High projective multiplicity produces a subgroup obstruction
ProvedWeierstrassEllipticZeta.finite_set_projective_multiplicity_obstructionLet be a complex period pair with lattice , canonical functions , and normalized entire sigma differential data . Let be entire functions with no common zero such that
There exists , uniform in the following inputs, with this property. Let be integers, let be finite with , and let be bihomogeneous of bidegree . Suppose
is not identically zero. Suppose also that for every and every with , the analytic chart evaluation
has vanishing order at least at . Then there exist an additive subgroup and nonnegative integers such that , either and or and , and
where is the additive quotient map. Vanishing order is an extended natural number, including infinity for a zero germ.
The subgroup represents the inverse image of a proper algebraic subgroup under the one-parameter group map. Establishing the existence of this obstruction, its two possible profiles, and the displayed multiplicity bound remains the geometric proof obligation. The statement imposes no numerical size conditions on and does not assume that is finite.
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_multiplicity_obstruction
(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 U : ℕ,
1 ≤ m → 1 ≤ n → 1 ≤ U → ∀ X : Finset ℂ,
0 ∈ X → ∀ 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 →
((3 * U + 1 : ℕ) : ℕ∞) ≤ 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) →
∃ K : Submodule ℤ ℂ, ∃ a b : ℕ,
((a = 1 ∧ K = ⊥) ∨ (a = 0 ∧ K ≤ L.lattice)) ∧ b ≤ 2 ∧
((U + 1 : ℕ) : ℝ) * (K.mkQ '' (X : Set ℂ)).ncard ≤
C * (m : ℝ) ^ a * (n : ℝ) ^ b := by sorry