File size: 14,984 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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
/-
Copyright 2026 The Formal Conjectures Authors.

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    https://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
This file has been modified.
-/
import OAI.AlgebraicGeometry.ComplexPoint.BasicNe
import Mathlib.AlgebraicGeometry.AffineSpace
import OAI.CategoryTheory.ConcreteCategory.Notation
import Mathlib.Logic.Equiv.PartialEquiv
import Mathlib.Topology.Algebra.MvPolynomial

/-! # Affine Space -/

namespace OAI.AlgebraicGeometry.ComplexPoint

noncomputable section

open _root_.AlgebraicGeometry

/-!
# Complex points of affine space

The complex points of algebraic affine space are canonically homeomorphic to tuples of complex
numbers. The proof identifies global regular functions with multivariate polynomials. It then uses
the localization description of sections on principal opens to handle every local regular function
appearing in the analytic topology.
-/

open _root_.CategoryTheory _root_.Topology

/-- Evaluation of a global section at a complex point is pullback of that section to `Spec ℂ`. -/
lemma Basic.ComplexSchemePoint.evaluate_top_eq_appTop {X : Over (Spec ↧ℂ)}
    (s : Γ(X.left, ⊤)) (z : Basic.ComplexSchemePoint X) :
    Basic.Point.evaluate ⊤ s z = (Scheme.ΓSpecIso ↧ℂ).hom (z.left.appTop s) := by
  rw [Basic.Point.evaluate, dite_eq_left (by exact trivial)]
  have h := Scheme.germ_stalkClosedPointTo (R := ↧ℂ) (X := X.left) z.left ⊤ trivial
  exact DFunLike.congr_fun (congrArg CommRingCat.Hom.hom h) s

/-- Evaluation of a global regular function is continuous in the analytic topology. -/
lemma Basic.ComplexSchemePoint.continuous_evaluate_top {X : Over (Spec ↧ℂ)}
    (s : Γ(X.left, ⊤)) :
    @Continuous (Basic.ComplexSchemePoint X) ℂ Basic.Point.analyticTopology inferInstance
      (Basic.Point.evaluate ⊤ s) := by
  rw [continuous_def]
  intro V hV
  simpa [Basic.Point.overOpen] using
    Basic.Point.isOpen_overOpen_inter_preimage (X := X) (⊤ : X.left.Opens) s V hV

/-- Complex affine space as a scheme over `Spec ℂ`. -/
abbrev Basic.ComplexSchemePoint.complexAffineSpace (n : Type) : Scheme :=
  AffineSpace n (Spec ↧ℂ)

/-- Algebraic coordinates identify complex points of affine space with tuples of complex numbers. -/
def Basic.ComplexSchemePoint.affineSpaceEquiv (n : Type) :
    Basic.ComplexSchemePoint (Over.mk (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ)) ≃ (n → ℂ) where
  toFun z i :=
    (Scheme.ΓSpecIso ↧ℂ).hom (z.left.appTop (AffineSpace.coord (Spec ↧ℂ) i))
  invFun v :=
    Over.homMk (AffineSpace.homOfVector (𝟙 _)
      (fun i ↦ (Scheme.ΓSpecIso ↧ℂ).inv (v i))) (by simp)
  left_inv z := by
    apply Over.OverMorphism.ext
    apply AffineSpace.hom_ext
    · simpa using (Over.w z).symm
    · intro i
      simp
  right_inv v := by
    funext i
    simp

@[simp]
lemma Basic.ComplexSchemePoint.affineSpaceEquiv_apply (n : Type)
    (z : Basic.ComplexSchemePoint (Over.mk (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ))) (i : n) :
    Basic.ComplexSchemePoint.affineSpaceEquiv n z i =
      (Scheme.ΓSpecIso ↧ℂ).hom
        (z.left.appTop (AffineSpace.coord (Spec ↧ℂ) i)) :=
  rfl

/-- The algebraic coordinate equivalence is continuous for the analytic topology. -/
lemma Basic.ComplexSchemePoint.continuous_affineSpaceEquiv (n : Type) :
    @Continuous
      (Basic.ComplexSchemePoint (Over.mk (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ)))
      (n → ℂ) Basic.Point.analyticTopology inferInstance (Basic.ComplexSchemePoint.affineSpaceEquiv n) := by
  apply @continuous_pi
    (Basic.ComplexSchemePoint (Over.mk (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ)))
    n (fun _ ↦ ℂ) Basic.Point.analyticTopology (fun _ ↦ inferInstance) (Basic.ComplexSchemePoint.affineSpaceEquiv n)
  intro i
  let s := AffineSpace.coord (Spec ↧ℂ) i
  have heq : (fun z : Basic.ComplexSchemePoint (Over.mk (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ)) ↦
      Basic.ComplexSchemePoint.affineSpaceEquiv n z i) = Basic.Point.evaluate ⊤ s :=
    funext fun z ↦ (Basic.ComplexSchemePoint.evaluate_top_eq_appTop s z).symm
  rw [heq]
  exact Basic.ComplexSchemePoint.continuous_evaluate_top (X := Over.mk (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ)) s

