Generic mixed equations have a finite smooth zero locus
OpenPhilipponMultiplicity.exists_principal_open_smooth_mixed_zero_locusLet be a Philippon base field, let be the mission's finite multiprojective space, and let be closed and irreducible. Choose with . Let be closed with .
Fix any ordered block list containing each exactly times. For a coefficient matrix , define
and put in the multihomogeneous coordinate ring .
There is a nonzero polynomial in the coefficient entries such that
and is smooth over at every prime at which each coordinate block has a coordinate outside the prime.
This is a generic geometric zero-locus assertion for a prescribed ordering of the equations. It supplies the geometric input for mixed-section constructions. Empty zero sets and zero-length lists are allowed.
Formalization Note. Coefficient rows contain entries from all blocks, but each equation uses only its selected block. The statement does not specify subspaces or their codimensions. Those are reconstructed by a separately checked determinant and kernel argument. The smoothness assertion concerns the punctured affine multicone, retaining one affine scale per projective block. This auxiliary coefficient-space formulation remains Open.
A checked reduction now proves that the smoothness clause follows from smoothness of the actual point-local quotients at ordinary nonzero-block tuples. It uses Hilbert’s Nullstellensatz, the Jacobson property, openness of the smooth locus, and a ground-field-compatible quotient/localization equivalence. The remaining pointwise geometric construction supplies the principal open family and stays Open.
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_zero_locus
(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 →
({x : M.Point | x ∈ W ∧
∀ j : Fin l.length, M.eval (MixedFlag.polynomial M l c j) x = 0}).Finite ∧
Disjoint {x : M.Point | x ∈ W ∧
∀ j : Fin l.length, M.eval (MixedFlag.polynomial M l c j) x = 0} B ∧
(∀ 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