Stabilizer loci with Noetherian minimal-prime degree data
OpenWeierstrassEllipticZeta.stabilizer_minimal_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 , construct a commutative Noetherian -algebra , an ideal , a minimal prime over , a derivation , and an element with such that
Here is the canonical localization map and is the ideal generated by . The derivation and derivative-containment conditions are stated in the original ring; the derivation on is not part of the supplied data.
Their upper bounds must satisfy
The same must work for every . Values outside the finite set are irrelevant.
Formalization Note. This is a sufficient Noetherian coordinate-ring route to the component construction and degree estimate in Senthil Kumar (2026), Appendix A, Theorem A.2. Noetherianity and minimality of each chosen prime are explicit hypotheses on the constructed data. The separate complete theorem supplies a canonical primary component, a residual ideal giving an exact intersection decomposition, a separator, and finite local length. This is the algebraic component step used in Philippon (1986), Proposition 4.7, pp. 378–379; the geometric selection and degree estimate in §5, Lemma 5.1 remain open. The statement does not require the rings or ideals to be identified with geometric components. No equivalence with arbitrary non-Noetherian witnesses from the previous interface is claimed.
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_minimal_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 (MinimalPrimeMultiplicityData 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