Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quantitative specialization of moving elliptic coordinates

Proved
WeierstrassEllipticZeta.specialize_moving_elliptic_coordinates

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

asymptoticselliptic-functionspolynomialstranscendence

Let LLL be a complex period pair, let ω,u1,u2,θ,ν∈C\omega,u_1,u_2,\theta,\nu\in\mathbb Cω,u1​,u2​,θ,ν∈C, and let d∈Z[X]d\in\mathbb Z[X]d∈Z[X] satisfy δ=d(θ)≠0\delta=d(\theta)\ne0δ=d(θ)=0. Let yyy be the nine-generator tuple specified below. Suppose that for each yjy_jyj​ there is an integer bivariate polynomial SjS_jSj​ such that

Sj(θ,ν)=δyj.S_j(\theta,\nu)=\delta y_j.Sj​(θ,ν)=δyj​.

Assume EllipticGeneratorPolynomialData⁡(L,ω,u1,u2)\operatorname{EllipticGeneratorPolynomialData}(L,\omega,u_1,u_2)EllipticGeneratorPolynomialData(L,ω,u1​,u2​), whose full meaning is given below. Then

AuxiliaryMovingCoordinateData⁡(L,ω,u1,u2,θ,ν).\operatorname{AuxiliaryMovingCoordinateData}(L,\omega,u_1,u_2,\theta,\nu).AuxiliaryMovingCoordinateData(L,ω,u1​,u2​,θ,ν).

In particular, substitution and clearing the fixed denominator preserve a quadratic degree bound, an exponential coefficient-length bound with logarithmic period-index contribution, and nonzero evaluated denominators. A single natural constant and threshold work at every nonlattice point of the enlarged auxiliary grid. No transcendence, integrality, polynomial-kernel, reduced-degree, grid-independence, or derivative hypothesis is needed for this algebraic specialization step.

Fix a complex period pair LLL, with lattice Ω\OmegaΩ, and complex numbers ω,u1,u2\omega,u_1,u_2ω,u1​,u2​. The ordered generator tuple is

y=(ηL(ω),g2/4,g3/4,℘L(u1),℘L′(u1),ζL(u1),℘L(u2),℘L′(u2),ζL(u2)).y=(\eta_L(\omega),g_2/4,g_3/4,\wp_L(u_1),\wp'_L(u_1),\zeta_L(u_1), \wp_L(u_2),\wp'_L(u_2),\zeta_L(u_2)).y=(ηL​(ω),g2​/4,g3​/4,℘L​(u1​),℘L′​(u1​),ζL​(u1​),℘L​(u2​),℘L′​(u2​),ζL​(u2​)).

For a point vvv and nonnegative integers D,JD,JD,J, a generator presentation consists of a common denominator QQQ and three numerators PjP_jPj​ in Z[Y0,…,Y8]\mathbb Z[Y_0,\ldots,Y_8]Z[Y0​,…,Y8​], with total degrees at most DDD and coefficient lengths at most JJJ, satisfying

