Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Arithmetic presentations of cleared elliptic derivatives

Definition
WeierstrassEllipticZeta_ArithmeticJets

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

elliptic-functionspolynomialstranscendence

For a period pair LLL, use the prescribed coordinate tuple

Jv(z)=(z+v,ζ(v),℘(v),℘′(v),ζ(z),℘(z),℘′(z),℘′′(z))J_v(z)=(z+v,\zeta(v),\wp(v),\wp'(v),\zeta(z),\wp(z),\wp'(z),\wp''(z))Jv​(z)=(z+v,ζ(v),℘(v),℘′(v),ζ(z),℘(z),℘′(z),℘′′(z))

and the canonical cleared monomial

Gv(z)=(z+v)l0[2(℘(v)−℘(z))]3M℘(z+v)l2ζ(z+v)l3.G_v(z)=(z+v)^{l_0}[2(\wp(v)-\wp(z))]^{3M} \wp(z+v)^{l_2}\zeta(z+v)^{l_3}.Gv​(z)=(z+v)l0​[2(℘(v)−℘(z))]3M℘(z+v)l2​ζ(z+v)l3​.

For nonnegative integers l0≤L0l_0\le L_0l0​≤L0​, l2,l3≤Ml_2,l_3\le Ml2​,l3​≤M, and nnn, set

K=L0+5M+n,k=(L0,5M,5M,5M,K,K,K,K).K=L_0+5M+n,\qquad k=(L_0,5M,5M,5M,K,K,K,K).K=L0​+5M+n,k=(L0​,5M,5M,5M,K,K,K,K).

Arithmetic jet data mean the following universal presentation property. Given eight pairs of integer bivariate polynomials Si,QiS_i,Q_iSi​,Qi​, each pair having total degree at most did_idi​ and coefficient length at most HiH_iHi​, there exists an integer bivariate polynomial RRR with

deg⁡R≤∑i=07kidi,ℓ(R)≤n! 241(L0+M+n)∏i=07Hiki.\deg R\le\sum_{i=0}^7 k_i d_i, \qquad \ell(R)\le n!\,2^{41(L_0+M+n)}\prod_{i=0}^7 H_i^{k_i}.degR≤i=0∑7​ki​di​,ℓ(R)≤n!241(L0​+M+n)i=0∏7​Hiki​​.

For every evaluation tuple w∈C2w\in\mathbb C^2w∈C2 and all v,z,z+vv,z,z+vv,z,z+v outside the lattice, if

Si(w)=Qi(w)Jv(z)i(0≤i<8),S_i(w)=Q_i(w)J_v(z)_i\quad(0\le i<8),Si​(w)=Qi​(w)Jv​(z)i​(0≤i<8),

then

R(w)=(∏i=07Qi(w)ki)Gv(n)(z).R(w)=\left(\prod_{i=0}^7 Q_i(w)^{k_i}\right)G_v^{(n)}(z).R(w)=(i=0∏7​Qi​(w)ki​)Gv(n)​(z).

The polynomial RRR precedes the choices of w,v,zw,v,zw,v,z. The denominator product depends on M,L0,nM,L_0,nM,L0​,n and the QiQ_iQi​, and is shared by all allowed monomial exponents. The fixed elliptic coordinates have exponents 5M5M5M independent of L0,nL_0,nL0​,n. This is a multiplied polynomial identity; zero denominators are allowed, and no hypothesis on ℘(v)−℘(z)\wp(v)-\wp(z)℘(v)−℘(z) is imposed. Here coefficient length is the sum of absolute values of all integer coefficients.

Definition code
import Definitions.Def_WeierstrassEllipticZeta_DifferentialPolynomials

noncomputable section

namespace WeierstrassEllipticZeta

open MvPolynomial

/-- Integer polynomial presentations of cleared elliptic derivatives, with a
common denominator for all coordinate exponents below `L₀`. The eight coordinate
denominators may differ, preserving the separate fixed and moving estimates. -/
def ArithmeticJetData (L : PeriodPair) : Prop :=
  ∀ (M L₀ l₀ l₂ l₃ n : ℕ), l₀ ≤ L₀ → l₂ ≤ M → l₃ ≤ M →
    let k : Fin 8 → ℕ :=
      ![L₀, 5 * M, 5 * M, 5 * M,
        L₀ + 5 * M + n, L₀ + 5 * M + n, L₀ + 5 * M + n, L₀ + 5 * M + n]
    ∀ (s q : Fin 8 → MvPolynomial (Fin 2) ℤ) (d H : Fin 8 → ℕ),
      (∀ i, (s i).totalDegree ≤ d i) → (∀ i, (q i).totalDegree ≤ d i) →
      (∀ i, (∑ m ∈ (s i).support, ((s i).coeff m).natAbs) ≤ H i) →
      (∀ i, (∑ m ∈ (q i).support, ((q i).coeff m).natAbs) ≤ H i) →
      ∃ r : MvPolynomial (Fin 2) ℤ,
        r.totalDegree ≤ ∑ i, k i * d i ∧
        (∑ m ∈ r.support, (r.coeff m).natAbs) ≤
          n.factorial * 2 ^ (41 * (L₀ + M + n)) * ∏ i, H i ^ k i ∧
        ∀ (w : Fin 2 → ℂ) (v z : ℂ),
          v ∉ L.lattice → z ∉ L.lattice → z + v ∉ L.lattice →
          (∀ i, eval₂ (Int.castRingHom ℂ) w (s i) =
            eval₂ (Int.castRingHom ℂ) w (q i) * ellipticJetCoordinates L v z i) →
          eval₂ (Int.castRingHom ℂ) w r =
            (∏ i, eval₂ (Int.castRingHom ℂ) w (q i) ^ k i) *
              iteratedDeriv n (clearedAdditionMonomial L v M l₀ l₂ l₃) z

end WeierstrassEllipticZeta
Source
Formal interface for the polynomial substitution and denominator clearing in Senthil Kumar K (2026), Section 5 Lemma 7(b), equations (20)-(27). Individual coordinate bounds are used in place of the source block bounds, with harmless fixed factors; this definition alone proves no estimates or grid representations. 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