Reconstruction of the ternary genus-four numerator
ProvedN25.Endgame.ternaryLPolynomial25_reconstructionmazur-n25
Let have degree at most and constant coefficient . Assume its first four coefficients satisfy the count-form Newton equations for and , and assume for every . Then
This reconstructs the ternary candidate numerator from the four certified point counts.
Preamble
import Definitions.Def_N25_GenusFourNumerator open N25 open N25.Endgame
Formal statement
theorem N25.Endgame.ternaryLPolynomial25_reconstruction (L : Polynomial ℤ)
(hdegree : L.natDegree ≤ 8) (hzero : L.coeff 0 = 1)
(hnewton : CountNewtonFourEquations 3 5 5 20 89
(L.coeff 1) (L.coeff 2) (L.coeff 3) (L.coeff 4))
(hrec : ∀ i ≤ 8, L.coeff (8 - i) * 3 ^ i = 3 ^ 4 * L.coeff i) :
L = ternaryLPolynomial25 := 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.