Sharper boundary count for elliptic polynomial roots
ProvedWeierstrassEllipticZeta.closed_parallelepiped_wp_root_count_sharp_boundaryLet L be a complex period pair and Z a finite subset of its closed basis parallelepiped. Let H be a nonzero complex polynomial. If wp(z) is a root of H for every z in Z outside the period lattice, then
card(Z) <= 4*deg(H)+4.
The previously proved coordinate bound was 8deg(H)+4. This refinement uses the fact that a nonzero period class has at most two representatives in the closed parallelepiped. Only the zero class can have four. Thus card(Z) <= 2card(Z modulo the lattice)+2. Combining this with the existing period-class bound 2*deg(H)+1 proves the result.
All boundary and lattice points are included. H can be constant and Z can be empty. No root condition is imposed at lattice points. This is a new boundary-count estimate derived for the mission, not a quoted numerical assertion from the paper.
For the A.1 whole-fibre anchor list, where deg(H)<=4n, the coordinate bound improves from 32n+4 to 16n+4. The period-class bound 8n+1 is unchanged. No optimality or effective coordinate enumeration is claimed.
import Definitions.Def_WeierstrassEllipticZeta_SigmaAddition import Mathlib.Algebra.Module.ZLattice.Basic import Mathlib.Algebra.Polynomial.Roots import Mathlib.Data.Set.Card open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.closed_parallelepiped_wp_root_count_sharp_boundary
(L : PeriodPair) (Z : Finset ℂ)
(hZ : ∀ z ∈ Z, z ∈ L.basis.parallelepiped)
(H : Polynomial ℂ) (hH : H ≠ 0)
(hroot : ∀ z ∈ Z, z ∉ L.lattice → L.weierstrassP z ∈ H.roots.toFinset) :
Z.card ≤ 4 * H.natDegree + 4 := by sorry