A division polynomial splits into its normalized part and the parity factor
ProvedFLT.EDS.mk_psi_eqmazur-n25
Let be a commutative ring, let be a Weierstrass curve, and let . In the affine coordinate ring of , write for the class of the full division polynomial, for the class of the normalized one-variable polynomial, and set when is even and when is odd. Then
This isolates the parity-dependent factor needed to translate Ward recurrences to one-variable division polynomials.
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.mk_psi_eq (W : WeierstrassCurve R) (n : ℤ) :
Affine.CoordinateRing.mk W (W.ψ n)
= Affine.CoordinateRing.mk W (Polynomial.C (W.preΨ n))
* (if Even n then Affine.CoordinateRing.mk W W.ψ₂ else 1) := 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.