Stabilizer degree budget with explicit cubic bases in both charts
OpenWeierstrassEllipticZeta.stabilizer_cubic_chart_base_degree_budgetThis is the remaining stabilizer degree-budget theorem with explicit cubic bases in both charts.
Keep all hypotheses and conclusions of the previous frontier: the period pair, sigma data, entire coordinates, quasiperiod map, bidegree , finite set containing zero, nonzero pullback, and order at least on the triple sumset. The constant must be uniform in .
One must still choose a nonempty zero locus , an exponent , and natural multiplicity budgets for the represented cosets modulo its linear-translation image. For each represented coset, choose an available chart point in and bound every qualifying persistent minimal prime's localized length by .
The base in either chart is now the explicit ideal
The persistent primes are minimal over the differential prolongations at both and , for . The original sum bound remains unchanged:
Only the budget data type is changed in the formal statement. The complete ideal-identification theorem and a checked converse preserve every candidate condition and localized quotient length. Global geometric gluing as needed, locus and chart-point selection, the coset/component connection and the uniform total-length degree estimate remain obligations.
import Definitions.Def_WeierstrassEllipticZeta_CubicChartBase import Definitions.Def_WeierstrassEllipticZeta_FirstCubicChartBase import Definitions.Def_WeierstrassEllipticZeta_GlobalChartBase import Definitions.Def_WeierstrassEllipticZeta_ChartOrbitBase import Definitions.Def_WeierstrassEllipticZeta_ChartSelectionData import Definitions.Def_WeierstrassEllipticZeta_ChartProlongationData 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_cubic_chart_base_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 (CubicChartBaseBudget L S Q U (e c) (X + X + X))) ∧
(∑ 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