Pure-power degree bound for quotient dimension and local multiplicities
ProvedTranscendenceTheory.pure_power_local_multiplicity_boundLet K be an algebraically closed field, let σ be a finite set of variables, and let I be any ideal in K[x_i : i ∈ σ]. Fix a monomial order o and nonnegative integers d_i. Suppose that, for each i, I contains a polynomial b_i with invertible leading coefficient and leading exponent vector d_i e_i.
Then K[x]/I is finite-dimensional over K and
All its prime-localized lengths are finite. For any finite injectively indexed family of primes p_j of this quotient,
Consequently, if each of these local lengths is at least e, then the number of primes multiplied by e is at most the same product.
No radicality assumption is made: nilpotent multiplicities are retained. The b_i need not generate I and need not be declared a Gröbner basis. Zero exponents and an empty variable set are included. The dimension conclusion is proved from the displayed hypotheses, not assumed.
import Mathlib.RingTheory.MvPolynomial.Groebner import Mathlib.RingTheory.Ideal.Quotient.Operations import Mathlib.LinearAlgebra.Dimension.Constructions import Mathlib.RingTheory.Finiteness.Basic import Mathlib.RingTheory.Spectrum.Prime.Noetherian import Mathlib.RingTheory.LocalRing.Length import Mathlib.FieldTheory.IsAlgClosed.Basic
theorem TranscendenceTheory.pure_power_local_multiplicity_bound
(K : Type*) [Field K] [IsAlgClosed K] (σ : Type*) [Fintype σ]
(I : Ideal (MvPolynomial σ K)) (o : MonomialOrder σ)
(d : σ → ℕ) (b : σ → MvPolynomial σ K)
(hb : ∀ i, b i ∈ I)
(hu : ∀ i, IsUnit (o.leadingCoeff (b i)))
(hd : ∀ i, o.degree (b i) = Finsupp.single i (d i)) :
Module.Finite K (MvPolynomial σ K ⧸ I) ∧
Module.finrank K (MvPolynomial σ K ⧸ I) ≤ ∏ i, d i ∧
(∀ p : PrimeSpectrum (MvPolynomial σ K ⧸ I),
Module.length (Localization.AtPrime p.asIdeal)
(Localization.AtPrime p.asIdeal) ≠ ⊤) ∧
∀ (ι : Type*) [Fintype ι]
(p : ι → PrimeSpectrum (MvPolynomial σ K ⧸ I)), Function.Injective p →
(∑ i, (Module.length (Localization.AtPrime (p i).asIdeal)
(Localization.AtPrime (p i).asIdeal)).toNat) ≤ ∏ i, d i ∧
∀ e : ℕ, (∀ i, e ≤ (Module.length (Localization.AtPrime (p i).asIdeal)
(Localization.AtPrime (p i).asIdeal)).toNat) →
Fintype.card ι * e ≤ ∏ i, d i := by sorry