Persistence of mixed sections from finite polynomial slices
ProvedPhilipponMultiplicity.exists_open_preserving_finite_polynomial_mixed_slicesLet be a Philippon base field, , and a closed irreducible subset. Choose integers with . Here dimension is the total degree of the actual multigraded quotient Hilbert polynomial. Let list each block exactly times, and write .
For a coefficient array , put
and let be the common zero set of these equations on . Choose initial coefficients and a finite set .
Assume that every has pivot indices , a representative with , a polynomial , and a scalar such that
The ideals from in this display are extended to through constant polynomials. The variables are the original affine coordinates; the additional indeterminate records the inverse of . The quotient retains the actual equations and may contain nilpotents. All choices may depend on , and additional points in this affine equation scheme are allowed.
Let be the polynomial ring on all coefficient entries, and let denote the evaluation maximal ideal at . There exists a Zariski-open subset such that
The injection may choose different points in each fiber. Positive-dimensional components elsewhere in the initial fiber, nonreduced intersections, empty , and an empty equation list are allowed.
Formalization Note. The checked reduction constructs the universal coefficient algebra, proves that its fiber at the initial coefficient point is isomorphic to the finite polynomial quotient in this hypothesis, and proves quasi-finiteness along that fiber. The remaining quasi-finite mixed-family persistence theorem supplies the geometric persistence step. The universal family, its coefficient-fiber identification, and its initial-fiber quasi-finiteness are established in the reduction; dimension/dominance and open-neighborhood persistence remain Open. The argument retains the original equations and their possible nilpotents.
import Mathlib import Definitions.Def_PhilipponMultiplicity_GeometricSupport import Definitions.Def_PhilipponMultiplicity_MixedFlagParameters set_option autoImplicit false open scoped BigOperators Topology
namespace PhilipponMultiplicity
open SectionThree SectionThreeSupport
theorem exists_open_preserving_finite_polynomial_mixed_slices
(K : Type*) [NontriviallyNormedField K] (hK : IsPhilipponBaseField K) :
∀ (M : MultiProjectiveSpace K) (W : Set M.Point),
@IsClosed _ M.zariskiTopology W → @IsIrreducible _ M.zariskiTopology W →
∀ (α : M.FactorIndex → ℕ), (∀ i, α i ≤ M.ambientDimension i) →
(∑ i, α i = locusDimension M W) →
∀ l : List M.FactorIndex, (∀ i, l.count i = α i) →
∀ c₀ : Fin l.length → M.Variable → K,
∀ S : Set M.Point, S.Finite →
S ⊆ {x : M.Point | x ∈ W ∧
∀ j : Fin l.length, M.eval (MixedFlag.polynomial M l c₀ j) x = 0} →
(∀ x ∈ S,
∃ b : ∀ i : M.FactorIndex, Fin (M.ambientDimension i + 1),
∃ v : M.Variable → K, (∀ i, v ⟨i,b i⟩ = 1) ∧
(∀ i : M.FactorIndex, ∃ h : (fun j => v ⟨i,j⟩) ≠ 0,
Projectivization.mk K (fun j => v ⟨i,j⟩) h = x i) ∧
∃ H : M.CoordinateRing, ∃ a : K, MvPolynomial.eval v H * a = 1 ∧
Module.Finite K ((Polynomial M.CoordinateRing) ⧸
(((MixedFlag.ideal M (M.vanishingIdeal W) l c₀ l.length) ⊔
Ideal.span (Set.range (fun i : M.FactorIndex =>
(MvPolynomial.X (⟨i,b i⟩ : M.Variable) : M.CoordinateRing) - 1))).map
Polynomial.C ⊔ Ideal.span {Polynomial.C H * Polynomial.X - 1}))) →
∃ U : Set (PrimeSpectrum (MvPolynomial (Fin l.length × M.Variable) K)),
IsOpen U ∧
(⟨MvPolynomial.vanishingIdeal K {Function.uncurry c₀}, inferInstance⟩ :
PrimeSpectrum (MvPolynomial (Fin l.length × M.Variable) K)) ∈ U ∧
∀ c : Fin l.length → M.Variable → K,
(⟨MvPolynomial.vanishingIdeal K {Function.uncurry c}, inferInstance⟩ :
PrimeSpectrum (MvPolynomial (Fin l.length × M.Variable) K)) ∈ U →
Nonempty (S ↪ {x : M.Point | x ∈ W ∧
∀ j : Fin l.length, M.eval (MixedFlag.polynomial M l c j) x = 0}) := by sorry
end PhilipponMultiplicity