Division-polynomial x-pairs satisfy the doubling and differential-addition recurrences
ProvedKeystoneLadder.xPair_double_and_diffAddOrInf_EDS_coremazur-n25
Let be an elliptic Weierstrass curve, let and , assume in , assume every nonzero-index division polynomial is nonzero, and assume . Then the x-pair for is nonzero and projectively equal to the doubled x-pair for , while the x-pair for is nonzero and projectively equal to differential addition from the pairs for , , and :
This is the elliptic-divisibility-sequence core of the x-only ladder.
Preamble
import Mathlib
import Mathlib.AlgebraicGeometry.EllipticCurve.DivisionPolynomial.Degree
import Mathlib.AlgebraicGeometry.EllipticCurve.DivisionPolynomial.Basic
import Mathlib.NumberTheory.EllipticDivisibilitySequence
import Mathlib.Tactic
import Definitions.Def_KeystoneLadder
import Definitions.Def_PsiInvariant
import Definitions.Def_KeystoneCoprimality
import Definitions.Def_WardSomos
import Definitions.Def_KeystoneDoubling
open Polynomial WeierstrassCurve WeierstrassCurve.Affine
open scoped Classical
variable {k : Type*} [Field k]
open KeystoneLadder
open KeystoneLadder.XOnlyFormal statement
theorem KeystoneLadder.xPair_double_and_diffAddOrInf_EDS_core
(W : WeierstrassCurve k) [W.IsElliptic] (m : ℕ) (x : k)
(h4 : (4 : k) ≠ 0)
(hψ_ne : ∀ n : ℤ, n ≠ 0 → W.ψ n ≠ 0)
(hc3 : W.Ψ₃ ≠ 0) :
xPair W ((2 * m : ℕ) : ℤ) x ≠ 0 ∧
SameP1Vec
(XOnly.doubleVec (E := W⁄k) (xPair W (m : ℤ) x))
(xPair W ((2 * m : ℕ) : ℤ) x) ∧
xPair W ((2 * m + 1 : ℕ) : ℤ) x ≠ 0 ∧
SameP1Vec
(XOnly.diffAddOrInfVec (E := W⁄k)
(xPair W (m : ℤ) x)
(xPair W ((m + 1 : ℕ) : ℤ) x)
(xPair W (1 : ℤ) x))
(xPair W ((2 * m + 1 : ℕ) : ℤ) 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.