Lattice-class bounds from polynomial root multiplicities
ProvedWeierstrassEllipticZeta.period_image_multiplicity_le_of_wp_polynomialLet be a complex period lattice, with canonical Weierstrass functions and . Suppose satisfies the normalized sigma identities: , , is nonzero off , off , and
Let be finite, let be an integer, and let be nonzero. If every satisfies
then the number of classes represented by in obeys
This converts a univariate polynomial with prescribed root multiplicities into a bound on lattice classes. It allows empty , , lattice points in , and coincident or ramified -values. The additive accounts for the possible lattice class, where 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 in its polynomial variable, not analytic derivative vanishing of .
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
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