STRATA
Skip to study
XLVII

Arithmetic geometry and L-functions

Birch and Swinnerton-Dyer conjecture

Can the order of vanishing of an elliptic curve's L-function determine the number of independent rational points?

Clay: Unsolved

Status and source review: 2026-11-19

State the mathematical question precisely.

For every elliptic curve E over Q, write E(Q) ≅ Zʳ ⊕ E(Q)tors. The official rank question asserts ordₛ₌₁ L(E,s) = r. The stronger leading-coefficient formula also involves periods, the regulator, local factors, torsion and the Tate–Shafarevich group; it is a separate refinement.

Identify what a complete argument must establish.

  1. Relate an analytic order of vanishing to the algebraic rank for each elliptic curve in the stated scope, including higher-rank cases.
  2. Certify independence and completeness when proposing generators; finding several rational points gives only a lower bound.
  3. For the stronger formula, retain exact normalizations and all local factors, and prove the necessary finiteness statement instead of assuming it.

Trace the results that changed the problem.

  1. Mordell proves finite generation.

    The group of rational points has finite rank plus finite torsion, making the rank a well-defined arithmetic invariant.

  2. Birch and Swinnerton-Dyer turn computations into a conjecture.

    Experiments with an EDSAC computer connect local point counts with rational-point behavior. Those observations motivate a universal statement rather than prove it.

  3. Heegner points and Euler systems connect analysis with arithmetic.

    Gross–Zagier's height formula and Kolyvagin's methods produce decisive low-rank results under the relevant modular and nonvanishing hypotheses.

  4. Modularity reaches every elliptic curve over Q.

    Breuil, Conrad, Diamond and Taylor complete the modularity theorem, building on Wiles and Taylor–Wiles.

  5. Counting methods control positive proportions.

    Bhargava and Shankar's 3-Selmer work proves average and positive-proportion statements when curves are ordered by height.

Separate established results from the remaining claim.

Analytic rank zero and one are established regimes for rank equality.

Combined modularity and Gross–Zagier–Kolyvagin results yield algebraic rank equal to analytic rank when the latter is 0 or 1. This should not be expanded into an unrestricted assertion of every refined BSD factor for every curve.

Inspect the upstream dependencies.

Make each proposed approach answer for its obstacle.

These are research directions and diagnostic tests. Their inclusion does not establish novelty, feasibility at full scale, or a solution.

Compare independently certified algebraic and analytic bounds.

For one explicit curve, compute a rigorous lower bound from independent points and an upper bound through descent; separately certify the analytic order with error-controlled evaluation.

Obstacle. A tiny numerical L-value is not proof of exact vanishing. An unresolved Selmer contribution can prevent an algebraic upper bound from matching the points found.

Try the next discriminating test.

Publish the curve model, conductor, bad primes, height-pairing certificate, error bounds and unresolved factors. A successful curve-level verification is valuable without implying the universal theorem.

Look for a higher-rank replacement of the low-rank mechanism.

Ask what arithmetic object would produce several independent points and match a higher derivative, then state the exact reciprocity or height identity needed.

Obstacle. The first-derivative formula becomes silent when that derivative vanishes. Reusing it with a new name does not produce higher-rank information.

Try the next discriminating test.

Identify a restricted family and one missing identity; compare it with known Euler-system or modularity hypotheses before investing in computation. This is a proposed research question, not a new theorem.

Work through a restricted calculation.

Local counts can be reproduced exactly.

For E: y² = x³ − x, enumerate all pairs modulo the good primes 5, 7, 11, 13 and 17, adding the point at infinity.

The exact counts are #E(F_p) = 8, 8, 12, 8, 16, giving a_p = −2, 0, 0, 6, 2 respectively. Two enumeration methods agree, and each satisfies a_p² ≤ 4p.

This checks local Euler-factor input. These five factors do not determine the full L-function's vanishing order, and this calculation makes no independent claim about the rational rank.

Compare this example with the interactive proof diagnostics

Follow the downstream consequences conditionally.

If a point search finds no non-torsion point.

Only the searched height range has been exhausted. A proof of rank zero needs an arithmetic upper bound or a theorem that certifies the analytic regime.

Locate the actual quantum connection.

Elliptic curves also occur in cryptography, but BSD concerns rational points and a central L-value. Shor's quantum discrete-logarithm algorithm addresses a different computational task; it neither proves BSD nor makes BSD equivalent to breaking an elliptic-curve cryptosystem.

Follow quantum mechanics through the historical map

Inspect the supporting sources.

  1. The Millennium Prize Problems

    Clay Mathematics Institute · Current official categories and original seven-prize fund.

  2. The Birch and Swinnerton-Dyer Conjecture

    Andrew Wiles / Clay Mathematics Institute · Rank equals order of vanishing for elliptic curves over Q; stronger leading-coefficient refinement.

  3. Heegner points and derivatives of L-series

    Benedict H. Gross and Don B. Zagier / Inventiones Mathematicae 1986 · Heegner-point height formula and first derivatives of suitable L-series.

  4. On the Mordell–Weil and Shafarevich–Tate groups for Weil elliptic curves

    Victor A. Kolyvagin / Mathematics of the USSR-Izvestiya 1989 · Heegner-point methods controlling rational points and Tate–Shafarevich groups under explicit hypotheses.

  5. On the Modularity of Elliptic Curves over Q: Wild 3-Adic Exercises

    Christophe Breuil, Brian Conrad, Fred Diamond and Richard Taylor / JAMS 2001 · Every elliptic curve over Q is modular; completes preceding Wiles–Taylor work.

  6. Ternary cubic forms having bounded invariants, and the existence of a positive proportion of elliptic curves having rank 0

    Manjul Bhargava and Arul Shankar / Annals of Mathematics 2015 · Average 3-Selmer size and positive-proportion rank-zero results with stated ordering.

  7. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

    Peter W. Shor / arXiv · Quantum polynomial-time algorithms for factoring and discrete logarithms, announced at FOCS 1994.