Local decomposition and gluing of finite polynomial schemes
ProvedTranscendenceTheory.finite_punctual_ideal_decompositionLet the coefficient field be algebraically closed, let the polynomial ring have finitely many variables, and fix a finite injectively labelled family of points:
The theorem gives both assembly and extraction of ideals supported at these points.
For assembly, suppose each ideal has exactly its assigned point as zero set. Their intersection then has exactly the assigned points as zero set, its quotient is finite-dimensional, and its dimension is the sum of the component dimensions:
Moreover, localization of the intersection at each assigned point equals localization of its component ideal:
Thus the local quotients, and in particular all local multiplicities, are unchanged.
For extraction, let an ideal have finite-dimensional quotient, and suppose all assigned points are among its zeros. There exist larger ideals supported at the individual assigned points, preserving the original localizations, whose total dimension does not exceed the original dimension:
The proof constructs these ideals by adjoining sufficiently high powers of the evaluation ideals. The selected family need not exhaust the original support, so extraction can discard unselected components. Nonradical ideals and an empty index set are included. No uniform bound on the powers, polynomial degrees, or component dimensions is asserted.
import Theorems.Thm_TranscendenceTheory_finite_zero_locus_quotient_geometry import Mathlib.RingTheory.Ideal.Quotient.Operations import Mathlib.RingTheory.Localization.Ideal import Mathlib.LinearAlgebra.Dimension.Constructions import Mathlib.Tactic import Mathlib.RingTheory.LocalRing.Quotient import Mathlib.RingTheory.Localization.Submodule open MvPolynomial
theorem TranscendenceTheory.finite_punctual_ideal_decomposition
(K σ ι : Type*) [Field K] [IsAlgClosed K] [Finite σ] [Fintype ι]
(x : ι → σ → K) (hx : Function.Injective x) :
(∀ J : ι → Ideal (MvPolynomial σ K),
(∀ i, zeroLocus K (J i) = {x i}) →
zeroLocus K (⨅ i, J i) = Set.range x ∧
Module.Finite K (MvPolynomial σ K ⧸ ⨅ i, J i) ∧
Module.finrank K (MvPolynomial σ K ⧸ ⨅ i, J i) =
∑ i, Module.finrank K (MvPolynomial σ K ⧸ J i) ∧
∀ i, (⨅ j, J j).map
(algebraMap (MvPolynomial σ K) (Localization.AtPrime (pointToPoint (k := K) (x i)).asIdeal)) =
(J i).map
(algebraMap (MvPolynomial σ K) (Localization.AtPrime (pointToPoint (k := K) (x i)).asIdeal))) ∧
(∀ I : Ideal (MvPolynomial σ K), Module.Finite K (MvPolynomial σ K ⧸ I) →
(∀ i, x i ∈ zeroLocus K I) →
∃ J : ι → Ideal (MvPolynomial σ K),
(∀ i, I ≤ J i) ∧ (∀ i, zeroLocus K (J i) = {x i}) ∧
(∀ i, (J i).map
(algebraMap (MvPolynomial σ K) (Localization.AtPrime (pointToPoint (k := K) (x i)).asIdeal)) =
I.map
(algebraMap (MvPolynomial σ K) (Localization.AtPrime (pointToPoint (k := K) (x i)).asIdeal))) ∧
(∑ i, Module.finrank K (MvPolynomial σ K ⧸ J i)) ≤
Module.finrank K (MvPolynomial σ K ⧸ I)) := by sorry