Reconstruction of a genus-four reciprocal numerator
ProvedN25.genusFour_numerator_reconstructionmazur-n25
Let have degree at most and , and let . For integers , set . Assume and both satisfy the first four Newton equations for , and assume for . Then
This is the abstract reconstruction step for the two candidate genus-four numerators.
Preamble
import Definitions.Def_N25_GenusFourNumerator open N25
Formal statement
theorem N25.genusFour_numerator_reconstruction
(L : Polynomial ℤ) (q a₁ a₂ a₃ a₄ N₁ N₂ N₃ N₄ : ℤ)
(hq : q ≠ 0) (hdegree : L.natDegree ≤ 8) (hzero : L.coeff 0 = 1)
(hnewton : CountNewtonFourEquations q N₁ N₂ N₃ N₄
(L.coeff 1) (L.coeff 2) (L.coeff 3) (L.coeff 4))
(hcandidate : CountNewtonFourEquations q N₁ N₂ N₃ N₄ a₁ a₂ a₃ a₄)
(hrec : ∀ i ≤ 8, L.coeff (8 - i) * q ^ i = q ^ 4 * L.coeff i) :
L = genusFourNumerator q a₁ a₂ a₃ a₄ := 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.