A zero residue certificate implies a high-power divisibility of the evaluation
ProvedN25.unitRelationNumeratorResidue25_soundmazur-n25
Let with , and assume the residue computation is zero. Put using integer division, and let be the corresponding numerator polynomial. Then
This proves the arithmetic soundness of each modular residue certificate.
Preamble
import Definitions.Def_N25_UnitRelationCertificate import Definitions.Def_Polynomial_BinomialResidue set_option autoImplicit false open N25
Formal statement
theorem N25.unitRelationNumeratorResidue25_sound (base count : ℕ) (hb : 0 < base)
(h : unitRelationNumeratorResidue25 base count = 0) :
(base : ℤ) ^ count ∣
(unitRelationNumeratorPolynomial25 ((count + 24) / 25)).eval (base : ℤ) := 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.