Smooth integral projective covers of arbitrary monomial nodes
ProvedMvPolynomial.CrossingQuotient.exists_smooth_integral_projective_cover_of_monomialLet be a commutative integral domain, let be a finite set of variables, and let be nonnegative integer exponents. Set
There exist an integral scheme and a proper surjective morphism such that the composite of with the original coefficient structure map to is smooth. This same covering morphism is projective: for some integer there is a closed immersion
Moreover the complete restriction over is an isomorphism:
Zero exponents, the unit monomial and the empty variable set are included. No field, characteristic, perfectness, noetherianity or regularity assumption on is imposed.
This gives a projective cover of the affine polynomial monomial-node model with smooth integral source. Compatible modifications on overlapping etale charts and alterations of arbitrary global families remain additional assertions.
import Mathlib import Definitions.Def_MvPolynomial_CrossingResolution import Definitions.Def_AlgebraicGeometry_ProjSpace set_option autoImplicit false set_option backward.isDefEq.respectTransparency.types false open AlgebraicGeometry CategoryTheory CategoryTheory.Limits open MvPolynomial MvPolynomial.CrossingQuotient attribute [local instance] MvPolynomial.gradedAlgebra universe u
theorem MvPolynomial.CrossingQuotient.exists_smooth_integral_projective_cover_of_monomial
(K : Type u) [CommRing K] [IsDomain K] (σ : Type u) [Finite σ] (d : σ →₀ ℕ) :
let R := MvPolynomial σ K
let c : R := MvPolynomial.monomial d 1
∃ (Y : Scheme.{u}) (q : Y ⟶ Spec (.of (CrossingQuotient R c))),
IsIntegral Y ∧ IsProper q ∧ Surjective q ∧
Smooth (q ≫ Spec.map (CommRingCat.ofHom
((algebraMap R (CrossingQuotient R c)).comp (MvPolynomial.C : K →+* R)))) ∧
IsIso (q ∣_ PrimeSpectrum.basicOpen (U c)) ∧
∃ (N : ℕ) (j : Y ⟶ Proj (@MvPolynomial.homogeneousSubmodule (Fin (N + 1))
(CrossingQuotient R c) (@CommRing.toCommSemiring (CrossingQuotient R c) inferInstance))),
IsClosedImmersion j ∧ j ≫ ProjSpace.π (CrossingQuotient R c) N = q := by sorry