Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Stabilizer loci with Noetherian minimal-prime degree data

Open
WeierstrassEllipticZeta.stabilizer_minimal_prime_degree_budget

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

algebraic-geometrynumber-theory

Fix a complex period pair with lattice Λ\LambdaΛ, its canonical Weierstrass functions, normalized entire sigma differential data, and five entire projective coordinates with no common zero satisfying

S(z)=σ(z)3(1,℘(z),℘′(z),ζ(z),℘′(z)ζ(z)+2℘(z)2)(z∉Λ).S(z)=\sigma(z)^3\bigl(1,\wp(z),\wp'(z),\zeta(z),\wp'(z)\zeta(z)+2\wp(z)^2\bigr) \qquad(z\notin\Lambda).S(z)=σ(z)3(1,℘(z),℘′(z),ζ(z),℘′(z)ζ(z)+2℘(z)2)(z∈/Λ).

Let η:Λ→C\eta:\Lambda\to\mathbb Cη:Λ→C be the integer-linear quasiperiod map. Put

G=C×(C2/{(ω,−η(ω)):ω∈Λ}),q(v)=(v0,[(v1,v2)]),ϕ(z)=(z,[(z,0)]).G=\mathbb C\times\bigl(\mathbb C^2/\{(\omega,-\eta(\omega)):\omega\in\Lambda\}\bigr), \quad q(v)=(v_0,[(v_1,v_2)]),\quad\phi(z)=(z,[(z,0)]).G=C×(C2/{(ω,−η(ω)):ω∈Λ}),q(v)=(v0​,[(v1​,v2​)]),ϕ(z)=(z,[(z,0)]).

There is a constant C>0C>0C>0, depending only on these fixed data, with the following property. Let m,n,U≥1m,n,U\ge1m,n,U≥1, let X⊂CX\subset\mathbb CX⊂C be finite with 0∈X0\in X0∈X, and let QQQ be bihomogeneous of bidegree (m,n)(m,n)(m,n) in its first two and last five variables. Define

FQ(t,z,u)=Q(1,t,S0(z),S1(z),S2(z),S3(z)+uS0(z),S4(z)+uS2(z)).\mathcal F_Q(t,z,u)=Q\bigl(1,t,S_0(z),S_1(z),S_2(z),S_3(z)+uS_0(z),S_4(z)+uS_2(z)\bigr).FQ​(t,z,u)=Q(1,t,S0​(z),S1​(z),S2​(z),S3​(z)+uS0​(z),S4​(z)+uS2​(z)).

Assume z↦FQ(z,z,0)z\mapsto\mathcal F_Q(z,z,0)z↦FQ​(z,z,0) is not identically zero. At each x∈X+X+Xx\in X+X+Xx∈X+X+X and in every available chart Sj(x)≠0S_j(x)\ne0Sj​(x)=0, assume the function

z↦Q(1,z,S0(z)/Sj(z),…,S4(z)/Sj(z))z\mapsto Q\bigl(1,z,S_0(z)/S_j(z),\ldots,S_4(z)/S_j(z)\bigr)z↦Q(1,z,S0​(z)/Sj​(z),…,S4​(z)/Sj​(z))

has analytic order at least 3U+13U+13U+1 at xxx.

Then there are a nonempty locus W⊆C3W\subseteq\mathbb C^3W⊆C3 on which FQ\mathcal F_QFQ​ vanishes, an integer 0≤b≤20\le b\le20≤b≤2, and nonnegative integers ece_cec​ indexed by G/HWG/H_WG/HW​ with the following properties. Here

VW={v: w+tv∈W for every w∈W, t∈C},HW=q(VW),Z={ϕ(x)+HW:x∈X}.V_W=\{v:\ w+tv\in W\text{ for every }w\in W,\ t\in\mathbb C\}, \quad H_W=q(V_W),\quad Z=\{\phi(x)+H_W:x\in X\}.VW​={v: w+tv∈W for every w∈W, t∈C},HW​=q(VW​),Z={ϕ(x)+HW​:x∈X}.

For every c∈Zc\in Zc∈Z, construct a commutative Noetherian Q\mathbb QQ-algebra RcR_cRc​, an ideal IcI_cIc​, a minimal prime pc\mathfrak p_cpc​ over IcI_cIc​, a derivation DcD_cDc​, and an element qc∈pcq_c\in\mathfrak p_cqc​∈pc​ with Dcqc∉pcD_cq_c\notin\mathfrak p_cDc​qc​∈/pc​ such that

Dcjf∈pc(f∈Ic, 0≤j≤U),length⁡(Rc)pc((Rc)pc/Ic(Rc)pc)≤ec.D_c^j f\in\mathfrak p_c\quad(f\in I_c,\ 0\le j\le U), \qquad\operatorname{length}_{(R_c)_{\mathfrak p_c}}\bigl((R_c)_{\mathfrak p_c}/I_c(R_c)_{\mathfrak p_c}\bigr)\le e_c.Dcj​f∈pc​(f∈Ic​, 0≤j≤U),length(Rc​)pc​​​((Rc​)pc​​/Ic​(Rc​)pc​​)≤ec​.

Here ιc:Rc→Sc=(Rc)pc\iota_c:R_c\to S_c=(R_c)_{\mathfrak p_c}ιc​:Rc​→Sc​=(Rc​)pc​​ is the canonical localization map and IcScI_c S_cIc​Sc​ is the ideal generated by ιc(Ic)\iota_c(I_c)ιc​(Ic​). The derivation and derivative-containment conditions are stated in the original ring; the derivation on ScS_cSc​ is not part of the supplied data.

Their upper bounds must satisfy

∑c∈Zec≤C ma(W)nb,a(W)={1v0=0 for every v∈VW,0otherwise.\sum_{c\in Z}e_c\le C\,m^{a(W)}n^b, \qquad a(W)=\begin{cases}1&v_0=0\text{ for every }v\in V_W,\\0&\text{otherwise.}\end{cases}c∈Z∑​ec​≤Cma(W)nb,a(W)={10​v0​=0 for every v∈VW​,otherwise.​

The same CCC must work for every X,Q,m,n,UX,Q,m,n,UX,Q,m,n,U. Values ece_cec​ outside the finite set ZZZ 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.

Preamble
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_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
Source
Philippon (1986), Lemmes de zeros dans les groupes algebriques commutatifs, Bull. Soc. Math. France 114, 355-383, Proposition 4.7, especially p. 379, and section 5, Lemma 5.1, pp. 380-382. https://www.numdam.org/item/10.24033/bsmf.2060.pdf. Stacks Project, Lemmas 10.62.3 and 10.62.5, https://stacks.math.columbia.edu/tag/00KY. Senthil Kumar K (2026), Appendix A, Theorem A.2. https://doi.org/10.1017/S001309152610145X. Algebraic auxiliary theorem: construct the canonical primary component at a minimal prime in a Noetherian ring and prove finite local length and preservation of finite-order derivative containment. Geometric prime selection, transversality, and the total local-length degree budget remain open.

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