A principal-open family of smooth mixed linear sections
OpenPhilipponMultiplicity.exists_principal_open_smooth_mixed_flag_familyLet be a Philippon base field and the nonempty finite product in the mission's multiprojective model. Let be a nonempty irreducible closed subset, and let with . Let be closed with .
There is an ordered list containing each block exactly times, and a nonzero polynomial in the entries of an -row coefficient matrix, such that every matrix with has the following properties. Define
Coefficients outside the selected block of a row are unused. There are subspaces of codimension for which the mixed section is finite, disjoint from , and consists exactly of the points of where all vanish. At every prime of where each coordinate block has a coordinate outside the prime, the quotient is smooth over .
Formalization Note. A checked proof-sketch reduces this statement to generic finite smooth zero loci for a prescribed block list. The construction of subspaces with the required codimensions and their equality with the equation locus is proved. The remaining geometric input, including comparison with the punctured multicone coordinate ring, remains Open. The formulation is an auxiliary synthesis rather than a verbatim theorem of the cited sources. Empty final sections and zero-length lists are allowed.
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_principal_open_smooth_mixed_flag_family
(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) →
∀ B : Set M.Point, @IsClosed _ M.zariskiTopology B → B ⊆ W →
(W \ B).Nonempty →
∃ l : List M.FactorIndex, (∀ i, l.count i = α i) ∧
∃ F : MvPolynomial (Fin l.length × M.Variable) K, F ≠ 0 ∧
∀ c : Fin l.length → M.Variable → K,
MvPolynomial.eval (Function.uncurry c) F ≠ 0 →
∃ L : ∀ i : M.FactorIndex, Submodule K (Fin (M.ambientDimension i + 1) → K),
(∀ i, Module.finrank K (L i) + α i = M.ambientDimension i + 1) ∧
(linearSlice M W L).Finite ∧ Disjoint (linearSlice M W L) B ∧
(∀ x : M.Point, x ∈ linearSlice M W L ↔ x ∈ W ∧
∀ j : Fin l.length, M.eval (MixedFlag.polynomial M l c j) x = 0) ∧
(∀ q : PrimeSpectrum (M.CoordinateRing ⧸
MixedFlag.ideal M (M.vanishingIdeal W) l c l.length),
(∀ i : M.FactorIndex, ∃ j : Fin (M.ambientDimension i + 1),
Ideal.Quotient.mk (MixedFlag.ideal M (M.vanishingIdeal W) l c l.length)
(MvPolynomial.X ⟨i,j⟩) ∉ q.asIdeal) →
Algebra.IsSmoothAt K q.asIdeal) := by sorry
end PhilipponMultiplicity