Universal affine mixed-section coefficient algebras
DefinitionPhilipponMultiplicity_UniversalMixedSlicesFor a multiprojective space over a field , write for its homogeneous coordinate polynomial ring. An ordered list of coordinate blocks determines a coefficient ring , with one parameter for every row and every original coordinate .
Given , pivot indices , and , this module defines the polynomial ring and the quotient
The map from is the composite inclusion of constant polynomials. The universal row equations use only the block selected by ; coefficient parameters outside that block remain present and unused in that row. Pivot equations fix one affine representative in each projective factor, while restricts to the principal open where is invertible. The quotient is by the displayed original equations, without taking radicals. The module contains only ring abbreviations, their inherited commutative-ring structures, and these defining expressions; specialization and quasi-finiteness are proved separately.
import Definitions.Def_PhilipponMultiplicity_MixedFlagParameters
import Mathlib
set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false
set_option backward.isDefEq.respectTransparency.types false
open scoped BigOperators
noncomputable section
namespace PhilipponMultiplicity.MixedFamily
variable {K : Type*} [Field K] (M : MultiProjectiveSpace K)
abbrev ParameterRing (l : List M.FactorIndex) :=
MvPolynomial (Fin l.length × M.Variable) K
/-- The affine coordinates of a normalized slice and one inverse variable. -/
abbrev SlicePolynomial := Polynomial M.CoordinateRing
instance : CommRing (SlicePolynomial M) := inferInstanceAs (CommRing (Polynomial M.CoordinateRing))
/-- Coefficient variables over the affine coordinate polynomial ring. -/
abbrev TotalPolynomial (l : List M.FactorIndex) :=
MvPolynomial (Fin l.length × M.Variable) (SlicePolynomial M)
instance (l : List M.FactorIndex) : CommRing (TotalPolynomial M l) :=
inferInstanceAs (CommRing (MvPolynomial (Fin l.length × M.Variable) (SlicePolynomial M)))
def fixed (l : List M.FactorIndex) : M.CoordinateRing →+* TotalPolynomial M l :=
MvPolynomial.C.comp Polynomial.C
def row (l : List M.FactorIndex) (j : Fin l.length) : TotalPolynomial M l :=
∑ t : Fin (M.ambientDimension l[j] + 1),
MvPolynomial.X (j, (⟨l[j],t⟩ : M.Variable)) *
fixed M l (MvPolynomial.X (⟨l[j],t⟩ : M.Variable))
/-- The original equations of the universal mixed slice, including pivot
normalizations and the inverse equation. No radical is taken. -/
def ideal (W : Set M.Point) (l : List M.FactorIndex)
(b : ∀ i : M.FactorIndex, Fin (M.ambientDimension i + 1))
(H : M.CoordinateRing) : Ideal (TotalPolynomial M l) :=
(((M.vanishingIdeal W).map (fixed M l) ⊔
⨆ (j : Fin l.length) (_ : j.val < l.length), Ideal.span {row M l j}) ⊔
(Ideal.span (Set.range (fun i : M.FactorIndex =>
(MvPolynomial.X (⟨i,b i⟩ : M.Variable) : M.CoordinateRing) - 1))).map (fixed M l)) ⊔
Ideal.span {MvPolynomial.C (Polynomial.C H * Polynomial.X - 1)}
abbrev CoordinateRing (W : Set M.Point) (l : List M.FactorIndex)
(b : ∀ i : M.FactorIndex, Fin (M.ambientDimension i + 1))
(H : M.CoordinateRing) := TotalPolynomial M l ⧸ ideal M W l b H
end PhilipponMultiplicity.MixedFamily