The row census has counts
ProvedN25.level25_row_censusmazur-n25
Let , let be the primitive rows, let act by scaling, and let . Let , , and . Then
This finite census simultaneously supplies the subgroup index and the two elliptic-orbit counts.
Preamble
import Mathlib import Definitions.Def_N25 set_option autoImplicit false open N25
Formal statement
theorem N25.level25_row_census :
let R := Fin 25 × Fin 25
let primitive : R → Prop := fun r => r.1.val % 5 ≠ 0 ∨ r.2.val % 5 ≠ 0
let scale : ℕ → R → R := fun h r =>
(⟨h * r.1.val % 25, Nat.mod_lt _ (by decide)⟩,
⟨h * r.2.val % 25, Nat.mod_lt _ (by decide)⟩)
let code : R → ℕ := fun r => r.1.val + 25 * r.2.val
let normcode : R → ℕ := fun r =>
min (min (code r) (code (scale 7 r))) (min (code (scale 18 r)) (code (scale 24 r)))
let canonical : R → Prop := fun r => code r = normcode r
let rows := (Finset.univ : Finset R).filter primitive
let reps := rows.filter canonical
let S : R → R := fun r => (r.2, ⟨(25-r.1.val)%25, Nat.mod_lt _ (by decide)⟩)
let ST : R → R := fun r =>
(r.2, ⟨(r.2.val+25-r.1.val)%25, Nat.mod_lt _ (by decide)⟩)
rows.card = 600 ∧ reps.card = 150 ∧
(reps.filter (fun r => ∃ h ∈ ([1,7,18,24] : List ℕ), scale h r = S r)).card = 10 ∧
(reps.filter (fun r => ∃ h ∈ ([1,7,18,24] : List ℕ), scale h r = ST r)).card = 0 ∧
(reps.filter (fun r => code r ≤ normcode (S r))).card = 80 ∧
(reps.filter (fun r => code r ≤ normcode (ST r) ∧
code r ≤ normcode (ST (ST r)))).card = 50 := 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.