/-- The polynomial represented by a global regular function on complex affine space. -/
def Basic.ComplexSchemePoint.affineGlobalPolynomial {n : Type} (s : Γ(Basic.ComplexSchemePoint.complexAffineSpace n, ⊤)) :
    MvPolynomial n ℂ :=
  (Scheme.ΓSpecIso ↧(MvPolynomial n ℂ)).hom
    ((AffineSpace.SpecIso n ↧ℂ).inv.appTop s)

lemma Basic.ComplexSchemePoint.SpecIso_hom_appTop_affineGlobalPolynomial {n : Type}
    (s : Γ(Basic.ComplexSchemePoint.complexAffineSpace n, ⊤)) :
    (AffineSpace.SpecIso n ↧ℂ).hom.appTop
        ((Scheme.ΓSpecIso ↧(MvPolynomial n ℂ)).inv (Basic.ComplexSchemePoint.affineGlobalPolynomial s)) = s := by
  rw [Basic.ComplexSchemePoint.affineGlobalPolynomial, Iso.hom_inv_id_apply]
  change ((AffineSpace.SpecIso n ↧ℂ).inv.appTop ≫
    (AffineSpace.SpecIso n ↧ℂ).hom.appTop) s = s
  rw [← Scheme.Hom.comp_appTop, Iso.hom_inv_id, Scheme.Hom.id_appTop]
  rfl

lemma Basic.ComplexSchemePoint.SpecIso_hom_appTop_X {n : Type} (i : n) :
    (AffineSpace.SpecIso n ↧ℂ).hom.appTop
        ((Scheme.ΓSpecIso ↧(MvPolynomial n ℂ)).inv (MvPolynomial.X i)) =
      AffineSpace.coord (Spec ↧ℂ) i := by
  rw [← AffineSpace.SpecIso_inv_appTop_coord ↧ℂ i]
  change ((AffineSpace.SpecIso n ↧ℂ).inv.appTop ≫
    (AffineSpace.SpecIso n ↧ℂ).hom.appTop)
      (AffineSpace.coord (Spec ↧ℂ) i) = _
  rw [← Scheme.Hom.comp_appTop, Iso.hom_inv_id, Scheme.Hom.id_appTop]
  rfl

lemma Basic.ComplexSchemePoint.SpecIso_hom_appTop_C {n : Type} (c : ℂ) :
    (AffineSpace.SpecIso n ↧ℂ).hom.appTop
        ((Scheme.ΓSpecIso ↧(MvPolynomial n ℂ)).inv (MvPolynomial.C c)) =
      (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ).appTop
        ((Scheme.ΓSpecIso ↧ℂ).inv c) := by
  rw [AffineSpace.SpecIso_hom_appTop]
  simp

