Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.1 four-equation certificate with a quotient-dimension bound

Open
WeierstrassEllipticZeta.sampled_locus_quotient_degree_certificate

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

algebraic-geometrynumber-theory

Under the same elliptic analytic hypotheses and uniform derivative-ideal cap as the four-equation certificate frontier, find a positive real constant CCC, uniform in positive m,n,Um,n,Um,n,U, a finite set XXX containing zero, and a bihomogeneous polynomial QQQ with nonzero entire pullback and order at least 3U+13U+13U+1 throughout X+X+XX+X+XX+X+X.

Choose an elementary point, line in a fixed elliptic fibre, or entire fibre, with an anchor satisfying the prescribed finite locus-zero tests. Choose a valid chart ccc and a point z∈X+X+Xz\in X+X+Xz∈X+X+X, and let EEE be the canonical capped chart cost there.

Choose four polynomials bi∈C[t,x,y,u]b_i\in\mathbb C[t,x,y,u]bi​∈C[t,x,y,u], a monomial order and exponents did_idi​, such that the leading coefficients are units and the leading exponent vectors are dieid_i e_idi​ei​. Put J=(b0,b1,b2,b3)J=(b_0,b_1,b_2,b_3)J=(b0​,b1​,b2​,b3​). Choose distinct primes of A=C[t,x,y,u]/JA=\mathbb C[t,x,y,u]/JA=C[t,x,y,u]/J indexed by the classes of XXX modulo the elementary period kernel, each with local length at least EEE. Require the quotient-degree bound

dim⁡CA≤C(elementaryDegree⁡(shape,m)+1)n2.\dim_{\mathbb C} A\leq C(\operatorname{elementaryDegree}(\mathrm{shape},m)+1)n^2.dimC​A≤C(elementaryDegree(shape,m)+1)n2.

The pure-power hypotheses imply that AAA is finite-dimensional. The proved standard-monomial theorem identifies its dimension exactly with ∏idi\prod_i d_i∏i​di​. Consequently this frontier is equivalent to the preceding exponent-product certificate, preserving CCC and every witness. It allows the global bound to be stated directly in terms of the quotient's dimension. Selecting the equations and prime family and proving this uniform global bound remain Open.

Preamble
import Mathlib.RingTheory.MvPolynomial.Groebner
import Definitions.Def_WeierstrassEllipticZeta_ElementaryLocusSamples
import Definitions.Def_WeierstrassEllipticZeta_ElementaryLoci
import Definitions.Def_WeierstrassEllipticZeta_CanonicalChartCost
import Definitions.Def_WeierstrassEllipticZeta_SectionJetEvaluation
import Definitions.Def_TranscendenceTheory_PolynomialQuotientDegreeFiltration
import Definitions.Def_WeierstrassEllipticZeta_FiniteJetChartIdeals
import Definitions.Def_WeierstrassEllipticZeta_PunctualChartIdeals
import Definitions.Def_WeierstrassEllipticZeta_FiniteChartZeroLocus
import Definitions.Def_WeierstrassEllipticZeta_ChartQuotientMultiplicity
import Definitions.Def_TranscendenceTheory_FiniteAlgebraMultiplicityModel
import Definitions.Def_WeierstrassEllipticZeta_FirstChartSections
import Definitions.Def_WeierstrassEllipticZeta_CappedChartJets
import Definitions.Def_WeierstrassEllipticZeta_FiniteChartJets
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.sampled_locus_quotient_degree_certificate
    (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 ω)
    (B : ℕ → ℕ)
    (hB : ∀ (m n : ℕ) (Q : MvPolynomial (Fin 7) ℂ),
      (∀ d ∈ Q.support, d 0 + d 1 = m ∧ d 2 + d 3 + d 4 + d 5 + d 6 = n) →
      ∀ (c : Fin 2) (T : ℕ), extensionChartJetIdeal L Q c T =
        extensionChartJetIdeal L Q c (min T (B (m + 2 * n)))) :
    ∃ 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) →
        ∃ (shape : ElementaryLocusShape) (r : Fin 3 → ℂ),
          (∀ w ∈ elementaryLocusSamples shape r m n,
            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) ∧
          ∃ (c : Fin 2) (z : ℂ), z ∈ X + X + X ∧
            S (extensionChartDenominator c) z ≠ 0 ∧
            ∃ (o : MonomialOrder.{0, 0} (Fin 4))
              (d : Fin 4 → ℕ) (b : Fin 4 → MvPolynomial (Fin 4) ℂ),
              (∀ i, IsUnit (o.leadingCoeff (b i))) ∧
              (∀ i, o.degree (b i) = Finsupp.single i (d i)) ∧
              ∃ p : (X.image (elementaryPeriodKernel L.lattice η shape).mkQ) →
                PrimeSpectrum (MvPolynomial (Fin 4) ℂ ⧸ Ideal.span (Set.range b)),
                Function.Injective p ∧
                (∀ i, cappedChartCost L S Q (B (m + 2 * n)) U c z ≤
                  (Module.length (Localization.AtPrime (p i).asIdeal)
                    (Localization.AtPrime (p i).asIdeal)).toNat) ∧
                ((Module.finrank ℂ
                  (MvPolynomial (Fin 4) ℂ ⧸ Ideal.span (Set.range b)) : ℕ) : ℝ) ≤
                  C * (((elementaryDegree shape m + 1) * n ^ 2 : ℕ) : ℝ) := by sorry
Source
Derived pure-power case of the standard-monomial basis theorem. The usual background is the product criterion for relatively prime leading monomials: John Edward Perry, Combinatorial Criteria for Groebner Bases (2005 thesis), section 2.4, Theorem 2.4, pp. 59-60, https://repository.lib.ncsu.edu/server/api/core/bitstreams/8b3d0e6c-fd44-4a52-82ee-39c6da4f6703/content. The Lean proof independently establishes the special pure-power leading-divisibility criterion by induction on the generators, using MonomialOrder.div in pinned Mathlib, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/RingTheory/MvPolynomial/Groebner.lean. This gives an explicit exponent-box basis, unique reduced representatives, and dim_K(R/(b_i)) = product_i d_i over any field, including zero exponents and the empty variable set. It strengthens the earlier quotient-dimension upper bound; it does not prove a full multihomogeneous Bezout theorem. The A.1 application replaces the exponent-product budget in https://prove2.me/theorems/aae7ee1d-79e8-444d-9ac1-03a2ab38cb18 by the exactly equal quotient dimension. Both directions preserve C and all witnesses. Selecting the equations and primes and proving the uniform bidegree 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