Eliminating auxiliary ideals from pure-power multiplicity certificates
ProvedTranscendenceTheory.pure_power_certificate_ideal_eliminationLet K be an algebraically closed field and R = K[x_i : i in σ], with σ finite. Fix a monomial order, nonnegative exponents d_i, and polynomials b_i having unit leading coefficients and pure-power leading exponent vectors d_i e_i. Write J = (b_i).
Then R/J is finite-dimensional, with dimension at most product_i d_i. Its local lengths are finite, and their sum over any finite family of distinct primes is at most the same product.
For every finite label set and prescribed nonnegative integer budgets e_j, the following conditions are equivalent:
- There exists an ideal I containing every b_i, and a distinct prime of R/I for each label, whose local length is at least the corresponding e_j.
- There exists a distinct prime of R/J for each label, whose local length is at least the corresponding e_j.
Thus no separate auxiliary ideal is needed. The equivalence fixes the polynomials, leading exponents, monomial order and label set. It preserves all lower budgets and the exponent-product upper bound. The ideal and selected primes may change, and equality of the individual local lengths is not asserted. Nonradical ideals, zero exponents and empty label sets are included.
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 import Mathlib.RingTheory.Spectrum.Prime.RingHom
theorem TranscendenceTheory.pure_power_certificate_ideal_elimination
(K : Type*) [Field K] [IsAlgClosed K] (σ : Type*) [Fintype σ]
(o : MonomialOrder σ) (d : σ → ℕ) (b : σ → MvPolynomial σ K)
(hu : ∀ i, IsUnit (o.leadingCoeff (b i)))
(hd : ∀ i, o.degree (b i) = Finsupp.single i (d i)) :
let J : Ideal (MvPolynomial σ K) := Ideal.span (Set.range b)
Module.Finite K (MvPolynomial σ K ⧸ J) ∧
Module.finrank K (MvPolynomial σ K ⧸ J) ≤ ∏ i, d i ∧
(∀ p : PrimeSpectrum (MvPolynomial σ K ⧸ J),
Module.length (Localization.AtPrime p.asIdeal)
(Localization.AtPrime p.asIdeal) ≠ ⊤) ∧
(∀ (ι : Type*) [Fintype ι]
(p : ι → PrimeSpectrum (MvPolynomial σ K ⧸ J)), Function.Injective p →
(∑ i, (Module.length (Localization.AtPrime (p i).asIdeal)
(Localization.AtPrime (p i).asIdeal)).toNat) ≤ ∏ i, d i) ∧
∀ (ι : Type*) [Fintype ι] (e : ι → ℕ),
(∃ I : Ideal (MvPolynomial σ K), (∀ i, b i ∈ I) ∧
∃ p : ι → PrimeSpectrum (MvPolynomial σ K ⧸ I),
Function.Injective p ∧ ∀ i, e i ≤
(Module.length (Localization.AtPrime (p i).asIdeal)
(Localization.AtPrime (p i).asIdeal)).toNat) ↔
∃ q : ι → PrimeSpectrum (MvPolynomial σ K ⧸ J),
Function.Injective q ∧ ∀ i, e i ≤
(Module.length (Localization.AtPrime (q i).asIdeal)
(Localization.AtPrime (q i).asIdeal)).toNat := by sorry