Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Analytic subgroup construction with a uniform multiplicity bound

Open
WeierstrassEllipticZeta.linear_analytic_multiplicity_obstruction

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

algebraic-geometrynumber-theory

Fix the canonical elliptic functions of a period pair, normalized entire sigma data, their five entire projective coordinates, and the canonical quasiperiod map. There should be 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 and contain zero, and let QQQ be bihomogeneous of bidegree (m,n)(m,n)(m,n). Suppose its regularized evaluation along the canonical one-parameter subgroup is not identically zero, while every valid projective chart expression has order at least 3U+13U+13U+1 at every point of X+X+XX+X+XX+X+X.

Construct a complex linear subspace V⊂C3V\subset\mathbb C^3V⊂C3, its exact image HHH under the quotient exponential map (t,z,u)↦(t,[(z,u)])(t,z,u)\mapsto(t,[(z,u)])(t,z,u)↦(t,[(z,u)]), a four-variable polynomial PPP, and an integer b≤2b\le2b≤2. The polynomial must vanish on the regular points of that analytic subgroup, but must be nonzero at some regular point of the original curve (z,℘(z),℘′(z),ζ(z))(z,\wp(z),\wp'(z),\zeta(z))(z,℘(z),℘′(z),ζ(z)). Require

(U+1)#((ϕ(X)+H)/H)≤C{mif V⊂{t=0},1otherwisenb.(U+1)\#\bigl((\phi(X)+H)/H\bigr) \le C\begin{cases}m&\text{if }V\subset\{t=0\},\\1&\text{otherwise}\end{cases}n^b.(U+1)#((ϕ(X)+H)/H)≤C{m1​if V⊂{t=0},otherwise​nb.

The constant is uniform in m,n,U,X,Qm,n,U,X,Qm,n,U,X,Q. Both the subgroup construction and this inequality are conclusions, not assumptions. The statement makes the analytic parametrization and polynomial properness of the obstruction explicit; the projection-kernel restriction then follows from the proved analytic subgroup criterion.

Source: Senthil Kumar K, Algebraic independence of values of Weierstrass elliptic and zeta functions, Appendix A, Theorem A.2 and the analytic subgroup description in §A.2, https://doi.org/10.1017/S001309152610145X. This is a specialized formal target for the multiplicity input. The parametrization and polynomial properness bridge, as well as the uniform multiplicity estimate, remain to be proved. It is not presented as a completed formalization of Philippon's theorem.

Preamble
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.linear_analytic_multiplicity_obstruction
    (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) →
        ∃ (V : Submodule ℂ (Fin 3 → ℂ))
          (H : Submodule ℤ (GraphExtensionGroup L.lattice η))
          (P : MvPolynomial (Fin 4) ℂ) (b : ℕ),
          (∀ g, g ∈ H ↔ ∃ v ∈ V,
            g = (v 0, (extensionPeriodGraph L.lattice η).mkQ (v 1, v 2))) ∧
          (∃ z : ℂ, z ∉ L.lattice ∧
            MvPolynomial.eval ![z, L.weierstrassP z, L.derivWeierstrassP z,
              weierstrassZeta L z] P ≠ 0) ∧
          (∀ v ∈ V, v 1 ∉ L.lattice →
            MvPolynomial.eval ![v 0, L.weierstrassP (v 1), L.derivWeierstrassP (v 1),
              v 2 + weierstrassZeta L (v 1)] P = 0) ∧ b ≤ 2 ∧
          ((U + 1 : ℕ) : ℝ) *
            (H.mkQ '' (extensionCurve L.lattice η '' (X : Set ℂ))).ncard ≤
            C * (if (∀ v ∈ V, v 0 = 0) then (m : ℝ) else 1) * (n : ℝ) ^ b := by sorry
Source
Senthil Kumar K (2026), Appendix A, §A.2, Lemma A.1 and Theorem A.2; https://doi.org/10.1017/S001309152610145X. Concrete analytic subgroup criterion and specialized multiplicity target.

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