Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit division polynomials and their elliptic multiplication identities

Definition
WeierstrassEllipticZeta_DivisionPolynomials

by tomasz · Sep 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

complex-analysiselliptic-functionspolynomialstranscendence

Work in the integer polynomial ring in five independent variables, ordered as

(G,H,x,p,Z).(G,H,x,p,Z).(G,H,x,p,Z).

Set

β=16(x3−Gx−H)2,γ=3x4−6Gx2−12Hx−G2,\beta=16(x^3-Gx-H)^2,\qquad \gamma=3x^4-6Gx^2-12Hx-G^2,β=16(x3−Gx−H)2,γ=3x4−6Gx2−12Hx−G2, δ=2x6−10Gx4−40Hx3−10G2x2−8GHx+2G3−16H2.\delta=2x^6-10Gx^4-40Hx^3-10G^2x^2-8GHx+2G^3-16H^2.δ=2x6−10Gx4−40Hx3−10G2x2−8GHx+2G3−16H2.

Let rn=preNormEDS⁡′(β,γ,δ,n)r_n=\operatorname{preNormEDS}'(\beta,\gamma,\delta,n)rn​=preNormEDS′(β,γ,δ,n) be Mathlib's auxiliary normalized elliptic-divisibility sequence. Explicitly, its initial terms and recurrences are

