Projective zero estimate from finite-set and lattice-quotient sizes
ProvedWeierstrassEllipticZeta.finite_set_projective_zero_estimateLet be a complex period pair with lattice and canonical functions . Let be normalized entire sigma differential data, so , , and off . Suppose are entire, have no common zero, and satisfy
Write for the additive quotient map. There is a real such that the following holds for all positive integers , integers , and finite sets containing zero. Assume
For a polynomial bihomogeneous of bidegree , define the entire function
If is not identically zero, there are and an integer for which .
The constant is uniform in . The finite set need not be a grid. The polynomial may depend on the fifth elliptic coordinate; every supported monomial must have total degree exactly and total degree exactly .
This is a sufficient finite-set form of the geometric zero estimate. The two size conditions account for proper subgroups whose first additive projection is zero and those whose projection is nonzero, respectively. Deducing it requires the algebraic-group multiplicity theorem, subgroup classification and the identification of local vanishing order with the entire lift. Those geometric assertions remain to be proved.
import Definitions.Def_WeierstrassEllipticZeta_SigmaDifferential import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Analysis.Calculus.IteratedDeriv.Defs import Mathlib.Algebra.Group.Pointwise.Finset.Basic import Mathlib.LinearAlgebra.Quotient.Basic import Mathlib.Data.Set.Card open WeierstrassEllipticZeta open scoped Pointwise
theorem WeierstrassEllipticZeta.finite_set_projective_zero_estimate
(L : PeriodPair) (D : EllipticSigmaDifferentialData L)
(S : Fin 5 → ℂ → ℂ)
(hS : ∀ j, AnalyticOnNhd ℂ (S j) Set.univ)
(hS_value : ∀ z : ℂ, z ∉ L.lattice → ∀ j : Fin 5,
S j z = D.sigma z ^ 3 * ![1, L.weierstrassP z, L.derivWeierstrassP z,
weierstrassZeta L z,
L.derivWeierstrassP z * weierstrassZeta L z + 2 * L.weierstrassP z ^ 2] j)
(hS_ne : ∀ z : ℂ, ∃ j : Fin 5, S j z ≠ 0) :
∃ C : ℝ, 0 < C ∧ ∀ m n T : ℕ,
1 ≤ m → 1 ≤ n → 3 ≤ T → ∀ X : Finset ℂ,
0 ∈ X →
3 * C * (m : ℝ) * (n : ℝ) ^ 2 < (T : ℝ) * X.card →
3 * C * (n : ℝ) ^ 2 <
(T : ℝ) * (L.lattice.mkQ '' (X : Set ℂ)).ncard →
∀ Q : MvPolynomial (Fin 7) ℂ,
(∀ d ∈ Q.support, d 0 + d 1 = m ∧
d 2 + d 3 + d 4 + d 5 + d 6 = n) →
(fun z : ℂ => MvPolynomial.eval
![1, z, S 0 z, S 1 z, S 2 z, S 3 z, S 4 z] Q) ≠ 0 →
∃ v ∈ X + X + X, ∃ j : ℕ, j ≤ T ∧ iteratedDeriv j
(fun z : ℂ => MvPolynomial.eval
![1, z, S 0 z, S 1 z, S 2 z, S 3 z, S 4 z] Q) v ≠ 0 := by sorry