Proof by infinite descent

Short description: Mathematical proof technique using contradiction

In mathematics, a proof by infinite descent, also known as Fermat's method of descent, is a particular kind of proof by contradiction[1] used to show that a statement cannot possibly hold for any number, by showing that if the statement were to hold for a number, then the same would be true for a smaller number, leading to an infinite descent and ultimately a contradiction.[2] It is a method which relies on the well-ordering principle, and is often used to show that a given equation, such as a Diophantine equation, has no solutions.[3][4]

Typically, one shows that if a solution to a problem existed, which in some sense was related to one or more natural numbers, it would necessarily imply that a second solution existed, which was related to one or more 'smaller' natural numbers. This in turn would imply a third solution related to smaller natural numbers, implying a fourth solution, therefore a fifth solution, and so on. However, there cannot be an infinity of ever-smaller natural numbers, and therefore by mathematical induction, the original premise--that any solution exists--is incorrect: its correctness produces a contradiction.

An alternative way to express this is to assume one or more solutions or examples exists, from which a smallest solution or example--a minimal counterexample—can then be inferred. Once there, one would try to prove that if a smallest solution exists, then it must imply the existence of a smaller solution (in some sense), which again proves that the existence of any solution would lead to a contradiction.

The earliest uses of the method of infinite descent appear in Euclid's Elements.[3] A typical example is Proposition 31 of Book 7, in which Euclid proves that every composite integer is divided (in Euclid's terminology "measured") by some prime number.[2]

The method was much later developed by Fermat, who coined the term and often used it for Diophantine equations.[4][5] Two typical examples are showing the non-solvability of the Diophantine equation r2+s4=t4 and proving Fermat's theorem on sums of two squares, which states that an odd prime p can be expressed as a sum of two squares when p≡1(mod4) (see Modular arithmetic and proof by infinite descent). In this way Fermat was able to show the non-existence of solutions in many cases of Diophantine equations of classical interest (for example, the problem of four perfect squares in arithmetic progression).

In some cases, to the modern eye, his "method of infinite descent" is an exploitation of the inversion of the doubling function for rational points on an elliptic curve E. The context is of a hypothetical non-trivial rational point on E. Doubling a point on E roughly doubles the length of the numbers required to write it (as number of digits), so that "halving" a point gives a rational with smaller terms. Since the terms are positive, they cannot decrease forever.

## Contents

* 1 Number theory
* 2 Application examples
* 2.1 Irrationality of √2
* 2.2 Irrationality of √k if it is not an integer
* 2.3 Non-solvability of r2 \+ s4 = t4 and its permutations
* 3 See also
* 4 References
* 5 Further reading

## Number theory

In the number theory of the twentieth century, the infinite descent method was taken up again, and pushed to a point where it connected with the main thrust of algebraic number theory and the study of L-functions. The structural result of Mordell, that the rational points on an elliptic curve E form a finitely-generated abelian group, used an infinite descent argument based on E/2E in Fermat's style.

To extend this to the case of an abelian variety A, André Weil had to make more explicit the way of quantifying the size of a solution, by means of a height function – a concept that became foundational. To show that A(Q)/2A(Q) is finite, which is certainly a necessary condition for the finite generation of the group A(Q) of rational points of A, one must do calculations in what later was recognised as Galois cohomology. In this way, abstractly defined cohomology groups in the theory become identified with descents in the tradition of Fermat. The Mordell–Weil theorem was at the start of what later became a very extensive theory.

## Application examples

### Irrationality of √2

The proof that the square root of 2 (√2) is irrational (i.e. cannot be expressed as a fraction of two whole numbers) was discovered by the ancient Greeks, and is perhaps the earliest known example of a proof by infinite descent. Pythagoreans discovered that the diagonal of a square is incommensurable with its side, or in modern language, that the square root of two is irrational. Little is known with certainty about the time or circumstances of this discovery, but the name of Hippasus of Metapontum is often mentioned. For a while, the Pythagoreans treated as an official secret the discovery that the square root of two is irrational, and, according to legend, Hippasus was murdered for divulging it.[6][7][8] The square root of two is occasionally called "Pythagoras' number" or "Pythagoras' Constant", for example (Conway Guy).[9]

The ancient Greeks, not having algebra, worked out a geometric proof by infinite descent (John Horton Conway presented another geometric proof by infinite descent that may be more accessible[10]). The following is an algebraic proof along similar lines:

