Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quantitative presentations of the three moving elliptic coordinates

Definition
WeierstrassEllipticZeta_MovingCoordinates

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,\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.

Definition code
import Definitions.Def_WeierstrassEllipticZeta_GridJetMatrices

noncomputable section

namespace WeierstrassEllipticZeta

/-- The three moving elliptic coordinates, with quantitative rational presentations. -/
structure MovingEllipticCoordinatePresentation (L : PeriodPair) (θ ν v : ℂ)
    (C N s : ℕ) where
  numerator : Fin 3 → MvPolynomial (Fin 2) ℤ
  denominator : Fin 3 → MvPolynomial (Fin 2) ℤ
  lengthBound : Fin 3 → ℕ
  numerator_degree : ∀ a, (numerator a).totalDegree ≤ C * s ^ 2
  denominator_degree : ∀ a, (denominator a).totalDegree ≤ C * s ^ 2
  numerator_length : ∀ a,
    (∑ b ∈ (numerator a).support, ((numerator a).coeff b).natAbs) ≤ lengthBound a
  denominator_length : ∀ a,
    (∑ b ∈ (denominator a).support, ((denominator a).coeff b).natAbs) ≤ lengthBound a
  length_le : ∀ a, (lengthBound a : ℝ) ≤ Real.exp (C * ((s : ℝ) ^ 2 + Real.log N))
  denominator_ne_zero : ∀ a,
    MvPolynomial.eval₂ (Int.castRingHom ℂ) ![θ, ν] (denominator a) ≠ 0
  evaluation : ∀ a,
    MvPolynomial.eval₂ (Int.castRingHom ℂ) ![θ, ν] (numerator a) =
      MvPolynomial.eval₂ (Int.castRingHom ℂ) ![θ, ν] (denominator a) *
        (![weierstrassZeta L v, L.weierstrassP v, L.derivWeierstrassP v] a)

/-- The arithmetic construction still needed after completing ordinary and fixed coordinates. -/
def AuxiliaryMovingCoordinateData (L : PeriodPair) (ω u₁ u₂ θ ν : ℂ) : Prop :=
  ∃ C : ℕ, ∀ᶠ N : ℕ in Filter.atTop,
    ∀ v ∈ auxiliaryGrid u₁ u₂ ω ![3 * auxiliaryS N, 3 * auxiliaryS N, 3 * auxiliaryS3 N],
      v ∉ L.lattice →
        Nonempty (MovingEllipticCoordinatePresentation L θ ν v C N (auxiliaryS N))

end WeierstrassEllipticZeta
Source
Coordinate-presentation interface for Senthil Kumar K (2026), Section 5 Lemma 7(a), equation (19), with the degree and height estimates there. A log N allowance in the length profile accommodates the period coordinate in zeta(v). Construction from division polynomials is not included in this definition. 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