-orbits admit canonical minima and form a group action
ProvedN25.level25_row_normalizationmazur-n25
Let act by scaling on , let , and let . Then every orbit contains an element attaining , for all , the four scaling maps are closed under relative composition, and each has an inverse among the four maps:
This establishes the normalization machinery used throughout the finite level- census.
Preamble
import Mathlib import Definitions.Def_N25 set_option autoImplicit false open N25
Formal statement
theorem N25.level25_row_normalization :
let R := Fin 25 × Fin 25
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 labels : Fin 4 → ℕ := ![1,7,18,24]
let normcode : R → ℕ := fun r =>
min (min (code r) (code (scale 7 r))) (min (code (scale 18 r)) (code (scale 24 r)))
(∀ r : R, ∃ i : Fin 4, code (scale (labels i) r) = normcode r) ∧
(∀ r : R, ∀ i : Fin 4, normcode (scale (labels i) r) = normcode r) ∧
(∀ i j : Fin 4, ∃ k : Fin 4, ∀ r : R,
scale (labels i) r = scale (labels j) (scale (labels k) r)) ∧
(∀ i : Fin 4, ∃ j : Fin 4, ∀ r : R,
scale (labels j) (scale (labels i) r) = 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.