Finite-set zero estimate in projective elliptic charts
ProvedWeierstrassEllipticZeta.finite_set_projective_chart_zero_estimateLet be a complex period pair with lattice and canonical functions . Let be normalized entire sigma differential data. Suppose the entire functions have no common zero and satisfy
Let be the additive quotient map. There exists , uniform in the parameters below, such that for all integers , , and finite with and
the following holds. Let be bihomogeneous of bidegree , and suppose its entire evaluation
is not identically zero. There exist and such that and the local chart evaluation
has vanishing order at most at . Its order is taken in ; the nonzero denominator makes this function analytic on a neighborhood of .
This is the remaining geometric zero estimate expressed in valid projective charts. The finite set and polynomial are arbitrary subject to the displayed hypotheses, and the polynomial may involve the fifth elliptic coordinate. The underlying algebraic-group construction, multiplicity theorem and subgroup analysis remain proof obligations.
import Mathlib.Analysis.Analytic.Order 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_chart_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 : Fin 5, S j v ≠ 0 ∧
analyticOrderAt
(fun z : ℂ => MvPolynomial.eval
![1, z, S 0 z / S j z, S 1 z / S j z,
S 2 z / S j z, S 3 z / S j z, S 4 z / S j z] Q) v ≤ T := by sorry