math / data /lean /OAI /Geometry /Borsuk /MatrixGeometry /MatrixTransport.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.17 kB
import Mathlib
import OAI.Geometry.Borsuk.MatrixGeometry.Rank
namespace OAI
namespace BorsukNine
open scoped RealInnerProductSpace MatrixOrder Matrix.Norms.L2Operator
section MatrixTransport
variable {Ξ½ : Type*} [Fintype Ξ½] [DecidableEq Ξ½]
local notation "E" => EuclideanSpace ℝ Ξ½
local notation "M" => Matrix Ξ½ Ξ½ ℝ
local notation "op" => Matrix.toEuclideanCLM (n := Ξ½) (π•œ := ℝ)
noncomputable def matrixConjugate (e : E ≃ₗᡒ[ℝ] E) : M ≃⋆ₐ[ℝ] M :=
(op).trans (e.conjStarAlgEquiv.trans (op).symm)
lemma matrixConjugate_action (e : E ≃ₗᡒ[ℝ] E) (A : M) (v : E) :
op (matrixConjugate e A) v = e (op A (e.symm v)) := by
simp only [matrixConjugate,StarAlgEquiv.trans_apply,StarAlgEquiv.apply_symm_apply,
LinearIsometryEquiv.conjStarAlgEquiv_apply_apply]
lemma matrixConjugate_nonneg (e : E ≃ₗᡒ[ℝ] E) {A : M} (hA : 0 ≀ A) :
0 ≀ matrixConjugate e A := map_nonneg _ hA
lemma matrixConjugate_rankOne (e : E ≃ₗᡒ[ℝ] E) (u : E) :
matrixConjugate e (rankOne u) = rankOne (e u) := by
apply (Matrix.toEuclideanCLM (n := Ξ½) (π•œ := ℝ)).injective
change op (matrixConjugate e (rankOne u)) = op (rankOne (e u))
apply ContinuousLinearMap.ext
intro v
rw [matrixConjugate_action,rankOne_action,rankOne_action,map_smul]
congr 1
simpa using (e.inner_map_map u (e.symm v)).symm
lemma matrix_operator_trace (A : M) : LinearMap.trace ℝ E (op A).toLinearMap = Matrix.trace A := by
rw [Matrix.coe_toEuclideanCLM_eq_toEuclideanLin,Matrix.toEuclideanLin_eq_toLin_orthonormal]
exact Matrix.trace_toLin_eq A _
lemma matrixConjugate_trace (e : E ≃ₗᡒ[ℝ] E) (A : M) :
Matrix.trace (matrixConjugate e A) = Matrix.trace A := by
rw [← matrix_operator_trace,← matrix_operator_trace]
have he : (op (matrixConjugate e A)).toLinearMap = e.toLinearEquiv.conj (op A).toLinearMap := by
apply LinearMap.ext
intro v
exact matrixConjugate_action e A v
rw [he,LinearMap.trace_conj']
lemma matrixConjugate_kernel (e : E ≃ₗᡒ[ℝ] E) {A : M} {v : E} (hv : op A v = 0) :
op (matrixConjugate e A) (e v) = 0 := by
rw [matrixConjugate_action,e.symm_apply_apply,hv,map_zero]
lemma matrixConjugate_range (e : E ≃ₗᡒ[ℝ] E) {A : M} {v : E}
(hv : v ∈ LinearMap.range (op A).toLinearMap) :
e v ∈ LinearMap.range (op (matrixConjugate e A)).toLinearMap := by
obtain ⟨x,rfl⟩ := hv
exact ⟨e x,by simp only [ContinuousLinearMap.coe_coe,matrixConjugate_action,e.symm_apply_apply]⟩
lemma matrixConjugate_selfAdjoint (e : E ≃ₗᡒ[ℝ] E) {A : M} (hA : IsSelfAdjoint A) :
IsSelfAdjoint (matrixConjugate e A) := by
rw [IsSelfAdjoint,← map_star,hA.star_eq]
lemma matrixConjugate_involutive {e : E ≃ₗᡒ[ℝ] E}
(he : βˆ€ v, e (e v) = v) (A : M) : matrixConjugate e (matrixConjugate e A) = A := by
have hes : βˆ€ v, e.symm v = e v := by intro v; apply e.injective; simp [he]
apply (Matrix.toEuclideanCLM (n := Ξ½) (π•œ := ℝ)).injective
change op (matrixConjugate e (matrixConjugate e A)) = op A
apply ContinuousLinearMap.ext
intro v
simp only [matrixConjugate_action,hes,he]
end MatrixTransport
end BorsukNine
end OAI