Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.3: intersection bound with primary multiplicities on a CM locus

Proved
PhilipponMultiplicity.proposition_3_3_cohenMacaulay

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

algebraic-geometrycommutative-algebra

Under the original base-field and equation hypotheses of Philippon Proposition 3.3, suppose I0I_0I0​ is locally Cohen–Macaulay at every maximal ideal in the open locus UUU. For I=I0+(P1,…,Pm)I=I_0+(P_1,\ldots,P_m)I=I0​+(P1​,…,Pm​),

SUH(I;D)≤SUH(I0;D).S_UH(I;D)\le S_UH(I_0;D).SU​H(I;D)≤SU​H(I0​;D).

These are the actual isolated primary-component degree sums, retaining multiplicities. This is exactly the proposition’s second inequality, with no added regularity, slice-dimension or per-cut estimate hypothesis. Its proof remains open.

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.proposition_3_3_cohenMacaulay
    (K : Type*) [NontriviallyNormedField K] (hK : IsPhilipponBaseField K)
    (M : MultiProjectiveSpace K)
    (I₀ : Ideal M.CoordinateRing) (hI₀ : IsMultihomogeneousIdeal M I₀)
    (m : ℕ) (P : Fin m → M.CoordinateRing) (D : M.FactorIndex → ℕ)
    (hP : ∀ j, IsMultihomogeneousOfDegreeAtMost M (P j) D)
    (U : MaximalOpenLocus M) (hCM : IsLocallyCohenMacaulayOn M I₀ U) :
    componentHilbertSum M (I₀ ⊔ Ideal.span (Set.range P)) U D ≤
      componentHilbertSum M I₀ U D := by sorry
Source
Philippon (1986), Lemmes de zéros dans les groupes algébriques commutatifs. Second inequality of Proposition 3.3, printed pp. 365–370, especially the changing open loci and primary-component comparisons on pp. 369–370. This separate dependency retains precisely the source conclusion and hypotheses. https://www.numdam.org/articles/10.24033/bsmf.2060/

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