Modularity Theorem (Taniyama–Shimura–Weil)
Statement
Every elliptic curve over is modular: there is a nonconstant morphism defined over , where is the conductor of ; equivalently, equals the -function of a weight- newform on .
Why is it true?
Modularity turns every elliptic curve into a modular form in disguise, transferring the powerful analytic machinery available for modular forms (analytic continuation, functional equations) to elliptic curves, and — crucially for Fermat's Last Theorem — it means a curve that cannot be modular cannot exist.
Proof sketch
Wiles proved modularity for semistable elliptic curves over in 1994–95 (with the final step, a numerical criterion for isomorphism between deformation rings and Hecke algebras — the ' theorem' — established jointly with Richard Taylor). The strategy shows that the Galois representation on the -adic Tate module of , and the corresponding representation attached to a candidate modular form, live in the same deformation space; proving the deformation ring and the Hecke algebra acting on modular forms coincide forces every allowed Galois representation — in particular 's — to come from a modular form. Since every semistable curve suffices to rule out a counterexample to Fermat's equation (any solution would yield a semistable Frey curve that Kenneth Ribet had shown, via his 1990 proof of -conjecture, cannot be modular), this proved Fermat's Last Theorem. The semistability restriction was later removed entirely, extending modularity to all elliptic curves over , by Christophe Breuil, Brian Conrad, Fred Diamond, and Richard Taylor in 2001.
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- Joseph H. Silverman (2009). The Arithmetic of Elliptic Curves · DOI:10.1007/978-0-387-09494-6
- Andrew Wiles (1995). Modular elliptic curves and Fermat's Last Theorem · DOI:10.2307/2118559
- Andrew Wiles / Clay Mathematics Institute (2000). The Birch and Swinnerton-Dyer Conjecture (official Millennium Problem description)
- Wouter Castryck, Thomas Decru (2022). An efficient key recovery attack on SIDH