Primitive residue rows are exactly the bottom rows of matrices
ProvedN25.level25_primitive_rowsmazur-n25
Let using representatives , and call primitive when at least one coordinate is not divisible by . For let be its bottom row modulo . Then
This identifies the finite residue-row model with the actual modular-group quotient.
Preamble
import Mathlib import Definitions.Def_N25 set_option autoImplicit false open scoped MatrixGroups open N25
Formal statement
theorem N25.level25_primitive_rows :
let R := Fin 25 × Fin 25
let primitive : R → Prop := fun r => r.1.val % 5 ≠ 0 ∨ r.2.val % 5 ≠ 0
let row : SL(2, ℤ) → R := fun A => ((A 1 0 : ZMod 25), (A 1 1 : ZMod 25))
(∀ A, primitive (row A)) ∧ ∀ r : R, primitive r → ∃ A, row A = 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.