File size: 53,903 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
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
/-
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.AffineSpace
import Mathlib.AlgebraicGeometry.ProjectiveSpectrum.Basic
import Mathlib.LinearAlgebra.Projectivization.Basic
import Mathlib.Tactic.Bound
import OAI.CategoryTheory.ConcreteCategory.Notation
import Mathlib.AlgebraicGeometry.AlgClosed.Basic
import Mathlib.Analysis.Complex.Polynomial.Basic

/-! # Projective -/

namespace OAI.AlgebraicGeometry.ComplexPoint.Projective.ComplexProjectiveSpace

open _root_.AlgebraicGeometry

/-!
# Projective analytification

This file supplies the compact topological model of finite-dimensional complex projective space.
It equips linear-algebraic projectivization with the quotient topology from nonzero coordinate
vectors. Normalizing coordinates gives a continuous surjection from the unit sphere, and hence
proves compactness.

It also constructs the standard scheme-theoretic projective points from homogeneous coordinates.
Standard affine charts prove that this construction is a continuous bijection from linear
projectivization onto the complex points of scheme-theoretic projective space. This proves that
scheme-theoretic projective space is analytically compact.
-/

open _root_.CategoryTheory _root_.Metric Opposite _root_.TopologicalSpace _root_.Topology
open scoped LinearAlgebra.Projectivization

/-- The coordinate vector space underlying complex projective `n`-space. -/
abbrev CoordinateSpace (n : ℕ) := Fin (n + 1) → ℂ

/-- The polynomial ring in homogeneous coordinates over the integral model. -/
abbrev UniversalRing (n : ℕ) := MvPolynomial (Fin (n + 1)) (ULift ℤ)

/-- The standard grading on the homogeneous coordinate ring. -/
abbrev UniversalGrading (n : ℕ) :=
  MvPolynomial.homogeneousSubmodule (Fin (n + 1)) (ULift ℤ)

attribute [local instance] MvPolynomial.gradedAlgebra

/-- The standard quotient topology on finite-dimensional complex projective space. -/
noncomputable instance instTopologicalSpace (n : ℕ) :
    TopologicalSpace (Projectivization ℂ (CoordinateSpace n)) :=
  instTopologicalSpaceQuotient

/-- Normalize a nonzero vector to a vector on the unit sphere. -/
noncomputable def normalize {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0) :
    sphere (0 : CoordinateSpace n) 1 :=
  ⟨((‖v‖ : ℝ) : ℂ)⁻¹ • v, by
    rw [mem_sphere, dist_zero_right, norm_smul, norm_inv, Complex.norm_real,
      Real.norm_eq_abs, abs_of_nonneg (norm_nonneg v)]
    exact inv_mul_cancel₀ (norm_ne_zero_iff.mpr hv)⟩

/-- A vector on the unit sphere is nonzero. -/
lemma sphere_ne_zero {n : ℕ} (v : sphere (0 : CoordinateSpace n) 1) :
    (v : CoordinateSpace n) ≠ 0 := by aesop

/-- The quotient map from the unit sphere to complex projective space. -/
noncomputable def sphereToProjectivization {n : ℕ} :
    sphere (0 : CoordinateSpace n) 1 → Projectivization ℂ (CoordinateSpace n) :=
  fun v ↦ Projectivization.mk ℂ v (sphere_ne_zero v)

/-- The quotient map from the unit sphere to complex projective space is continuous. -/
lemma continuous_sphereToProjectivization {n : ℕ} :
    Continuous (sphereToProjectivization (n := n)) := by
  exact continuous_quot_mk.comp (continuous_subtype_val.subtype_mk _)

