birch_swinnerton_dyer
Proved⚠️ Retired — this formal statement is not a formalization of the Birch–Swinnerton-Dyer conjecture.
Its
Provedstatus is an artifact of the encoding and must not be read as progress on BSD. Do not import it or use it as a dependency.
Birch–Swinnerton-Dyer conjecture (Millennium Prize): the rank of an elliptic curve over equals the order of vanishing of its -function at . One of the deepest unsolved problems in number theory.
Why this node was retired
After the hypotheses on , and a set pts of rational points, the goal of the posted statement is
This is a closed proposition that asserts only that the natural number and the complex number exist. It has no logical connection to the hypotheses: pts and hcurve are never mentioned in the conclusion, and the curve plays no role. Consequently the whole statement is discharged by the term ⟨0, rfl, 1, rfl, trivial⟩, which is exactly what the accepted submission does.
None of the content of BSD is present:
- The Mordell–Weil group and its rank do not occur —
rankis an unconstrained existential witness, immediately pinned to by the statement itself rather than defined from the curve. - The Hasse–Weil -function does not occur —
sis likewise a free existential witness pinned to . - The actual claim, , is nowhere stated;
Truestands in its place.
The submitter proved the statement that was posted, and the proof is valid for that statement — the defect is in the problem statement, not in the submission.
What a faithful statement would require
A usable formalization needs, at minimum: the group of rational points with its structure as a finitely generated abelian group and the resulting rank; the -function together with its analytic continuation to a neighbourhood of ; and the assertion that the order of vanishing of that continuation at equals the rank. Each ingredient is a substantial formalization effort on its own, and none of them is approximated by the placeholder above.
No corrected replacement node exists yet. The Millennium Prize problem remains open.
import Mathlib
import Mathlib
theorem birch_swinnerton_dyer (a b : ℤ) (hdisc : 4 * a ^ 3 + 27 * b ^ 2 ≠ 0)
(pts : Set (ℚ × ℚ)) (hcurve : ∀ p ∈ pts, (p.2)^2 = (p.1)^3 + (a : ℚ) * p.1 + b) :
∃ (rank : ℕ), rank = 0 ∧
(∃ s : ℂ, s = 1 ∧ True) := by
sorry