A non-width-one factorization forces divisibility by
ProvedN25.dilation25_triangular_five_dvdmazur-n25
Let , let and , assume , , , and
If does not divide the lower-left entry , then divides the upper-left entry . This is the arithmetic constraint needed to isolate the middle and width- cusp cases.
Preamble
import Mathlib set_option autoImplicit false open Matrix
Formal statement
theorem N25.dilation25_triangular_five_dvd
(A B : Matrix.SpecialLinearGroup (Fin 2) ℤ) (d : ℕ) (e v : ℤ)
(hd : 0 < d) (he : 0 < e) (hde : (d : ℤ) * e = 25)
(hm : !![25, 0; 0, 1] * (A : Matrix (Fin 2) (Fin 2) ℤ) =
(B : Matrix (Fin 2) (Fin 2) ℤ) * !![(d : ℤ), v; 0, e])
(hA : ¬ (25 : ℤ) ∣ A 1 0) : (5 : ℤ) ∣ B 0 0 := 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.