# Fermat's right triangle theorem

Two right triangles with the two legs of the top one equal to the leg and hypotenuse of the bottom one. For these lengths, ${\displaystyle a^{2}}$, ${\displaystyle b^{2}}$, and ${\displaystyle c^{2}}$ form an arithmetic progression separated by a gap of ${\displaystyle d^{2}}$. It is not possible for all four lengths ${\displaystyle a}$, ${\displaystyle b}$, ${\displaystyle c}$, and ${\displaystyle d}$ to be integers.

Fermat's right triangle theorem is a non-existence proof in number theory, published in 1670 among the works of Pierre de Fermat, soon after his death. It is the only complete proof given by Fermat.[1] It has several equivalent formulations, one of which was stated (but not proved) in 1225 by Fibonacci. In its geometric forms, it states:

More abstractly, as a result about Diophantine equations (integer or rational-number solutions to polynomial equations), it is equivalent to the statements that:

• If three square numbers form an arithmetic progression, then the gap between consecutive numbers in the progression (called a congruum) cannot itself be square.
• The only rational points on the elliptic curve ${\displaystyle y^{2}=x(x-1)(x+1)}$ are the three trivial points with ${\displaystyle x\in \{-1,0,1\}}$ and ${\displaystyle y=0}$.
• The quartic equation ${\displaystyle x^{4}-y^{4}=z^{2}}$ has no nonzero integer solution.

An immediate consequence of the last of these formulations is that Fermat's Last Theorem is true in the special case that its exponent is 4.

## Formulation

### Squares in arithmetic progression

In 1225, Emperor Frederick II challenged the mathematician Fibonacci to take part in a mathematical contest against several other mathematicians, with three problems set by his court philosopher John of Palermo. The first of these problems asked for three rational numbers whose squares were equally spaced five units apart, solved by Fibonacci with the three numbers ${\displaystyle {\tfrac {31}{12}}}$, ${\displaystyle {\tfrac {41}{12}}}$, and ${\displaystyle {\tfrac {49}{12}}}$. In The Book of Squares, published later the same year by Fibonacci, he solved the more general problem of finding triples of square numbers that are equally spaced from each other, forming an arithmetic progression. Fibonacci called the gap between these numbers a congruum.[2] One way of describing Fibonacci's solution is that the numbers to be squared are the difference of legs, hypotenuse, and sum of legs of a Pythagorean triangle, and that the congruum is four times the area of the same triangle.[3] Fibonacci observed that it is impossible for a congruum to be a square number itself, but did not present a satisfactory proof of this fact.[4]

If three squares ${\displaystyle a^{2}}$, ${\displaystyle b^{2}}$, and ${\displaystyle c^{2}}$ could form an arithmetic progression whose congruum was also a square ${\displaystyle d^{2}}$, then these numbers would satisfy the Diophantine equations

{\displaystyle {\begin{aligned}a^{2}+d^{2}&=b^{2},\\b^{2}+d^{2}&=c^{2}.\\\end{aligned}}}
That is, by the Pythagorean theorem, they would form two integer-sided right triangles in which the pair ${\displaystyle (d,b)}$ gives one leg and the hypotenuse of the smaller triangle and the same pair also forms the two legs of the larger triangle. But if (as Fibonacci asserted) no square congruum can exist, then there can be no two integer right triangles that share two sides in this way.[5]

### Areas of right triangles

Because the congrua are exactly the numbers that are four times the area of a Pythagorean triangle, and multiplication by four does not change whether a number is square, the existence of a square congruum is equivalent to the existence of a Pythagorean triangle with a square area. It is this variant of the problem that Fermat's proof concerns: he shows that there is no such triangle. In considering this problem, Fermat was inspired not by Fibonacci but by an edition of Arithmetica by Diophantus, published in a translation into French in 1621 by Claude Gaspar Bachet de Méziriac.[6] This book described various special right triangles whose areas had forms related to squares, but did not consider the case of areas that were themselves square.[7]

By rearranging the equations for the two Pythagorean triangles above, and then multiplying them together, one obtains the single Diophantine equation

${\displaystyle b^{4}-d^{4}=(b^{2}-d^{2})(b^{2}+d^{2})=a^{2}c^{2}}$
which can be simplified by introducing a new variable ${\displaystyle e=ac}$ to
${\displaystyle b^{4}-d^{4}=e^{2}.}$
Conversely, any three positive integers obeying the equation ${\displaystyle b^{4}-d^{4}=e^{2}}$ lead to a square congruum: for these numbers, the squares ${\displaystyle (b^{4}-d^{4}-2b^{2}d^{2})^{2}}$, ${\displaystyle (b^{4}+d^{4})^{2}}$, and ${\displaystyle (b^{4}-d^{4}+2b^{2}d^{2})^{2}}$ form an arithmetic progression with congruum ${\displaystyle 4b^{2}d^{2}(b^{4}-d^{4})=(2bde)^{2}}$, which is a square itself. Thus, the solvability of ${\displaystyle b^{4}-d^{4}=e^{2}}$ is equivalent to the existence of a square congruum. But, if Fermat's Last Theorem had a counterexample for the exponent ${\displaystyle 4}$, an integer solution to the equation ${\displaystyle x^{4}+y^{4}=z^{4}}$, then squaring one of the three numbers in the counterexample would give three numbers that solve the equation ${\displaystyle b^{4}-d^{4}=e^{2}}$. Therefore, Fermat's proof that no Pythagorean triangle has a square area implies the truth of the exponent-${\displaystyle 4}$ case of Fermat's Last Theorem.[7]

