Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Locus selection with a uniform stabilizer multiplicity bound

Open
WeierstrassEllipticZeta.stabilizer_locus_multiplicity_bound

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:

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. Write

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 the 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. Put

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 every x∈X+X+Xx\in X+X+Xx∈X+X+X and for every jjj with Sj(x)≠0S_j(x)\ne0Sj​(x)=0, assume the analytic order at xxx of

z⟼Q(1,z,S0(z)/Sj(z),…,S4(z)/Sj(z))z\longmapsto 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))

is at least 3U+13U+13U+1.

Then there exist a nonempty set W⊆C3W\subseteq\mathbb C^3W⊆C3 and an integer 0≤b≤20\le b\le20≤b≤2 such that FQ\mathcal F_QFQ​ vanishes on WWW and

(U+1)#((ϕ(X)+HW)/HW)≤C ma(W)nb,(U+1)\#\bigl((\phi(X)+H_W)/H_W\bigr)\le C\,m^{a(W)}n^b,(U+1)#((ϕ(X)+HW​)/HW​)≤Cma(W)nb,

where the subgroup and exponent are fixed by the locus:

VW={v: w+tv∈W for all t∈C, w∈W},HW=q(VW),a(W)={1v0=0 for every v∈VW,0otherwise.V_W=\{v:\ w+tv\in W\text{ for all }t\in\mathbb C,\ w\in W\}, \quad H_W=q(V_W),\quad a(W)=\begin{cases}1&v_0=0\text{ for every }v\in V_W,\\0&\text{otherwise.}\end{cases}VW​={v: w+tv∈W for all t∈C, w∈W},HW​=q(VW​),a(W)={10​v0​=0 for every v∈VW​,otherwise.​

The constant is uniform in X,Q,m,n,UX,Q,m,n,UX,Q,m,n,U. The substantive obligation is the choice of WWW and the displayed degree bound. The construction of the parametrized proper subgroup from a chosen nonempty locus is a separate proved theorem.

Formalization Note. This is a concrete locus-selection formulation of the remaining multiplicity step for Senthil Kumar (2026), Appendix A, Theorem A.2. It follows the stabilizer construction in Philippon (1986), §5, Lemma 5.1, pp. 380–382. The set WWW may be a lifted algebraic locus, but the formal statement does not require a formal variety structure. It does not assume an identification of HWH_WHW​ with an algebraic stabilizer or assert that the uniform bound has already been proved.

Preamble
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_locus_multiplicity_bound
    (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 ∧
          ((U + 1 : ℕ) : ℝ) *
            ((linearTranslationImage L.lattice η W).mkQ ''
              (extensionCurve L.lattice η '' (X : Set ℂ))).ncard ≤
            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, Lemma 5.1, pp. 380-382. https://www.numdam.org/item/10.24033/bsmf.2060.pdf. Senthil Kumar K (2026), Appendix A, Theorem A.2 and section A.2. https://doi.org/10.1017/S001309152610145X. Specialized covering-space translation-direction construction; no algebraic-stabilizer identification is assumed. Uniform locus selection and its multiplicity bound 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