Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quadratic degree and exponential length bounds for elliptic multiplication polynomials

Proved
WeierstrassEllipticZeta.division_multiple_polynomial_bounds

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

complex-analysiselliptic-functionspolynomialstranscendence

For the following explicit integer polynomials, there exist positive natural constants C,JC,JC,J, independent of the positive integer nnn, such that

deg⁡Qn≤Cn2,L(Qn)≤Jn2,\deg Q_n\le Cn^2,\quad L(Q_n)\le J^{n^2},degQn​≤Cn2,L(Qn​)≤Jn2, deg⁡Pn,j≤Cn2,L(Pn,j)≤Jn2(j=0,1,2).\deg P_{n,j}\le Cn^2,\quad L(P_{n,j})\le J^{n^2}\qquad(j=0,1,2).degPn,j​≤Cn2,L(Pn,j​)≤Jn2(j=0,1,2).

Here L(P)L(P)L(P) is the sum of the absolute values of all integer coefficients. The constants are universal for these formal polynomials; no lattice, evaluation point, nonvanishing, or analytic identity is assumed. In particular, this result also bounds each individual coefficient. The recurrences, derivation, and four polynomials are specified below.

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.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_DivisionPolynomials

open WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.division_multiple_polynomial_bounds : ∃ C H : ℕ, 0 < C ∧ 0 < H ∧
    ∀ n : ℕ, 0 < n →
      (ellipticDivisionDenominator n).totalDegree ≤ C * n ^ 2 ∧
      (∑ m ∈ (ellipticDivisionDenominator n).support,
        ((ellipticDivisionDenominator n).coeff m).natAbs) ≤ H ^ (n ^ 2) ∧
      (∀ j, (ellipticDivisionNumerator n j).totalDegree ≤ C * n ^ 2) ∧
      (∀ j, (∑ m ∈ (ellipticDivisionNumerator n j).support,
        ((ellipticDivisionNumerator n j).coeff m).natAbs) ≤ H ^ (n ^ 2)) := by sorry
Source
Senthil Kumar K (2026), Section 4 Lemma 5 and the division-polynomial estimates immediately preceding it, used in Section 5 Lemma 7(a). The explicit cleared numerators and denominator are obtained from equation (12). This theorem proves universal bounds for the recursively defined reduced polynomial representatives using Mathlib preNormEDS' and polynomial derivation estimates. Coefficient length replaces maximum coefficient height, and constants are enlarged. No analytic identities or nonvanishing are asserted. 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