Generic normalized mixed sections have full-rank pointwise Jacobians
ProvedPhilipponMultiplicity.exists_principal_open_transverse_normalized_mixed_sectionsLet be a Philippon base field, , and a closed irreducible subset. Choose integers with , where dimension is the total degree of the actual quotient Hilbert polynomial. Let be closed with . Let be an ordered list containing each block exactly times.
For a coefficient array , write for its block-linear cutting rows, , and for their common zero set in . There exists a nonzero polynomial in the coefficient entries such that implies and the following pointwise Jacobian condition. For every pivot choice , put
At every common zero of this ideal, where , there exist polynomials such that
Equivalently, their gradients form a basis of . The equations may depend on the chart, coefficients, and point; they need not generate the ideal. All variables, including the normalized pivots, occur in this square Jacobian. Empty charts and zero-length cutting lists are allowed.
Formalization Note. This is an auxiliary affine formulation of generic transverse mixed sections, motivated by the cited geometric results, not a verbatim statement. The unproved work includes avoiding the singular locus and prescribed boundary, generic transversality, the Hilbert-polynomial dimension comparison, the relation between the concrete normalized ideals and projective intersections, and a nonzero principal-open condition in coefficient space. Neither finiteness nor radicality is assumed here: the parent reduction proves both from the displayed pointwise condition. Coefficients outside a row's selected block remain unused.
Verified generic-fibre reduction (8 October 2026). It suffices to establish Jacobian and boundary unit-ideal certificates over the coefficient function field. The new proof clears denominators in a finite family of generic unit ideals and multiplies the resulting nonzero coefficients to obtain one principal-open condition. It verifies specialization of the universal cutting rows and Jacobian determinants, derives full rank at every common zero, and proves boundary avoidance by normalizing projective representatives. The new child contains no principal-open assumption. Generic transversality and its concrete coefficient-field and normalized-ideal comparisons remain Open; the original formal statement is unchanged.
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_transverse_normalized_mixed_sections
(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 →
Disjoint {x : M.Point | x ∈ W ∧
∀ j : Fin l.length, M.eval (MixedFlag.polynomial M l c j) x = 0} B ∧
(∀ b : ∀ i : M.FactorIndex, Fin (M.ambientDimension i + 1),
let J := 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))
∀ a : M.Variable → K, (∀ P ∈ J, MvPolynomial.eval a P = 0) →
∃ Q : M.Variable → M.CoordinateRing, (∀ i, Q i ∈ J) ∧
MvPolynomial.eval a
(Matrix.of (fun i j => MvPolynomial.pderiv j (Q i))).det ≠ 0) := by sorry
end PhilipponMultiplicity