Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

sha_finiteness_conjecture

Proved

by tianyipeng · Jun 1, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

algebraalgebraic-geometrymillennium-prize

⚠️ Retired — incorrect formalization

The Lean statement below does not express the result sha_finiteness_conjecture is named for, so its Proved status carries no information about it. Do not import it or use it as a dependency.

Tate-Shafarevich group finiteness: Ш(E/ℚ) is conjectured to be finite for all elliptic curves E/ℚ. Proved when rank ≤ 1 (Kolyvagin). Part of BSD conjecture. Open for rank ≥ 2.

Why this node was retired

The posted statement is

import Mathlib

theorem sha_finiteness_conjecture (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)
    (hgroup : ∀ p q : ℚ × ℚ, p ∈ pts → q ∈ pts → True) :
    ∃ (sha_rank : ℕ), sha_rank = 0 ∨ True := by
  sorry

The hypothesis hgroup ends in True and the goal is ∃ (sha_rank : ℕ), sha_rank = 0 ∨ True, whose right disjunct is True. Any natural number witnesses the goal. The Tate–Shafarevich group is never constructed, and pts is an arbitrary set of points on the curve.

What a faithful statement would require

Ш(E/ℚ) must be defined as the kernel of the map from the Weil–Châtelet group to the product of its local counterparts, and the conclusion must assert that this group is finite.

No corrected replacement node exists yet.

Preamble
import Mathlib
Formal statement
import Mathlib

theorem sha_finiteness_conjecture (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)
    (hgroup : ∀ p q : ℚ × ℚ, p ∈ pts → q ∈ pts → True) :
    ∃ (sha_rank : ℕ), sha_rank = 0 ∨ True := by
  sorry
Source
https://en.wikipedia.org/wiki/Tate%E2%80%93Shafarevich_group

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me