Evaluation of the differential-addition determinant
ProvedWeierstrassCurve.deltaP_evalmazur-n25
Let be an integral domain, let be a Weierstrass curve, let , and let . Put and . Then the determinant polynomial used in differential addition satisfies
This records the projective cross-difference whose vanishing triggers the degenerate ladder branch.
Preamble
import Mathlib.AlgebraicGeometry.EllipticCurve.DivisionPolynomial.Degree
import Mathlib.AlgebraicGeometry.EllipticCurve.DivisionPolynomial.Basic
import Mathlib.NumberTheory.EllipticDivisibilitySequence
import Mathlib.Tactic
import Definitions.Def_KeystoneDiffAddCert
import Definitions.Def_WardSomos
open Polynomial
open scoped Polynomial
open FLT.EDS
open WeierstrassCurve
variable {R : Type*} [CommRing R] [IsDomain R]Formal statement
theorem WeierstrassCurve.deltaP_eval (W : WeierstrassCurve R) (X0 Z0 X1 Z1 : R[X]) (x : R) :
(deltaP W X0 Z0 X1 Z1).eval x = X0.eval x * Z1.eval x - X1.eval x * Z0.eval x := 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.