Geometric zero estimate in bihomogeneous elliptic coordinates
ProvedWeierstrassEllipticZeta.bihomogeneous_regularized_grid_zero_estimateLet be a complex period pair with lattice and canonical functions . Fix satisfying RegularAuxiliaryGridData: the integer map is injective, is in exactly when , and two integer grid points are congruent modulo exactly when their first two coordinates agree. Every is regular. The data includes the standard finite-grid cardinalities, shifted-grid radius bounds and period-translation formulas.
Let be normalized sigma differential data, so is entire, , , and off . Set
where the indices are integers. There is a real such that for all positive integers with and , and all integers satisfying
the following holds. Let be bihomogeneous of degrees : every monomial with nonzero coefficient has total degree and total degree . Let be entire and not identically zero, with, for every ,
Then there exist and an integer such that .
The constant is uniform in all five integer parameters, and . The nonzero entire function is an explicit input; merely is not substituted for this hypothesis. The final projective coordinate is allowed to occur in . This is the remaining geometric zero estimate in the full coordinates of the source's algebraic group, and still requires proof.
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.bihomogeneous_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 →
∀ (Q : MvPolynomial (Fin 7) ℂ) (G : ℂ → ℂ),
(∀ d ∈ Q.support, d 0 + d 1 = m ∧
d 2 + d 3 + d 4 + d 5 + d 6 = 5 * l) →
AnalyticOnNhd ℂ G Set.univ →
(∀ z : ℂ, z ∉ L.lattice →
G z = MvPolynomial.eval ![1, z, D.sigma z ^ 3,
D.sigma z ^ 3 * L.weierstrassP z,
D.sigma z ^ 3 * L.derivWeierstrassP z,
D.sigma z ^ 3 * weierstrassZeta L z,
D.sigma z ^ 3 * (L.derivWeierstrassP z * weierstrassZeta L z +
2 * L.weierstrassP z ^ 2)] Q) →
G ≠ 0 → ∃ v ∈ auxiliaryGrid u₁ u₂ ω ![3 * s, 3 * s, 3 * q],
∃ n : ℕ, n ≤ T ∧ iteratedDeriv n G v ≠ 0 := by sorry