Every relevant numerator coefficient is smaller than
ProvedN25.unitRelationNumeratorPolynomial25_coeff_boundmazur-n25
Let be the truncated unit-relation numerator polynomial. For every ,
This bound allows four coprime modular evaluations to certify that each coefficient is zero.
Preamble
import Mathlib import Definitions.Def_N25_UnitRelationCertificate set_option autoImplicit false open N25 open Polynomial
Formal statement
theorem N25.unitRelationNumeratorPolynomial25_coeff_bound (n : ℕ) (hn : n < 4951) :
|(unitRelationNumeratorPolynomial25 199).coeff n| < (2 : ℤ) ^ 360 := 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.