File size: 4,418 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
import OAI.AlgebraicGeometry.PELModuli.IntegralModel.Picard.DisjointOpenGluing
import OAI.AlgebraicGeometry.Isogenies.NeighborCounting.FramedPullback
import OAI.AlgebraicGeometry.Picard.PoincareBundle.IsoDescent

/-! # Open Immersion Gluing -/

namespace OAI.AlgebraicGeometry.PELModuli.IntegralModel.Picard.OpenImmersionGluing.PicardOpenImmersionGluing

noncomputable section

/-! Checked import adaptation of `/Proofs/OpenImmersionGluing.lean`; original.
Only imports and namespaces change. -/

/-! Gluing along disjoint open immersions, retaining their given source
schemes and the exact pullback isomorphisms. -/

open _root_.CategoryTheory _root_.AlgebraicGeometry

universe u

open OAI.AlgebraicGeometry.Isogenies.NeighborCounting.FramedPullback OAI.AlgebraicGeometry.PELModuli.IntegralModel.Picard.DisjointOpenGluing.PicardDisjointOpenGluing

theorem pullbackHomTo_map {X Y Z : Scheme.{u}} (f : X ⟶ Y) (g : Y ⟶ Z)
    (p : X ⟶ Z) (h : f ≫ g = p) {M N : Z.Modules} (q : M ⟶ N) :
    Isogenies.NeighborCounting.FramedPullback.pullbackHomTo f g p h ((Scheme.Modules.pullback g).map q) =
      (Scheme.Modules.pullback p).map q := by
  let c := Scheme.Modules.pullbackComp f g ≪≫ Scheme.Modules.pullbackCongr h
  have hn := c.hom.naturality q
  exact (congrArg (fun a ↦ (c.app M).inv ≫ a) hn).trans ((c.app M).inv_hom_id_assoc _)

theorem pullbackHomTo_injective {X Y Z : Scheme.{u}} (f : X ⟶ Y) (g : Y ⟶ Z)
    (p : X ⟶ Z) (h : f ≫ g = p) {M N : Z.Modules}
    [(Scheme.Modules.pullback f).Faithful] :
    Function.Injective (Isogenies.NeighborCounting.FramedPullback.pullbackHomTo (M := M) (N := N) f g p h) := by
  intro a b hab
  apply (Scheme.Modules.pullback f).map_injective
  let c := Scheme.Modules.pullbackComp f g ≪≫ Scheme.Modules.pullbackCongr h
  exact ((c.app M).homCongr (c.app N)).injective hab

variable {X Y : Scheme.{u}} {M N : Y.Modules} (f : X ⟶ Y) [IsOpenImmersion f]

def isoOnRange (e : (Scheme.Modules.pullback f).obj M ≅ (Scheme.Modules.pullback f).obj N) :
    (Scheme.Modules.pullback f.opensRange.ι).obj M ≅ (Scheme.Modules.pullback f.opensRange.ι).obj N :=
  Isogenies.NeighborCounting.FramedPullback.pullbackIsoTo f.isoOpensRange.inv f f.opensRange.ι f.isoOpensRange_inv_comp e

theorem isoOnRange_mapIso (d : M ≅ N) :
    isoOnRange f ((Scheme.Modules.pullback f).mapIso d) =
      (Scheme.Modules.pullback f.opensRange.ι).mapIso d := by
  apply Iso.ext
  exact (Isogenies.NeighborCounting.FramedPullback.pullbackIsoTo_hom f.isoOpensRange.inv f f.opensRange.ι f.isoOpensRange_inv_comp
    ((Scheme.Modules.pullback f).mapIso d)).trans
      (pullbackHomTo_map f.isoOpensRange.inv f f.opensRange.ι f.isoOpensRange_inv_comp d.hom)

theorem isoOnRange_injective : Function.Injective (isoOnRange (M := M) (N := N) f) := by
  intro e d hed
  have : (Scheme.Modules.pullback f.isoOpensRange.inv).IsEquivalence :=
    Picard.PoincareBundle.IsoDescent.pullback_isEquivalence f.isoOpensRange.symm
  apply Iso.ext
  apply pullbackHomTo_injective f.isoOpensRange.inv f f.opensRange.ι f.isoOpensRange_inv_comp
  exact (Isogenies.NeighborCounting.FramedPullback.pullbackIsoTo_hom f.isoOpensRange.inv f f.opensRange.ι f.isoOpensRange_inv_comp e).symm.trans
    ((congrArg Iso.hom hed).trans
      (Isogenies.NeighborCounting.FramedPullback.pullbackIsoTo_hom f.isoOpensRange.inv f f.opensRange.ι f.isoOpensRange_inv_comp d))

omit f [IsOpenImmersion f] in
theorem existsUnique_disjoint_immersion_iso {ι : Type*} (T : ι → Scheme.{u}) (a : ∀ i, T i ⟶ Y)
    [∀ i, IsOpenImmersion (a i)]
    (hU : (⊤ : Y.Opens) ≤ ⨆ i, (a i).opensRange)
    (hd : Pairwise (fun i j ↦ Disjoint (a i).opensRange (a j).opensRange))
    (e : ∀ i, (Scheme.Modules.pullback (a i)).obj M ≅ (Scheme.Modules.pullback (a i)).obj N) :
    ∃! d : M ≅ N, ∀ i, (Scheme.Modules.pullback (a i)).mapIso d = e i := by
  obtain ⟨d, hd, hu⟩ := DisjointOpenGluing.PicardDisjointOpenGluing.existsUnique_disjoint_iso M N (fun i ↦ (a i).opensRange) hU hd
    (fun i ↦ isoOnRange (a i) (e i))
  refine ⟨d, ?_, ?_⟩
  · intro i
    apply isoOnRange_injective (a i)
    exact (isoOnRange_mapIso (a i) d).trans (hd i)
  · intro d' hd'
    apply hu
    intro i
    exact (isoOnRange_mapIso (a i) d').symm.trans (congrArg (isoOnRange (a i)) (hd' i))

end

end OAI.AlgebraicGeometry.PELModuli.IntegralModel.Picard.OpenImmersionGluing.PicardOpenImmersionGluing