Geometric zero estimate for a sigma-regularized polynomial
ProvedWeierstrassEllipticZeta.polynomial_regularized_grid_zero_estimateLet be a complex period pair with lattice and canonical Weierstrass functions . Fix satisfying RegularAuxiliaryGridData: the integer map is injective, belongs to exactly when , and two integer grid points are congruent modulo exactly when their first two coordinates agree. Every is regular. The data also includes the standard finite-grid cardinalities, shifted-grid radius bounds, and period-translation formulas.
Let be normalized sigma differential data: is entire, , , and off . Write
with integer indices. There is a real such that, for all positive integers with , , and all integers satisfying
the following implication holds. Let have and for every exponent vector in its support, and let be an entire function, not identically zero, with
Then for some and some integer .
The constant is uniform in all five integer parameters, , and . Nonvanishing of the resulting function, rather than merely , is an explicit hypothesis. The fixed exponent comes from homogenizing to elliptic degree using the source's sigma-cubed projective coordinates; lower-degree polynomials can be padded. This is the remaining geometric zero estimate, and its proof is still required.
import Definitions.Def_WeierstrassEllipticZeta_AuxiliaryGrids import Definitions.Def_WeierstrassEllipticZeta_SigmaDifferential import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Analysis.Calculus.IteratedDeriv.Defs open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.polynomial_regularized_grid_zero_estimate
(L : PeriodPair) (ω u₁ u₂ : ℂ)
(h_grid : RegularAuxiliaryGridData L ω u₁ u₂)
(D : EllipticSigmaDifferentialData L) :
∃ C : ℝ, 0 < C ∧ ∀ m l s q T : ℕ,
1 ≤ m → 1 ≤ l → 1 ≤ s → 1 ≤ q → s ≤ q → l ≤ m → 3 ≤ T →
3 * C * max ((m : ℝ) * (15 * l) ^ 2) ((q : ℝ) * (15 * l) ^ 2) <
(T : ℝ) * (s : ℝ) ^ 2 * q →
∀ (P : MvPolynomial (Fin 4) ℂ) (G : ℂ → ℂ),
(∀ d ∈ P.support, d 0 ≤ m ∧ d 1 + d 2 + d 3 ≤ 5 * l) →
AnalyticOnNhd ℂ G Set.univ →
(∀ z : ℂ, z ∉ L.lattice →
G z = D.sigma z ^ (15 * l) *
MvPolynomial.eval ![z, L.weierstrassP z, L.derivWeierstrassP z,
weierstrassZeta L z] P) →
G ≠ 0 → ∃ v ∈ auxiliaryGrid u₁ u₂ ω ![3 * s, 3 * s, 3 * q],
∃ n : ℕ, n ≤ T ∧ iteratedDeriv n G v ≠ 0 := by sorry