/-- Every point of complex projective space has a unit-norm representative. -/
lemma surjective_sphereToProjectivization {n : ℕ} :
    Function.Surjective (sphereToProjectivization (n := n)) := by
  intro p
  induction p using Projectivization.ind with
  | _ v hv =>
      exact ⟨normalize v hv, (Projectivization.mk_eq_mk_iff' ℂ _ _ (sphere_ne_zero _) hv).2
        ⟨((‖v‖ : ℝ) : ℂ)⁻¹, rfl⟩⟩

/-- Finite-dimensional complex projective space is compact in its quotient topology. -/
noncomputable instance instCompactSpace (n : ℕ) :
    CompactSpace (Projectivization ℂ (CoordinateSpace n)) := by
  constructor
  rw [← (surjective_sphereToProjectivization (n := n)).range_eq]
  exact isCompact_range continuous_sphereToProjectivization

/-- Evaluation at a coordinate vector, regarded as a map to the global functions on
`Spec ℂ`. -/
noncomputable def coordinateGlobalSectionsHom {n : ℕ} (v : CoordinateSpace n) :
    UniversalRing n →+* ↑Γ(Spec ↧ℂ, ⊤) :=
  MvPolynomial.eval₂Hom
    ((algebraMap ℤ _).comp ULift.ringEquiv.toRingHom)
    ((Scheme.ΓSpecIso ↧ℂ).inv ∘ v)

@[simp]
lemma coordinateGlobalSectionsHom_X {n : ℕ} (v : CoordinateSpace n)
    (i : Fin (n + 1)) :
    coordinateGlobalSectionsHom v (MvPolynomial.X i) =
      (Scheme.ΓSpecIso ↧ℂ).inv (v i) := by
  simp [coordinateGlobalSectionsHom]

/-- Evaluation of a homogeneous polynomial on scaled coordinates changes by the corresponding
power of the scale. -/
lemma eval₂_smul_of_isHomogeneous {n d : ℕ}
    (r : UniversalRing n) (hr : r.IsHomogeneous d)
    (c : ℂ) (v : CoordinateSpace n) :
    MvPolynomial.eval₂ ((algebraMap ℤ ℂ).comp ULift.ringEquiv.toRingHom) (c • v) r =
      c ^ d * MvPolynomial.eval₂
        ((algebraMap ℤ ℂ).comp ULift.ringEquiv.toRingHom) v r := by
  rw [MvPolynomial.eval₂_eq', MvPolynomial.eval₂_eq', Finset.mul_sum]
  apply Finset.sum_congr rfl
  intro m hm
  have hd : ∑ i, m i = d := by
    rw [← hr (MvPolynomial.mem_support_iff.mp hm)]
    simp only [Finsupp.weight_apply, smul_eq_mul, Pi.one_apply, mul_one]
    exact (Finsupp.sum_fintype m (fun _ x ↦ x) (fun _ ↦ rfl)).symm
  simp only [Pi.smul_apply, smul_eq_mul, mul_pow, Finset.prod_mul_distrib]
  rw [show (∏ x, c ^ m x) = c ^ ∑ x, m x by
    simpa using Finset.prod_pow_eq_pow_sum (Finset.univ : Finset (Fin (n + 1))) m c]
  rw [hd]
  ring

/-- After identifying the global functions on `Spec ℂ` with `ℂ`, scaling coordinates
scales the value of a homogeneous polynomial by its degree. -/
lemma coordinateGlobalSectionsHom_smul {n d : ℕ}
    (r : UniversalRing n) (hr : r.IsHomogeneous d)
    (c : ℂ) (v : CoordinateSpace n) :
    (Scheme.ΓSpecIso ↧ℂ).hom (coordinateGlobalSectionsHom (c • v) r) =
      c ^ d * (Scheme.ΓSpecIso ↧ℂ).hom (coordinateGlobalSectionsHom v r) := by
  have hEval (w : CoordinateSpace n) :
      (Scheme.ΓSpecIso ↧ℂ).hom.hom.comp (coordinateGlobalSectionsHom w) =
        MvPolynomial.eval₂Hom
          ((algebraMap ℤ ℂ).comp ULift.ringEquiv.toRingHom) w := by
    apply MvPolynomial.ringHom_ext
    · intro a
      simp [coordinateGlobalSectionsHom]
    · intro j
      simp [coordinateGlobalSectionsHom]
  change ((Scheme.ΓSpecIso ↧ℂ).hom.hom.comp
      (coordinateGlobalSectionsHom (c • v))) r = c ^ d *
        ((Scheme.ΓSpecIso ↧ℂ).hom.hom.comp
          (coordinateGlobalSectionsHom v)) r
  rw [hEval, hEval]
  exact eval₂_smul_of_isHomogeneous r hr c v

/-- Evaluation of the integral homogeneous coordinate ring at a complex vector, with the global
functions on `Spec ℂ` identified with `ℂ`. -/
noncomputable def coordinateEvaluationHom {n : ℕ} (v : CoordinateSpace n) :
    UniversalRing n →+* ℂ :=
  (Scheme.ΓSpecIso ↧ℂ).hom.hom.comp (coordinateGlobalSectionsHom v)

@[simp]
lemma coordinateEvaluationHom_apply {n : ℕ} (v : CoordinateSpace n)
    (r : UniversalRing n) :
    coordinateEvaluationHom v r =
      (Scheme.ΓSpecIso ↧ℂ).hom (coordinateGlobalSectionsHom v r) :=
  rfl

@[simp]
lemma coordinateEvaluationHom_X {n : ℕ} (v : CoordinateSpace n) (i : Fin (n + 1)) :
    coordinateEvaluationHom v (MvPolynomial.X i) = v i := by simp

/-- Evaluation of regular functions on the standard projective chart where the `i`-th coordinate
is nonzero. -/
noncomputable def awayCoordinateEvaluation {n : ℕ} (v : CoordinateSpace n)
    (i : Fin (n + 1)) (hi : v i ≠ 0) :
    HomogeneousLocalization.Away (UniversalGrading n) (MvPolynomial.X i) →+* ℂ :=
  (IsLocalization.Away.lift
    (S := Localization.Away (MvPolynomial.X i : UniversalRing n))
    (MvPolynomial.X i)
    (show IsUnit (coordinateEvaluationHom v (MvPolynomial.X i)) by
      rw [coordinateEvaluationHom_X]
      exact isUnit_iff_ne_zero.mpr hi)).comp
      (algebraMap
        (HomogeneousLocalization.Away (UniversalGrading n) (MvPolynomial.X i))
        (Localization.Away (MvPolynomial.X i)))

/-- On the standard chart, a homogeneous fraction evaluates as its numerator divided by the
corresponding power of the nonzero coordinate. -/
lemma awayCoordinateEvaluation_mk {n : ℕ} (v : CoordinateSpace n)
    (i : Fin (n + 1)) (hi : v i ≠ 0) (d : ℕ)
    (r : UniversalRing n) (hr : r ∈ UniversalGrading n d) :
    awayCoordinateEvaluation v i hi
      (HomogeneousLocalization.Away.mk (UniversalGrading n)
        (MvPolynomial.isHomogeneous_X _ i) d r (by simpa using hr)) =
      coordinateEvaluationHom v r * (v i) ⁻¹ ^ d := by
  simp only [awayCoordinateEvaluation, RingHom.coe_comp, Function.comp_apply]
  change (Localization.awayLift (coordinateEvaluationHom v) (MvPolynomial.X i) _)
      (Localization.mk r ⟨MvPolynomial.X i ^ d, ⟨d, rfl⟩⟩) = _
  rw [Localization.awayLift_mk (coordinateEvaluationHom v) (MvPolynomial.X i)
    r (v i) ⁻¹]
  rw [coordinateEvaluationHom_X]
  exact mul_inv_cancel₀ hi

/-- Degree-zero localized coordinate evaluation is unchanged when all homogeneous coordinates are
rescaled by the same nonzero scalar. -/
lemma awayCoordinateEvaluation_smul {n : ℕ} (v : CoordinateSpace n)
    (c : ℂ) (hc : c ≠ 0) (i : Fin (n + 1)) (hi : v i ≠ 0) :
    awayCoordinateEvaluation (c • v) i (mul_ne_zero hc hi) =
      awayCoordinateEvaluation v i hi := by
  ext z
  obtain ⟨d, r, hr, rfl⟩ :=
    HomogeneousLocalization.Away.mk_surjective
      (UniversalGrading n) (MvPolynomial.isHomogeneous_X (ULift ℤ) i) z
  have hr' : r ∈ UniversalGrading n d := by simpa using hr
  rw [awayCoordinateEvaluation_mk (hr := hr'), awayCoordinateEvaluation_mk (hr := hr')]
  rw [coordinateEvaluationHom_apply, coordinateEvaluationHom_apply,
    coordinateGlobalSectionsHom_smul r hr' c v]
  simp only [Pi.smul_apply, smul_eq_mul, mul_inv_rev, mul_pow]
  calc
    _ = ((Scheme.ΓSpecIso ↧ℂ).hom (coordinateGlobalSectionsHom v r) *
        (v i)⁻¹ ^ d) *
        (c ^ d * c⁻¹ ^ d) := by ring
    _ = ((Scheme.ΓSpecIso ↧ℂ).hom (coordinateGlobalSectionsHom v r) *
        (v i)⁻¹ ^ d) *
        (c * c⁻¹) ^ d := by rw [mul_pow]
    _ = _ := by rw [mul_inv_cancel₀ hc, one_pow, mul_one]

/-- Evaluation on the degree-zero localization away from an arbitrary homogeneous polynomial. -/
noncomputable def awayHomogeneousEvaluation {n : ℕ} (v : CoordinateSpace n)
    (f : UniversalRing n) (hv : coordinateEvaluationHom v f ≠ 0) :
    HomogeneousLocalization.Away (UniversalGrading n) f →+* ℂ :=
  (IsLocalization.Away.lift
    (S := Localization.Away f) f
    (show IsUnit (coordinateEvaluationHom v f) from isUnit_iff_ne_zero.mpr hv)).comp
      (algebraMap
        (HomogeneousLocalization.Away (UniversalGrading n) f)
        (Localization.Away f))

/-- Evaluation on a homogeneous fraction is evaluation of its numerator divided by evaluation of
the denominator to the same power. -/
lemma awayHomogeneousEvaluation_mk {n d : ℕ} (v : CoordinateSpace n)
    (f : UniversalRing n) (hf : f ∈ UniversalGrading n d)
    (hv : coordinateEvaluationHom v f ≠ 0) (k : ℕ)
    (r : UniversalRing n) (hr : r ∈ UniversalGrading n (k * d)) :
    awayHomogeneousEvaluation v f hv
      (HomogeneousLocalization.Away.mk (UniversalGrading n) hf k r
        (by simpa [nsmul_eq_mul] using hr)) =
      coordinateEvaluationHom v r * (coordinateEvaluationHom v f)⁻¹ ^ k := by
  simp only [awayHomogeneousEvaluation, RingHom.coe_comp, Function.comp_apply]
  change (Localization.awayLift (coordinateEvaluationHom v) f _)
      (Localization.mk r ⟨f ^ k, ⟨k, rfl⟩⟩) = _
  rw [Localization.awayLift_mk (coordinateEvaluationHom v) f
    r (coordinateEvaluationHom v f)⁻¹]
  exact mul_inv_cancel₀ hv

/-- The regular function `X_j / X_i` on the standard projective chart where `X_i` is
nonzero. -/
noncomputable def chartCoordinate {n : ℕ} (i j : Fin (n + 1)) :
    HomogeneousLocalization.Away (UniversalGrading n) (MvPolynomial.X i) :=
  HomogeneousLocalization.Away.mk (UniversalGrading n)
    (MvPolynomial.isHomogeneous_X _ i) 1 (MvPolynomial.X j)
      (by simpa using MvPolynomial.isHomogeneous_X (ULift ℤ) j)

set_option backward.isDefEq.respectTransparency.types false in
@[simp]
lemma chartCoordinate_self {n : ℕ} (i : Fin (n + 1)) :
    chartCoordinate (n := n) i i = 1 := by
  rw [HomogeneousLocalization.ext_iff_val]
  unfold chartCoordinate
  simp

/-- The homogeneous coordinate variables generate the polynomial ring over its degree-zero
subring. -/
lemma adjoin_coordinates_eq_top (n : ℕ) :
    Algebra.adjoin (UniversalGrading n 0)
      (Set.range (MvPolynomial.X : Fin (n + 1) → UniversalRing n)) = ⊤ := by
  apply top_unique
  intro p hp
  clear hp
  induction p using MvPolynomial.induction_on with
  | C a =>
      exact (Algebra.adjoin (UniversalGrading n 0)
        (Set.range (MvPolynomial.X : Fin (n + 1) → UniversalRing n))).algebraMap_mem
          ⟨MvPolynomial.C a, MvPolynomial.isHomogeneous_C _ _⟩
  | add p q hp hq => exact add_mem hp hq
  | mul_X p j hp =>
      exact mul_mem hp (Algebra.subset_adjoin ⟨j, rfl⟩)

set_option backward.isDefEq.respectTransparency.types false in
lemma chartGenerator_eq_prod {n a : ℕ} (i : Fin (n + 1))
    (ai : Fin (n + 1) → ℕ) (hai : ∑ j, ai j = a) :
    HomogeneousLocalization.Away.mk (UniversalGrading n)
        (MvPolynomial.isHomogeneous_X _ i) a
        (∏ j, MvPolynomial.X j ^ ai j)
        (by
          convert SetLike.prod_pow_mem_graded (UniversalGrading n) (fun _ ↦ (1 : ℕ))
            (fun j ↦ MvPolynomial.X j) ai (F := Finset.univ)
              (fun j _ ↦ MvPolynomial.isHomogeneous_X (ULift ℤ) j) using 1;
            simp [hai]) =
      ∏ j, chartCoordinate i j ^ ai j := by
  rw [HomogeneousLocalization.ext_iff_val, HomogeneousLocalization.Away.val_mk,
    show (∏ j, chartCoordinate i j ^ ai j).val =
      ∏ j, (chartCoordinate i j).val ^ ai j by
    induction (Finset.univ : Finset (Fin (n + 1))) using Finset.induction with
    | empty => exact HomogeneousLocalization.val_one
    | @insert j s hjs ih =>
        rw [Finset.prod_insert hjs, Finset.prod_insert hjs,
          HomogeneousLocalization.val_mul, HomogeneousLocalization.val_pow, ih]]
  simp only [chartCoordinate, HomogeneousLocalization.Away.val_mk]
  simp_rw [Localization.mk_pow]
  rw [Localization.mk_prod (Finset.univ : Finset (Fin (n + 1)))]
  apply Localization.mk_eq_mk_iff.mpr
  rw [Localization.r_iff_exists]
  simp [Finset.prod_pow_eq_pow_sum, hai]

/-- A ring map from a standard projective chart is determined by the coordinate ratios. -/
lemma awayRingHom_ext {n : ℕ} (i : Fin (n + 1))
    (φ ψ : HomogeneousLocalization.Away (UniversalGrading n)
      (MvPolynomial.X i : UniversalRing n) →+* ℂ)
    (hbase : ∀ a : UniversalGrading n 0,
      φ (HomogeneousLocalization.fromZeroRingHom (UniversalGrading n)
        (Submonoid.powers (MvPolynomial.X i : UniversalRing n)) a) =
      ψ (HomogeneousLocalization.fromZeroRingHom (UniversalGrading n)
        (Submonoid.powers (MvPolynomial.X i : UniversalRing n)) a))
    (hcoord : ∀ j, φ (chartCoordinate i j) = ψ (chartCoordinate i j)) :
    φ = ψ := by
  let : Algebra (UniversalGrading n 0) ℂ :=
    (φ.comp (HomogeneousLocalization.fromZeroRingHom (UniversalGrading n)
      (Submonoid.powers (MvPolynomial.X i : UniversalRing n)))).toAlgebra
  let φa : HomogeneousLocalization.Away (UniversalGrading n)
      (MvPolynomial.X i : UniversalRing n) →ₐ[UniversalGrading n 0] ℂ :=
    { φ with commutes' := fun _ ↦ rfl }
  let ψa : HomogeneousLocalization.Away (UniversalGrading n)
      (MvPolynomial.X i : UniversalRing n) →ₐ[UniversalGrading n 0] ℂ :=
    { ψ with commutes' := fun r ↦ (hbase r).symm }
  change φa.toRingHom = ψa.toRingHom
  apply congrArg AlgHom.toRingHom
  apply AlgHom.ext_of_adjoin_eq_top
    (HomogeneousLocalization.Away.adjoin_mk_prod_pow_eq_top
      (MvPolynomial.isHomogeneous_X (ULift ℤ) i)
      (Fin (n + 1)) (fun j ↦ MvPolynomial.X j) (adjoin_coordinates_eq_top n)
      (fun _ ↦ (1 : ℕ)) (fun j ↦ MvPolynomial.isHomogeneous_X (ULift ℤ) j))
  rintro z ⟨a, ai, hai, hai_le, rfl⟩
  have hai' : ∑ j, ai j = a := by simpa using hai
  rw [chartGenerator_eq_prod i ai hai']
  simp only [map_prod]
  apply Finset.prod_congr rfl
  intro j hj
  change φ (chartCoordinate i j ^ ai j) = ψ (chartCoordinate i j ^ ai j)
  rw [φ.map_pow, ψ.map_pow, hcoord]

/-- The degree-zero coefficient ring of the standard projective grading has a unique ring map to
`ℂ`. -/
lemma degreeZero_ringHom_unique {n : ℕ}
    (φ ψ : UniversalGrading n 0 →+* ℂ) : φ = ψ := by
  ext a
  obtain ⟨z, rfl⟩ :=
    (Foundations.ProjectiveSpaceIs.ProjectiveSpace.degreeZeroEquiv (Fin (n + 1)) (ULift ℤ)).symm.surjective a
  obtain ⟨z, rfl⟩ := (ULift.ringEquiv (R := ℤ)).symm.surjective z
  exact DFunLike.congr_fun (Subsingleton.elim
    ((φ.comp (Foundations.ProjectiveSpaceIs.ProjectiveSpace.degreeZeroEquiv
      (Fin (n + 1)) (ULift ℤ)).symm.toRingHom).comp
        (ULift.ringEquiv (R := ℤ)).symm.toRingHom)
    ((ψ.comp (Foundations.ProjectiveSpaceIs.ProjectiveSpace.degreeZeroEquiv
      (Fin (n + 1)) (ULift ℤ)).symm.toRingHom).comp
        (ULift.ringEquiv (R := ℤ)).symm.toRingHom)) z

/-- Homogeneous coordinates reconstructed from a complex point of one standard affine chart. -/
noncomputable def vectorOfAwayRingHom {n : ℕ} (i : Fin (n + 1))
    (φ : HomogeneousLocalization.Away (UniversalGrading n)
      (MvPolynomial.X i : UniversalRing n) →+* ℂ) : CoordinateSpace n :=
  fun j ↦ φ (chartCoordinate i j)

@[simp]
lemma vectorOfAwayRingHom_apply {n : ℕ} (i j : Fin (n + 1))
    (φ : HomogeneousLocalization.Away (UniversalGrading n)
      (MvPolynomial.X i : UniversalRing n) →+* ℂ) :
    vectorOfAwayRingHom i φ j = φ (chartCoordinate i j) :=
  rfl

@[simp]
lemma vectorOfAwayRingHom_self {n : ℕ} (i : Fin (n + 1))
    (φ : HomogeneousLocalization.Away (UniversalGrading n)
      (MvPolynomial.X i : UniversalRing n) →+* ℂ) :
    vectorOfAwayRingHom i φ i = 1 := by simp

lemma vectorOfAwayRingHom_ne_zero {n : ℕ} (i : Fin (n + 1))
    (φ : HomogeneousLocalization.Away (UniversalGrading n)
      (MvPolynomial.X i : UniversalRing n) →+* ℂ) :
    vectorOfAwayRingHom i φ ≠ 0 := by
  intro h
  have hi := vectorOfAwayRingHom_self i φ
  rw [h] at hi
  exact one_ne_zero hi.symm

/-- Reconstructing coordinates from a chart ring map and evaluating them recovers that ring map. -/
lemma awayCoordinateEvaluation_vectorOfAwayRingHom {n : ℕ} (i : Fin (n + 1))
    (φ : HomogeneousLocalization.Away (UniversalGrading n)
      (MvPolynomial.X i : UniversalRing n) →+* ℂ) :
    awayCoordinateEvaluation (vectorOfAwayRingHom i φ) i
      (by
        rw [vectorOfAwayRingHom_self]
        exact one_ne_zero) = φ := by
  let v := vectorOfAwayRingHom i φ
  have hi : v i ≠ 0 := by
    change vectorOfAwayRingHom i φ i ≠ 0
    rw [vectorOfAwayRingHom_self]
    exact one_ne_zero
  apply awayRingHom_ext i
  · intro a
    exact DFunLike.congr_fun (degreeZero_ringHom_unique
      ((awayCoordinateEvaluation v i hi).comp
        (HomogeneousLocalization.fromZeroRingHom (UniversalGrading n)
          (Submonoid.powers (MvPolynomial.X i : UniversalRing n))))
      (φ.comp (HomogeneousLocalization.fromZeroRingHom (UniversalGrading n)
        (Submonoid.powers (MvPolynomial.X i : UniversalRing n))))) a
  · intro j
    change awayCoordinateEvaluation v i hi
      (HomogeneousLocalization.Away.mk (UniversalGrading n)
        (MvPolynomial.isHomogeneous_X _ i) 1 (MvPolynomial.X j) _) =
      φ (chartCoordinate i j)
    rw [awayCoordinateEvaluation_mk (d := 1) (r := MvPolynomial.X j)
      (hr := by simpa using MvPolynomial.isHomogeneous_X (ULift ℤ) j)]
    simp only [coordinateEvaluationHom_X, one_pow, v, vectorOfAwayRingHom_apply,
      chartCoordinate_self, map_one, inv_one, mul_one]

set_option backward.isDefEq.respectTransparency.types false in
/-- Evaluation on the overlap `D₊(X_i X_j)`, restricted to `D₊(X_i)`, is evaluation in the
`i`-th standard chart. -/
lemma awayHomogeneousEvaluation_comp_awayMap_coordinate {n : ℕ}
    (v : CoordinateSpace n) (i j : Fin (n + 1))
    (hi : v i ≠ 0) (hj : v j ≠ 0) :
    (awayHomogeneousEvaluation v (MvPolynomial.X i * MvPolynomial.X j)
      (by simp [hi, hj])).comp
        (HomogeneousLocalization.awayMap (UniversalGrading n)
          (MvPolynomial.isHomogeneous_X (ULift ℤ) j) rfl) =
      awayCoordinateEvaluation v i hi := by
  let hvij : coordinateEvaluationHom v (MvPolynomial.X i * MvPolynomial.X j) ≠ 0 := by
    simp [hi, hj]
  let φij := awayHomogeneousEvaluation v (MvPolynomial.X i * MvPolynomial.X j) hvij
  apply awayRingHom_ext i
  · intro a
    exact DFunLike.congr_fun (degreeZero_ringHom_unique
      ((φij.comp
        (HomogeneousLocalization.awayMap (UniversalGrading n)
          (MvPolynomial.isHomogeneous_X (ULift ℤ) j) rfl)).comp
        (HomogeneousLocalization.fromZeroRingHom (UniversalGrading n)
          (Submonoid.powers (MvPolynomial.X i : UniversalRing n))))
      ((awayCoordinateEvaluation v i hi).comp
        (HomogeneousLocalization.fromZeroRingHom (UniversalGrading n)
          (Submonoid.powers (MvPolynomial.X i : UniversalRing n))))) a
  · intro k
    change φij
      (HomogeneousLocalization.awayMap (UniversalGrading n)
        (MvPolynomial.isHomogeneous_X (ULift ℤ) j) rfl (chartCoordinate i k)) =
      awayCoordinateEvaluation v i hi (chartCoordinate i k)
    unfold chartCoordinate
    rw [HomogeneousLocalization.awayMap_mk, awayHomogeneousEvaluation_mk (k := 1)
      (hr := by simpa using (SetLike.mul_mem_graded (A := UniversalGrading n)
        (MvPolynomial.isHomogeneous_X (ULift ℤ) k)
        (MvPolynomial.isHomogeneous_X (ULift ℤ) j))),
      awayCoordinateEvaluation_mk (hr := MvPolynomial.isHomogeneous_X (ULift ℤ) k)]
    simp only [map_mul, coordinateEvaluationHom_X]
    field_simp
    simp

/-- A nonzero coordinate vector has a nonzero coordinate. -/
lemma exists_coordinate_ne_zero {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0) :
    ∃ i, v i ≠ 0 := by
  contrapose! hv
  exact funext hv

/-- The finite set of indices of the nonzero coordinates of a vector. -/
noncomputable def coordinateSupport {n : ℕ} (v : CoordinateSpace n) :
    Finset (Fin (n + 1)) :=
  Finset.univ.filter (fun i ↦ v i ≠ 0)

lemma coordinateSupport_nonempty {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0) :
    (coordinateSupport v).Nonempty := by
  obtain ⟨i, hi⟩ := exists_coordinate_ne_zero v hv
  exact ⟨i, by simp [coordinateSupport, hi]⟩

/-- The least index of a nonzero coordinate. This gives a scale-independent choice of a
standard projective chart. -/
noncomputable def coordinateIndex {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0) :
    Fin (n + 1) :=
  (coordinateSupport v).min' (coordinateSupport_nonempty v hv)

lemma coordinateIndex_ne_zero {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0) :
    v (coordinateIndex v hv) ≠ 0 := by
  simpa [coordinateIndex, coordinateSupport] using
    (coordinateSupport v).min'_mem (coordinateSupport_nonempty v hv)

/-- Rescaling by a nonzero scalar does not change the selected standard chart. -/
lemma coordinateIndex_smul {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0)
    (c : ℂ) (hc : c ≠ 0) :
    coordinateIndex (c • v) (smul_ne_zero hc hv) = coordinateIndex v hv := by
  have hs : coordinateSupport (c • v) = coordinateSupport v := by
    ext i
    simp [coordinateSupport, hc]
  unfold coordinateIndex
  congr

/-- The projective point defined directly in one standard affine chart. -/
noncomputable def chartIntegralProjAt {n : ℕ} (v : CoordinateSpace n)
    (i : Fin (n + 1)) (hi : v i ≠ 0) :
    Spec ↧ℂ ⟶ Proj (UniversalGrading n) :=
  Spec.map (CommRingCat.ofHom (awayCoordinateEvaluation v i hi)) ≫
    Proj.awayι (UniversalGrading n) (MvPolynomial.X i)
      (MvPolynomial.isHomogeneous_X _ _) zero_lt_one

/-- Every complex point whose image lies in a standard projective chart is obtained by evaluating
homogeneous coordinates. -/
lemma exists_coordinates_of_range_subset_chart {n : ℕ}
    (q : Spec ↧ℂ ⟶ Proj (UniversalGrading n)) (i : Fin (n + 1))
    (hq : Set.range q ⊆ Set.range
      (Proj.awayι (UniversalGrading n) (MvPolynomial.X i)
        (MvPolynomial.isHomogeneous_X _ _) zero_lt_one)) :
    ∃ (v : CoordinateSpace n) (_hv : v ≠ 0) (hi : v i ≠ 0),
      chartIntegralProjAt v i hi = q := by
  let e := Proj.awayι (UniversalGrading n) (MvPolynomial.X i)
    (MvPolynomial.isHomogeneous_X _ _) zero_lt_one
  let : IsOpenImmersion e := by
    dsimp [e]
    exact Proj.instIsOpenImmersionAwayι (UniversalGrading n) (MvPolynomial.X i)
      (MvPolynomial.isHomogeneous_X _ _) zero_lt_one
  let l : Spec ↧ℂ ⟶
      Spec ↧(HomogeneousLocalization.Away (UniversalGrading n) (MvPolynomial.X i)) :=
    IsOpenImmersion.lift e q hq
  let φ : HomogeneousLocalization.Away (UniversalGrading n)
      (MvPolynomial.X i) →+* ℂ := (Spec.preimage l).hom
  let v := vectorOfAwayRingHom i φ
  have hv : v ≠ 0 := vectorOfAwayRingHom_ne_zero i φ
  have hi : v i ≠ 0 := (vectorOfAwayRingHom_self i φ).trans_ne one_ne_zero
  refine ⟨v, hv, hi, ?_⟩
  unfold chartIntegralProjAt
  rw [awayCoordinateEvaluation_vectorOfAwayRingHom]
  change Spec.map (Spec.preimage l) ≫ e = q
  rw [Spec.map_preimage]
  exact IsOpenImmersion.lift_fac e q hq

lemma chartIntegralProjAt_congr {n : ℕ} (v : CoordinateSpace n)
    {i j : Fin (n + 1)} (hi : v i ≠ 0) (hj : v j ≠ 0) (hij : i = j) :
    chartIntegralProjAt v i hi = chartIntegralProjAt v j hj := by simp_all

set_option backward.isDefEq.respectTransparency.types false in
/-- The projective morphism defined by a coordinate vector is independent of the chosen nonzero
standard coordinate. -/
lemma chartIntegralProjAt_independent {n : ℕ} (v : CoordinateSpace n)
    (i j : Fin (n + 1)) (hi : v i ≠ 0) (hj : v j ≠ 0) :
    chartIntegralProjAt v i hi = chartIntegralProjAt v j hj := by
  let φij := awayHomogeneousEvaluation v
    (MvPolynomial.X i * MvPolynomial.X j)
    (by simp [hi, hj])
  have hfi : φij.comp
        (HomogeneousLocalization.awayMap (UniversalGrading n)
          (MvPolynomial.isHomogeneous_X (ULift ℤ) j) rfl) =
      awayCoordinateEvaluation v i hi :=
    awayHomogeneousEvaluation_comp_awayMap_coordinate v i j hi hj
  have hfj : φij.comp
        (HomogeneousLocalization.awayMap (UniversalGrading n)
          (MvPolynomial.isHomogeneous_X (ULift ℤ) i) (mul_comm _ _)) =
      awayCoordinateEvaluation v j hj := by
    apply awayRingHom_ext j
    · intro a
      exact DFunLike.congr_fun (degreeZero_ringHom_unique
        ((φij.comp
          (HomogeneousLocalization.awayMap (UniversalGrading n)
            (MvPolynomial.isHomogeneous_X (ULift ℤ) i) (mul_comm _ _))).comp
          (HomogeneousLocalization.fromZeroRingHom (UniversalGrading n)
            (Submonoid.powers (MvPolynomial.X j : UniversalRing n))))
        ((awayCoordinateEvaluation v j hj).comp
          (HomogeneousLocalization.fromZeroRingHom (UniversalGrading n)
            (Submonoid.powers (MvPolynomial.X j : UniversalRing n))))) a
    · intro k
      change φij
        (HomogeneousLocalization.awayMap (UniversalGrading n)
          (MvPolynomial.isHomogeneous_X (ULift ℤ) i) (mul_comm _ _)
            (chartCoordinate j k)) =
        awayCoordinateEvaluation v j hj (chartCoordinate j k)
      unfold chartCoordinate
      rw [HomogeneousLocalization.awayMap_mk, awayHomogeneousEvaluation_mk (k := 1)
        (hr := by simpa [mul_comm] using
          (SetLike.mul_mem_graded (A := UniversalGrading n)
            (MvPolynomial.isHomogeneous_X (ULift ℤ) k)
            (MvPolynomial.isHomogeneous_X (ULift ℤ) i))),
        awayCoordinateEvaluation_mk (hr := MvPolynomial.isHomogeneous_X (ULift ℤ) k)]
      simp only [map_mul, coordinateEvaluationHom_X]
      field_simp
      simp
  unfold chartIntegralProjAt
  rw [← hfi, ← hfj]
  simp only [CommRingCat.ofHom_comp, Spec.map_comp, Category.assoc]
  rw [Proj.SpecMap_awayMap_awayι, Proj.SpecMap_awayMap_awayι]

/-- Direct chart points are unchanged by rescaling their coordinates. -/
lemma chartIntegralProjAt_smul {n : ℕ} (v : CoordinateSpace n)
    (i : Fin (n + 1)) (hi : v i ≠ 0) (c : ℂ) (hc : c ≠ 0) :
    chartIntegralProjAt (c • v) i (mul_ne_zero hc hi) = chartIntegralProjAt v i hi := by
  unfold chartIntegralProjAt
  rw [awayCoordinateEvaluation_smul v c hc i hi]

/-- The projective point obtained in the least standard chart containing it. -/
noncomputable def chartIntegralProj {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0) :
    Spec ↧ℂ ⟶ Proj (UniversalGrading n) :=
  chartIntegralProjAt v (coordinateIndex v hv) (coordinateIndex_ne_zero v hv)

/-- The chosen-chart construction is unchanged by nonzero rescaling. -/
lemma chartIntegralProj_smul {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0)
    (c : ℂ) (hc : c ≠ 0) :
    chartIntegralProj (c • v) (smul_ne_zero hc hv) = chartIntegralProj v hv := by
  let i := coordinateIndex v hv
  have hi : v i ≠ 0 := coordinateIndex_ne_zero v hv
  have hci : (c • v) i ≠ 0 := by simpa using mul_ne_zero hc hi
  calc
    chartIntegralProj (c • v) (smul_ne_zero hc hv) =
        chartIntegralProjAt (c • v) i hci :=
      chartIntegralProjAt_congr _ _ _ (coordinateIndex_smul v hv c hc)
    _ = chartIntegralProjAt v i hi := chartIntegralProjAt_smul v i hi c hc
    _ = chartIntegralProj v hv := rfl

/-- The selected-chart construction agrees with evaluation in every nonzero coordinate chart. -/
lemma chartIntegralProj_eq_chartIntegralProjAt {n : ℕ} (v : CoordinateSpace n)
    (hv : v ≠ 0) (i : Fin (n + 1)) (hi : v i ≠ 0) :
    chartIntegralProj v hv = chartIntegralProjAt v i hi :=
  chartIntegralProjAt_independent v (coordinateIndex v hv) i
    (coordinateIndex_ne_zero v hv) hi

/-- The irrelevant ideal of the homogeneous coordinate ring is contained in the ideal generated
by the degree-one coordinates. -/
lemma irrelevant_le_span_coordinates (n : ℕ) :
    (HomogeneousIdeal.irrelevant (UniversalGrading n)).toIdeal ≤
      Ideal.span (Set.range (MvPolynomial.X : Fin (n + 1) → UniversalRing n)) := by
  rw [HomogeneousIdeal.irrelevant_eq_span, Ideal.span_le]
  intro r hr
  simp only [Set.mem_iUnion] at hr
  obtain ⟨d, hd⟩ := hr
  obtain ⟨hd0, hr⟩ := hd
  have hrpow : r ∈
      Ideal.span (Set.range (MvPolynomial.X : Fin (n + 1) → UniversalRing n)) ^ d := by
    rw [Ideal.span_pow_eq_map_homogeneousSubmodule]
    exact ⟨MvPolynomial.map MvPolynomial.C r, hr.map _, by simp⟩
  exact Ideal.pow_le_self hd0.ne' hrpow

/-- The standard coordinate basic opens cover the integral `Proj` model of finite-dimensional
projective space. -/
lemma iSup_coordinateBasicOpen_eq_top (n : ℕ) :
    ⨆ i : Fin (n + 1),
      Proj.basicOpen (UniversalGrading n) (MvPolynomial.X i) = ⊤ :=
  Proj.iSup_basicOpen_eq_top _ _ (irrelevant_le_span_coordinates n)

set_option backward.isDefEq.respectTransparency.types false in
/-- Every complex point of the integral projective spectrum has homogeneous coordinates in some
standard affine chart. -/
lemma exists_coordinates_of_integralProj {n : ℕ}
    (q : Spec ↧ℂ ⟶ Proj (UniversalGrading n)) :
    ∃ (i : Fin (n + 1)) (v : CoordinateSpace n) (_hv : v ≠ 0) (hi : v i ≠ 0),
      chartIntegralProjAt v i hi = q := by
  have hmem : q (IsLocalRing.closedPoint ℂ) ∈ (⊤ : (Proj (UniversalGrading n)).Opens) :=
    trivial
  rw [← iSup_coordinateBasicOpen_eq_top n,
    TopologicalSpace.Opens.mem_iSup] at hmem
  obtain ⟨i, hi⟩ := hmem
  let e := Proj.awayι (UniversalGrading n) (MvPolynomial.X i)
    (MvPolynomial.isHomogeneous_X _ _) zero_lt_one
  have hRange : Set.range q ⊆ Set.range e := by
    change Set.range q ⊆ e.opensRange
    dsimp only [e]
    rw [Proj.opensRange_awayι]
    rintro _ ⟨x, rfl⟩
    obtain rfl := Subsingleton.elim x (IsLocalRing.closedPoint ℂ)
    exact hi
  obtain ⟨v, hv, hvi, hq⟩ := exists_coordinates_of_range_subset_chart q i hRange
  exact ⟨i, v, hv, hvi, hq⟩

/-- Every complex-valued point of the integral projective spectrum is represented by a nonzero
homogeneous coordinate vector. -/
lemma surjective_chartIntegralProj {n : ℕ} :
    Function.Surjective (fun v : {v : CoordinateSpace n // v ≠ 0} ↦
      chartIntegralProj v.1 v.2) := by
  intro q
  obtain ⟨i, v, hv, hi, hq⟩ := exists_coordinates_of_integralProj q
  refine ⟨⟨v, hv⟩, ?_⟩
  change chartIntegralProj v hv = q
  rw [chartIntegralProj_eq_chartIntegralProjAt v hv i hi, hq]

/-- Nonzero homogeneous coordinates define a point of scheme-theoretic projective space over
`Spec ℂ`. -/
noncomputable def vectorToProjectiveSpace {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0) :
    Spec ↧ℂ ⟶ Foundations.ProjectiveSpaceIs.ProjectiveSpace (Fin (n + 1)) (Spec ↧ℂ) :=
  Limits.pullback.lift (𝟙 _) (chartIntegralProj v hv) (Subsingleton.elim _ _)

/-- Rescaling homogeneous coordinates does not change the resulting projective-space
morphism. -/
lemma vectorToProjectiveSpace_smul {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0)
    (c : ℂ) (hc : c ≠ 0) :
    vectorToProjectiveSpace (c • v) (smul_ne_zero hc hv) =
      vectorToProjectiveSpace v hv := by
  apply Limits.pullback.hom_ext
  · rw [vectorToProjectiveSpace, vectorToProjectiveSpace,
      Limits.pullback.lift_fst, Limits.pullback.lift_fst]
  · simp [vectorToProjectiveSpace, chartIntegralProj_smul v hv c hc]

@[simp]
lemma vectorToProjectiveSpace_toBase {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0) :
    vectorToProjectiveSpace v hv ≫
      Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ) = 𝟙 _ :=
  Limits.pullback.lift_fst _ _ _

/-- Nonzero homogeneous coordinates define a complex point of scheme-theoretic projective
space. -/
noncomputable def vectorToComplexPoint {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0) :
    ComplexPoint.Basic.ComplexSchemePoint (Over.mk (Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ))) :=
  Over.homMk (vectorToProjectiveSpace v hv) (vectorToProjectiveSpace_toBase v hv)

/-- Rescaling homogeneous coordinates does not change the resulting complex point. -/
lemma vectorToComplexPoint_smul {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0)
    (c : ℂ) (hc : c ≠ 0) :
    vectorToComplexPoint (c • v) (smul_ne_zero hc hv) = vectorToComplexPoint v hv :=
  Over.OverMorphism.ext (vectorToProjectiveSpace_smul v hv c hc)

set_option backward.isDefEq.respectTransparency.types false in
/-- Every complex point of scheme-theoretic projective space is represented by a nonzero
homogeneous coordinate vector. -/
lemma surjective_vectorToComplexPoint {n : ℕ} :
    Function.Surjective (fun v : {v : CoordinateSpace n // v ≠ 0} ↦
      vectorToComplexPoint v.1 v.2) := by
  intro z
  obtain ⟨v, hq⟩ := surjective_chartIntegralProj
    (z.left ≫ Limits.pullback.snd
      (Limits.terminal.from (Spec ↧ℂ))
      (Limits.terminal.from (Proj (UniversalGrading n))))
  refine ⟨v, ?_⟩
  apply Over.OverMorphism.ext
  change vectorToProjectiveSpace v.1 v.2 = z.left
  apply Limits.pullback.hom_ext
  · change vectorToProjectiveSpace v.1 v.2 ≫
      Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ) =
        z.left ≫ Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ)
    rw [vectorToProjectiveSpace_toBase]
    exact (Over.w z).symm
  · rw [vectorToProjectiveSpace, Limits.pullback.lift_snd]
    exact hq

/-- For `n ∈ ℕ`, this map sends a complex line in `ℂ^{n+1}` to the complex point of the scheme
`ℙ^n_ℂ` with those homogeneous coordinates. For a nonzero representative `v`, it evaluates
affine coordinates as `X_j/X_i = v_j/v_i` on a chart where `v_i ≠ 0`; the resulting point is
independent of scaling `v`. -/
noncomputable def projectivizationToComplexPoint {n : ℕ} :
    Projectivization ℂ (CoordinateSpace n) →
      ComplexPoint.Basic.ComplexSchemePoint (Over.mk (Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ))) :=
  Projectivization.lift
    (fun v ↦ vectorToComplexPoint v.1 v.2)
    (fun a b c h ↦ by
      have hc : c ≠ 0 := by
        intro hc
        apply a.2
        rw [h, hc, zero_smul]
      simpa only [h] using vectorToComplexPoint_smul b.1 b.2 c hc)

@[simp]
lemma projectivizationToComplexPoint_mk {n : ℕ}
    (v : CoordinateSpace n) (hv : v ≠ 0) :
    projectivizationToComplexPoint (Projectivization.mk ℂ v hv) =
      vectorToComplexPoint v hv :=
  rfl

/-- The coordinate map from linear projectivization onto the complex points of scheme-theoretic
projective space is surjective. -/
lemma surjective_projectivizationToComplexPoint {n : ℕ} :
    Function.Surjective (projectivizationToComplexPoint (n := n)) := by
  intro z
  obtain ⟨v, hz⟩ := surjective_vectorToComplexPoint z
  exact ⟨Projectivization.mk ℂ v.1 v.2, hz⟩

noncomputable def chartPolynomialEvaluationHom {n : ℕ} (i : Fin (n + 1)) :
    UniversalRing n →+* MvPolynomial (Fin (n + 1)) ℂ :=
  MvPolynomial.eval₂Hom
    ((MvPolynomial.C : ℂ →+* MvPolynomial (Fin (n + 1)) ℂ).comp
      ((algebraMap ℤ ℂ).comp ULift.ringEquiv.toRingHom))
    (fun j ↦ if j = i then 1 else MvPolynomial.X j)

@[simp]
lemma chartPolynomialEvaluationHom_X_self {n : ℕ} (i : Fin (n + 1)) :
    chartPolynomialEvaluationHom i (MvPolynomial.X i) = 1 := by
  simp [chartPolynomialEvaluationHom]

noncomputable def chartAwayPolynomialHom {n : ℕ} (i : Fin (n + 1)) :
    HomogeneousLocalization.Away (UniversalGrading n) (MvPolynomial.X i) →+*
      MvPolynomial (Fin (n + 1)) ℂ :=
  (Localization.awayLift
    (chartPolynomialEvaluationHom i) (MvPolynomial.X i) (by
      rw [chartPolynomialEvaluationHom_X_self]
      exact isUnit_one)).comp
    (algebraMap
      (HomogeneousLocalization.Away (UniversalGrading n) (MvPolynomial.X i))
      (Localization.Away (MvPolynomial.X i)))

set_option backward.isDefEq.respectTransparency.types false in
@[simp]
lemma chartAwayPolynomialHom_chartCoordinate {n : ℕ} (i j : Fin (n + 1)) :
    chartAwayPolynomialHom i (chartCoordinate i j) =
      if j = i then 1 else MvPolynomial.X j := by
  simp only [chartAwayPolynomialHom, RingHom.coe_comp, Function.comp_apply]
  change (Localization.awayLift (chartPolynomialEvaluationHom i) (MvPolynomial.X i) _)
    (Localization.mk (MvPolynomial.X j) ⟨MvPolynomial.X i ^ 1, ⟨1, rfl⟩⟩) = _
  rw [Localization.awayLift_mk (chartPolynomialEvaluationHom i) (MvPolynomial.X i)
    (MvPolynomial.X j) 1]
  simp [chartPolynomialEvaluationHom]
  simp

noncomputable def chartAffineToProj {n : ℕ} (i : Fin (n + 1)) :
    ComplexPoint.Basic.ComplexSchemePoint.complexAffineSpace (Fin (n + 1)) ⟶ Proj (UniversalGrading n) :=
  (AffineSpace.SpecIso (Fin (n + 1)) ↧ℂ).hom ≫
    Spec.map (CommRingCat.ofHom (chartAwayPolynomialHom i)) ≫
    Proj.awayι (UniversalGrading n) (MvPolynomial.X i)
      (MvPolynomial.isHomogeneous_X _ _) zero_lt_one

noncomputable def chartAffineToProjectiveSpace {n : ℕ} (i : Fin (n + 1)) :
    ComplexPoint.Basic.ComplexSchemePoint.complexAffineSpace (Fin (n + 1)) ⟶
      Foundations.ProjectiveSpaceIs.ProjectiveSpace (Fin (n + 1)) (Spec ↧ℂ) :=
  Limits.pullback.lift
    (ComplexPoint.Basic.ComplexSchemePoint.complexAffineSpace (Fin (n + 1)) ↘ Spec ↧ℂ)
    (chartAffineToProj i) (Subsingleton.elim _ _)

@[reassoc]
lemma chartAffineToProjectiveSpace_over {n : ℕ} (i : Fin (n + 1)) :
    chartAffineToProjectiveSpace i ≫
      Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ) =
    ComplexPoint.Basic.ComplexSchemePoint.complexAffineSpace (Fin (n + 1)) ↘ Spec ↧ℂ :=
  Limits.pullback.lift_fst _ _ _

@[reassoc]
lemma chartAffineToProjectiveSpace_toProj {n : ℕ} (i : Fin (n + 1)) :
    chartAffineToProjectiveSpace i ≫
      Limits.pullback.snd
        (Limits.terminal.from (Spec ↧ℂ))
        (Limits.terminal.from (Proj (UniversalGrading n))) =
    chartAffineToProj i :=
  Limits.pullback.lift_snd _ _ _

noncomputable def chartAffineComplexPointMap {n : ℕ} (i : Fin (n + 1)) :
    ComplexPoint.Basic.ComplexSchemePoint (Over.mk (ComplexPoint.Basic.ComplexSchemePoint.complexAffineSpace (Fin (n + 1)) ↘ Spec ↧ℂ)) →
      ComplexPoint.Basic.ComplexSchemePoint (Over.mk (Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ))) :=
  ComplexPoint.Basic.Point.map (Over.homMk (chartAffineToProjectiveSpace i)
    (chartAffineToProjectiveSpace_over i))

