Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 6: entire regularization and interpolation bounds

Proved
WeierstrassEllipticZeta.sigma_regularized_interpolation_bounds

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

complex-analysiselliptic-functionsinterpolationtranscendence

For every complex period lattice Λ\LambdaΛ there exists a normalized entire sigma function σ\sigmaσ and real constants R0>0R_0>0R0​>0, c13>1c_{13}>1c13​>1, and c14>1c_{14}>1c14​>1, chosen before all polynomial, radius, and derivative data, such that both estimates below hold. Normalization means σ(0)=0\sigma(0)=0σ(0)=0, σ′(0)=1\sigma'(0)=1σ′(0)=1, and σ′(z)=ζ(z)σ(z)\sigma'(z)=\zeta(z)\sigma(z)σ′(z)=ζ(z)σ(z) off the lattice. The same sigma function and threshold R0R_0R0​ serve both estimates.

For a complex period lattice Λ\LambdaΛ, let ℘,ζ,℘′\wp,\zeta,\wp'℘,ζ,℘′ denote its canonical Weierstrass functions. For positive integers d,ld,ld,l and a complex coefficient array p=(pijk)p=(p_{ijk})p=(pijk​), set

P(w)=∑i=0d∑j,k=0lpijkwi℘(w)jζ(w)k.P(w)=\sum_{i=0}^{d}\sum_{j,k=0}^{l}p_{ijk}w^i\wp(w)^j\zeta(w)^k.P(w)=i=0∑d​j,k=0∑l​pijk​wi℘(w)jζ(w)k.

The exponents are bounded separately by (d,l,l)(d,l,l)(d,l,l); they need not attain these bounds. For a complex number vvv put

M1(v,l)=max⁡a,b,c≥0, a+b+c≤5l(1+∣ζ(v)a℘(v)b℘′(v)c∣).M_1(v,l)=\max_{a,b,c\ge0,\ a+b+c\le5l}\left(1+|\zeta(v)^a\wp(v)^b\wp'(v)^c|\right).M1​(v,l)=a,b,c≥0, a+b+c≤5lmax​(1+∣ζ(v)a℘(v)b℘′(v)c∣).

The maximum is finite; its constant monomial contributes 222.

For every positive d,l,Md,l,Md,l,M, every array with ∣pijk∣≤M|p_{ijk}|\le M∣pijk​∣≤M, and every u∈Cu\in\mathbb Cu∈C, the expression

F(z)=σ(z+u)3lP(z+u)F(z)=\sigma(z+u)^{3l}P(z+u)F(z)=σ(z+u)3lP(z+u)

has an entire extension. Choose this extension before the radii and derivative data. If 2<r<R2<r<R2<r<R, R>R0R>R_0R>R0​, ∣u∣<R|u|<R∣u∣<R, ∣v∣<r−2|v|<r-2∣v∣<r−2, and FFF has at least N≥0N\ge0N≥0 zeros counted with multiplicity in ∣z∣<r|z|<r∣z∣<r, then for every integer t≥0t\ge0t≥0,

∣F(t)(v)∣≤t!(d+1)(l+1)2M(2R)dc13R2l(2rR)N.|F^{(t)}(v)|\le t!(d+1)(l+1)^2M(2R)^d c_{13}^{R^2l}\left(\frac{2r}{R}\right)^N.∣F(t)(v)∣≤t!(d+1)(l+1)2M(2R)dc13R2l​(R2r​)N.

For every positive d,l,Md,l,Md,l,M, every array with ∣pijk∣≤M|p_{ijk}|\le M∣pijk​∣≤M, and every v∉Λv\notin\Lambdav∈/Λ, the expression

G(z)=σ(z)15l[2(℘(v)−℘(z))]3lP(z+v)G(z)=\sigma(z)^{15l}[2(\wp(v)-\wp(z))]^{3l}P(z+v)G(z)=σ(z)15l[2(℘(v)−℘(z))]3lP(z+v)

has an entire extension. Choose this extension before the radii and derivative data. If 2<r<R2<r<R2<r<R, R>R0R>R_0R>R0​, ∣v∣<R|v|<R∣v∣<R, ∣u∣<r−2|u|<r-2∣u∣<r−2, and GGG has at least N≥0N\ge0N≥0 zeros counted with multiplicity in ∣z∣<r|z|<r∣z∣<r, then for every integer t≥0t\ge0t≥0,

∣G(t)(u)∣≤t!(d+1)(l+1)2(5l+1)6M(2R)dM1(v,l)c14R2l(2rR)N.|G^{(t)}(u)|\le t!(d+1)(l+1)^2(5l+1)^6M(2R)^dM_1(v,l)c_{14}^{R^2l}\left(\frac{2r}{R}\right)^N.∣G(t)(u)∣≤t!(d+1)(l+1)2(5l+1)6M(2R)dM1​(v,l)c14R2l​(R2r​)N.

These are both analytic estimates of Lemma 6. They provide the entire functions and derivative bounds used for the auxiliary-polynomial argument, with no grid, arithmetic-model, or geometric zero-estimate assumption.

Formalization note. A lower bound on the number of zeros is expressed by an arbitrary finite set s⊂{∣z∣<r}s\subset\{|z|<r\}s⊂{∣z∣<r} and arbitrary multiplicities m(a)≥0m(a)\ge0m(a)≥0 with N≤∑a∈sm(a)N\le\sum_{a\in s}m(a)N≤∑a∈s​m(a), together with vanishing of every derivative of order below m(a)m(a)m(a) at each a∈sa\in sa∈s. The estimate holds for every such witness. Empty sets, N=0N=0N=0, t=0t=0t=0, and the zero coefficient array are included. The product identities specify the extensions only where all meromorphic factors are regular: z+u∉Λz+u\notin\Lambdaz+u∈/Λ in the first case, and z,z+v∉Λz,z+v\notin\Lambdaz,z+v∈/Λ in the second. Zeros and derivative evaluation points may lie at excluded points of those product formulas, because they refer to the entire extensions. No condition 2r<R2r<R2r<R is imposed. The constants raised to R2lR^2lR2l use real powers; all other displayed exponents are integers.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_PolynomialInterpolation

open WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.sigma_regularized_interpolation_bounds
    (L : PeriodPair) :
    ∃ (D : EllipticSigmaDifferentialData L) (R₀ c₁₃ c₁₄ : ℝ),
      0 < R₀ ∧ 1 < c₁₃ ∧ 1 < c₁₄ ∧
      SigmaPolynomialInterpolation L D.sigma c₁₃ R₀ ∧
      ClearedSigmaPolynomialInterpolation L D.sigma c₁₄ R₀ := by sorry
Source
Senthil Kumar K (2026), Algebraic independence of values of Weierstrass elliptic and zeta functions, https://doi.org/10.1017/S001309152610145X, §4, Lemma 6(i)–(ii), equations (14)–(15) and the proof of Lemma 6.
Human review
  • Endorsed by Shuze Chen · Sep 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by tomasz · Sep 29, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me