Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Entire cleared translates and their auxiliary-grid derivative bounds

Definition
WeierstrassEllipticZeta_ClearedEntire

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'ζ,℘,℘′. 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.

For fixed L,ω,u1,u2L,\omega,u_1,u_2L,ω,u1​,u2​, cleared-addition entire data assert the preceding entire-extension and disk-bound property for every choice of the four basic factors, regular shift, finite coefficients, and exponents. The data also assert the following interpolation consequences for the same entire function GGG.

Let A=(A1,A2,A3)A=(A_1,A_2,A_3)A=(A1​,A2​,A3​) and TTT be nonnegative integers. Suppose 0<r<R0<r<R0<r<R, B≥1B\ge1B≥1, the four factors are bounded by BBB on the closed radius-RRR disk, and

A1∣u1∣+A2∣u2∣+A3∣ω∣+∣u1∣/2≤r.A_1|u_1|+A_2|u_2|+A_3|\omega|+|u_1|/2\le r.A1​∣u1​∣+A2​∣u2​∣+A3​∣ω∣+∣u1​∣/2≤r.

Write

ΓA={a1u1+a2u2+a3ω+u1/2:0≤ai<Ai}.\Gamma_A=\{a_1u_1+a_2u_2+a_3\omega+u_1/2:0\le a_i<A_i\}.ΓA​={a1​u1​+a2​u2​+a3​ω+u1​/2:0≤ai​<Ai​}.

Assume x+v∉Ωx+v\notin\Omegax+v∈/Ω for every x∈ΓAx\in\Gamma_Ax∈ΓA​, and

f(t)(x)=0(x∈ΓA, 0≤t<T).f^{(t)}(x)=0\qquad(x\in\Gamma_A,\ 0\le t<T).f(t)(x)=0(x∈ΓA​, 0≤t<T).

Then

∣G(z)∣≤CR(2r/R)TA1A2A3(∣z∣≤r),|G(z)|\le C_R(2r/R)^{TA_1A_2A_3}\qquad(|z|\le r),∣G(z)∣≤CR​(2r/R)TA1​A2​A3​(∣z∣≤r), ∣G(n)(z)∣≤n!ρnCR(2r/R)TA1A2A3(ρ>0, ∣z∣+ρ≤r, n≥0).|G^{(n)}(z)|\le \frac{n!}{\rho^n}C_R(2r/R)^{TA_1A_2A_3} \qquad(\rho>0,\ |z|+\rho\le r,\ n\ge0).∣G(n)(z)∣≤ρnn!​CR​(2r/R)TA1​A2​A3​(ρ>0, ∣z∣+ρ≤r, n≥0).

The entire function precedes all choices of grids, radii and bounds. The data do not provide the four basic factors, establish their nonvanishing or growth, or prove that a test value is nonzero.

Definition code
import Definitions.Def_WeierstrassEllipticZeta_EntireRegularization
import Definitions.Def_WeierstrassEllipticZeta_DifferentialPolynomials

noncomputable section

open Filter Metric Set
open scoped Topology

namespace WeierstrassEllipticZeta

/-- Translated auxiliary polynomial multiplied by the common addition factor. -/
def clearedAuxiliarySum (L : PeriodPair) {ι : Type} [Fintype ι] (v : ℂ)
    (c : ι → ℂ) (l₀ l₂ l₃ : ι → ℕ) (M : ℕ) (z : ℂ) : ℂ :=
  ∑ i, c i * clearedAdditionMonomial L v M (l₀ i) (l₂ i) (l₃ i) z

/-- A coarse explicit bound, retaining the quadratic exponential growth scale
when the basic entire factors have bounds exponential in the squared radius. -/
def clearedAuxiliaryBound (L : PeriodPair) {ι : Type} [Fintype ι] (v : ℂ)
    (c : ι → ℂ) (D M : ℕ) (R B : ℝ) : ℝ :=
  (∑ 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)

/-- Entire extensions and grid estimates for the actual cleared translates.
Basic entire factors and their bounds are supplied as inputs. -/
def ClearedAdditionEntireData (L : PeriodPair) (ω u₁ u₂ : ℂ) : Prop :=
  ∀ (σ : ℂ → ℂ) (S : Fin 3 → ℂ → ℂ),
    AnalyticOnNhd ℂ σ univ → (∀ j, AnalyticOnNhd ℂ (S j) univ) →
    (∀ z : ℂ, z ∉ L.lattice → ∀ j : Fin 3,
      S j z = σ z ^ (j.val + 1) * ellipticPoleCoordinates L z j) →
    ∀ {ι : Type} [Fintype ι] (v : ℂ), v ∉ L.lattice →
    ∀ (c : ι → ℂ) (l₀ l₂ l₃ : ι → ℕ) (D M : ℕ),
      (∀ i, l₀ i ≤ D) → (∀ i, l₂ i ≤ M) → (∀ i, l₃ i ≤ M) →
    ∃ G : ℂ → ℂ, AnalyticOnNhd ℂ G univ ∧
      (∀ z : ℂ, z ∉ L.lattice → z + v ∉ L.lattice →
        G z = σ z ^ (15 * M) * clearedAuxiliarySum L v c l₀ l₂ l₃ M z) ∧
      (∀ R B : ℝ, 1 ≤ B →
        (∀ z : ℂ, ‖z‖ ≤ R → ‖σ z‖ ≤ B ∧ ∀ j, ‖S j z‖ ≤ B) →
        ∀ z : ℂ, ‖z‖ ≤ R → ‖G z‖ ≤ clearedAuxiliaryBound L v c D M R B) ∧
      ∀ (A : Fin 3 → ℕ) (T : ℕ) (r R B : ℝ),
        0 < r → r < R → 1 ≤ B →
        (A 0 : ℝ) * ‖u₁‖ + (A 1 : ℝ) * ‖u₂‖ +
          (A 2 : ℝ) * ‖ω‖ + ‖u₁‖ / 2 ≤ r →
        (∀ z : ℂ, ‖z‖ ≤ R → ‖σ z‖ ≤ B ∧ ∀ j, ‖S j z‖ ≤ B) →
        (∀ x ∈ shiftedAuxiliaryGrid u₁ u₂ ω A, x + v ∉ L.lattice) →
        (∀ x ∈ shiftedAuxiliaryGrid u₁ u₂ ω A, ∀ t < T,
          iteratedDeriv t (clearedAuxiliarySum L v c l₀ l₂ l₃ M) x = 0) →
        (∀ z : ℂ, ‖z‖ ≤ r → ‖G z‖ ≤ clearedAuxiliaryBound L v c D M R B *
          (2 * r / R) ^ (T * ∏ i, A i)) ∧
        ∀ (z : ℂ) (ρ : ℝ), 0 < ρ → ‖z‖ + ρ ≤ r → ∀ n : ℕ,
          ‖iteratedDeriv n G z‖ ≤ n.factorial *
            (clearedAuxiliaryBound L v c D M R B *
              (2 * r / R) ^ (T * ∏ i, A i)) / ρ ^ n

end WeierstrassEllipticZeta
Source
Supporting interface for Senthil Kumar K (2026), Section 4 Lemma 6(ii), equation (16), and equations (14)-(15) applied to the shifted Section 5 grids. The numerical bound is explicitly coarser, and the basic sigma factors remain inputs. 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