The fourteen cusps have widths
ProvedN25.level25_cusp_width_censusmazur-n25
Let using representatives , call primitive when at least one coordinate is not divisible by , and let act by scaling. Set , , and . Let be the primitive rows satisfying for every , and put if , if and , and otherwise. Then
Moreover for every primitive , and no positive has . This certifies both the cusp count and the complete width distribution.
Preamble
import Mathlib import Definitions.Def_N25 set_option autoImplicit false open N25
Formal statement
theorem N25.level25_cusp_width_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 translate : ℕ → R → R := fun n r =>
(r.1, ⟨(r.2.val+n*r.1.val)%25, Nat.mod_lt _ (by decide)⟩)
let cusps := (Finset.univ : Finset R).filter (fun r => primitive r ∧
∀ n : Fin 25, code r ≤ normcode (translate n.val r))
let width : R → ℕ := fun r =>
if r.1.val = 0 then 1 else if r.1.val % 5 = 0 then 5 else 25
cusps.card = 14 ∧
(cusps.filter (fun r => width r = 1)).card = 5 ∧
(cusps.filter (fun r => width r = 5)).card = 4 ∧
(cusps.filter (fun r => width r = 25)).card = 5 ∧
(∑ r ∈ cusps, width r) = 150 ∧
(∀ r : R, primitive r →
normcode (translate (width r) r) = normcode r ∧
∀ n : Fin 25, 0 < n.val → n.val < width r →
normcode (translate n.val r) ≠ normcode r) := 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.