Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Stabilizer loci with height-selection hypotheses and a degree budget

Open
WeierstrassEllipticZeta.stabilizer_height_selection_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, choose a chart index jc∈{0,1}j_c\in\{0,1\}jc​∈{0,1} and a point zcz_czc​ in that chart. The denominators are S0S_0S0​ for chart zero and S2S_2S2​ for chart one; the chosen denominator at zcz_czc​ must be nonzero.

Use the fixed ring A=C[T,X1,X2,X3]A=\mathbb C[T,X_1,X_2,X_3]A=C[T,X1​,X2​,X3​]. In chart zero write its coordinates (t,x,y,u)(t,x,y,u)(t,x,y,u) and in chart one (t,a,b,h)(t,a,b,h)(t,a,b,h). Define the normalized polynomials

Q0(t,x,y,u)=Q(1,t,1,x,y,u,yu+2x2),Q1(t,a,b,h)=Q(1,t,a,b,1,ah−2b2,h).Q_0(t,x,y,u)=Q(1,t,1,x,y,u,yu+2x^2),\qquad Q_1(t,a,b,h)=Q(1,t,a,b,1,ah-2b^2,h).Q0​(t,x,y,u)=Q(1,t,1,x,y,u,yu+2x2),Q1​(t,a,b,h)=Q(1,t,a,b,1,ah−2b2,h).

The corresponding orbit coordinates are

v0(z)=(z,S1/S0,S2/S0,S3/S0),v1(z)=(z,S0/S2,S1/S2,S4/S2).v_0(z)=(z,S_1/S_0,S_2/S_0,S_3/S_0),\qquad v_1(z)=(z,S_0/S_2,S_1/S_2,S_4/S_2).v0​(z)=(z,S1​/S0​,S2​/S0​,S3​/S0​),v1​(z)=(z,S0​/S2​,S1​/S2​,S4​/S2​).

The fixed complex derivations are determined on the variables by

δ0(t,x,y,u)=(1,y,6x2−g2/2,−x),\delta_0(t,x,y,u)=(1,y,6x^2-g_2/2,-x),δ0​(t,x,y,u)=(1,y,6x2−g2​/2,−x), δ1(t,a,b,h)=(1,−6b2+(g2/2)a2,−1/2−g2ab−(3g3/2)a2,−2g2b2−3g3ab).\delta_1(t,a,b,h)=(1,-6b^2+(g_2/2)a^2, -1/2-g_2ab-(3g_3/2)a^2,-2g_2b^2-3g_3ab).δ1​(t,a,b,h)=(1,−6b2+(g2​/2)a2,−1/2−g2​ab−(3g3​/2)a2,−2g2​b2−3g3​ab).

For the derivation δjc\delta_{j_c}δjc​​ define, for any ideal J⊆AJ\subseteq AJ⊆A,

Pr(J)=(δjckf:f∈J, 0≤k≤r).P_r(J)=\bigl(\delta_{j_c}^k f:f\in J,\ 0\le k\le r\bigr).Pr​(J)=(δjc​k​f:f∈J, 0≤k≤r).

Choose a base ideal JcJ_cJc​ and put

qc=ker⁡(A→eval⁡vjc(zc)C).\mathfrak q_c=\ker\bigl(A\xrightarrow{\operatorname{eval}_{v_{j_c}(z_c)}}\mathbb C\bigr).qc​=ker(Aevalvjc​​(zc​)​​C).

Require

ht⁡(Jc)≥2,Qjc∈Jc,P3U(Jc)⊆qc.\operatorname{ht}(J_c)\ge2,\qquad Q_{j_c}\in J_c,\qquad P_{3U}(J_c)\subseteq\mathfrak q_c.ht(Jc​)≥2,Qjc​​∈Jc​,P3U​(Jc​)⊆qc​.

For every i∈{0,1,2}i\in\{0,1,2\}i∈{0,1,2} and every prime p⊆qc\mathfrak p\subseteq\mathfrak q_cp⊆qc​ that is minimal over both PiU(Jc)P_{iU}(J_c)PiU​(Jc​) and P(i+1)U(Jc)P_{(i+1)U}(J_c)P(i+1)U​(Jc​), require the bound

length⁡Ap(Ap/PiU(Jc)Ap)≤ec.\operatorname{length}_{A_{\mathfrak p}}\bigl(A_{\mathfrak p}/P_{iU}(J_c)A_{\mathfrak p}\bigr)\le e_c.lengthAp​​(Ap​/PiU​(Jc​)Ap​)≤ec​.

These data do not supply a prime or a stage as a witness. The complete three-step selection theorem produces a qualifying prime and a stage among 0,U,2U0,U,2U0,U,2U. The ring has dimension four; if none of the three adjacent stage pairs shared a minimal prime below qc\mathfrak q_cqc​, a recursively chosen chain of minimal primes would have height at least five. The normalized polynomial lies in the selected prime because it lies in the base ideal, and that prime vanishes at the supplied chart point because it lies below qc\mathfrak q_cqc​.

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 an explicit height-based route to the persistent-component degree budget for Senthil Kumar (2026), Appendix A, Theorem A.2. The complete selection criterion implements the affine prime-height form of the dimension-drop argument in Philippon (1986), §5, p. 380. The present theorem remains Open: it must construct the locus, chart points and base ideals; establish their height, membership and terminal-containment properties; and prove the uniform total-length degree bound. This is a sufficient route, and no converse for arbitrary previous chart data is claimed. The constant, degree exponents and numerical sum inequality are unchanged.

Preamble
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_height_selection_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 (ChartSelectionMultiplicityData 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
Source
Philippon (1986), Lemmes de zeros dans les groupes algebriques commutatifs, Bull. Soc. Math. France 114, 355-383, section 5, p. 380: dimension-drop selection of a component common to adjacent derivative stages. 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. The complete theorem gives an affine prime-height criterion: four increasing ideals, initial height at least two, all below a prime of height at most four, have a common minimal prime at adjacent stages. The chart reduction selects a stage among 0, U, 2U. Constructing the geometric height and terminal-containment data and proving the uniform total-length degree bound remain open. This is a sufficient route; no converse for arbitrary old chart data is asserted.

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