Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Matching polynomial growth bounds for the actual quotient filtration

Proved
PhilipponMultiplicity.Hilbert.cumulativeHilbertFunction_polynomial_bounds

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

algebraic-geometrycommutative-algebra

Let qqq be a relevant multihomogeneous prime, aaa the total degree of its actual Hilbert polynomial, and sss the number of projective blocks. There exist positive rational constants c,Cc,Cc,C and a natural threshold NNN such that for every n≥Nn\ge Nn≥N,

cna+s≤Cq(2sn),Cq(n)≤C(n+1)a+s,c n^{a+s}\le C_q(2sn),\qquad C_q(n)\le C(n+1)^{a+s},cna+s≤Cq​(2sn),Cq​(n)≤C(n+1)a+s,

where CqC_qCq​ is the actual vector-space dimension of the total-degree filtration in R/qR/qR/q. These bounds prove the Hilbert-polynomial side of the growth comparison; they do not assume or assert the remaining equality with Krull dimension.

Preamble
import Definitions.Def_PhilipponMultiplicity_HilbertGrowth
set_option autoImplicit false
open scoped BigOperators Topology
open Filter
open MvPolynomial PhilipponMultiplicity PhilipponMultiplicity.Hilbert
Formal statement
theorem PhilipponMultiplicity.Hilbert.cumulativeHilbertFunction_polynomial_bounds
{K : Type*} [Field K] (M : MultiProjectiveSpace K)
    (Q : Ideal M.CoordinateRing) (hQ : Q.IsPrime)
    (hhom : IsMultihomogeneousIdeal M Q)
    (hrel : IsRelevant K M.factorCount M.ambientDimension Q) :
    ∃ c C : ℚ, 0 < c ∧ 0 < C ∧ ∃ N : ℕ, ∀ n ≥ N,
      c * (n : ℚ) ^ (SectionThree.idealDimension M Q + M.factorCount) ≤
          (cumulativeHilbertFunction M Q (2 * M.factorCount * n) : ℚ) ∧
        (cumulativeHilbertFunction M Q n : ℚ) ≤
          C * ((n + 1 : ℕ) : ℚ) ^ (SectionThree.idealDimension M Q + M.factorCount) := by sorry
Source
Supporting formalization for Philippon (1986), §3, printed pp. 362–364, https://www.numdam.org/articles/10.24033/bsmf.2060/ . Matching polynomial growth bounds for the actual quotient filtration.

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