Suppose that √2 were rational. Then it could be written as

2=pq

for two natural numbers, p and q. Then squaring would give

2=p2q2,
2q2=p2,

so 2 must divide p2. Because 2 is a prime number, it must also divide p, by Euclid's lemma. So p = 2r, for some integer r.

But then,

2q2=(2r)2=4r2,
q2=2r2,

which shows that 2 must divide q as well. So q = 2s for some integer s.

This gives

pq=2r2s=rs.

Therefore, if √2 could be written as a rational number, then it could always be written as a rational number with smaller parts, which itself could be written with yet-smaller parts, ad infinitum. But this is impossible in the set of natural numbers. Since √2 is a real number, which can be either rational or irrational, the only option left is for √2 to be irrational.[11]

(Alternatively, this proves that if √2 were rational, no "smallest" representation as a fraction could exist, as any attempt to find a "smallest" representation p/q would imply that a smaller one existed, which is a similar contradiction.)

### Irrationality of √k if it is not an integer

For positive integer k, suppose that √k is not an integer, but is rational and can be expressed as ⁠m/n⁠ for natural numbers m and n, and let q be the largest integer less than √k (that is, q is the floor of √k). Then

k=mn[6pt]=m(k−q)n(k−q)[6pt]=mk−mqnk−nq[6pt]=(nk)k−mqn(mn)−nq[6pt]=nk−mqm−nq

The numerator and denominator were each multiplied by the expression (√k − q)—which is positive but less than 1—and then simplified independently. So, the resulting products, say m′ and n′, are themselves integers, and are less than m and n respectively. Therefore, no matter what natural numbers m and n are used to express √k, there exist smaller natural numbers m′ < m and n′ < n that have the same ratio. But infinite descent on the natural numbers is impossible, so this disproves the original assumption that √k could be expressed as a ratio of natural numbers.[12]

### Non-solvability of r2 \+ s4 = t4 and its permutations

The non-solvability of r2+s4=t4 in integers is sufficient to show the non-solvability of q4+s4=t4 in integers, which is a special case of Fermat's Last Theorem, and the historical proofs of the latter proceeded by more broadly proving the former using infinite descent. The following more recent proof demonstrates both of these impossibilities by proving still more broadly that a Pythagorean triangle cannot have any two of its sides each either a square or twice a square, since there is no smallest such triangle:[13]

Suppose there exists such a Pythagorean triangle. Then it can be scaled down to give a primitive (i.e., with no common factors other than 1) Pythagorean triangle with the same property. Primitive Pythagorean triangles' sides can be written as x=2ab, y=a2−b2, z=a2+b2, with a and b relatively prime and with a+b odd and hence y and z both odd. The property that y and z are each odd means that neither y nor z can be twice a square. Furthermore, if x is a square or twice a square, then each of a and b is a square or twice a square. There are three cases, depending on which two sides are postulated to each be a square or twice a square:

* y and z: In this case, y and z are both squares. But then the right triangle with legs yz and b2 and hypotenuse a2 also would have integer sides including a square leg (b2) and a square hypotenuse (a2), and would have a smaller hypotenuse (a2 compared to z=a2+b2).
* z and x: z is a square. The integer right triangle with legs a and b and hypotenuse z also would have two sides (a and b) each of which is a square or twice a square, and a smaller hypotenuse (z compared to z).
* y and x: y is a square. The integer right triangle with legs b and y and hypotenuse a would have two sides (b and a) each of which is a square or twice a square, with a smaller hypotenuse than the original triangle (a compared to z=a2+b2).

In any of these cases, one Pythagorean triangle with two sides each of which is a square or twice a square has led to a smaller one, which in turn would lead to a smaller one, etc.; since such a sequence cannot go on infinitely, the original premise that such a triangle exists must be wrong.

This implies that the equations

r2+s4=t4,
r4+s2=t4, and
r4+s4=t2

cannot have non-trivial solutions, since non-trivial solutions would give Pythagorean triangles with two sides being squares.

For other similar proofs by infinite descent for the n = 4 case of Fermat's Theorem, see the articles by Grant and Perella[14] and Barbara.[15]

## See also

* Vieta jumping

## References

