Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Clearing elliptic addition denominators preserves finite vanishing jets

Proved
WeierstrassEllipticZeta.cleared_addition_jet_vanishing_iff

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

complex-analysiselliptic-functionstranscendence

Let LLL be a complex period pair with lattice Ω\OmegaΩ. Assume the canonical zeta derivative identity and the multiplied zeta addition identity at regular arguments. Let z,v,z+v,z−vz,v,z+v,z-vz,v,z+v,z−v all lie outside Ω\OmegaΩ.

For nonnegative integers M,TM,TM,T, a finite index set III, arbitrary nonnegative exponents l0,i,l2,i,l3,il_{0,i},l_{2,i},l_{3,i}l0,i​,l2,i​,l3,i​, and coefficients ci∈Cc_i\in\mathbb Cci​∈C, put

F(w)=∑i∈Iciwl0,i℘(w)l2,iζ(w)l3,i,F(w)=\sum_{i\in I}c_iw^{l_{0,i}}\wp(w)^{l_{2,i}}\zeta(w)^{l_{3,i}},F(w)=i∈I∑​ci​wl0,i​℘(w)l2,i​ζ(w)l3,i​, Gi(w)=(w+v)l0,i[2(℘(v)−℘(w))]3M℘(w+v)l2,iζ(w+v)l3,i.G_i(w)=(w+v)^{l_{0,i}}[2(\wp(v)-\wp(w))]^{3M} \wp(w+v)^{l_{2,i}}\zeta(w+v)^{l_{3,i}}.Gi​(w)=(w+v)l0,i​[2(℘(v)−℘(w))]3M℘(w+v)l2,i​ζ(w+v)l3,i​.

Then the clearing factor is nonzero:

[2(℘(v)−℘(z))]3M≠0,[2(\wp(v)-\wp(z))]^{3M}\ne0,[2(℘(v)−℘(z))]3M=0,

and finite vanishing jets are equivalent:

(∀ 0≤n<T, ∑i∈IciGi(n)(z)=0)⟺(∀ 0≤n<T, F(n)(z+v)=0).\left(\forall\,0\le n<T,\ \sum_{i\in I}c_iG_i^{(n)}(z)=0\right) \quad\Longleftrightarrow\quad \left(\forall\,0\le n<T,\ F^{(n)}(z+v)=0\right).(∀0≤n<T, i∈I∑​ci​Gi(n)​(z)=0)⟺(∀0≤n<T, F(n)(z+v)=0).

No a priori inequality between the elliptic values is assumed; it follows from the four regularity hypotheses and the addition identity. The statement includes M=0M=0M=0, T=0T=0T=0, empty index sets, and zero coefficient vectors. Exponents need not be bounded by MMM for this analytic cancellation result. This is the local passage from cleared linear equations to ordinary derivative vanishing in the auxiliary-function construction.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_DifferentialPolynomials
import Mathlib.Analysis.Analytic.Order
import Mathlib.Analysis.Complex.RemovableSingularity
import Mathlib.Analysis.Normed.Module.Connected
import Mathlib.Tactic.LinearCombination

open WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.cleared_addition_jet_vanishing_iff
    (L : PeriodPair)
    (hzeta : ∀ z : ℂ, z ∉ L.lattice →
      HasDerivAt (weierstrassZeta L) (-L.weierstrassP z) z)
    (hadd : ∀ 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)
    (z v : ℂ) (hz : z ∉ L.lattice) (hv : v ∉ L.lattice)
    (hp : z + v ∉ L.lattice) (hn : z - v ∉ L.lattice)
    (M T : ℕ) {ι : Type} [Fintype ι]
    (l₀ l₂ l₃ : ι → ℕ) (c : ι → ℂ) :
    (2 * (L.weierstrassP v - L.weierstrassP z)) ^ (3 * M) ≠ 0 ∧
    ((∀ n < T, ∑ i, c i *
        iteratedDeriv n (clearedAdditionMonomial L v M (l₀ i) (l₂ i) (l₃ i))
          z = 0) ↔
      ∀ n < T, iteratedDeriv n (fun w =>
        ∑ i, c i * w ^ l₀ i * L.weierstrassP w ^ l₂ i *
          weierstrassZeta L w ^ l₃ i) (z + v) = 0) := by sorry
Source
Senthil Kumar K (2026), Section 5, proof of Lemma 8, immediately after the definition of A(v,t): the order comparison between F and F_1 and the implication to equation (29). The formal statement makes the regularity hypotheses explicit, generalizes to an arbitrary finite monomial family, and proves the stronger equivalence of finite jets. 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