File size: 9,862 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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
import OAI.AlgebraicGeometry.Resolution.Blowups.ControlPrefix.FixedLabels
import OAI.AlgebraicGeometry.Resolution.Blowups.ControlPrefix.Composition

/-! # Center Comparison -/

namespace OAI.AlgebraicGeometry.Resolution.Blowups

noncomputable section

section

/-! Étale comparison of actual prefixes records the map at each step and the specified endpoint map. -/

open _root_.CategoryTheory _root_.AlgebraicGeometry

def Smooth.ControlPrefix.Construction.SmoothControlPrefix.EtaleComparison {b : ℕ} {X Y : Scheme} {f : X ⟶ Foundations.Scheme.ProjectiveSpace.complexBase} {g : Y ⟶ Foundations.Scheme.ProjectiveSpace.complexBase}
    {J : X.IdealSheafData} {K : Y.IdealSheafData} (P : Smooth.ControlPrefix.Construction.SmoothControlPrefix b X f J Y g K) :
    ∀ {V W : Scheme} {h : V ⟶ Foundations.Scheme.ProjectiveSpace.complexBase} {k : W ⟶ Foundations.Scheme.ProjectiveSpace.complexBase}
      {L : V.IdealSheafData} {M : W.IdealSheafData},
      Smooth.ControlPrefix.Construction.SmoothControlPrefix b V h L W k M → (V ⟶ X) → (W ⟶ Y) → Prop := by
  induction P with
  | @stop X f hf J =>
      intro V W h k L M Q q r
      cases Q with
      | stop => exact Etale q ∧ q ≫ f = h ∧ J.comap q = L ∧ r = q
      | blowup => exact False
  | @blowup X hX hNX f J I hI hb hp hs hbl Y g K tail ih =>
      intro V W h k L M Q q r
      cases Q with
      | stop => exact False
      | blowup C hC hbC hpC hsC hblC rest =>
          exact Etale q ∧ q ≫ f = h ∧ J.comap q = L ∧
            ∃ he : I.comap q = C, ih rest (GlobalBlowup.SpecifiedMap.Construction.globalBlowupMapTo q I C he hI hC) r

theorem Smooth.ControlPrefix.Construction.SmoothControlPrefix.EtaleComparison.stepCount_eq
    {b : ℕ} {X Y : Scheme} {f : X ⟶ Foundations.Scheme.ProjectiveSpace.complexBase} {g : Y ⟶ Foundations.Scheme.ProjectiveSpace.complexBase}
    {J : X.IdealSheafData} {K : Y.IdealSheafData} (P : Smooth.ControlPrefix.Construction.SmoothControlPrefix b X f J Y g K) :
    ∀ {V W : Scheme} {h : V ⟶ Foundations.Scheme.ProjectiveSpace.complexBase} {k : W ⟶ Foundations.Scheme.ProjectiveSpace.complexBase}
      {L : V.IdealSheafData} {M : W.IdealSheafData}
      (Q : Smooth.ControlPrefix.Construction.SmoothControlPrefix b V h L W k M) (q : V ⟶ X) (r : W ⟶ Y),
      P.EtaleComparison Q q r → P.stepCount = Q.stepCount := by
  induction P with
  | stop =>
      intro V W h k L M Q q r hc
      cases Q with
      | stop => rfl
      | blowup => exact False.elim hc
  | blowup I hI hb hp hs hbl tail ih =>
      intro V W h k L M Q q r hc
      cases Q with
      | stop => exact False.elim hc
      | blowup C hC hbC hpC hsC hblC rest =>
          obtain ⟨_, _, _, he, ht⟩ := hc
          exact congrArg (fun a : ℕ => a + 1) (ih rest _ r ht)

