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.
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.
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.
A first derivative can detect a non-torsion Heegner point.
Gross and Zagier connect a suitable L-series derivative to a canonical height. A simple zero supplies a rational point of infinite order in their modular elliptic-curve consequence; this does not alone exclude additional independent points.
A density theorem does not settle each exceptional curve.
The average size of the 3-Selmer group is 4 in the Bhargava–Shankar height ordering. Their result gives positive proportions with relevant rank properties, while a universal conjecture still requires every curve.
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.
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.
The central analytic zero order would determine the rank of E(Q) in the official scope. Effective generator-finding still requires attention to constructive bounds and stronger arithmetic information.
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.
Victor A. Kolyvagin / Mathematics of the USSR-Izvestiya 1989 · Heegner-point methods controlling rational points and Tate–Shafarevich groups under explicit hypotheses.
Christophe Breuil, Brian Conrad, Fred Diamond and Richard Taylor / JAMS 2001 · Every elliptic curve over Q is modular; completes preceding Wiles–Taylor work.