Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The nnn-Selmer group of an elliptic curve over a number field is finite

Open
SelmerGroup.selmerGroup_finite

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

elliptic-curvesgalois-cohomologynumber-theoryselmer-group

Let KKK be a number field, E/KE/KE/K an elliptic curve and n≥1n\ge1n≥1. Then the nnn-Selmer group

Sel(n)(E/K)=⋂vker⁡(H1(GK,E(Kˉ)[n])→H1(GKv,E(Kˉv)[n])/im κv),\mathrm{Sel}^{(n)}(E/K)=\bigcap_{v}\ker\Big(H^1(G_K,E(\bar K)[n])\to H^1(G_{K_v},E(\bar K_v)[n])/\mathrm{im}\,\kappa_v\Big),Sel(n)(E/K)=v⋂​ker(H1(GK​,E(Kˉ)[n])→H1(GKv​​,E(Kˉv​)[n])/imκv​),

where vvv runs over all finite and infinite places of KKK and κv\kappa_vκv​ is the local Kummer map, is finite.

This is the finiteness statement for the Selmer group of the isogeny [n]:E→E[n]:E\to E[n]:E→E; it implies the weak Mordell–Weil theorem and the finiteness of Ш(E/K)[n]\text{Ш}(E/K)[n]Ш(E/K)[n].

Formalization Note The Selmer group is a subset of the continuous cohomology group H1(GK,E(Kˉ)[n])H^1(G_K,E(\bar K)[n])H1(GK​,E(Kˉ)[n]); the theorem asserts this subset is finite.

Preamble
import Mathlib
import Definitions.Def_SelmerGroup_ContinuousH1
import Definitions.Def_SelmerGroup_GaloisPoints
import Definitions.Def_SelmerGroup_Selmer

open NumberField
Formal statement
namespace SelmerGroup
theorem selmerGroup_finite {K : Type*} [Field K] [NumberField K] (E : WeierstrassCurve K)
    [E.IsElliptic] (n : ℕ) (hn : 0 < n) :
    (selmerGroup E n).Finite := by sorry
end SelmerGroup
Source
Wikipedia, "Selmer group", revision oldid=1370673670, https://en.wikipedia.org/w/index.php?title=Selmer_group&oldid=1370673670 , section "Selmer group of an isogeny" (p. 1 of the supplied PDF)
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me