Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lattice-class bounds from polynomial root multiplicities

Proved
WeierstrassEllipticZeta.period_image_multiplicity_le_of_wp_polynomial

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

elliptic-functionspolynomialstranscendence-theory

Let Λ\LambdaΛ be a complex period lattice, with canonical Weierstrass functions ℘\wp℘ and ζ\zetaζ. Suppose σ\sigmaσ satisfies the normalized sigma identities: σ(0)=0\sigma(0)=0σ(0)=0, σ′(0)=1\sigma'(0)=1σ′(0)=1, σ\sigmaσ is nonzero off Λ\LambdaΛ, σ′=ζσ\sigma'=\zeta\sigmaσ′=ζσ off Λ\LambdaΛ, and

σ(z+v)σ(z−v)=(℘(v)−℘(z))σ(z)2σ(v)2(z,v∉Λ).\sigma(z+v)\sigma(z-v)=(\wp(v)-\wp(z))\sigma(z)^2\sigma(v)^2 \qquad(z,v\notin\Lambda).σ(z+v)σ(z−v)=(℘(v)−℘(z))σ(z)2σ(v)2(z,v∈/Λ).

Let Y⊂CY\subset\mathbb CY⊂C be finite, let w≥0w\ge0w≥0 be an integer, and let p∈C[T]p\in\mathbb C[T]p∈C[T] be nonzero. If every z∈Y∖Λz\in Y\setminus\Lambdaz∈Y∖Λ satisfies

(T−℘(z))w∣p(T),(T-\wp(z))^w\mid p(T),(T−℘(z))w∣p(T),

then the number of classes represented by YYY in C/Λ\mathbb C/\LambdaC/Λ obeys

w ∣Y/Λ∣≤2deg⁡p+w.w\,|Y/\Lambda|\le 2\deg p+w.w∣Y/Λ∣≤2degp+w.

This converts a univariate polynomial with prescribed root multiplicities into a bound on lattice classes. It allows empty YYY, w=0w=0w=0, lattice points in YYY, and coincident or ramified ℘\wp℘-values. The additive www accounts for the possible lattice class, where ℘\wp℘ has its pole. No root condition is imposed there.

Formalization Note. The sigma hypotheses are the existing EllipticSigmaData record. The degree is the natural degree of the nonzero polynomial. Divisibility expresses multiplicity of a root of ppp in its polynomial variable, not analytic derivative vanishing of p(℘(z))p(\wp(z))p(℘(z)).

Preamble
import Definitions.Def_WeierstrassEllipticZeta_SigmaAddition
import Mathlib.Algebra.Polynomial.Roots
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.RingTheory.Coprime.Lemmas
import Mathlib.Data.Set.Card
import Mathlib.Tactic

noncomputable section
open WeierstrassEllipticZeta
open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.period_image_multiplicity_le_of_wp_polynomial
    (L : PeriodPair) (D : EllipticSigmaData L) (Y : Finset ℂ)
    (w : ℕ) (p : Polynomial ℂ) (hp : p ≠ 0)
    (hdiv : ∀ z ∈ Y, z ∉ L.lattice →
      (Polynomial.X - Polynomial.C (L.weierstrassP z)) ^ w ∣ p) :
    w * (L.lattice.mkQ '' (Y : Set ℂ)).ncard ≤ 2 * p.natDegree + w := by sorry
Source
Derived reduction for https://prove2.me/theorems/1cf89501-706f-4434-bf47-ac8f0a87de52. Mission context: Senthil Kumar K (2026), Algebraic independence of values of Weierstrass elliptic and zeta functions, Appendix A.2, Theorem A.3 and the lattice-class counts used for Proposition A.1, https://doi.org/10.1017/S001309152610145X. The counting lemma is an independent deduction from the standard sigma addition identity and polynomial root multiplicities, not a quotation of the paper zero estimate. Primary Lean sources: Mathlib Algebra/Polynomial/Roots.lean, RingTheory/Coprime/Lemmas.lean, Algebra/Order/BigOperators/Group/Finset.lean and LinearAlgebra/Quotient/Defs.lean, revision 0df444a360eaa60ab8c11dca51a86af692955474. The new remaining problem asks for the quantitative annihilator construction explicitly; the geometric estimate remains open.

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