The - and -orbits admit canonical level- representatives
ProvedN25.level25_elliptic_orbit_normalizationmazur-n25
Let , let primitive rows be those not divisible by in both coordinates, let act by scaling, and let be the minimum encoded value in an -orbit. Define and , and set and . For every primitive , these minima are attained by an -multiple of one of the two -orbit points and one of the three -orbit points, respectively. In addition,
and the actions of , , and preserve primitivity. This provides canonical finite representatives for the elliptic double-coset counts.
Preamble
import Mathlib import Definitions.Def_N25 set_option autoImplicit false open N25
Formal statement
theorem N25.level25_elliptic_orbit_normalization :
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 labels : Fin 4 → ℕ := ![1,7,18,24]
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 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)⟩)
let snorm : R → ℕ := fun r => min (normcode r) (normcode (S r))
let stnorm : R → ℕ := fun r =>
min (normcode r) (min (normcode (ST r)) (normcode (ST (ST r))))
(∀ r : R, primitive r →
∃ i : Fin 4, ∃ n : Fin 2,
code (scale (labels i) (if n.val=0 then r else S r)) = snorm r) ∧
(∀ r : R, primitive r →
∃ i : Fin 4, ∃ n : Fin 3,
code (scale (labels i) (if n.val=0 then r else if n.val=1 then ST r else ST (ST r))) = stnorm r) ∧
(∀ r : R, ∀ i : Fin 4,
snorm (scale (labels i) r) = snorm r ∧
stnorm (scale (labels i) r) = stnorm r ∧
(primitive (scale (labels i) r) ↔ primitive r)) ∧
(∀ r : R, snorm (S r) = snorm r ∧ stnorm (ST r) = stnorm r ∧
(primitive (S r) ↔ primitive r) ∧ (primitive (ST r) ↔ primitive 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.