MathLabs
TheoremProved

Mazur's torsion classification

Statement

For an elliptic curve EE over Q\mathbb{Q}, the torsion subgroup E(Q)torsE(\mathbb{Q})_{\mathrm{tors}} is isomorphic to exactly one of the following 1515 groups: the cyclic group Z/NZ\mathbb{Z}/N\mathbb{Z} for N=1,…,10N=1,\dots,10 or N=12N=12, or the group Z/2Z⊕Z/2NZ\mathbb{Z}/2\mathbb{Z}\oplus\mathbb{Z}/2N\mathbb{Z} for N=1,2,3,4N=1,2,3,4; no other finite abelian group occurs.

Why is it true?

This is a striking rigidity statement: among infinitely many abstractly possible finite abelian groups, only these 1515 ever occur as the torsion of a rational elliptic curve — a torsion subgroup of order, say, 1111 or 1616 is simply impossible.

Proof sketch

Mazur's 1977 proof translates the existence of a rational point of exact order NN on EE into the existence of a non-cuspidal rational point on the modular curve X1(N)X_1(N), which classifies pairs (E,P)(E, P) with PP of order NN. The strategy studies the Jacobian J0(N)J_0(N) of the related modular curve X0(N)X_0(N) and the Eisenstein ideal I\mathcal{I} — the ideal in the Hecke algebra generated by Tℓ−ℓ−1T_\ell - \ell - 1 for primes ℓ∤N\ell \nmid N — acting on it. By analyzing the Eisenstein quotient of J0(N)J_0(N) and its reduction modulo auxiliary primes, Mazur shows that for NN outside the allowed list, X1(N)(Q)X_1(N)(\mathbb{Q}) consists only of cusps, so no elliptic curve over Q\mathbb{Q} can have a rational point of that exact order; explicit constructions (for instance using the curves y2=x3+axy^2=x^3+ax and y2=x3+by^2=x^3+b) exhibit examples realizing each of the 1515 permitted groups.

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. Joseph H. Silverman (2009). The Arithmetic of Elliptic Curves · DOI:10.1007/978-0-387-09494-6
  2. Andrew Wiles (1995). Modular elliptic curves and Fermat's Last Theorem · DOI:10.2307/2118559
  3. Andrew Wiles / Clay Mathematics Institute (2000). The Birch and Swinnerton-Dyer Conjecture (official Millennium Problem description)
  4. Wouter Castryck, Thomas Decru (2022). An efficient key recovery attack on SIDH