Every primitive row has an idempotent normalization
ProvedN25.level25_gamma0_row_normalizationmazur-n25
Let be primitive, and define when is a unit and otherwise. Then there exists a unit with , and
This selects a canonical representative of each unit-scaling orbit used for .
Preamble
import Mathlib import Definitions.Def_N25 set_option autoImplicit false open N25
Formal statement
theorem N25.level25_gamma0_row_normalization :
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
∀ r : R, primitive r →
(∃ u : (ZMod 25)ˣ, ((u:ZMod 25)*r.1,(u:ZMod 25)*r.2) = normal r) ∧
primitive (normal r) ∧ normal (normal r) = normal 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.