/-- In affine coordinates, evaluation of a global section is evaluation of its polynomial. -/
lemma Basic.ComplexSchemePoint.evaluate_affineSpaceEquiv_symm_top {n : Type} (s : Γ(Basic.ComplexSchemePoint.complexAffineSpace n, ⊤))
    (v : n → ℂ) :
    Basic.Point.evaluate ⊤ s ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm v) =
      MvPolynomial.eval v (Basic.ComplexSchemePoint.affineGlobalPolynomial s) := by
  rw [Basic.ComplexSchemePoint.evaluate_top_eq_appTop]
  let h := ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm v).left
  let φ : MvPolynomial n ℂ →+* ℂ :=
    ((Scheme.ΓSpecIso ↧(MvPolynomial n ℂ)).inv ≫
      (AffineSpace.SpecIso n ↧ℂ).hom.appTop ≫ h.appTop ≫
      (Scheme.ΓSpecIso ↧ℂ).hom).hom
  have hφ : φ = MvPolynomial.eval v := by
    apply MvPolynomial.ringHom_ext
    · intro c
      dsimp [φ]
      rw [MvPolynomial.eval_C]
      change (Scheme.ΓSpecIso ↧ℂ).hom
        (h.appTop ((AffineSpace.SpecIso n ↧ℂ).hom.appTop
          ((Scheme.ΓSpecIso ↧(MvPolynomial n ℂ)).inv (MvPolynomial.C c)))) = c
      rw [Basic.ComplexSchemePoint.SpecIso_hom_appTop_C]
      change (Scheme.ΓSpecIso ↧ℂ).hom
        (((Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ).appTop ≫
          (AffineSpace.homOfVector (𝟙 _) fun i ↦
            (Scheme.ΓSpecIso ↧ℂ).inv (v i)).appTop)
              ((Scheme.ΓSpecIso ↧ℂ).inv c)) = c
      rw [← Scheme.Hom.comp_appTop, AffineSpace.homOfVector_over, Scheme.Hom.id_appTop]
      simp
    · intro i
      dsimp [φ]
      rw [MvPolynomial.eval_X]
      change (Scheme.ΓSpecIso ↧ℂ).hom
        (h.appTop ((AffineSpace.SpecIso n ↧ℂ).hom.appTop
          ((Scheme.ΓSpecIso ↧(MvPolynomial n ℂ)).inv (MvPolynomial.X i)))) = v i
      rw [Basic.ComplexSchemePoint.SpecIso_hom_appTop_X]
      simp [h, Basic.ComplexSchemePoint.affineSpaceEquiv]
  calc
    (Scheme.ΓSpecIso ↧ℂ).hom (h.appTop s) =
        (Scheme.ΓSpecIso ↧ℂ).hom
          (h.appTop ((AffineSpace.SpecIso n ↧ℂ).hom.appTop
            ((Scheme.ΓSpecIso ↧(MvPolynomial n ℂ)).inv
              (Basic.ComplexSchemePoint.affineGlobalPolynomial s)))) := by
                rw [Basic.ComplexSchemePoint.SpecIso_hom_appTop_affineGlobalPolynomial]
    _ = φ (Basic.ComplexSchemePoint.affineGlobalPolynomial s) := rfl
    _ = MvPolynomial.eval v (Basic.ComplexSchemePoint.affineGlobalPolynomial s) := by rw [hφ]

/-- Pullback of a global affine regular function along the coordinate inverse is continuous. -/
lemma Basic.ComplexSchemePoint.continuous_evaluate_top_affineSpaceEquiv_symm {n : Type}
    (s : Γ(Basic.ComplexSchemePoint.complexAffineSpace n, ⊤)) :
    Continuous fun v : n → ℂ ↦ Basic.Point.evaluate ⊤ s ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm v) := by
  simpa only [Basic.ComplexSchemePoint.evaluate_affineSpaceEquiv_symm_top] using
    (Basic.ComplexSchemePoint.affineGlobalPolynomial s).continuous_eval

/-- Principal opens of complex affine space pull back to Euclidean open sets. -/
lemma Basic.ComplexSchemePoint.isOpen_affineSpaceEquiv_symm_preimage_overOpen_basicOpen {n : Type}
    (s : Γ(Basic.ComplexSchemePoint.complexAffineSpace n, ⊤)) :
    IsOpen ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm ⁻¹'
      Basic.Point.overOpen ((Basic.ComplexSchemePoint.complexAffineSpace n).basicOpen s)) := by
  rw [show (Basic.ComplexSchemePoint.affineSpaceEquiv n).symm ⁻¹'
      Basic.Point.overOpen ((Basic.ComplexSchemePoint.complexAffineSpace n).basicOpen s) =
      {v | Basic.Point.evaluate ⊤ s ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm v) ≠ 0} by
    ext v
    exact Basic.Point.mem_overOpen_basicOpen_iff_evaluate_ne_zero
      (X := Over.mk (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ)) (U := ⊤) s _ trivial]
  exact isOpen_ne_fun (Basic.ComplexSchemePoint.continuous_evaluate_top_affineSpaceEquiv_symm s) continuous_const

