File size: 5,271 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 | import OAI.AlgebraicGeometry.HilbertScheme.Presentations.Normalized.PolynomialTransitions
import OAI.AlgebraicGeometry.HilbertScheme.Presentations.BoundedHilbert.Parameter
import OAI.AlgebraicGeometry.HilbertScheme.Presentations.Grassmannian.FiniteType
/-! # Chart -/
namespace OAI.AlgebraicGeometry.HilbertScheme.Presentations.NormalizedHilbert.Chart.GradedHilbert
noncomputable section
/-! Constructed bounded Hilbert charts inside the actual normalized
Grassmannian charts, with natural representation on all test schemes. -/
open _root_.CategoryTheory _root_.AlgebraicGeometry _root_.MvPolynomial
open OAI.AlgebraicGeometry.HilbertScheme.Presentations.Grassmannian.FiniteType
universe u
variable {ΞΉ : Type u} [Fintype ΞΉ] [DecidableEq ΞΉ] {n N : β}
variable (a : ΞΉ β Homogeneous.CoordinateBasis.GradedHilbert.DegreeIndex.{u} n N) (S : Scheme.{u})
def universalPolynomialGenerators :
Homogeneous.CoordinateBasis.GradedHilbert.DegreeIndex.{u} n N β Hilbert.Polynomial.GradedHilbert.CoordinateRing Ξ((Normalized.Chart.Grassmannian.normalizedChart a S).left, β€) n :=
Normalized.PolynomialGenerators.GradedHilbert.normalizedPolynomialGenerator a (Normalized.Chart.Grassmannian.universalNormalizedMatrix a S)
theorem universalPolynomialGenerators_homogeneous (j : Homogeneous.CoordinateBasis.GradedHilbert.DegreeIndex.{u} n N) :
(universalPolynomialGenerators a S j).IsHomogeneous N :=
Normalized.PolynomialGenerators.GradedHilbert.normalizedPolynomialGenerator_homogeneous a (Normalized.Chart.Grassmannian.universalNormalizedMatrix a S) j
def normalizedHilbertChartSubfunctor (q : β β β) : Subfunctor (yoneda.obj (Normalized.Chart.Grassmannian.normalizedChart a S)) :=
BoundedHilbert.DegreeLocus.GradedHilbert.boundedHilbertDegreeSubfunctor (Normalized.Chart.Grassmannian.normalizedChart a S) (universalPolynomialGenerators a S) N
(universalPolynomialGenerators_homogeneous a S) q
structure NormalizedHilbertChartModel (q : β β β) where
carrier : Over S
inclusion : carrier βΆ Normalized.Chart.Grassmannian.normalizedChart a S
immersion : IsImmersion inclusion.left
quasiCompact : QuasiCompact inclusion.left
representation : yoneda.obj carrier β
(normalizedHilbertChartSubfunctor a S q).toFunctor
compatibility : representation.hom β« (normalizedHilbertChartSubfunctor a S q).ΞΉ = yoneda.map inclusion
def normalizedHilbertChartModel (q : β β β) : NormalizedHilbertChartModel a S q := by
apply Classical.choice
obtain β¨Z, j, hj, hqc, e, heβ© := BoundedHilbert.DegreeLocus.GradedHilbert.bounded_hilbert_degree_locus (Normalized.Chart.Grassmannian.normalizedChart a S)
(universalPolynomialGenerators a S) N (universalPolynomialGenerators_homogeneous a S) q
exact β¨β¨Z, j, hj, hqc, e, heβ©β©
def normalizedHilbertChart (q : β β β) : Over S := (normalizedHilbertChartModel a S q).carrier
def normalizedHilbertChartInclusion (q : β β β) :
normalizedHilbertChart a S q βΆ Normalized.Chart.Grassmannian.normalizedChart a S := (normalizedHilbertChartModel a S q).inclusion
instance normalizedHilbertChartInclusion_isImmersion (q : β β β) :
IsImmersion (normalizedHilbertChartInclusion a S q).left :=
(normalizedHilbertChartModel a S q).immersion
instance normalizedHilbertChartInclusion_quasiCompact (q : β β β) :
QuasiCompact (normalizedHilbertChartInclusion a S q).left :=
(normalizedHilbertChartModel a S q).quasiCompact
instance normalizedHilbertChartInclusion_mono (q : β β β) :
Mono (normalizedHilbertChartInclusion a S q) :=
Over.mono_of_mono_left _
def normalizedHilbertChartRepresentation (q : β β β) :
yoneda.obj (normalizedHilbertChart a S q) β
(normalizedHilbertChartSubfunctor a S q).toFunctor :=
(normalizedHilbertChartModel a S q).representation
theorem normalizedHilbertChartRepresentation_inclusion (q : β β β) :
(normalizedHilbertChartRepresentation a S q).hom β« (normalizedHilbertChartSubfunctor a S q).ΞΉ =
yoneda.map (normalizedHilbertChartInclusion a S q) :=
(normalizedHilbertChartModel a S q).compatibility
theorem normalizedHilbertChart_universal_mem (q : β β β) :
normalizedHilbertChartInclusion a S q β
(normalizedHilbertChartSubfunctor a S q).obj (.op (normalizedHilbertChart a S q)) :=
(SubfunctorRepresentations.represented_subfunctor_mem _ _ (normalizedHilbertChartRepresentation a S q)
(normalizedHilbertChartRepresentation_inclusion a S q) _ _).mpr
β¨π _, Category.id_comp _β©
theorem normalizedHilbertChart_factorization_iff (q : β β β) {T : Over S}
(x : T βΆ Normalized.Chart.Grassmannian.normalizedChart a S) :
x β (normalizedHilbertChartSubfunctor a S q).obj (.op T) β
β! y : T βΆ normalizedHilbertChart a S q, y β« normalizedHilbertChartInclusion a S q = x := by
rw [SubfunctorRepresentations.represented_subfunctor_mem _ _ (normalizedHilbertChartRepresentation a S q)
(normalizedHilbertChartRepresentation_inclusion a S q)]
constructor
Β· rintro β¨y, hyβ©
exact β¨y, hy, fun z hz => (cancel_mono _).mp (hz.trans hy.symm)β©
Β· rintro β¨y, hy, _β©
exact β¨y, hyβ©
end
end OAI.AlgebraicGeometry.HilbertScheme.Presentations.NormalizedHilbert.Chart.GradedHilbert
|