Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Polynomial derivative formulas and coefficient bounds at period translates

Proved
WeierstrassEllipticZeta.period_translate_polynomial_jets

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

elliptic-functionspolynomialstranscendence

Let LLL be a complex period pair with lattice Ω\OmegaΩ and canonical functions ζ,℘,℘′\zeta,\wp,\wp'ζ,℘,℘′. Let ω∈C\omega\in\mathbb Cω∈C and write η=ηL(ω)\eta=\eta_L(\omega)η=ηL​(ω) for its canonical quasi-period. Assume

ζ′(z)=−℘(z)(z∉Ω),\zeta'(z)=-\wp(z)\qquad(z\notin\Omega),ζ′(z)=−℘(z)(z∈/Ω), ℘(z+aω)=℘(z),ζ(z+aω)=ζ(z)+aη(z∉Ω, a∈Z).\wp(z+a\omega)=\wp(z),\qquad \zeta(z+a\omega)=\zeta(z)+a\eta \qquad(z\notin\Omega,\ a\in\mathbb Z).℘(z+aω)=℘(z),ζ(z+aω)=ζ(z)+aη(z∈/Ω, a∈Z).

In the polynomial ring Z[X0,…,X6]\mathbb Z[X_0,\ldots,X_6]Z[X0​,…,X6​], define the derivation D\mathcal DD by

(DX0,…,DX6)=(1,0,0,−X4,X5,X6,12X4X5).(\mathcal D X_0,\ldots,\mathcal D X_6)=(1,0,0,-X_4,X_5,X_6,12X_4X_5).(DX0​,…,DX6​)=(1,0,0,−X4​,X5​,X6​,12X4​X5​).

For any integer aaa and nonnegative integers ℓ0,ℓ2,ℓ3,n\ell_0,\ell_2,\ell_3,nℓ0​,ℓ2​,ℓ3​,n, put

Pa=(X0+aX1)ℓ0X4ℓ2(X3+aX2)ℓ3,K=ℓ0+ℓ2+ℓ3+n.P_a=(X_0+aX_1)^{\ell_0}X_4^{\ell_2}(X_3+aX_2)^{\ell_3}, \qquad K=\ell_0+\ell_2+\ell_3+n.Pa​=(X0​+aX1​)ℓ0​X4ℓ2​​(X3​+aX2​)ℓ3​,K=ℓ0​+ℓ2​+ℓ3​+n.

Let L(P)\mathscr L(P)L(P) denote the sum of the absolute values of all integer coefficients. Then

deg⁡(DnPa)≤K,L(DnPa)≤n! 24K(1+∣a∣)ℓ0+ℓ3.\deg(\mathcal D^nP_a)\le K,\qquad \mathscr L(\mathcal D^nP_a)\le n!\,24^K(1+|a|)^{\ell_0+\ell_3}.deg(DnPa​)≤K,L(DnPa​)≤n!24K(1+∣a∣)ℓ0​+ℓ3​.

At every z∉Ωz\notin\Omegaz∈/Ω, evaluation at the seven basic values gives the actual translated derivative:

dndwn(wℓ0℘(w)ℓ2ζ(w)ℓ3)∣w=z+aω=(DnPa)(z,ω,η,ζ(z),℘(z),℘′(z),℘′′(z)).\left.\frac{d^n}{dw^n}\big(w^{\ell_0}\wp(w)^{\ell_2}\zeta(w)^{\ell_3}\big) \right|_{w=z+a\omega} =(\mathcal D^nP_a)(z,\omega,\eta,\zeta(z),\wp(z),\wp'(z),\wp''(z)).dwndn​(wℓ0​℘(w)ℓ2​ζ(w)ℓ3​)​w=z+aω​=(DnPa​)(z,ω,η,ζ(z),℘(z),℘′(z),℘′′(z)).

This gives a universal integer polynomial for every derivative at a period translate. It includes negative and zero aaa, all zero exponents, and derivative order zero. It is a supporting formulation of the calculation following equation (28), with an explicit coarse coefficient bound rather than the source's displayed numerical estimate.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_PeriodJets

open MvPolynomial WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.period_translate_polynomial_jets (L : PeriodPair) (ω : ℂ)
    (hzeta : ∀ z : ℂ, z ∉ L.lattice →
      HasDerivAt (weierstrassZeta L) (-L.weierstrassP z) z)
    (hperiod : ∀ (z : ℂ) (a : ℤ), z ∉ L.lattice →
      L.weierstrassP (z + a * ω) = L.weierstrassP z ∧
      weierstrassZeta L (z + a * ω) = weierstrassZeta L z + a * zetaQuasiPeriod L ω)
    (a : ℤ) (l₀ l₂ l₃ n : ℕ) :
    (periodJetDerivation^[n] (periodJetPolynomial a l₀ l₂ l₃)).totalDegree ≤
      l₀ + l₂ + l₃ + n ∧
    (∑ m ∈ (periodJetDerivation^[n] (periodJetPolynomial a l₀ l₂ l₃)).support,
      ((periodJetDerivation^[n] (periodJetPolynomial a l₀ l₂ l₃)).coeff m).natAbs) ≤
        n.factorial * 24 ^ (l₀ + l₂ + l₃ + n) * (1 + a.natAbs) ^ (l₀ + l₃) ∧
    ∀ z : ℂ, z ∉ L.lattice →
      iteratedDeriv n (fun w => w ^ l₀ * L.weierstrassP w ^ l₂ *
        weierstrassZeta L w ^ l₃) (z + a * ω) =
          eval₂ (Int.castRingHom ℂ) (periodJetCoordinates L ω z)
            (periodJetDerivation^[n] (periodJetPolynomial a l₀ l₂ l₃)) := by sorry
Source
Supporting formulation of Senthil Kumar K (2026), Section 5, the remark following Lemma 7, equation (28) and the subsequent derivative expansion and coefficient estimate, using the differential identities in Section 4, equations (8)-(9). The polynomial derivation and the explicit bound n! 24^K (1+|a|)^(l0+l3) formalize that calculation; the numerical bound is not claimed to be verbatim. 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