Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded polynomials in the nine elliptic generators

Definition
WeierstrassEllipticZeta_GeneratorPolynomials

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

asymptoticselliptic-functionspolynomialstranscendence

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.

Definition code
import Definitions.Def_WeierstrassEllipticZeta_MovingCoordinates

noncomputable section

namespace WeierstrassEllipticZeta

/-- The nine fixed values in Senthil Kumar's equation (19). -/
def ellipticArithmeticGenerators (L : PeriodPair) (ω u₁ u₂ : ℂ) : Fin 9 → ℂ :=
  ![zetaQuasiPeriod L ω, L.g₂ / 4, L.g₃ / 4,
    L.weierstrassP u₁, L.derivWeierstrassP u₁, weierstrassZeta L u₁,
    L.weierstrassP u₂, L.derivWeierstrassP u₂, weierstrassZeta L u₂]

/-- A common denominator and three numerators in the nine fixed generators. -/
structure EllipticGeneratorPresentation (L : PeriodPair) (ω u₁ u₂ v : ℂ)
    (D H : ℕ) where
  numerator : Fin 3 → MvPolynomial (Fin 9) ℤ
  denominator : MvPolynomial (Fin 9) ℤ
  numerator_degree : ∀ j, (numerator j).totalDegree ≤ D
  denominator_degree : denominator.totalDegree ≤ D
  numerator_length : ∀ j,
    (∑ m ∈ (numerator j).support, ((numerator j).coeff m).natAbs) ≤ H
  denominator_length : (∑ m ∈ denominator.support, (denominator.coeff m).natAbs) ≤ H
  denominator_ne_zero : MvPolynomial.eval₂ (Int.castRingHom ℂ)
    (ellipticArithmeticGenerators L ω u₁ u₂) denominator ≠ 0
  evaluation : ∀ j,
    MvPolynomial.eval₂ (Int.castRingHom ℂ)
      (ellipticArithmeticGenerators L ω u₁ u₂) (numerator j) =
    MvPolynomial.eval₂ (Int.castRingHom ℂ)
      (ellipticArithmeticGenerators L ω u₁ u₂) denominator *
        (![weierstrassZeta L v, L.weierstrassP v, L.derivWeierstrassP v] j)

/-- Quadratic degree and exponential length bounds before arithmetic specialization.
The period index appears only as a linear factor in the coefficient-length bound. -/
def EllipticGeneratorPolynomialData (L : PeriodPair) (ω u₁ u₂ : ℂ) : Prop :=
  ∃ C H : ℕ, 0 < C ∧ 0 < H ∧ ∀ a : Fin 3 → ℕ,
    integerGridPoint u₁ u₂ ω (fun j => a j) ∉ L.lattice →
    Nonempty (EllipticGeneratorPresentation L ω u₁ u₂
      (integerGridPoint u₁ u₂ ω (fun j => a j))
      (C * (a 0 ^ 2 + a 1 ^ 2 + 1))
      ((1 + a 2) * H ^ (a 0 ^ 2 + a 1 ^ 2 + 1)))

end WeierstrassEllipticZeta
Source
Interface for the common-denominator polynomial construction in Senthil Kumar K (2026), Section 5 Lemma 7(a), equation (19). The natural-index formulation makes quadratic nonperiodic growth and linear dependence on the period index explicit. The definitions contain no proof of the division-polynomial estimates. 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