File size: 3,098 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
import OAI.LinearAlgebra.Moore.Form

/-! A positive quaternionic matrix has a genuine two-sided quaternionic inverse. -/

noncomputable section

namespace OAI.LinearAlgebra.Moore

open Matrix OAI.Analysis.PDE.Dirichlet
open scoped MatrixOrder ComplexOrder

def quaternionMulVecLinear {n : β„•}
    (A : Matrix (Fin n) (Fin n) (Quaternion ℝ)) :
    (Fin n β†’ Quaternion ℝ) β†’β‚—[ℝ] (Fin n β†’ Quaternion ℝ) where
  toFun := A.mulVec
  map_add' := A.mulVec_add
  map_smul' := by
    intro c z
    funext i
    simp [Matrix.mulVec, dotProduct, Finset.smul_sum]

theorem quaternionForm_eq_dotProduct {n : β„•}
    (A : Matrix (Fin n) (Fin n) (Quaternion ℝ)) (z : Fin n β†’ Quaternion ℝ) :
    OAI.Analysis.PDE.Dirichlet.quaternionForm A z = star z ⬝α΅₯ A *α΅₯ z := by
  simp only [OAI.Analysis.PDE.Dirichlet.quaternionForm, dotProduct, Matrix.mulVec, Finset.mul_sum, Pi.star_apply,
    mul_assoc]

theorem quaternionMulVec_injective_of_pos {n : β„•}
    (A : Matrix (Fin n) (Fin n) (Quaternion ℝ))
    (hpos : βˆ€ z β‰  0, 0 < (OAI.Analysis.PDE.Dirichlet.quaternionForm A z).re) : Function.Injective A.mulVec := by
  change Function.Injective (quaternionMulVecLinear A)
  apply (LinearMap.ker_eq_bot).mp
  rw [LinearMap.ker_eq_bot']
  intro z hz
  by_contra hne
  have hp := hpos z hne
  have hz' : A *α΅₯ z = 0 := hz
  rw [quaternionForm_eq_dotProduct, hz'] at hp
  simp at hp

/-- The inverse is constructed from surjectivity of real-linear multiplication;
no commutative determinant or quaternionic spectral theorem is assumed. -/
theorem exists_quaternion_inverse_of_pos {n : β„•}
    (A : Matrix (Fin n) (Fin n) (Quaternion ℝ))
    (hpos : βˆ€ z β‰  0, 0 < (OAI.Analysis.PDE.Dirichlet.quaternionForm A z).re) :
    βˆƒ C : Matrix (Fin n) (Fin n) (Quaternion ℝ), A * C = 1 ∧ C * A = 1 := by
  have hi := quaternionMulVec_injective_of_pos A hpos
  have hs : Function.Surjective (quaternionMulVecLinear A) :=
    LinearMap.surjective_of_injective hi
  choose v hv using hs
  let C : Matrix (Fin n) (Fin n) (Quaternion ℝ) := fun i j ↦ v (Pi.single j 1) i
  have hAC : A * C = 1 := by
    apply Matrix.ext
    intro i j
    have h := congrFun (hv (Pi.single j 1)) i
    change (A *α΅₯ v (Pi.single j 1)) i = (Pi.single j (1 : Quaternion ℝ) : Fin n β†’ Quaternion ℝ) i at h
    change (A *α΅₯ v (Pi.single j 1)) i = (1 : Matrix _ _ _) i j
    simpa only [Matrix.one_apply, Pi.single_apply, eq_comm] using h
  refine ⟨C, hAC, ?_⟩
  have he : A * (C * A) = A * 1 := by rw [← Matrix.mul_assoc, hAC, one_mul, mul_one]
  apply Matrix.ext
  intro i j
  apply congrFun (hi (a₁ := fun k ↦ (C * A) k j) (aβ‚‚ := fun k ↦ (1 : Matrix _ _ _) k j) ?_) i
  funext k
  exact congrFun (congrFun he k) j

theorem exists_quaternion_inverse_of_complexify_posDef {n : β„•}
    (A : Matrix (Fin n) (Fin n) (Quaternion ℝ)) (hA : (complexify A).PosDef) :
    βˆƒ C : Matrix (Fin n) (Fin n) (Quaternion ℝ), A * C = 1 ∧ C * A = 1 :=
  exists_quaternion_inverse_of_pos A
    ((complexify_posDef_iff (isHermitian_of_complexify hA.isHermitian)).mp hA)

end OAI.LinearAlgebra.Moore