Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Stabilizer degree budget with explicit cubic bases in both charts

Open
WeierstrassEllipticZeta.stabilizer_cubic_chart_base_degree_budget

by tomasz · Sep 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrynumber-theory

This 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 (m,n)(m,n)(m,n), finite set XXX containing zero, nonzero pullback, and order at least 3U+13U+13U+1 on the triple sumset. The constant must be uniform in m,n,U,X,Qm,n,U,X,Qm,n,U,X,Q.

One must still choose a nonempty zero locus WWW, an exponent b≤2b\le2b≤2, and natural multiplicity budgets ece_cec​ for the represented cosets modulo its linear-translation image. For each represented coset, choose an available chart point in X+X+XX+X+XX+X+X and bound every qualifying persistent minimal prime's localized length by ece_cec​.

The base in either chart is now the explicit ideal

Ic=(Fc)+(Qc).I_c=(F_c)+(Q_c).Ic​=(Fc​)+(Qc​).

The persistent primes are minimal over the differential prolongations at both iUiUiU and (i+1)U(i+1)U(i+1)U, for i∈{0,1,2}i\in\{0,1,2\}i∈{0,1,2}. The original sum bound remains unchanged:

∑cec≤C{m,all linear translation directions have zero additive coordinate,1,otherwisenb.\sum_c e_c\le C\begin{cases}m,&\text{all linear translation directions have zero additive coordinate},\\1,&\text{otherwise}\end{cases}n^b.c∑​ec​≤C{m,1,​all linear translation directions have zero additive coordinate,otherwise​nb.

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.

Preamble
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

Formal statement
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
Source
Philippon (1986), Lemmes de zeros dans les groupes algebriques commutatifs, Bull. Soc. Math. France 114, 355-383, section 5, pp. 380-382: ambient defining ideals in the global zero-estimate argument. https://www.numdam.org/item/10.24033/bsmf.2060.pdf. Senthil Kumar K (2026), Appendix A, Theorem A.2. https://doi.org/10.1017/S001309152610145X. Building on the Proved first-chart relation ideal, the new argument identifies the second chart kernel by rational coordinate transition, denominator clearing and exact saturation of its cubic ideal. Both bases are now generated by the explicit cubic and normalized auxiliary polynomial. The budget conditions and all localized lengths are preserved. Full geometric gluing, locus and coset/component selection, and the uniform total-degree estimate remain outside this result.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me