Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weighted growth bound for the cleared elliptic addition sum

Proved
WeierstrassEllipticZeta.cleared_addition_entire_growth_weighted

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

complex-analysiselliptic-functionstranscendence

Let LLL be a complex period pair with lattice Λ\LambdaΛ and canonical functions ℘,ζ\wp,\zeta℘,ζ. Assume their multiplied addition identities for regular z,v,z+vz,v,z+vz,v,z+v:

2(℘(v)−℘(z))ζ(z+v)=2(ζ(z)+ζ(v))(℘(v)−℘(z))+℘′(v)−℘′(z),2(\wp(v)-\wp(z))\zeta(z+v)=2(\zeta(z)+\zeta(v))(\wp(v)-\wp(z))+\wp'(v)-\wp'(z),2(℘(v)−℘(z))ζ(z+v)=2(ζ(z)+ζ(v))(℘(v)−℘(z))+℘′(v)−℘′(z), 4(℘(v)−℘(z))2℘(z+v)=−4(℘(z)+℘(v))(℘(v)−℘(z))2+(℘′(v)−℘′(z))2.4(\wp(v)-\wp(z))^2\wp(z+v)=-4(\wp(z)+\wp(v))(\wp(v)-\wp(z))^2+(\wp'(v)-\wp'(z))^2.4(℘(v)−℘(z))2℘(z+v)=−4(℘(z)+℘(v))(℘(v)−℘(z))2+(℘′(v)−℘′(z))2.

Supply entire functions σ,S0,S1,S2\sigma,S_0,S_1,S_2σ,S0​,S1​,S2​ such that S0=σζS_0=\sigma\zetaS0​=σζ, S1=σ2℘S_1=\sigma^2\wpS1​=σ2℘ and S2=σ3℘′S_2=\sigma^3\wp'S2​=σ3℘′ outside the lattice. Let III be any finite index set, v∉Λv\notin\Lambdav∈/Λ, ci∈Cc_i\in\mathbb Cci​∈C, and let di,bi,ei,D,Md_i,b_i,e_i,D,Mdi​,bi​,ei​,D,M be nonnegative integers with di≤Dd_i\le Ddi​≤D and bi,ei≤Mb_i,e_i\le Mbi​,ei​≤M. Put

f(z)=∑i∈Ici(z+v)di[2(℘(v)−℘(z))]3M℘(z+v)biζ(z+v)ei.f(z)=\sum_{i\in I}c_i(z+v)^{d_i}[2(\wp(v)-\wp(z))]^{3M}\wp(z+v)^{b_i}\zeta(z+v)^{e_i}.f(z)=i∈I∑​ci​(z+v)di​[2(℘(v)−℘(z))]3M℘(z+v)bi​ζ(z+v)ei​.

There is an entire function GGG, chosen before any radius or bounds, satisfying

G(z)=σ(z)15Mf(z)(z,z+v∉Λ).G(z)=\sigma(z)^{15M}f(z)\qquad(z,z+v\notin\Lambda).G(z)=σ(z)15Mf(z)(z,z+v∈/Λ).

Write V=1+∣ζ(v)∣+∣℘(v)∣+∣℘′(v)∣V=1+|\zeta(v)|+|\wp(v)|+|\wp'(v)|V=1+∣ζ(v)∣+∣℘(v)∣+∣℘′(v)∣. For every real radius RRR and B≥1B\ge1B≥1 bounding all four entire functions on ∣z∣≤R|z|\le R∣z∣≤R, the same GGG obeys

∣G(z)∣≤(∑i∈I∣ci∣)max⁡(1,R+∣v∣)D 363MV5MB15M(∣z∣≤R).|G(z)|\le\left(\sum_{i\in I}|c_i|\right)\max(1,R+|v|)^D\,36^{3M}V^{5M}B^{15M} \qquad(|z|\le R).∣G(z)∣≤(i∈I∑​∣ci​∣)max(1,R+∣v∣)D363MV5MB15M(∣z∣≤R).

The moving-coordinate exponent is 5M5M5M, obtained by retaining the separate degrees of the three cleared addition factors. The entire-factor exponent is 15M15M15M. Empty finite sets, zero coefficients and M=0M=0M=0 are included; neither sigma nor the addition factor is assumed nonzero. The identity only applies at regular arguments, while the entire extension defines its own values at poles. The numerical constant is an explicit choice for this formalization.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_ClearedEntire

open Set WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.cleared_addition_entire_growth_weighted
    (L : PeriodPair)
    (hZ : ∀ z v : ℂ, z ∉ L.lattice → v ∉ L.lattice → z + v ∉ L.lattice →
      2 * (L.weierstrassP v - L.weierstrassP z) * weierstrassZeta L (z + v) =
        2 * (weierstrassZeta L z + weierstrassZeta L v) *
          (L.weierstrassP v - L.weierstrassP z) +
        L.derivWeierstrassP v - L.derivWeierstrassP z)
    (hP : ∀ z v : ℂ, z ∉ L.lattice → v ∉ L.lattice → z + v ∉ L.lattice →
      4 * (L.weierstrassP v - L.weierstrassP z) ^ 2 * L.weierstrassP (z + v) =
        -4 * (L.weierstrassP z + L.weierstrassP v) *
          (L.weierstrassP v - L.weierstrassP z) ^ 2 +
        (L.derivWeierstrassP v - L.derivWeierstrassP z) ^ 2)
    (σ : ℂ → ℂ) (S : Fin 3 → ℂ → ℂ)
    (hσ : AnalyticOnNhd ℂ σ univ) (hS : ∀ j, AnalyticOnNhd ℂ (S j) univ)
    (hrel : ∀ z : ℂ, z ∉ L.lattice → ∀ j : Fin 3,
      S j z = σ z ^ (j.val + 1) * ellipticPoleCoordinates L z j)
    {ι : Type} [Fintype ι] (v : ℂ) (hv : v ∉ L.lattice)
    (c : ι → ℂ) (l₀ l₂ l₃ : ι → ℕ) (D M : ℕ)
    (h₀ : ∀ i, l₀ i ≤ D) (h₂ : ∀ i, l₂ i ≤ M) (h₃ : ∀ i, l₃ i ≤ M) :
    ∃ G : ℂ → ℂ, AnalyticOnNhd ℂ G univ ∧
      (∀ z : ℂ, z ∉ L.lattice → z + v ∉ L.lattice →
        G z = σ z ^ (15 * M) * ∑ i, c i *
          clearedAdditionMonomial L v M (l₀ i) (l₂ i) (l₃ i) z) ∧
      ∀ R B : ℝ, 1 ≤ B →
        (∀ z : ℂ, ‖z‖ ≤ R → ‖σ z‖ ≤ B ∧ ∀ j, ‖S j z‖ ≤ B) →
        ∀ z : ℂ, ‖z‖ ≤ R →
          ‖G z‖ ≤ (∑ i, ‖c i‖) * (max 1 (R + ‖v‖)) ^ D *
            (36 : ℝ) ^ (3 * M) *
            (1 + ‖weierstrassZeta L v‖ + ‖L.weierstrassP v‖ +
              ‖L.derivWeierstrassP v‖) ^ (5 * M) * B ^ (15 * M) := by sorry
Source
Senthil Kumar K (2026), Section 4, proof of Lemma 6(ii), equation (16) and its adjacent degree bound max(sum mu, sum rho)<=5L2, https://doi.org/10.1017/S001309152610145X. The proof keeps separate weights in the three multiplied addition factors and obtains the explicit bound 36^(3M)*V^(5M)*B^(15M). The numerical constant is a formalization choice, not a quoted source constant.

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