lemma continuous_chartAffineComplexPointMap {n : ℕ} (i : Fin (n + 1)) :
    @Continuous
      (ComplexPoint.Basic.ComplexSchemePoint (Over.mk (ComplexPoint.Basic.ComplexSchemePoint.complexAffineSpace (Fin (n + 1)) ↘ Spec ↧ℂ)))
      (ComplexPoint.Basic.ComplexSchemePoint (Over.mk (Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ))))
      ComplexPoint.Basic.Point.analyticTopology ComplexPoint.Basic.Point.analyticTopology
      (chartAffineComplexPointMap i) :=
  ComplexPoint.Basic.Point.continuous_map _

/-- Affine ratio coordinates associated to a vector in the `i`-th standard chart. -/
noncomputable def vectorChartRatios {n : ℕ} (i : Fin (n + 1))
    (v : {v : CoordinateSpace n // v i ≠ 0}) : CoordinateSpace n :=
  (v.1 i)⁻¹ • v.1

lemma continuous_vectorChartRatios {n : ℕ} (i : Fin (n + 1)) :
    Continuous (vectorChartRatios (n := n) i) := by
  apply continuous_pi
  intro j
  have hci : Continuous (fun v : {v : CoordinateSpace n // v i ≠ 0} ↦ v.1 i) :=
    (continuous_apply i).comp continuous_subtype_val
  have hcj : Continuous (fun v : {v : CoordinateSpace n // v i ≠ 0} ↦ v.1 j) :=
    (continuous_apply j).comp continuous_subtype_val
  exact (hci.inv₀ (fun v ↦ v.property)).mul hcj

noncomputable def vectorChartToAffinePoint {n : ℕ} (i : Fin (n + 1)) :
    {v : CoordinateSpace n // v i ≠ 0} →
      ComplexPoint.Basic.ComplexSchemePoint (Over.mk (ComplexPoint.Basic.ComplexSchemePoint.complexAffineSpace (Fin (n + 1)) ↘ Spec ↧ℂ)) :=
  (ComplexPoint.Basic.ComplexSchemePoint.affineSpaceEquiv (Fin (n + 1))).symm ∘ vectorChartRatios i

lemma continuous_vectorChartToAffinePoint {n : ℕ} (i : Fin (n + 1)) :
    @Continuous {v : CoordinateSpace n // v i ≠ 0}
      (ComplexPoint.Basic.ComplexSchemePoint (Over.mk (ComplexPoint.Basic.ComplexSchemePoint.complexAffineSpace (Fin (n + 1)) ↘ Spec ↧ℂ)))
      inferInstance ComplexPoint.Basic.Point.analyticTopology
      (vectorChartToAffinePoint i) :=
  (ComplexPoint.Basic.ComplexSchemePoint.affineSpaceHomeomorph (Fin (n + 1))).symm.continuous.comp
    (continuous_vectorChartRatios i)

lemma continuous_chartVectorToComplexPoint {n : ℕ} (i : Fin (n + 1)) :
    @Continuous {v : CoordinateSpace n // v i ≠ 0}
      (ComplexPoint.Basic.ComplexSchemePoint (Over.mk (Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ))))
      inferInstance ComplexPoint.Basic.Point.analyticTopology
      (chartAffineComplexPointMap i ∘ vectorChartToAffinePoint i) := by
  exact (continuous_chartAffineComplexPointMap i).comp
    (continuous_vectorChartToAffinePoint i)

lemma specPreimage_apply {R : CommRingCat} (f : Spec ↧ℂ ⟶ Spec R) (r : R) :
    (Spec.preimage f).hom r =
      (Scheme.ΓSpecIso ↧ℂ).hom
        (f.appTop ((Scheme.ΓSpecIso R).inv r)) := by
  have h := Scheme.ΓSpecIso_naturality (Spec.preimage f)
  have h' := DFunLike.congr_fun (congrArg CommRingCat.Hom.hom h)
    ((Scheme.ΓSpecIso R).inv r)
  simpa using h'.symm

set_option backward.isDefEq.respectTransparency.types false in
lemma vectorChartToAffinePoint_comp_SpecIso {n : ℕ} (i : Fin (n + 1))
    (v : {v : CoordinateSpace n // v i ≠ 0}) :
    (vectorChartToAffinePoint i v).left ≫
        (AffineSpace.SpecIso (Fin (n + 1)) ↧ℂ).hom =
      Spec.map (CommRingCat.ofHom
        (MvPolynomial.eval₂Hom (RingHom.id ℂ) (vectorChartRatios i v))) := by
  rw [← Spec.map_preimage ((vectorChartToAffinePoint i v).left ≫
    (AffineSpace.SpecIso (Fin (n + 1)) ↧ℂ).hom)]
  congr 1
  apply CommRingCat.hom_ext
  apply MvPolynomial.ringHom_ext
  · intro c
    rw [specPreimage_apply]
    simp only [Scheme.Hom.comp_appTop, CommRingCat.comp_apply]
    rw [ComplexPoint.Basic.ComplexSchemePoint.SpecIso_hom_appTop_C]
    change (Scheme.ΓSpecIso ↧ℂ).hom
      ((((ComplexPoint.Basic.ComplexSchemePoint.complexAffineSpace (Fin (n + 1)) ↘ Spec ↧ℂ).appTop ≫
        (vectorChartToAffinePoint i v).left.appTop))
          ((Scheme.ΓSpecIso ↧ℂ).inv c)) = _
    rw [← Scheme.Hom.comp_appTop, show (vectorChartToAffinePoint i v).left ≫
      (ComplexPoint.Basic.ComplexSchemePoint.complexAffineSpace (Fin (n + 1)) ↘ Spec ↧ℂ) = 𝟙 _ from
        Over.w (vectorChartToAffinePoint i v)]
    simp
  · intro j
    rw [specPreimage_apply]
    simp only [Scheme.Hom.comp_appTop, CommRingCat.comp_apply]
    rw [ComplexPoint.Basic.ComplexSchemePoint.SpecIso_hom_appTop_X]
    change (Scheme.ΓSpecIso ↧ℂ).hom
      ((vectorChartToAffinePoint i v).left.appTop
        (AffineSpace.coord (Spec ↧ℂ) j)) = _
    simp [vectorChartToAffinePoint, ComplexPoint.Basic.ComplexSchemePoint.affineSpaceEquiv]

set_option backward.isDefEq.respectTransparency.types false in
lemma chartAwayPolynomialHom_evaluate_ratios {n : ℕ} (i : Fin (n + 1))
    (v : {v : CoordinateSpace n // v i ≠ 0}) :
    (MvPolynomial.eval₂Hom (RingHom.id ℂ) (vectorChartRatios i v)).comp
        (chartAwayPolynomialHom i) =
      awayCoordinateEvaluation v.1 i v.2 := by
  apply awayRingHom_ext i
  · intro a
    exact DFunLike.congr_fun (degreeZero_ringHom_unique
      (((MvPolynomial.eval₂Hom (RingHom.id ℂ) (vectorChartRatios i v)).comp
        (chartAwayPolynomialHom i)).comp
          (HomogeneousLocalization.fromZeroRingHom (UniversalGrading n)
            (Submonoid.powers (MvPolynomial.X i : UniversalRing n))))
      ((awayCoordinateEvaluation v.1 i v.2).comp
        (HomogeneousLocalization.fromZeroRingHom (UniversalGrading n)
          (Submonoid.powers (MvPolynomial.X i : UniversalRing n))))) a
  · intro j
    rw [RingHom.comp_apply, chartAwayPolynomialHom_chartCoordinate]
    change _ = awayCoordinateEvaluation v.1 i v.2
      (HomogeneousLocalization.Away.mk (UniversalGrading n)
        (MvPolynomial.isHomogeneous_X _ i) 1 (MvPolynomial.X j) _)
    rw [awayCoordinateEvaluation_mk
      (hr := MvPolynomial.isHomogeneous_X (ULift ℤ) j)]
    simp only [coordinateEvaluationHom_X]
    by_cases hji : j = i
    · subst j
      simp [vectorChartRatios, v.2]
    · simp [hji, vectorChartRatios]
      ring

set_option backward.isDefEq.respectTransparency.types false in
lemma vectorChartToAffinePoint_comp_chartAffineToProj {n : ℕ} (i : Fin (n + 1))
    (v : {v : CoordinateSpace n // v i ≠ 0}) :
    (vectorChartToAffinePoint i v).left ≫ chartAffineToProj i =
      chartIntegralProjAt v.1 i v.2 := by
  unfold chartAffineToProj chartIntegralProjAt
  rw [← Category.assoc, vectorChartToAffinePoint_comp_SpecIso, ← Category.assoc,
    ← Spec.map_comp, show CommRingCat.ofHom (chartAwayPolynomialHom i) ≫
      CommRingCat.ofHom
        (MvPolynomial.eval₂Hom (RingHom.id ℂ) (vectorChartRatios i v)) =
      CommRingCat.ofHom (awayCoordinateEvaluation v.1 i v.2) from
    CommRingCat.hom_ext (chartAwayPolynomialHom_evaluate_ratios i v)]

lemma vector_ne_zero_of_coordinate {n : ℕ} (v : CoordinateSpace n)
    (i : Fin (n + 1)) (hi : v i ≠ 0) : v ≠ 0 :=
  fun h ↦ hi (congrFun h i)

@[reassoc]
lemma vectorToProjectiveSpace_toProj {n : ℕ} (v : CoordinateSpace n) (hv : v ≠ 0) :
    vectorToProjectiveSpace v hv ≫
      Limits.pullback.snd
        (Limits.terminal.from (Spec ↧ℂ))
        (Limits.terminal.from (Proj (UniversalGrading n))) =
    chartIntegralProj v hv :=
  Limits.pullback.lift_snd _ _ _

set_option backward.isDefEq.respectTransparency.types false in
lemma chartVectorToComplexPoint_eq {n : ℕ} (i : Fin (n + 1))
    (v : {v : CoordinateSpace n // v i ≠ 0}) :
    chartAffineComplexPointMap i (vectorChartToAffinePoint i v) =
      vectorToComplexPoint v.1 (vector_ne_zero_of_coordinate v.1 i v.2) := by
  apply Over.OverMorphism.ext
  apply Limits.pullback.hom_ext
  · change ((vectorChartToAffinePoint i v).left ≫ chartAffineToProjectiveSpace i) ≫
      Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ) =
      vectorToProjectiveSpace v.1 (vector_ne_zero_of_coordinate v.1 i v.2) ≫
        Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ)
    calc
      _ = (vectorChartToAffinePoint i v).left ≫
          (chartAffineToProjectiveSpace i ≫
            Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ)) :=
        Category.assoc _ _ _
      _ = (vectorChartToAffinePoint i v).left ≫
          (ComplexPoint.Basic.ComplexSchemePoint.complexAffineSpace (Fin (n + 1)) ↘ Spec ↧ℂ) := by
        rw [chartAffineToProjectiveSpace_over]
      _ = 𝟙 _ := Over.w (vectorChartToAffinePoint i v)
      _ = _ := (vectorToProjectiveSpace_toBase _ _).symm
  · calc
      _ = (vectorChartToAffinePoint i v).left ≫
          (chartAffineToProjectiveSpace i ≫ Limits.pullback.snd
            (Limits.terminal.from (Spec ↧ℂ))
            (Limits.terminal.from (Proj (UniversalGrading n)))) :=
        Category.assoc _ _ _
      _ = (vectorChartToAffinePoint i v).left ≫ chartAffineToProj i := by
        rw [chartAffineToProjectiveSpace_toProj]
      _ = chartIntegralProjAt v.1 i v.2 :=
        vectorChartToAffinePoint_comp_chartAffineToProj i v
      _ = chartIntegralProj v.1 (vector_ne_zero_of_coordinate v.1 i v.2) :=
        (chartIntegralProj_eq_chartIntegralProjAt v.1
          (vector_ne_zero_of_coordinate v.1 i v.2) i v.2).symm
      _ = _ := (vectorToProjectiveSpace_toProj _ _).symm

/-- Nonzero vectors whose `i`-th coordinate is nonzero. -/
def nonzeroVectorChart {n : ℕ} (i : Fin (n + 1)) :
    Set {v : CoordinateSpace n // v ≠ 0} :=
  {v | v.1 i ≠ 0}

/-- Forget the redundant global nonvanishing proof on a standard coordinate chart. -/
def toVectorChart {n : ℕ} (i : Fin (n + 1))
    (v : nonzeroVectorChart i) : {v : CoordinateSpace n // v i ≠ 0} :=
  ⟨v.1.1, v.2⟩

lemma continuous_toVectorChart {n : ℕ} (i : Fin (n + 1)) :
    Continuous (toVectorChart i) :=
  continuous_subtype_val.comp continuous_subtype_val |>.subtype_mk _

lemma isOpen_nonzeroVectorChart {n : ℕ} (i : Fin (n + 1)) :
    IsOpen (nonzeroVectorChart i) :=
  isOpen_ne.preimage ((continuous_apply i).comp continuous_subtype_val)

lemma iUnion_nonzeroVectorChart {n : ℕ} :
    ⋃ i : Fin (n + 1), nonzeroVectorChart i = Set.univ := by
  apply Set.eq_univ_of_forall
  intro v
  rw [Set.mem_iUnion]
  by_contra h
  apply v.2
  funext i
  by_contra hi
  exact h ⟨i, hi⟩

lemma continuousOn_vectorToComplexPoint_chart {n : ℕ} (i : Fin (n + 1)) :
    @ContinuousOn {v : CoordinateSpace n // v ≠ 0}
      (ComplexPoint.Basic.ComplexSchemePoint (Over.mk (Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ))))
      inferInstance ComplexPoint.Basic.Point.analyticTopology
      (fun v ↦ vectorToComplexPoint v.1 v.2) (nonzeroVectorChart i) := by
  rw [continuousOn_iff_continuous_domRestrict]
  have h := (continuous_chartVectorToComplexPoint i).comp
    (continuous_toVectorChart i)
  exact h.congr fun v ↦ chartVectorToComplexPoint_eq i (toVectorChart i v)

lemma continuous_vectorToComplexPoint {n : ℕ} :
    @Continuous {v : CoordinateSpace n // v ≠ 0}
      (ComplexPoint.Basic.ComplexSchemePoint (Over.mk (Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ))))
      inferInstance ComplexPoint.Basic.Point.analyticTopology
      (fun v ↦ vectorToComplexPoint v.1 v.2) := by
  apply continuous_of_continuousOn_iUnion_of_isOpen
    (continuousOn_vectorToComplexPoint_chart (n := n))
    (isOpen_nonzeroVectorChart (n := n))
    iUnion_nonzeroVectorChart

lemma continuous_projectivizationToComplexPoint {n : ℕ} :
    @Continuous (Projectivization ℂ (CoordinateSpace n))
      (ComplexPoint.Basic.ComplexSchemePoint (Over.mk (Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ))))
      (instTopologicalSpace n) ComplexPoint.Basic.Point.analyticTopology
      projectivizationToComplexPoint := by
  apply Continuous.quotient_lift
  exact continuous_vectorToComplexPoint

/-- Finite-dimensional scheme-theoretic complex projective space is analytically compact. -/
noncomputable instance instCompactSpaceProjectiveSpaceComplexPoint (n : ℕ) :
    CompactSpace
      (ComplexPoint.Basic.ComplexSchemePoint (Over.mk (Foundations.ProjectiveSpaceIs.ProjectiveSpace.toBase (Fin (n + 1)) (Spec ↧ℂ)))) := by
  constructor
  rw [← (surjective_projectivizationToComplexPoint (n := n)).range_eq]
  exact isCompact_range continuous_projectivizationToComplexPoint

end OAI.AlgebraicGeometry.ComplexPoint.Projective.ComplexProjectiveSpace