The finite row census has counts
ProvedN25.level25_gamma0_finite_censusmazur-n25
With , primitivity, normalization , and as above, let be the primitive rows fixed by . Let , , and . Then
These finite counts yield the index, elliptic-orbit, and cusp data for .
Preamble
import Mathlib import Definitions.Def_N25 set_option autoImplicit false open N25
Formal statement
theorem N25.level25_gamma0_finite_census :
let R := ZMod 25 × ZMod 25
let primitive : R → Prop := fun r => r.1.val % 5 ≠ 0 ∨ r.2.val % 5 ≠ 0
let normal : R → R := fun r =>
if r.1.val % 5 ≠ 0 then (1,r.1⁻¹*r.2) else (r.2⁻¹*r.1,1)
let code : R → ℕ := fun r => r.1.val + 25*r.2.val
let reps := (Finset.univ : Finset R).filter (fun r => primitive r ∧ normal r = r)
let S : R → R := fun r => (r.2,-r.1)
let ST : R → R := fun r => (r.2,r.2-r.1)
let translate : Fin 25 → R → R := fun n r => (r.1,r.2+(n.val:ZMod 25)*r.1)
reps.card = 30 ∧
(reps.filter (fun r => code r ≤ code (normal (S r)))).card = 16 ∧
(reps.filter (fun r => code r ≤ code (normal (ST r)) ∧
code r ≤ code (normal (ST (ST r))))).card = 10 ∧
(reps.filter (fun r => ∀ n : Fin 25,
code r ≤ code (normal (translate n r)))).card = 6 := by sorrySource
B. Mazur, Modular curves and the Eisenstein ideal, Publ. IHES 47 (1977); Lean formalization of the order-25 case for this mission. Modules in the MazurProof/Keystone/Tate families are adapted from anthropics/fermats-last-theorem (Apache-2.0) via the xiangyazi24/FLT fork.