theorem Smooth.ControlPrefix.Construction.SmoothControlPrefix.EtaleComparison.endpoint_pullback
    {b : ℕ} {X Y : Scheme} {f : X ⟶ Foundations.Scheme.ProjectiveSpace.complexBase} {g : Y ⟶ Foundations.Scheme.ProjectiveSpace.complexBase}
    {J : X.IdealSheafData} {K : Y.IdealSheafData} (P : Smooth.ControlPrefix.Construction.SmoothControlPrefix b X f J Y g K) :
    ∀ {V W : Scheme} {h : V ⟶ Foundations.Scheme.ProjectiveSpace.complexBase} {k : W ⟶ Foundations.Scheme.ProjectiveSpace.complexBase}
      {L : V.IdealSheafData} {M : W.IdealSheafData}
      (Q : Smooth.ControlPrefix.Construction.SmoothControlPrefix b V h L W k M) (q : V ⟶ X) (r : W ⟶ Y),
      P.EtaleComparison Q q r → Etale r ∧ IsPullback r Q.toBase P.toBase q ∧ K.comap r = M := by
  induction P with
  | stop =>
      intro V W h k L M Q q r hc
      cases Q with
      | stop =>
          obtain ⟨hq, _, hJ, hr⟩ := hc
          subst r
          exact ⟨hq, IsPullback.id_vert q, hJ⟩
      | blowup => exact False.elim hc
  | blowup I hI hb hp hs hbl tail ih =>
      intro V W h k L M Q q r hc
      cases Q with
      | stop => exact False.elim hc
      | blowup C hC hbC hpC hsC hblC rest =>
          obtain ⟨hq, _, _, he, ht⟩ := hc
          let : Etale q := hq
          obtain ⟨hr, hpb, hK⟩ := ih rest _ r ht
          exact ⟨hr, hpb.paste_vert (GlobalBlowup.EtalePullback.Construction.globalBlowupMapTo_etale_isPullback q I C he hI hC), hK⟩

theorem Smooth.ControlPrefix.Construction.SmoothControlPrefix.EtaleComparison.append
    {b : ℕ} {X Y : Scheme} {f : X ⟶ Foundations.Scheme.ProjectiveSpace.complexBase} {g : Y ⟶ Foundations.Scheme.ProjectiveSpace.complexBase}
    {J : X.IdealSheafData} {K : Y.IdealSheafData} (P : Smooth.ControlPrefix.Construction.SmoothControlPrefix b X f J Y g K) :
    ∀ {V W : Scheme} {h : V ⟶ Foundations.Scheme.ProjectiveSpace.complexBase} {k : W ⟶ Foundations.Scheme.ProjectiveSpace.complexBase}
      {L : V.IdealSheafData} {M : W.IdealSheafData}
      (Q : Smooth.ControlPrefix.Construction.SmoothControlPrefix b V h L W k M) (q : V ⟶ X) (r : W ⟶ Y),
      P.EtaleComparison Q q r →
      ∀ {Z U : Scheme} {a : Z ⟶ Foundations.Scheme.ProjectiveSpace.complexBase} {c : U ⟶ Foundations.Scheme.ProjectiveSpace.complexBase}
        {B : Z.IdealSheafData} {C : U.IdealSheafData}
        (T : Smooth.ControlPrefix.Construction.SmoothControlPrefix b Y g K Z a B) (S : Smooth.ControlPrefix.Construction.SmoothControlPrefix b W k M U c C) (s : U ⟶ Z),
        T.EtaleComparison S r s → (P.append T).EtaleComparison (Q.append S) q s := by
  induction P with
  | stop =>
      intro V W h k L M Q q r hc Z U a c B C T S s ht
      cases Q with
      | stop =>
          obtain ⟨_, _, _, rfl⟩ := hc
          exact ht
      | blowup => exact False.elim hc
  | blowup I hI hb hp hs hbl tail ih =>
      intro V W h k L M Q q r hc Z U a c B C T S s ht
      cases Q with
      | stop => exact False.elim hc
      | blowup C hC hbC hpC hsC hblC rest =>
          obtain ⟨hq, hg, hJ, he, htail⟩ := hc
          exact ⟨hq, hg, hJ, he, ih rest _ r htail T S s ht⟩

end

/-! Prefixes following the same pulled-back center list form actual étale base-change squares. -/

open _root_.CategoryTheory _root_.AlgebraicGeometry