r0=0,r1=r2=1,r3=γ,r4=δ,r_0=0,\quad r_1=r_2=1,\quad r_3=\gamma,\quad r_4=\delta,r0​=0,r1​=r2​=1,r3​=γ,r4​=δ, r2k=rk−12rkrk+2−rk−2rkrk+12(k≥3),r_{2k}=r_{k-1}^2r_kr_{k+2}-r_{k-2}r_kr_{k+1}^2\quad(k\ge3),r2k​=rk−12​rk​rk+2​−rk−2​rk​rk+12​(k≥3), r2k+1=rk+2rk3{βk even,1k odd−rk−1rk+13{1k even,βk odd(k≥2).r_{2k+1}=r_{k+2}r_k^3\begin{cases}\beta&k\text{ even},\\1&k\text{ odd}\end{cases} -r_{k-1}r_{k+1}^3\begin{cases}1&k\text{ even},\\\beta&k\text{ odd}\end{cases}\quad(k\ge2).r2k+1​=rk+2​rk3​{β1​k even,k odd​−rk−1​rk+13​{1β​k even,k odd​(k≥2).

The reduced division polynomial is

Fn=rn{pn even,1n odd.F_n=r_n\begin{cases}p&n\text{ even},\\1&n\text{ odd}.\end{cases}Fn​=rn​{p1​n even,n odd.​

These are the usual division-polynomial representatives after using the cubic relation to replace even powers of ppp. The even factor is ppp, corresponding to 2y=℘′2y=\wp'2y=℘′. The signs above correspond to the curve y2=x3−Gx−Hy^2=x^3-Gx-Hy2=x3−Gx−H.

Define the integer polynomial derivation D\mathcal DD by

D(G,H,x,p,Z)=(0,0,p,6x2−2G,−x).\mathcal D(G,H,x,p,Z)=(0,0,p,6x^2-2G,-x).D(G,H,x,p,Z)=(0,0,p,6x2−2G,−x).

The explicit common denominator and three numerators are

Qn=nFn4,Q_n=nF_n^4,Qn​=nFn4​, Pn,0=n2Fn4Z+Fn3DFn,P_{n,0}=n^2F_n^4Z+F_n^3\mathcal D F_n,Pn,0​=n2Fn4​Z+Fn3​DFn​, Pn,1=n(xFn2−Fn−1Fn+1)Fn2,Pn,2=nF2n.P_{n,1}=n(xF_n^2-F_{n-1}F_{n+1})F_n^2,\qquad P_{n,2}=nF_{2n}.Pn,1​=n(xFn2​−Fn−1​Fn+1​)Fn2​,Pn,2​=nF2n​.

The definitions are total for natural indices; n−1n-1n−1 denotes truncated natural subtraction. Bounds and analytic multiplication claims below are required only for n>0n>0n>0.

For a complex period pair LLL and a point uuu, evaluate these polynomials at

yu=(g2/4,g3/4,℘L(u),℘L′(u),ζL(u)),fn=Fn(yu).y_u=(g_2/4,g_3/4,\wp_L(u),\wp'_L(u),\zeta_L(u)),\qquad f_n=F_n(y_u).yu​=(g2​/4,g3​/4,℘L​(u),℘L′​(u),ζL​(u)),fn​=Fn​(yu​).

The property EllipticDivisionPolynomialIdentities⁡(L,u)\operatorname{EllipticDivisionPolynomialIdentities}(L,u)EllipticDivisionPolynomialIdentities(L,u) asserts, for every positive natural nnn, nonvanishing fn≠0f_n\ne0fn​=0 and the three identities

fn2℘L(nu)=℘L(u)fn2−fn−1fn+1,f_n^2\wp_L(nu)=\wp_L(u)f_n^2-f_{n-1}f_{n+1},fn2​℘L​(nu)=℘L​(u)fn2​−fn−1​fn+1​, fn4℘L′(nu)=f2n,f_n^4\wp'_L(nu)=f_{2n},fn4​℘L′​(nu)=f2n​, nfnζL(nu)=n2fnζL(u)+(DFn)(yu).nf_n\zeta_L(nu)=n^2f_n\zeta_L(u)+(\mathcal D F_n)(y_u).nfn​ζL​(nu)=n2fn​ζL​(u)+(DFn​)(yu​).

There are no degree or coefficient estimates in this property. The formal last term is the evaluated polynomial derivation; identifying it with the complex derivative of the evaluated division polynomial is part of the analytic construction. The nonvanishing assertion concerns every positive index and is essential to the resulting common denominator.

Definition code
import Definitions.Def_WeierstrassEllipticZeta_MultiplePolynomials
import Mathlib.NumberTheory.EllipticDivisibilitySequence
import Mathlib.Algebra.MvPolynomial.PDeriv

noncomputable section
namespace WeierstrassEllipticZeta
open MvPolynomial

/-- The square of the cubic representing `wp-prime^2`, in coordinates
`g2/4, g3/4, wp, wp-prime, zeta`. -/
def ellipticDivisionB : MvPolynomial (Fin 5) ℤ :=
  (C 4 * (X 2 ^ 3 - X 0 * X 2 - X 1)) ^ 2

/-- The third reduced division polynomial for `y^2 = x^3 - G*x - H`. -/
def ellipticDivisionC : MvPolynomial (Fin 5) ℤ :=
  C 3 * X 2 ^ 4 - C 6 * X 0 * X 2 ^ 2 - C 12 * X 1 * X 2 - X 0 ^ 2

/-- The fourth division polynomial with the factor `wp-prime` removed. -/
def ellipticDivisionD : MvPolynomial (Fin 5) ℤ :=
  C 2 * X 2 ^ 6 - C 10 * X 0 * X 2 ^ 4 - C 40 * X 1 * X 2 ^ 3 -
    C 10 * X 0 ^ 2 * X 2 ^ 2 - C 8 * X 0 * X 1 * X 2 +
    C 2 * X 0 ^ 3 - C 16 * X 1 ^ 2

/-- Reduced division polynomials, with the missing even factor restored. -/
def ellipticDivisionPolynomial (n : ℕ) : MvPolynomial (Fin 5) ℤ :=
  preNormEDS' ellipticDivisionB ellipticDivisionC ellipticDivisionD n *
    if Even n then X 3 else 1

/-- Differentiation along the canonical elliptic differential equations. -/
def ellipticMultipleDerivation :
    Derivation ℤ (MvPolynomial (Fin 5) ℤ) (MvPolynomial (Fin 5) ℤ) :=
  mkDerivation ℤ ![0, 0, X 3, C 6 * X 2 ^ 2 - C 2 * X 0, -X 2]

/-- A common denominator in the three multiplication identities. -/
def ellipticDivisionDenominator (n : ℕ) : MvPolynomial (Fin 5) ℤ :=
  C (n : ℤ) * ellipticDivisionPolynomial n ^ 4

/-- Cleared multiplication numerators, ordered as zeta, wp, wp-prime. -/
def ellipticDivisionNumerator (n : ℕ) : Fin 3 → MvPolynomial (Fin 5) ℤ :=
  ![C ((n : ℤ) ^ 2) * ellipticDivisionPolynomial n ^ 4 * X 4 +
      ellipticDivisionPolynomial n ^ 3 *
        ellipticMultipleDerivation (ellipticDivisionPolynomial n),
    C (n : ℤ) * (X 2 * ellipticDivisionPolynomial n ^ 2 -
      ellipticDivisionPolynomial (n - 1) * ellipticDivisionPolynomial (n + 1)) *
        ellipticDivisionPolynomial n ^ 2,
    C (n : ℤ) * ellipticDivisionPolynomial (2 * n)]

/-- The nonvanishing and multiplied-out analytic identities of Lemma 5.
All evaluations are at the five generators at the fixed point. -/
def EllipticDivisionPolynomialIdentities (L : PeriodPair) (u : ℂ) : Prop :=
  ∀ n : ℕ, 0 < n →
    let e := eval₂ (Int.castRingHom ℂ) (ellipticMultipleGenerators L u)
    let f := fun k => e (ellipticDivisionPolynomial k)
    f n ≠ 0 ∧
    f n ^ 2 * L.weierstrassP (n * u) =
      L.weierstrassP u * f n ^ 2 - f (n - 1) * f (n + 1) ∧
    f n ^ 4 * L.derivWeierstrassP (n * u) = f (2 * n) ∧
    (n : ℂ) * f n * weierstrassZeta L (n * u) =
      (n : ℂ) ^ 2 * f n * weierstrassZeta L u +
        e (ellipticMultipleDerivation (ellipticDivisionPolynomial n))

end WeierstrassEllipticZeta
Source
Definitions for Senthil Kumar K (2026), Section 4 Lemma 5, equation (12). The reduced division polynomials use Mathlib preNormEDS' with the short Weierstrass specialization (a4,a6)=(-G,-H). The numerator/denominator formulas are explicit denominator clearing, and the analytic identities are recorded as a proposition, not assumed or proved by these definitions. https://doi.org/10.1017/S001309152610145X

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me