Generic localized length counts prime-filtration factors
ProvedPhilipponMultiplicity.Hilbert.localLength_eq_filtration_countalgebraic-geometrycommutative-algebra
Let be a finite cyclic filtration with and each prime. At every actual minimal prime over , the actual generic length is the number of indices with . The length is the existing localized module-length definition, converted to a natural number; no multiplicity is supplied as data.
Preamble
import Definitions.Def_PhilipponMultiplicity_SectionThree set_option autoImplicit false open scoped BigOperators open MvPolynomial PhilipponMultiplicity PhilipponMultiplicity.SectionThree open PhilipponMultiplicity.Hilbert
Formal statement
theorem PhilipponMultiplicity.Hilbert.localLength_eq_filtration_count
{K : Type*} [Field K] (M : MultiProjectiveSpace K) (I : Ideal M.CoordinateRing) (n : ℕ)
(J : Fin (n + 1) → Ideal M.CoordinateRing) (P : Fin n → M.CoordinateRing)
(hfirst : J 0 = I) (hlast : J (Fin.last n) = ⊤)
(hstep : ∀ j, J j.succ = J j.castSucc ⊔ Ideal.span {P j})
(hprime : ∀ j, ((J j.castSucc).colon {P j}).IsPrime)
(q : PrimeSpectrum M.CoordinateRing) (hq : q.asIdeal ∈ I.minimalPrimes) :
(localLength K M.factorCount M.ambientDimension I q).toNat =
∑ j, if (J j.castSucc).colon {P j} = q.asIdeal then 1 else 0 := by sorrySource
Supporting commutative algebra for Philippon (1986), Lemmes de zéros dans les groupes algébriques commutatifs, §3, Lemma 3.2, printed p. 364, https://www.numdam.org/articles/10.24033/bsmf.2060/. Philippon refers to the classical homogeneous argument and van der Waerden (1928), Theorem 8 p. 758 and §32 p. 767. This is a proved intermediate step of that associativity argument, not an additional numbered assertion in Philippon.