Locus selection with a uniform stabilizer multiplicity bound
OpenWeierstrassEllipticZeta.stabilizer_locus_multiplicity_boundFix a complex period pair with lattice , its canonical Weierstrass functions, normalized entire sigma differential data, and five entire projective coordinates with no common zero:
Let be the integer-linear quasiperiod map. Write
There is a constant , depending only on the fixed data, with the following property. Let , let be finite with , and let be bihomogeneous of bidegree in its first two and last five variables. Put
Assume is not identically zero. At every and for every with , assume the analytic order at of
is at least .
Then there exist a nonempty set and an integer such that vanishes on and
where the subgroup and exponent are fixed by the locus:
The constant is uniform in . The substantive obligation is the choice of and the displayed degree bound. The construction of the parametrized proper subgroup from a chosen nonempty locus is a separate proved theorem.
Formalization Note. This is a concrete locus-selection formulation of the remaining multiplicity step for Senthil Kumar (2026), Appendix A, Theorem A.2. It follows the stabilizer construction in Philippon (1986), §5, Lemma 5.1, pp. 380–382. The set may be a lifted algebraic locus, but the formal statement does not require a formal variety structure. It does not assume an identification of with an algebraic stabilizer or assert that the uniform bound has already been proved.
import Definitions.Def_TranscendenceTheory_LinearTranslationStabilizer import Definitions.Def_TranscendenceTheory_GraphQuotientExtension 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 open TranscendenceTheory open scoped Classical
theorem WeierstrassEllipticZeta.stabilizer_locus_multiplicity_bound
(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)
(η : L.lattice →ₗ[ℤ] ℂ)
(hη : ∀ ω : L.lattice, η ω = zetaQuasiPeriod L ω) :
∃ 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) →
∃ (W : Set (Fin 3 → ℂ)) (b : ℕ), W.Nonempty ∧
(∀ w ∈ W,
MvPolynomial.eval ![1, w 0, S 0 (w 1), S 1 (w 1), S 2 (w 1),
S 3 (w 1) + w 2 * S 0 (w 1), S 4 (w 1) + w 2 * S 2 (w 1)] Q = 0) ∧
b ≤ 2 ∧
((U + 1 : ℕ) : ℝ) *
((linearTranslationImage L.lattice η W).mkQ ''
(extensionCurve L.lattice η '' (X : Set ℂ))).ncard ≤
C * (if (∀ v ∈ linearTranslationDirections W, v 0 = 0) then (m : ℝ) else 1) *
(n : ℝ) ^ b := by sorry