Stabilizer loci with concrete chart primes and a degree budget
OpenWeierstrassEllipticZeta.stabilizer_chart_prime_degree_budgetFix a complex period pair with lattice , its canonical Weierstrass functions, normalized entire sigma differential data, and five entire projective coordinates with no common zero satisfying
Let be the integer-linear quasiperiod map. Put
There is a constant , depending only on these 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. Define
Assume is not identically zero. At each and in every available chart , assume the function
has analytic order at least at .
Then there are a nonempty locus on which vanishes, an integer , and nonnegative integers indexed by with the following properties. Here
For every , choose a chart index and a point in that chart. The denominators are for chart zero and for chart one; the chosen denominator at must be nonzero.
Use the fixed ring . In chart zero write its coordinates and in chart one . Define the normalized polynomials
The corresponding orbit coordinates are
The fixed complex derivations are determined on the variables by
Choose an ideal and a minimal prime over it, with and for every . Require
The ring is automatically Noetherian. The orbit map, its differential compatibility, analyticity and finite-order property are constructed by the separate complete theorem and are not supplied as additional data.
Their upper bounds must satisfy
The same must work for every . Values outside the finite set are irrelevant.
Formalization Note. This is an explicit sufficient route through the two concrete Weierstrass charts to the degree estimate in Senthil Kumar (2026), Appendix A, Theorem A.2. The complete chart-orbit theorem implements the local-coordinate reasoning in Philippon (1986), §2 and Proposition 4.3, removing the previous abstract analytic-orbit hypotheses. Geometric locus and prime selection, contact, and the uniform total degree estimate remain open. No identification with selected geometric components is included in the structure, and no equivalence with arbitrary old abstract witnesses is asserted. The constant, degree exponents, and numerical sum bound are unchanged.
import Definitions.Def_WeierstrassEllipticZeta_ChartPrimeMultiplicityData import Definitions.Def_TranscendenceTheory_AnalyticOrbitMultiplicityData import Definitions.Def_TranscendenceTheory_MinimalPrimeMultiplicityData import Definitions.Def_TranscendenceTheory_IsolatedComponentMultiplicityData import Definitions.Def_TranscendenceTheory_PrimeMultiplicityData import Definitions.Def_TranscendenceTheory_DifferentialMultiplicity 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_chart_prime_degree_budget
(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 ∧
∃ e : GraphExtensionGroup L.lattice η ⧸ linearTranslationImage L.lattice η W → ℕ,
(∀ c ∈ X.image (fun z => (linearTranslationImage L.lattice η W).mkQ
(extensionCurve L.lattice η z)), Nonempty (ChartPrimeMultiplicityData L S Q U (e c))) ∧
(∑ c ∈ X.image (fun z => (linearTranslationImage L.lattice η W).mkQ
(extensionCurve L.lattice η z)), (e c : ℝ)) ≤
C * (if (∀ v ∈ linearTranslationDirections W, v 0 = 0) then (m : ℝ) else 1) *
(n : ℝ) ^ b := by sorry