Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.3: the complete reduced intersection inequality

Proved
PhilipponMultiplicity.proposition_3_3_radical

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

algebraic-geometrycommutative-algebra

Let I0I_0I0​ be a multihomogeneous ideal over an infinite field and let I=I0+(P1,…,Pm)I=I_0+(P_1,\ldots,P_m)I=I0​+(P1​,…,Pm​), where the homogeneous equations have block degrees at most DDD. For every open locus UUU,

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

This proves the first inequality of Philippon Proposition 3.3 when UUU is the whole maximal spectrum, with the stronger open-locus conclusion stated explicitly. It concerns reduced components; it does not prove the second inequality retaining primary multiplicities.

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_radical {K : Type*} [Field K] [Infinite 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) :
    componentHilbertSum M (I₀ ⊔ Ideal.span (Set.range P)).radical U D ≤
      componentHilbertSum M I₀.radical U D := by sorry
Source
Philippon (1986), Lemmes de zéros dans les groupes algébriques commutatifs. First inequality of Proposition 3.3, printed pp. 365–368. The source’s finite descending cut chain and final component comparison are reused. The support theorem is valid over every infinite field and on every open locus; the original proposition is recovered at the full locus. 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