Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Regular-cut degree bound for equidimensional relevant support

Proved
PhilipponMultiplicity.SectionThreeSupport.componentSum_regular_cut_le_of_equidimensional

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

algebraic-geometrycommutative-algebra

Let III be a multihomogeneous ideal over a field. Assume that every relevant minimal prime of III has the same Hilbert dimension as III. Let PPP be multihomogeneous of natural multidegree DDD and regular modulo III. Then, for every open locus UUU of maximal ideals,

SUH(I+(P);D)≤H(I;D).S_UH(I+(P);D)\le H(I;D).SU​H(I+(P);D)≤H(I;D).

The component sum uses the actual isolated primary multiplicities. Zero degree entries and empty relevant cuts are allowed. The hypothesis concerns the original ideal's equidimensionality; the dimensions of its cut components are conclusions proved through the geometric component theorem, not additional hypotheses of this statement.

Preamble
import Definitions.Def_PhilipponMultiplicity_SectionThreeSupport
set_option autoImplicit false
open scoped BigOperators
open MvPolynomial PhilipponMultiplicity PhilipponMultiplicity.SectionThree
open PhilipponMultiplicity.SectionThreeSupport PhilipponMultiplicity.Hilbert
Formal statement
theorem PhilipponMultiplicity.SectionThreeSupport.componentSum_regular_cut_le_of_equidimensional
    {K : Type*} [Field K] (M : MultiProjectiveSpace K)
(I : Ideal M.CoordinateRing)
    (hI : IsMultihomogeneousIdeal M I)
    (hdim : ∀ p ∈ I.minimalPrimes,
      Hilbert.IsRelevant K M.factorCount M.ambientDimension p →
      idealDimension M p = idealDimension M I)
    (P : M.CoordinateRing) (D : M.FactorIndex → ℕ)
    (hP : M.IsHomogeneous P D) (hregular : IsRegular (Ideal.Quotient.mk I P))
    (U : MaximalOpenLocus M) :
    componentHilbertSum M (I ⊔ Ideal.span {P}) U D ≤ idealDegreeValue M I D := by sorry
Source
Philippon (1986), proof of Proposition 3.3, printed pp. 368–370, one-cut estimate for the pure-dimensional slices; https://www.numdam.org/articles/10.24033/bsmf.2060/ . This supporting reduction does not assert the full multi-step proposition.

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