Q(y)≠0,Pj(y)=Q(y)xj(v),(x0,x1,x2)=(ζL,℘L,℘L′).Q(y)\ne0,\qquad P_j(y)=Q(y)x_j(v),\qquad (x_0,x_1,x_2)=(\zeta_L,\wp_L,\wp'_L).Q(y)=0,Pj​(y)=Q(y)xj​(v),(x0​,x1​,x2​)=(ζL​,℘L​,℘L′​).

Coefficient length means the sum of the absolute values of all integer coefficients. Numerators may vanish; the evaluated denominator may not.

The property EllipticGeneratorPolynomialData⁡(L,ω,u1,u2)\operatorname{EllipticGeneratorPolynomialData}(L,\omega,u_1,u_2)EllipticGeneratorPolynomialData(L,ω,u1​,u2​) asserts that there are positive integers C,HC,HC,H, chosen before all indices, with the following property. For every triple a1,a2,a3∈Na_1,a_2,a_3\in\mathbb Na1​,a2​,a3​∈N, set

v=a1u1+a2u2+a3ω,T=a12+a22+1.v=a_1u_1+a_2u_2+a_3\omega,\qquad T=a_1^2+a_2^2+1.v=a1​u1​+a2​u2​+a3​ω,T=a12​+a22​+1.

If v∉Ωv\notin\Omegav∈/Ω, there is a generator presentation at vvv with bounds

D=CT,J=(1+a3)HT.D=CT,\qquad J=(1+a_3)H^T.D=CT,J=(1+a3​)HT.

Thus the degree is quadratic in the two nonperiodic indices and independent of the period index; the period index occurs only linearly in the coefficient-length bound. The constants may depend on the fixed lattice and generators. The polynomials may depend on the index triple. This property does not assert that one polynomial family works for every lattice. It contains no arithmetic parameters θ,ν\theta,\nuθ,ν, auxiliary integer NNN, or reduced polynomial model.

Fix a complex period pair LLL with lattice Ω\OmegaΩ, and complex numbers ω,u1,u2,θ,ν\omega,u_1,u_2,\theta,\nuω,u1​,u2​,θ,ν. Let L(P)\mathscr L(P)L(P) denote the sum of the absolute values of all integer coefficients of a polynomial. For sufficiently large positive integers NNN, put

s=⌊N3/16⌋,q=⌊N5/8log⁡N/64⌋,s=\lfloor N^{3/16}\rfloor,\qquad q=\lfloor N^{5/8}\log N/64\rfloor,s=⌊N3/16⌋,q=⌊N5/8logN/64⌋, Γ3={a1u1+a2u2+a3ω:0≤a1,a2<3s, 0≤a3<3q, ai∈Z}.\Gamma_3=\{a_1u_1+a_2u_2+a_3\omega: 0\le a_1,a_2<3s,\ 0\le a_3<3q,\ a_i\in\mathbb Z\}.Γ3​={a1​u1​+a2​u2​+a3​ω:0≤a1​,a2​<3s, 0≤a3​<3q, ai​∈Z}.

Moving elliptic coordinate data assert that there is a nonnegative integer CCC such that, for every sufficiently large NNN and every nonlattice point v∈Γ3v\in\Gamma_3v∈Γ3​, there are three numerator polynomials PjP_jPj​, denominator polynomials QjQ_jQj​ in Z[X,Y]\mathbb Z[X,Y]Z[X,Y], and nonnegative integers hjh_jhj​, with

deg⁡Pj,deg⁡Qj≤Cs2,L(Pj),L(Qj)≤hj≤eC(s2+log⁡N),\deg P_j,\deg Q_j\le Cs^2,\qquad \mathscr L(P_j),\mathscr L(Q_j)\le h_j\le e^{C(s^2+\log N)},degPj​,degQj​≤Cs2,L(Pj​),L(Qj​)≤hj​≤eC(s2+logN), Qj(θ,ν)≠0,Pj(θ,ν)=Qj(θ,ν)yj(v),(y0,y1,y2)=(ζL,℘L,℘L′).Q_j(\theta,\nu)\ne0,\qquad P_j(\theta,\nu)=Q_j(\theta,\nu)y_j(v),\qquad (y_0,y_1,y_2)=(\zeta_L,\wp_L,\wp'_L).Qj​(θ,ν)=0,Pj​(θ,ν)=Qj​(θ,ν)yj​(v),(y0​,y1​,y2​)=(ζL​,℘L​,℘L′​).

The constant and threshold precede all grid points. A presentation is the collection of these polynomials, bounds, and evaluation identities at one point. Numerators may vanish; evaluated denominators may not. This property concerns the three moving elliptic values only. The ordinary coordinate and the four fixed jet coordinates are supplied separately by the coordinate-completion theorem.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_GeneratorPolynomials

open scoped Polynomial
open WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.specialize_moving_elliptic_coordinates
    (L : PeriodPair) (ω u₁ u₂ θ ν : ℂ)
    (d : ℤ[X]) (hd : Polynomial.aeval θ d ≠ 0)
    (h_generators : ∀ j : Fin 9, ∃ p : ℤ[X][X],
      p.eval₂ (Polynomial.aeval θ).toRingHom ν = Polynomial.aeval θ d *
        ellipticArithmeticGenerators L ω u₁ u₂ j)
    (h_polynomials : EllipticGeneratorPolynomialData L ω u₁ u₂) :
    AuxiliaryMovingCoordinateData L ω u₁ u₂ θ ν := by sorry
Source
Supporting algebraic specialization of Senthil Kumar K (2026), Section 5 Lemma 7(a), equation (19), and the denominator-clearing argument in Lemma 7(b), equations (20)-(23). This theorem assumes the generator-polynomial estimates and proves their transfer to integer bivariate presentations. The factor 9 from coordinatewise clearing, the bound T <= 19*s^2 on the enlarged grid, and the N^4 period-index envelope are explicit formalization choices. 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