1. ↑ Benson, Donald C. (2000) (in en). The Moment of Proof: Mathematical Epiphanies. Oxford University Press. pp. 43. ISBN 978-0-19-513919-8. https://books.google.com/books?id=8_vbuzxrpfIC. "a special case of proof by contradiction called the method of infinite descent"
2. ↑ 2.0 2.1 "What Is Infinite Descent". https://www.cut-the-knot.org/WhatIs/WhatIsInfiniteDescent.shtml.
3. ↑ 3.0 3.1 "Fermat's Method of Infinite Descent | Brilliant Math & Science Wiki" (in en-us). https://brilliant.org/wiki/general-diophantine-equations-fermats-method-of/.
4. ↑ 4.0 4.1 Donaldson, Neil. "Fermat's Method of Descent". https://www.math.uci.edu/~ndonalds/math180b/5descent.pdf.
5. ↑ Weil, André (1984), Number Theory: An approach through history from Hammurapi to Legendre, Birkhäuser, pp. 75–79, ISBN 0-8176-3141-0
6. ↑ Stephanie J. Morris, "The Pythagorean Theorem", Dept. of Math. Ed., University of Georgia.
7. ↑ Brian Clegg, "The Dangerous Ratio ...", Nrich.org, November 2004.
8. ↑ Kurt von Fritz, "The discovery of incommensurability by Hippasus of Metapontum", Annals of Mathematics, 1945.
9. ↑ The Book of Numbers, Copernicus, 1996, p. 25
10. ↑ "Square root of 2 is irrational (Proof 8)". http://www.cut-the-knot.org/proofs/sq_root.shtml.
11. ↑ Conrad, Keith (August 6, 2008). "Infinite Descent". https://kconrad.math.uconn.edu/ross2008/descent1.pdf.
12. ↑ Sagher, Yoram (February 1988), "What Pythagoras could have done", American Mathematical Monthly 95 (2): 117, doi:10.2307/2323064
13. ↑ Dolan, Stan, "Fermat's method of descente infinie", Mathematical Gazette 95, July 2011, 269–271.
14. ↑ Grant, Mike, and Perella, Malcolm, "Descending to the irrational", Mathematical Gazette 83, July 1999, pp. 263–267.
15. ↑ Barbara, Roy, "Fermat's last theorem in the case n = 4", Mathematical Gazette 91, July 2007, 260–262.

## Further reading

* Infinite descent at PlanetMath.org.
* Example of Fermat's last theorem at PlanetMath.org.

* v
* t
* e

Mathematical logic

General|

* Formal language
* Formation rule
* Formal proof
* Formal semantics
* Well-formed formula
* Set
* Element
* Class
* Classical logic
* Axiom
* Rule of inference
* Relation
* Theorem
* Logical consequence
* Type theory
* Symbol
* Syntax
* Theory

Systems|

* Formal system
* Deductive system
* Axiomatic system
* Hilbert style systems
* Natural deduction
* Sequent calculus

Traditional logic|

* Proposition
* Inference
* Argument
* Validity
* Cogency
* Syllogism
* Square of opposition
* Venn diagram

Propositional calculus
and Boolean logic

* Boolean functions
* Propositional calculus
* Propositional formula
* Logical connectives
* Truth tables
* Many-valued logic

Predicate logic|

* First-order
* Quantifiers
* Predicate
* Second-order
* Monadic predicate calculus

Naive set theory|

* Set
* Empty set
* Element
* Enumeration
* Extensionality
* Finite set
* Infinite set
* Subset
* Power set
* Countable set
* Uncountable set
* Recursive set
* Domain
* Codomain
* Image
* Map
* Function
* Relation
* Ordered pair

Set theory|

* Foundations of mathematics
* Zermelo–Fraenkel set theory
* Axiom of choice
* General set theory
* Kripke–Platek set theory
* Von Neumann–Bernays–Gödel set theory
* Morse–Kelley set theory
* Tarski–Grothendieck set theory

Model theory|

* Model
* Interpretation
* Non-standard model
* Finite model theory
* Truth value
* Validity

Proof theory|

* Formal proof
* Deductive system
* Formal system
* Theorem
* Logical consequence
* Rule of inference
* Syntax

Computability
theory|

* Recursion
* Recursive set
* Recursively enumerable set
* Decision problem
* Church–Turing thesis
* Computable function
* Primitive recursive function

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Proof by infinite descent. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Proof_by_infinite_descent&oldid=4156681"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template