Zero estimate for the entire projective elliptic curve
ProvedWeierstrassEllipticZeta.projective_regularized_grid_zero_estimateLet be a complex period pair with lattice and functions . Fix satisfying RegularAuxiliaryGridData: the integer map is injective, lies 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 entire sigma differential data for . Suppose are entire functions having no common zero and satisfying, off ,
For nonnegative integers write
where the indices are integers. There is a real with the following property. For all positive integers with and , and every integer satisfying
let be bihomogeneous of degrees . Thus every monomial with nonzero coefficient has total degree and total degree . Set
If is not identically zero, there are and an integer for which .
The constant is uniform in all five integer parameters and in . The function is entire because its coordinates are entire; no separate extension function is an input. The hypothesis is nonvanishing of the evaluated function, not merely . The last coordinate may occur in . This is the remaining geometric zero estimate for the globally defined projective curve, 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.projective_regularized_grid_zero_estimate
(L : PeriodPair) (ω u₁ u₂ : ℂ)
(h_grid : RegularAuxiliaryGridData L ω u₁ u₂)
(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 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) ℂ,
(∀ d ∈ Q.support, d 0 + d 1 = m ∧
d 2 + d 3 + d 4 + d 5 + d 6 = 5 * l) →
(fun z : ℂ => MvPolynomial.eval
![1, z, S 0 z, S 1 z, S 2 z, S 3 z, S 4 z] Q) ≠ 0 →
∃ v ∈ auxiliaryGrid u₁ u₂ ω ![3 * s, 3 * s, 3 * q],
∃ n : ℕ, n ≤ T ∧ iteratedDeriv n
(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