theorem Smooth.ControlPrefix.Construction.SmoothControlPrefix.exists_etaleComparison_of_followsCenters
    {b : ℕ} {X Y : Scheme} {f : X ⟶ Foundations.Scheme.ProjectiveSpace.complexBase} {g : Y ⟶ Foundations.Scheme.ProjectiveSpace.complexBase}
    {J : X.IdealSheafData} {K : Y.IdealSheafData} (P : Smooth.ControlPrefix.Construction.SmoothControlPrefix b X f J Y g K) :
    ∀ centers : List X.IdealSheafData, P.followsCenters centers →
      ∀ {V W : Scheme} {h : V ⟶ Foundations.Scheme.ProjectiveSpace.complexBase} {k : W ⟶ Foundations.Scheme.ProjectiveSpace.complexBase}
        {L : V.IdealSheafData} {M : W.IdealSheafData}
        (Q : Smooth.ControlPrefix.Construction.SmoothControlPrefix b V h L W k M) (q : V ⟶ X) [Etale q],
        q ≫ f = h → J.comap q = L → Q.followsCenters (centers.map (fun C => C.comap q)) →
        ∃ r : W ⟶ Y, P.EtaleComparison Q q r := by
  induction P with
  | stop =>
      intro centers hcenters V W h k L M Q q hq hstructure hJ hQ
      change centers = [] at hcenters
      subst centers
      cases Q with
      | stop => exact ⟨q, hq, hstructure, hJ, rfl⟩
      | blowup C hC hb hp hs hbl rest =>
          obtain ⟨cs, he, _⟩ := hQ
          cases he
  | @blowup X hX hNX f J I hI hb hp hs hbl Y g K tail ih =>
      intro centers hcenters V W h k L M Q q hq hstructure hJ hQ
      obtain ⟨cs, rfl, hcs⟩ := hcenters
      cases Q with
      | stop =>
          change (I :: cs).map (fun C => C.comap q) = [] at hQ
          cases hQ
      | blowup C hC hbC hpC hsC hblC rest =>
          obtain ⟨ds, he, hds⟩ := hQ
          change I.comap q :: cs.map (fun B => B.comap q) = C :: ds at he
          have hcenter : I.comap q = C := (List.cons.inj he).1
          have hlist : cs.map (fun B => B.comap q) = ds := (List.cons.inj he).2
          subst ds
          let q' := GlobalBlowup.SpecifiedMap.Construction.globalBlowupMapTo q I C hcenter hI hC
          let : Etale q' := GlobalBlowup.EtaleMap.Construction.globalBlowupMapTo_etale q I C hcenter hI hC
          have hover : q' ≫ (GlobalBlowup.Data.Construction.globalBlowupToBase I hI ≫ f) = GlobalBlowup.Data.Construction.globalBlowupToBase C hC ≫ h := by
            rw [← Category.assoc, GlobalBlowup.SpecifiedMap.Construction.globalBlowupMapTo_over, Category.assoc, hstructure]
          have hJ' : (GlobalControlled.Ideal.Construction.globalBlowupControlledIdeal I J hI b).comap q' =
              GlobalControlled.Ideal.Construction.globalBlowupControlledIdeal C L hC b := by
            rw [GlobalBlowup.EtaleBoundary.Construction.globalBlowupMapTo_controlledIdeal_etale q I J C hcenter hI hC b, hJ]
          have hmaps : (cs.map (fun B => B.comap (GlobalBlowup.Data.Construction.globalBlowupToBase I hI))).map (fun B => B.comap q') =
              (cs.map (fun B => B.comap q)).map (fun B => B.comap (GlobalBlowup.Data.Construction.globalBlowupToBase C hC)) := by
            rw [List.map_map, List.map_map]
            apply List.map_congr_left
            intro B _
            change (B.comap (GlobalBlowup.Data.Construction.globalBlowupToBase I hI)).comap q' =
              (B.comap q).comap (GlobalBlowup.Data.Construction.globalBlowupToBase C hC)
            rw [← Scheme.IdealSheafData.comap_comp, GlobalBlowup.SpecifiedMap.Construction.globalBlowupMapTo_over,
              Scheme.IdealSheafData.comap_comp]
          have hrest : rest.followsCenters
              ((cs.map (fun B => B.comap (GlobalBlowup.Data.Construction.globalBlowupToBase I hI))).map (fun B => B.comap q')) := by
            rw [hmaps]
            exact hds
          obtain ⟨r, hr⟩ := ih _ hcs rest q' hover hJ' hrest
          exact ⟨r, hq, hstructure, hJ, hcenter, hr⟩

end

end OAI.AlgebraicGeometry.Resolution.Blowups