Math 2.0

Number theory Arithmetic geometry Theorem

Modularity theorem

Builds on Elliptic curveModular formCusp formCongruence subgroupHecke operatorFinite field

Statement

Let EE be an elliptic curve over ℚ\Q with conductor NN, a positive integer whose prime factors are the primes where EE has bad reduction. For each prime p∤Np \nmid N, let E~\tilde{E} be the reduction modulo pp of a minimal Weierstrass model of EE. It is a curve over the finite field 𝔽p\F_p; let ap=p+1−#E~(𝔽p)a_p = p + 1 - \# \tilde{E}(\F_p). Then there is a cusp form f(τ)=∑n≥1bnqnf(\tau) = \sum_{n \ge 1} b_n q^n, with q=e2πiτq = e^{2\pi i \tau}, of weight 22 for the congruence subgroup Γ0(N)\Gamma_0(N), such that:

  1. ff is a normalised newform: b1=1b_1 = 1 and ff is an eigenform of all Hecke operators that does not come from a lower level;
  2. bn∈ℤb_n \in \Z for all nn;
  3. bp=apb_p = a_p for every prime p∤Np \nmid N.

Remarks

Equivalently, the LL-function of EE equals the LL-function of ff, or there is a nonconstant morphism X0(N)→EX_0(N) \to E defined over ℚ\Q from the modular curve X0(N)X_0(N). Wiles, with a key step completed jointly with Taylor, proved the theorem for semistable curves in 1995; Breuil, Conrad, Diamond and Taylor completed the general case in 2001. The proof shows that the ℓ\ell-adic Galois representation of EE is modular. It lifts the modularity of the reduction modulo 33, known by the Langlands–Tunnell theorem, with a modularity lifting theorem. A switch to the prime 55 handles the cases where the reduction modulo 33 is not irreducible. Example: y2+y=x3−x2y^2 + y = x^3 - x^2 has conductor 1111, and it corresponds to f=q∏n≥1(1−qn)2(1−q11n)2f = q \prod_{n \ge 1} (1 - q^n)^2 (1 - q^{11n})^2. The semistable case, combined with the earlier work of Frey, Serre and Ribet, implies Fermat's Last Theorem.

Going deeper

For a student

Modularity gives the analytic continuation and functional equation of L(E,s)L(E, s), which are needed even to state the Birch and Swinnerton-Dyer conjecture. The parametrisation X0(N)→EX_0(N) \to E lets one construct Heegner points on EE, the input of the Gross–Zagier theorem. It is a case of the reciprocity conjectures of the Langlands program.

Reading path

To understand this page from the ground up, read these 7 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Congruence subgroup concept
  2. Cusp form concept
  3. Elliptic curve concept
  4. Finite field concept
  5. Hecke operator concept
  6. Modular form concept
  7. Modularity theorem statement

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Modularity_theorem
About this page
TagCS1NVJBZMH
URIm2://CS1NVJBZMH
Kindstatement, theorem
WritingW0 stub
MSC11G05, 11F11, 11F80
StatusThis copy of the site has no build data. Run m2 status CS1NVJBZMH.
AboutElliptic curve, Modular form
UsesElliptic curve, Modular form, Cusp form, Congruence subgroup, Hecke operator, Finite field
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by