A method discovered by Fermat for proving the non-existence of numbers bearing certain properties which are bounded by a closed system (this is most often the natural numbers).

The quick and dirty of it is, you suppose the existence of a set of numbers which fit an equation, and go about proving that their existence implies the existence of another set of numbers which meet the same parameters, and all of which are smaller than their counterparts in the first set. And it follows that since this new set meets the same requirements as the first set, its existence implies another smaller set. And another and another and so on. The trick is, since the solutions are restricted to a closed set, eventually you will imply the existence of solutions outside that set... and wind up with something like a square number less than zero, which is a contradiction. Because that contradiction stems solely from the assumption that there is a solution to a certain equation, you have proven that there is no solution, no numbers to meet those parameters.

We can use Infinite Descent to prove such useful things as that the square root of a prime number is irrational. Fermat used it to prove his famous Last Theorem for the specific case of n = 4. Note that you can use Infinite Ascent if you're dealing with solutions that would be limited by an upper bound.

Infinite Descent is a proof technique of use in solving problems from number theory, ranging from elementary problems to vital theorems of modern algebraic number theory. Infinite Descent was first described by name by the 17th century mathematician Fermat in the paper La méthode de la 'descente infinie ou indéfinie.

Proof by Infinite Descent is a special case of proof by contradiction (reductio ad absurdum), although from a mathematical logic point of view it can be seen as equivalent to the axiom of induction, or the well-order property of the natural numbers. The technique is usually employed to demonstrate non-existence of collections of numbers with a particular property. To do so, it is shown that if one set exists, then another exists which is in some sense 'smaller'. In this way, infinitely many successively smaller collections can be found, yet the problem is posed in such a way that there cannot be infinitely many such collections- usually because of the existence of a bound. This is a contradiction, so the assumption of existence of a solution isn't tenable and we thus conclude no solutions exist.

This is probably best understood by way of an example. So consider the following problem:

Show that there is no quadruple (x,y,z,u) of positive integers satisfying
x2 + y2 = 3(z2 + u2)

The important thing here is that we are looking for positive integers -the counting numbers 1,2,3,...- and thus an infinite descent cannot exist: a sequence of such values cannot keep strictly decreasing forever. By contrast, infinite strictly decreasing sequences of rational numbers or real numbers are not inherently paradoxical- the sequence obtained by successive halving (1, 1/2, 1/4, 1/8,...) being an example.

Descent Proof

We proceed therefore to give a proof by infinite descent. Suppose we have four positive integer values x,y,z,u satisfying the required condition. Then, since 3(z2 +u2) is divisible by three, and x2 + y2 is equal to that expression, it must be that x2+y2 is divisible by 3. Formally, we say that x2 + y2 is congruent to 0 mod 3, which is a fancy way of saying we are left with remainder 0 after division by 3.

An aside on working mod 3. Here a number is essentially either 0, 1 or 2: 3 is 0 mod 3 (as are 6,9,12 etc.) , 4 is 1 mod 3 (as are 7,10,13,etc) and so on. Addition works as usual except you discard multiples of 3, so, for example, 2+2 = 4 = 3+1 so 2+2 =1.

Knowing that x2+y2=0 mod 3, we conclude that one of three cases holds:

  • Both x2 and y2 are 0 mod 3
  • x2 = 1 mod 3 and y2 = 2 mod 3
  • x2 = 2 mod 3 and y2 = 1 mod 3

However, you can easily verify (test all cases!) that the square of any number mod 3 is 0 or 1. That is, there are no numbers which square to 2 mod 3, so the second two cases above are impossible. We know therefore that x2 and y2 are both 0 mod 3, meaning they are divisible by 3.

But if the square of an integer can be divided by 3, then the integer itself can be divided by 3. So we can write x=3x' and y=3y' for some x' and y'. Since x and y were strictly positive, x' and y' are definitely smaller (x' being a third of x, y' a third of y). We can plug these new versions into the equation to get (3x')2 + (3y')2 = 3(z2 + u2).

That simplifies to 3.3(x'2+y'2) = 3(z2+u2), and cancelling a 3 from each side we get

3(x'2+y'2)=z2+u2

So we can deduce from the presence of a 3 on the left hand side that z2+u2 =0 mod 3, and by the same reasoning as for x and y earlier can find ourselves z' and u' such that z=3z' and u=3u'.

Plugging into the equation again, we find

3(x'2 +y'2)= (3z')2 + (3u')2
So 3(x'2 +y'2)= 9(z'2 + u'2)
i.e x'2+y'2=3(z'2 + u'2)

Hence we're right back where we started, except all the numbers are a third of those we started with. There's nothing to stop us applying the same thought process to find a set x'',y'',z'',u''. In fact, we can do this infinitely many times, with the terms strictly decreasing in size each time.

Thus admitting one solution gives rise to an infinite descent, so there can be no solutions.

Direct proof by contradiction

To confirm proof by descent is a contradiction argument in disguise (even though we needn't explicitly appeal to that contradiction to complete a proof; as in the example above the observation of an infinite descent of integers is sufficient), here's a proof of the same result by slightly different means.

Suppose for contradiction there exist positive integer solutions to the problem. Let x,y,z,u be a solution such that V=x2 + y2 = 3(z2 + u2) is minimal. Then, by the earlier reasoning, we can find x',y,z',u' satisfying the conditions. But they give rise to V'=x'2 + y'2 = 3(z'2 + u'2) = V/9. So V'<V, contradicting the minimality of V. So positive integer solutions do not exist.

Constructive proof

One last proof can be given, with a more constructivist feel- it demonstrates that any non-negative integer solution must be the solution 0,0,0,0. Thus, there cannot be a positive integer solution, since x,y,z,u a solution implies x=y=z=u=0 and x,y,z,u arbitrary positive integers implies x,y,z,u non-zero; the method of proof by contraposition then ensures x,y,z,u aren't a solution and their arbitrary nature proves there are no such solutions.

To reason in this way, let X,Y,Z,U be a non-negative integer solution (so zero is allowed). Then we can construct a new solution X',Y',Z',U' with X=3X'. Repeating, we get X'' st X=3X' = 3.3X'' and so on; concluding that 3n divides X for every n. But the only number which is infinitely divisible by 3 is zero, so X=0. Further, the same reasoning gives each of Y,Z and U =0. We are done.

Some notable results by Infinite Descent

Fermat's theorem on sums of two squares (the Christmas Theorem)
An odd prime p can be written as p=x2 + y2 iff p is congruent to 1 mod 4

Typically for Fermat, he didn't prove this. Euler gave the first proof, by means of infinite descent.

No solution to x4+y4=z2

This was known to Fermat, and allows an elementary proof of his last theorem in the case n=4 (clearly, if the sum cannot be a square it cannot be a fourth power).

Irrationality of the square root of 2

That the square root of 2 cannot be rational was known to the Greeks. Euclid gave a proof by infinite descent, so the technique actually predates Fermat by nearly 2000 years! The result generalises to the square root of any prime.

Log in or registerto write something here or to contact authors.