Tunnell's theorem

From Wikipedia, the free encyclopedia

In mathematics, specifically number theory, Tunnell's theorem gives a partial resolution to the congruent number problem, and under the Birch and Swinnerton-Dyer conjecture, a full resolution. The congruent number problem asks which rational numbers can be the area of a right triangle with all three sides rational. Tunnell's theorem relates this to the number of integral solutions to a few fairly simple Diophantine equations. The theorem is named for Jerrold B. Tunnell, a number theorist at Rutgers University, who proved it in 1983.

[edit] Theorem

For a given integer n, define

\begin{matrix} A_n & = & \#\{ x,y,z \in \mathbb{Z} | n = 2x^2 + y^2 + 32z^2 \} \\ B_n & = & \#\{ x,y,z \in \mathbb{Z} | n = 2x^2 + y^2 + 8z^2 \} \quad \\ C_n & = & \#\{ x,y,z \in \mathbb{Z} | n = 8x^2 + 2y^2 + 64z^2 \} \\ D_n & = & \#\{ x,y,z \in \mathbb{Z} | n = 8x^2 + 2y^2 + 16z^2 \}. \end{matrix}

Tunnell's theorem states that supposing n is a congruent number, if n is odd then 2An = Bn and if n is even then 2Cn = Dn. Conversely, if the Birch and Swinnerton-Dyer conjecture holds true for elliptic curves of the form y2 = x3 − n2x, these equalities are sufficient to conclude that n is a congruent number.

A proof can be found in Koblitz's book.

The importance of Tunnell's theorem is that the criterion it gives is easily testable. For instance, for a given n, the numbers An,Bn,Cn,Dn can be calculated by exhaustively searching through x,y,z in the range -\sqrt{n},\ldots,\sqrt{n}.

[edit] References