File size: 5,310 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
import Mathlib.Analysis.Normed.Module.Connected
import Mathlib.Analysis.Complex.Basic
import Mathlib.LinearAlgebra.Complex.FiniteDimensional
import Mathlib.Algebra.Polynomial.Roots
import Mathlib.LinearAlgebra.Matrix.NonsingularInverse
import Mathlib.Topology.Instances.Matrix

/-! # Complex Linear Homotopy -/

namespace OAI.AlgebraicGeometry.CycleClass.Geometric.ComplexLinearHomotopy.Cycles

noncomputable section

/-!
# Paths through invertible complex matrices

The determinant of the pencil `(1-z)I + zA` is a nonzero complex polynomial.
Its finite root set can be avoided by a path from `0` to `1`. Mapping that path
through the pencil produces a path of invertible matrices from `I` to `A`.
This proves the actual homotopy input for later orientation arguments, without
assuming a local homology generator or any fundamental-class theorem.
-/

open _root_.Polynomial

universe u

variable {n : Type u} [DecidableEq n]

/-- The affine complex pencil joining the identity matrix to `A`. -/
def complexMatrixPencil (A : Matrix n n β„‚) (z : β„‚) : Matrix n n β„‚ :=
  (1 - z) β€’ (1 : Matrix n n β„‚) + z β€’ A

@[simp]
theorem complexMatrixPencil_zero (A : Matrix n n β„‚) :
    complexMatrixPencil A 0 = 1 := by
  simp [complexMatrixPencil]

@[simp]
theorem complexMatrixPencil_one (A : Matrix n n β„‚) :
    complexMatrixPencil A 1 = A := by
  simp [complexMatrixPencil]

theorem continuous_complexMatrixPencil (A : Matrix n n β„‚) :
    Continuous (complexMatrixPencil A) :=
  ((continuous_const.sub continuous_id).smul continuous_const).add
    (continuous_id.smul continuous_const)

/-- The pencil entries as actual one-variable polynomials. -/
def complexMatrixPolynomial (A : Matrix n n β„‚) : Matrix n n β„‚[X] :=
  fun i j => (1 - Polynomial.X) * Polynomial.C ((1 : Matrix n n β„‚) i j) +
    Polynomial.X * Polynomial.C (A i j)

variable [Fintype n]

/-- The determinant polynomial whose roots are the singular parameters. -/
def complexMatrixDetPolynomial (A : Matrix n n β„‚) : β„‚[X] :=
  (complexMatrixPolynomial A).det

@[simp]
theorem complexMatrixDetPolynomial_eval (A : Matrix n n β„‚) (z : β„‚) :
    (complexMatrixDetPolynomial A).eval z = (complexMatrixPencil A z).det := by
  have hmap : (Polynomial.evalRingHom z).mapMatrix (complexMatrixPolynomial A) =
      complexMatrixPencil A z := by
    ext i j
    simp [complexMatrixPolynomial, complexMatrixPencil, Matrix.smul_apply]
    exact mul_comm _ _
  exact ((Polynomial.evalRingHom z).map_det (complexMatrixPolynomial A)).trans
    (congrArg Matrix.det hmap)

@[simp]
theorem complexMatrixDetPolynomial_eval_zero (A : Matrix n n β„‚) :
    (complexMatrixDetPolynomial A).eval 0 = 1 := by
  simp

@[simp]
theorem complexMatrixDetPolynomial_eval_one (A : Matrix n n β„‚) :
    (complexMatrixDetPolynomial A).eval 1 = A.det := by
  simp

theorem complexMatrixDetPolynomial_ne_zero (A : Matrix n n β„‚) :
    complexMatrixDetPolynomial A β‰  0 := by
  intro h
  have hz := congrArg (fun q : β„‚[X] => q.eval 0) h
  simp at hz

/-- The singular parameters of the pencil form a finite set. -/
theorem finite_complexMatrixPencil_singular (A : Matrix n n β„‚) :
    Set.Finite {z : β„‚ | (complexMatrixPencil A z).det = 0} := by
  simpa only [Polynomial.IsRoot, complexMatrixDetPolynomial_eval] using
    Polynomial.finite_setOfPred_isRoot (complexMatrixDetPolynomial_ne_zero A)

/-- A nonsingular complex matrix can be joined to the identity without crossing
a singular matrix. -/
theorem joinedIn_complexMatrix_det_ne_zero (A : Matrix n n β„‚) (hA : A.det β‰  0) :
    JoinedIn {M : Matrix n n β„‚ | M.det β‰  0} 1 A := by
  let S : Set β„‚ := {z : β„‚ | (complexMatrixPencil A z).det = 0}ᢜ
  have hS : IsPathConnected S :=
    (finite_complexMatrixPencil_singular A).countable.isPathConnected_compl_of_one_lt_rank
      (by simp [Complex.rank_real_complex])
  have h0 : (0 : β„‚) ∈ S := by simp [S]
  have h1 : (1 : β„‚) ∈ S := by simpa [S] using hA
  have hpath := (hS.joinedIn 0 h0 1 h1).map (continuous_complexMatrixPencil A).continuousOn
  have hrange : complexMatrixPencil A '' S βŠ† {M : Matrix n n β„‚ | M.det β‰  0} := by
    rintro M ⟨z, hz, rfl⟩
    exact hz
  simpa only [complexMatrixPencil_zero, complexMatrixPencil_one] using hpath.mono hrange

/-- The group of invertible complex matrices is path connected, expressed as
the actual invertible subset of matrix space. -/
theorem isPathConnected_invertible_complexMatrices :
    IsPathConnected {M : Matrix n n β„‚ | IsUnit M} := by
  refine ⟨1, isUnit_one, ?_⟩
  intro A hA
  have hdet : A.det β‰  0 := ((Matrix.isUnit_iff_isUnit_det A).mp hA).ne_zero
  apply (joinedIn_complexMatrix_det_ne_zero A hdet).mono
  intro M hM
  exact (Matrix.isUnit_iff_isUnit_det M).mpr (isUnit_iff_ne_zero.mpr hM)

/-- A chosen genuine path of invertible matrices from the identity to `A`. -/
def complexMatrixPath (A : Matrix n n β„‚) (hA : IsUnit A) :
    Path (1 : Matrix n n β„‚) A :=
  (isPathConnected_invertible_complexMatrices.joinedIn 1 isUnit_one A hA).somePath

theorem complexMatrixPath_isUnit (A : Matrix n n β„‚) (hA : IsUnit A)
    (t : unitInterval) : IsUnit (complexMatrixPath A hA t) :=
  (isPathConnected_invertible_complexMatrices.joinedIn 1 isUnit_one A hA).somePath_mem t

end

end OAI.AlgebraicGeometry.CycleClass.Geometric.ComplexLinearHomotopy.Cycles