/-- Evaluation on a principal open is continuous on the corresponding Euclidean open set. -/
lemma Basic.ComplexSchemePoint.continuousOn_evaluate_basicOpen_affineSpaceEquiv_symm {n : Type}
    (f : Γ(Basic.ComplexSchemePoint.complexAffineSpace n, ⊤))
    (t : Γ(Basic.ComplexSchemePoint.complexAffineSpace n, (Basic.ComplexSchemePoint.complexAffineSpace n).basicOpen f)) :
    ContinuousOn
      (fun v : n → ℂ ↦ Basic.Point.evaluate ((Basic.ComplexSchemePoint.complexAffineSpace n).basicOpen f) t
        ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm v))
      ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm ⁻¹'
        Basic.Point.overOpen ((Basic.ComplexSchemePoint.complexAffineSpace n).basicOpen f)) := by
  obtain ⟨k, a, h⟩ :=
    Basic.Point.exists_evaluate_basicOpen_eq_div (X := Over.mk (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ))
      (isAffineOpen_top (Basic.ComplexSchemePoint.complexAffineSpace n)) f t
  have ha := Basic.ComplexSchemePoint.continuous_evaluate_top_affineSpaceEquiv_symm a
  have hf := Basic.ComplexSchemePoint.continuous_evaluate_top_affineSpaceEquiv_symm f
  have hrat : ContinuousOn
      (fun v : n → ℂ ↦ Basic.Point.evaluate ⊤ a ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm v) /
        Basic.Point.evaluate ⊤ f ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm v) ^ k)
      ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm ⁻¹'
        Basic.Point.overOpen ((Basic.ComplexSchemePoint.complexAffineSpace n).basicOpen f)) :=
    ha.continuousOn.div (hf.pow k).continuousOn fun v hv ↦
      pow_ne_zero k ((Basic.Point.mem_overOpen_basicOpen_iff_evaluate_ne_zero
        (X := Over.mk (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ)) (U := ⊤) f _ trivial).mp hv)
  exact hrat.congr fun v hv ↦ h _ hv

/-- The inverse coordinate map is continuous for every local regular-function subbasis set. -/
lemma Basic.ComplexSchemePoint.continuous_affineSpaceEquiv_symm (n : Type) :
    @Continuous (n → ℂ)
      (Basic.ComplexSchemePoint (Over.mk (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ)))
      inferInstance Basic.Point.analyticTopology (Basic.ComplexSchemePoint.affineSpaceEquiv n).symm := by
  rw [Basic.Point.continuous_iff_analyticSubbasis]
  rintro W ⟨U, s, V, hV, rfl⟩
  apply isOpen_iff_forall_mem_open.mpr
  rintro v ⟨hvU, hvV⟩
  obtain ⟨f, hfU, hvf⟩ :=
    (isAffineOpen_top (Basic.ComplexSchemePoint.complexAffineSpace n)).exists_basicOpen_le
      ⟨((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm v).underlying, hvU⟩ trivial
  let t := (Basic.ComplexSchemePoint.complexAffineSpace n).presheaf.map (homOfLE hfU).op s
  let N := (Basic.ComplexSchemePoint.affineSpaceEquiv n).symm ⁻¹'
      Basic.Point.overOpen ((Basic.ComplexSchemePoint.complexAffineSpace n).basicOpen f) ∩
    (fun w : n → ℂ ↦ Basic.Point.evaluate ((Basic.ComplexSchemePoint.complexAffineSpace n).basicOpen f) t
      ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm w)) ⁻¹' V
  have hNopen : IsOpen N :=
    (Basic.ComplexSchemePoint.continuousOn_evaluate_basicOpen_affineSpaceEquiv_symm f t).isOpen_inter_preimage
      (Basic.ComplexSchemePoint.isOpen_affineSpaceEquiv_symm_preimage_overOpen_basicOpen f) hV
  refine ⟨N, ?_, hNopen, ?_⟩
  · rintro w ⟨hwf, hwV⟩
    have hwU : (Basic.ComplexSchemePoint.affineSpaceEquiv n).symm w ∈ Basic.Point.overOpen U := hfU hwf
    refine ⟨hwU, ?_⟩
    change Basic.Point.evaluate U s ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm w) ∈ V
    rw [Basic.Point.evaluate_res hfU s _ hwf]
    exact hwV
  · refine ⟨hvf, ?_⟩
    change Basic.Point.evaluate ((Basic.ComplexSchemePoint.complexAffineSpace n).basicOpen f) t
      ((Basic.ComplexSchemePoint.affineSpaceEquiv n).symm v) ∈ V
    exact (congrArg (fun c ↦ c ∈ V) (Basic.Point.evaluate_res hfU s _ hvf)).mp hvV

/-- Complex affine space with the evaluation topology is ordinary complex affine space. -/
def Basic.ComplexSchemePoint.affineSpaceHomeomorph (n : Type) :
    Basic.ComplexSchemePoint (Over.mk (Basic.ComplexSchemePoint.complexAffineSpace n ↘ Spec ↧ℂ)) ≃ₜ (n → ℂ) where
  toEquiv := Basic.ComplexSchemePoint.affineSpaceEquiv n
  continuous_toFun := Basic.ComplexSchemePoint.continuous_affineSpaceEquiv n
  continuous_invFun := Basic.ComplexSchemePoint.continuous_affineSpaceEquiv_symm n

end

end OAI.AlgebraicGeometry.ComplexPoint