Another equivalent formulation of the same problem involves congruent numbers, the numbers that are areas of right triangles whose three sides are all rational numbers. By multiplying the sides by a common denominator, any congruent number may be transformed into the area of a Pythagorean triangle, from which it follows that the congruent numbers are exactly the numbers formed by multiplying a congruum by the square of a rational number.[8] Therefore, the existence of a square congruum is equivalent to the statement that the number 1 is not a congruent number.[9] Another more geometric way of stating this formulation is that it is impossible for a square (the geometric shape) and a right triangle to have both equal areas and all sides commensurate with each other.[10]

### Elliptic curve

The elliptic curve y2 = x(x + 1)(x − 1). The three rational points (−1,0), (0,0), and (1,0) are the crossings of this curve with the x-axis.

Yet another equivalent form of Fermat's theorem involves the elliptic curve consisting of the points whose Cartesian coordinates ${\displaystyle (x,y)}$ satisfy the equation

${\displaystyle y^{2}=x(x+1)(x-1).}$
The points (−1,0), (0,0), and (1,0), provide obvious solutions to this equation. Fermat's theorem is equivalent to the statement that these are the only points on the curve for which both ${\displaystyle x}$ and ${\displaystyle y}$ are rational. More generally, the right triangles with rational sides and area ${\displaystyle n}$ correspond one-for-one with the rational points with positive ${\displaystyle y}$-coordinate on the elliptic curve ${\displaystyle y^{2}=x(x+n)(x-n)}$.[11]

## Fermat's proof

During his lifetime, Fermat challenged several other mathematicians to prove the non-existence of a Pythagorean triangle with square area, but did not publish the proof himself. However, he wrote a proof in his copy of Diophantus's Arithmetica, the same copy in which he wrote that he could prove Fermat's Last Theorem. Fermat's son Clement-Samuel published an edition of this book, including Fermat's marginal notes with the proof of the right triangle theorem, in 1670.[12]

Fermat's proof is a proof by infinite descent. It shows that, from any example of a Pythagorean triangle with square area, one can derive a smaller example. Since Pythagorean triangles have positive integer areas, and there does not exist an infinite descending sequence of positive integers, there also cannot exist a Pythagorean triangle with square area.[13]

In more detail, suppose that ${\displaystyle x}$, ${\displaystyle y}$, and ${\displaystyle z}$ are the integer sides of a right triangle with square area. By dividing by any common factors, one can assume that this triangle is primitive[10] and from the known form of all primitive Pythagorean triples, one can set ${\displaystyle x=2pq}$, ${\displaystyle y=p^{2}-q^{2}}$, and ${\displaystyle z=p^{2}+q^{2}}$, by which the problem is transformed into finding relatively prime integers ${\displaystyle p}$ and ${\displaystyle q}$ (one of which is even) such that the area ${\displaystyle pq(p^{2}-q^{2})}$ is square. For this number to be a square, its four linear factors ${\displaystyle p}$, ${\displaystyle q}$, ${\displaystyle p+q}$, and ${\displaystyle p-q}$ (which are relatively prime) must themselves be squares; let ${\displaystyle p+q=r^{2}}$ and ${\displaystyle p-q=s^{2}}$. Both ${\displaystyle r}$ and ${\displaystyle s}$ must be odd since exactly one of ${\displaystyle p}$ or ${\displaystyle q}$ is even and the other is odd. Therefore, both ${\displaystyle r-s}$ and ${\displaystyle r+s}$ are even, and one of them is divisible by 4. Dividing them by two produces two more integers ${\displaystyle u=(r-s)/2}$ and ${\displaystyle v=(r+s)/2}$, one of which is even by the previous sentence. Because ${\displaystyle u^{2}+v^{2}=(r^{2}+s^{2})/2=p}$ is a square, ${\displaystyle u}$ and ${\displaystyle v}$ are the legs of another primitive Pythagorean triangle whose area is ${\displaystyle uv/2=q/4}$. Since ${\displaystyle q}$ is itself a square and since ${\displaystyle uv}$ is even, ${\displaystyle q/4}$ is a square. Thus, any Pythagorean triangle with square area leads to a smaller Pythagorean triangle with square area, completing the proof.[14]

## Notes

1. ^ Edwards (2000). Many subsequent mathematicians published proofs, including Gottfried Wilhelm Leibniz (1678), Leonhard Euler (1747), and Bernard Frenicle de Bessy (before 1765); see Dickson (1920) and Goldstein (1995).
2. ^
3. ^
4. ^
5. ^ The fact that there can be no two right triangles that share two of their sides, and the connection between this problem and the problem of squares in arithmetic progression, is described as "well known" by Cooper & Poirel (2008)
6. ^
7. ^ a b
8. ^ Conrad (2008); Koblitz (1993, p. 3).
9. ^ Conrad (2008), Theorem 2; Koblitz (1993), Exercise 3, p. 5.
10. ^ a b
11. ^ Koblitz (1993), Proposition 19, pp. 46–47; Kato & Saitō (2000).
12. ^ Edwards (2000); Dickson (1920). For other proofs, see Grant & Perella (1999) and Barbara (2007).
13. ^
14. ^