Finite dimension-descending regular cuts for Proposition 3.3
ProvedPhilipponMultiplicity.SectionThreeSupport.exists_descending_cut_chainLet be a multihomogeneous ideal over an infinite field, let be multihomogeneous equations with block degrees bounded by , and put and . There exist ideals and cutting equations with , and . Each lies in the original equation ideal, has exact multidegree , avoids every discarded relevant minimal prime, and is a nonzerodivisor modulo their canonical primary-component intersection. Every such discarded component at stage has dimension at most ; above that threshold, the radicals of the dimension truncations of and agree. At the endpoint, each isolated dimension slice of is contained in the corresponding slice of , and for every open locus and every natural degree vector the radical component sum of is at most that of . The ideals and equations are represented by natural-indexed functions, with conditions only through stage . Zero degree entries and empty equation families are included. This theorem constructs the geometric part of the induction and its radical endpoint comparison; it does not assert either per-cut degree-sum bound or the scheme-theoretic endpoint bound.
import Definitions.Def_PhilipponMultiplicity_SectionThreeSupport set_option autoImplicit false open scoped BigOperators open PhilipponMultiplicity PhilipponMultiplicity.SectionThree open PhilipponMultiplicity.SectionThreeSupport
theorem PhilipponMultiplicity.SectionThreeSupport.exists_descending_cut_chain
{K : Type*} [Field K] (M : MultiProjectiveSpace K)
[Infinite 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) :
let I := I₀ ⊔ Ideal.span (Set.range P)
let a := idealDimension M I₀
∃ J : ℕ → Ideal M.CoordinateRing, ∃ F : ℕ → M.CoordinateRing,
J 0 = I₀ ∧
(∀ t ≤ a, IsMultihomogeneousIdeal M (J t) ∧ I₀ ≤ J t ∧ J t ≤ I ∧
(∀ q ∈ (J t).minimalPrimes,
Hilbert.IsRelevant K M.factorCount M.ambientDimension q →
q ∉ associatedPrimes M.CoordinateRing (M.CoordinateRing ⧸ I) →
idealDimension M q ≤ a - t) ∧
(∀ c, a - t < c →
(dimensionAtLeast M (J t) c).radical = (dimensionAtLeast M I c).radical)) ∧
(∀ t < a, J (t + 1) = J t ⊔ Ideal.span {F t} ∧
F t ∈ Ideal.span (Set.range P) ∧ M.IsHomogeneous (F t) D ∧
(∀ q ∈ (J t).minimalPrimes,
Hilbert.IsRelevant K M.factorCount M.ambientDimension q →
q ∉ associatedPrimes M.CoordinateRing (M.CoordinateRing ⧸ I) → F t ∉ q) ∧
IsRegular (Ideal.Quotient.mk
(⨅ q : {q : Hilbert.MinimalComponent K M.factorCount M.ambientDimension (J t) //
Hilbert.IsRelevant K M.factorCount M.ambientDimension q.1.asIdeal ∧
q.1.asIdeal ∉ associatedPrimes M.CoordinateRing (M.CoordinateRing ⧸ I)},
Hilbert.primaryComponent K M.factorCount M.ambientDimension (J t) q.1.1) (F t))) ∧
(∀ b, dimensionSlice M (J a) b ≤ dimensionSlice M I b) ∧
(∀ (U : MaximalOpenLocus M) (d : M.FactorIndex → ℕ),
componentHilbertSum M I.radical U d ≤ componentHilbertSum M (J a).radical U d) := by sorry