Normalized division polynomials satisfy an adjacent Somos relation
ProvedFLT.EDS.prePsi_adjacent_somosmazur-n25
Let be an integral domain, let be a Weierstrass curve over , assume in , and let . Put , , and , all viewed as polynomials in , and define if is even and if is odd. Then
This is the parity-corrected Somos recurrence used by the x-only multiplication certificates.
Preamble
import Mathlib.AlgebraicGeometry.EllipticCurve.DivisionPolynomial.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.DivisionPolynomial.Degree
import Mathlib.NumberTheory.EllipticDivisibilitySequence
import Mathlib.Tactic
open Polynomial WeierstrassCurve
open scoped Classical
variable {R : Type*} [CommRing R]Formal statement
theorem FLT.EDS.prePsi_adjacent_somos [IsDomain R] (W : WeierstrassCurve R) (h4 : (4 : R) ≠ 0) (m : ℤ) :
W.preΨ (m + 2) * W.preΨ (m - 2)
= (if Even m then 1 else W.Ψ₂Sq ^ 2) * (W.preΨ (m + 1) * W.preΨ (m - 1))
- W.Ψ₃ * W.preΨ m ^ 2 := 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.