A normalized graph presentation for a nonempty mixed incidence chart
ProvedPhilipponMultiplicity.exists_normalized_mixed_graph_presentationLet be a base field satisfying the mission's Philippon hypotheses, let , and let be a closed irreducible locus of dimension . Choose integers with , and an ordered list containing factor exactly times. Put and let be the set of all homogeneous coordinate indices of . Choose a chart coordinate in each factor and a coordinate polynomial .
Let be the universal mixed incidence ring: its equations are the vanishing ideal of , the generic linear equation in factor for each , the normalizations , and the inverse equation . All coefficient variables indexed by are retained, including those absent from a particular row. Assume is nonzero. Define the distinguished coefficient index and the remaining index set
There exist a finitely generated -algebra which is an integral domain with , and polynomials , such that there is a ring isomorphism
This presentation isolates the geometric chart input needed to eliminate one coefficient per incidence row and compute the dimension of the universal incidence ring. The quotient uses the displayed ideal itself; no radical is taken. The assertion is existential in and in the ring isomorphism, and imposes no compatibility of that isomorphism with the coefficient parameter map.
The checked reduction now constructs the presentation explicitly using
It proves that the substitution maps are inverse for the original incidence ideal, proves finite generation of this ring, and transfers nontriviality from . The outstanding input is refthe domain and dimension of this explicit normalized principal chart. No coefficient elimination or presentation isomorphism remains in that child.
import Mathlib import Definitions.Def_PhilipponMultiplicity_UniversalMixedSlices import Definitions.Def_PhilipponMultiplicity_GeometricSupport import Definitions.Def_PhilipponMultiplicity_MixedFlagParameters set_option autoImplicit false open scoped BigOperators Topology set_option backward.isDefEq.respectTransparency false set_option backward.isDefEq.respectTransparency.types false attribute [local instance] MvPolynomial.algebraMvPolynomial universe u
namespace PhilipponMultiplicity
open SectionThree SectionThreeSupport
theorem exists_normalized_mixed_graph_presentation
(K : Type u) [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) →
∀ b : ∀ i : M.FactorIndex, Fin (M.ambientDimension i + 1),
∀ H : M.CoordinateRing,
Nontrivial (MixedFamily.CoordinateRing M W l b H) →
let F := {t : Fin l.length × M.Variable //
t.2 ≠ (⟨l[t.1], b l[t.1]⟩ : M.Variable)}
∃ (A : Type u) (instA : CommRing A) (algA : Algebra K A),
IsDomain A ∧ Algebra.FiniteType K A ∧
ringKrullDim A = locusDimension M W ∧
∃ g : Fin l.length → MvPolynomial F A,
Nonempty (MixedFamily.CoordinateRing M W l b H ≃+*
(MvPolynomial (Fin l.length ⊕ F) A ⧸
Ideal.span (Set.range (fun j =>
(MvPolynomial.X (Sum.inl j) : MvPolynomial (Fin l.length ⊕ F) A) -
MvPolynomial.rename Sum.inr (g j))))) := by sorry
end PhilipponMultiplicity