Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Entire extension and explicit growth of translated, cleared elliptic auxiliary sums

Proved
WeierstrassEllipticZeta.cleared_addition_entire_growth

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

complex-analysiselliptic-functionstranscendence

Let LLL be a complex period pair, with lattice Ω\OmegaΩ and canonical functions ζ,℘,℘′\zeta,\wp,\wp'ζ,℘,℘′. Assume their multiplied addition identities at regular arguments. Supply entire functions σ,S0,S1,S2\sigma,S_0,S_1,S_2σ,S0​,S1​,S2​ satisfying

S0=σζ,S1=σ2℘,S2=σ3℘′outside Ω.S_0=\sigma\zeta,\qquad S_1=\sigma^2\wp,\qquad S_2=\sigma^3\wp' \qquad\text{outside }\Omega.S0​=σζ,S1​=σ2℘,S2​=σ3℘′outside Ω.

Let III be any finite index set, let v∉Ωv\notin\Omegav∈/Ω, and choose complex coefficients cic_ici​ and nonnegative integers ℓ0i,ℓ2i,ℓ3i,D,M\ell_{0i},\ell_{2i},\ell_{3i},D,Mℓ0i​,ℓ2i​,ℓ3i​,D,M with

ℓ0i≤D,ℓ2i,ℓ3i≤M.\ell_{0i}\le D,\qquad\ell_{2i},\ell_{3i}\le M.ℓ0i​≤D,ℓ2i​,ℓ3i​≤M.

Define the translated, cleared auxiliary sum

f(z)=∑i∈Ici(z+v)ℓ0i[2(℘(v)−℘(z))]3M℘(z+v)ℓ2iζ(z+v)ℓ3i.f(z)=\sum_{i\in I}c_i(z+v)^{\ell_{0i}} [2(\wp(v)-\wp(z))]^{3M}\wp(z+v)^{\ell_{2i}}\zeta(z+v)^{\ell_{3i}}.f(z)=i∈I∑​ci​(z+v)ℓ0i​[2(℘(v)−℘(z))]3M℘(z+v)ℓ2i​ζ(z+v)ℓ3i​.

There exists a single entire function GGG, chosen before any radius or bounds, with

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

Put

Vv=1+∣ζ(v)∣+∣℘(v)∣+∣℘′(v)∣,Kv=36Vv3.V_v=1+|\zeta(v)|+|\wp(v)|+|\wp'(v)|,\qquad K_v=36V_v^3.Vv​=1+∣ζ(v)∣+∣℘(v)∣+∣℘′(v)∣,Kv​=36Vv3​.

For every R∈RR\in\mathbb RR∈R and B≥1B\ge1B≥1, if all four basic entire functions are bounded in absolute value by BBB on ∣z∣≤R|z|\le R∣z∣≤R, then

∣G(z)∣≤CR:=(∑i∣ci∣)max⁡(1,R+∣v∣)DKv15MB90M(∣z∣≤R).|G(z)|\le C_R:=\left(\sum_i|c_i|\right) \max(1,R+|v|)^D K_v^{15M}B^{90M}\qquad(|z|\le R).∣G(z)∣≤CR​:=(i∑​∣ci​∣)max(1,R+∣v∣)DKv15M​B90M(∣z∣≤R).

The finite set may be empty, coefficients may vanish, and D=M=0D=M=0D=M=0 is allowed. Neither σ\sigmaσ nor the addition factor is assumed nonzero. The identity is restricted to regular arguments; the entire extension supplies its own values at poles. This is a conditional version of the construction in Lemma 6(ii), with a coarse explicit growth constant. It does not construct the basic sigma factors or assert the source's sharper displayed numerical bound.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_EntireRegularization
import Definitions.Def_WeierstrassEllipticZeta_DifferentialPolynomials
import Mathlib.Tactic.FinCases

open Finset Set WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.cleared_addition_entire_growth
    (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 * (1 + ‖weierstrassZeta L v‖ + ‖L.weierstrassP v‖ +
              ‖L.derivWeierstrassP v‖) ^ 3) ^ (15 * M) * B ^ (90 * M) := by sorry
Source
Supporting conditional formulation of Senthil Kumar K (2026), Section 4, Lemma 6(ii), its proof and equation (16), using the multiplied addition formulas (5)-(7). The regularizer exponent 15M is unchanged; the disk bound uses the explicit coarse constant K_v^(15M) B^(90M), not the sharper source constant. Basic entire sigma factors are hypotheses. 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