File size: 4,919 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 | import OAI.AlgebraicGeometry.HilbertScheme.Presentations.NormalizedHilbert.OverlapCriterion
/-! # Open Overlap -/
namespace OAI.AlgebraicGeometry.HilbertScheme.Presentations.NormalizedHilbert.OpenOverlap.GradedHilbert
noncomputable section
/-! Open overlaps of the constructed Hilbert charts, obtained by pulling
back the actual Grassmannian determinant opens. -/
open _root_.CategoryTheory _root_.CategoryTheory.Limits _root_.AlgebraicGeometry
universe u
variable {ι : Type u} [Fintype ι] [DecidableEq ι] {n N : ℕ}
variable (a b : ι → Homogeneous.CoordinateBasis.GradedHilbert.DegreeIndex.{u} n N) (S : Scheme.{u}) (q : ℕ → ℕ)
def normalizedHilbertChartParameter :
Chart.GradedHilbert.normalizedHilbertChart a S q ⟶ Grassmannian.Gluing.grassmannianOver (ι := ι) (ν := Homogeneous.CoordinateBasis.GradedHilbert.DegreeIndex.{u} n N) S :=
Chart.GradedHilbert.normalizedHilbertChartInclusion a S q ≫ Grassmannian.Gluing.grassmannianChartOverMap a S
instance normalizedHilbertChartParameter_mono : Mono (normalizedHilbertChartParameter a S q) := by
have : Mono (Grassmannian.Gluing.grassmannianChartOverMap a S).left := inferInstanceAs (Mono (Grassmannian.Gluing.grassmannianChartMap a S))
have : Mono (Grassmannian.Gluing.grassmannianChartOverMap a S) := Over.mono_of_mono_left _
exact inferInstanceAs (Mono (Chart.GradedHilbert.normalizedHilbertChartInclusion a S q ≫ Grassmannian.Gluing.grassmannianChartOverMap a S))
theorem normalizedGrassmannianOverlap_isPullback_over :
IsPullback (Normalized.Overlap.Grassmannian.normalizedOverlapInclusion a b S)
((Normalized.Overlap.Grassmannian.normalizedOverlapTransition a b S).hom ≫ Normalized.Overlap.Grassmannian.normalizedOverlapInclusion b a S)
(Grassmannian.Gluing.grassmannianChartOverMap a S) (Grassmannian.Gluing.grassmannianChartOverMap b S) := by
apply IsPullback.of_map_of_faithful (Over.forget S)
exact Grassmannian.Gluing.grassmannianChart_intersection_isPullback a b S
def normalizedHilbertOpenOverlap : Over S :=
pullback (Chart.GradedHilbert.normalizedHilbertChartInclusion a S q) (Normalized.Overlap.Grassmannian.normalizedOverlapInclusion a b S)
def normalizedHilbertOpenOverlapInclusion :
normalizedHilbertOpenOverlap a b S q ⟶ Chart.GradedHilbert.normalizedHilbertChart a S q := pullback.fst _ _
def normalizedHilbertOpenOverlapAmbient :
normalizedHilbertOpenOverlap a b S q ⟶ Normalized.Overlap.Grassmannian.normalizedChartOverlap a b S := pullback.snd _ _
theorem normalizedHilbertOpenOverlap_condition :
normalizedHilbertOpenOverlapInclusion a b S q ≫ Chart.GradedHilbert.normalizedHilbertChartInclusion a S q =
normalizedHilbertOpenOverlapAmbient a b S q ≫ Normalized.Overlap.Grassmannian.normalizedOverlapInclusion a b S := pullback.condition
instance normalizedHilbertOpenOverlapInclusion_isOpenImmersion :
IsOpenImmersion (normalizedHilbertOpenOverlapInclusion a b S q).left := by
have hp := (IsPullback.of_hasPullback (Chart.GradedHilbert.normalizedHilbertChartInclusion a S q)
(Normalized.Overlap.Grassmannian.normalizedOverlapInclusion a b S)).map (Over.forget S)
exact MorphismProperty.of_isPullback hp.flip (Normalized.Overlap.Grassmannian.normalizedOverlapInclusion_isOpenImmersion a b S)
theorem normalizedHilbertOpenOverlap_second_mem :
normalizedHilbertOpenOverlapAmbient a b S q ≫ (Normalized.Overlap.Grassmannian.normalizedOverlapTransition a b S).hom ≫
Normalized.Overlap.Grassmannian.normalizedOverlapInclusion b a S ∈
(Chart.GradedHilbert.normalizedHilbertChartSubfunctor b S q).obj (.op (normalizedHilbertOpenOverlap a b S q)) := by
apply (OverlapCriterion.GradedHilbert.normalizedHilbertChart_overlap_mem_iff a b S q _).mp
rw [← normalizedHilbertOpenOverlap_condition]
exact (Chart.GradedHilbert.normalizedHilbertChartSubfunctor a S q).map
(normalizedHilbertOpenOverlapInclusion a b S q).op (Chart.GradedHilbert.normalizedHilbertChart_universal_mem a S q)
def normalizedHilbertOpenOverlapToSecond :
normalizedHilbertOpenOverlap a b S q ⟶ Chart.GradedHilbert.normalizedHilbertChart b S q :=
Classical.choose ((Chart.GradedHilbert.normalizedHilbertChart_factorization_iff b S q _).mp
(normalizedHilbertOpenOverlap_second_mem a b S q))
theorem normalizedHilbertOpenOverlapToSecond_inclusion :
normalizedHilbertOpenOverlapToSecond a b S q ≫ Chart.GradedHilbert.normalizedHilbertChartInclusion b S q =
normalizedHilbertOpenOverlapAmbient a b S q ≫ (Normalized.Overlap.Grassmannian.normalizedOverlapTransition a b S).hom ≫
Normalized.Overlap.Grassmannian.normalizedOverlapInclusion b a S :=
(Classical.choose_spec ((Chart.GradedHilbert.normalizedHilbertChart_factorization_iff b S q _).mp
(normalizedHilbertOpenOverlap_second_mem a b S q))).1
end
end OAI.AlgebraicGeometry.HilbertScheme.Presentations.NormalizedHilbert.OpenOverlap.GradedHilbert
|