Analytic properties of the star operation on matrices

This transports the operator norm on EuclideanSpace 𝕜 n →L[𝕜] EuclideanSpace 𝕜 m to Matrix m n 𝕜. See the file Analysis.Matrix for many other matrix norms.

Main definitions

• Matrix.instNormedRingL2Op: the (necessarily unique) normed ring structure on Matrix n n 𝕜 which ensure it is a CstarRing in Matrix.instCstarRing. This is a scoped instance in the namespace Matrix.L2OpNorm in order to avoid choosing a global norm for Matrix.

Main statements

• entry_norm_bound_of_unitary: the entries of a unitary matrix are uniformly bound by 1.

Implementation details

We take care to ensure the topology and uniformity induced by Matrix.instMetricSpaceL2Op coincide with the existing topology and uniformity on matrices.

TODO

• Show that ‖diagonal (v : n → 𝕜)‖ = ‖v‖.

theorem entry_norm_bound_of_unitary {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] {U : Matrix n n 𝕜} (hU : U ∈ Matrix.unitaryGroup n 𝕜) (i : n) (j : n) : ‖U i j‖ ≤ 1

theorem entrywise_sup_norm_bound_of_unitary {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] {U : Matrix n n 𝕜} (hU : U ∈ Matrix.unitaryGroup n 𝕜) : ‖U‖ ≤ 1

The entrywise sup norm of a unitary matrix is at most 1.

def Matrix.toEuclideanCLM {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] : Matrix n n 𝕜 ≃⋆ₐ[𝕜] EuclideanSpace 𝕜 n →L[𝕜] EuclideanSpace 𝕜 n

The natural star algebra equivalence between matrices and continuous linear endomoporphisms of Euclidean space induced by the orthonormal basis EuclideanSpace.basisFun.

This is a more-bundled version of Matrix.toEuclideanLin, for the special case of square matrices, followed by a more-bundled version of LinearMap.toContinuousLinearMap.

Equations

• One or more equations did not get rendered due to their size.

theorem Matrix.coe_toEuclideanCLM_eq_toEuclideanLin {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] (A : Matrix n n 𝕜) : ↑(Matrix.toEuclideanCLM A) = Matrix.toEuclideanLin A

@[simp]

theorem Matrix.toEuclideanCLM_piLp_equiv_symm {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] (A : Matrix n n 𝕜) (x : n → 𝕜) : (Matrix.toEuclideanCLM A) ((WithLp.equiv 2 ((i : n) → (fun (x : n) => 𝕜) i)).symm x) = (WithLp.equiv 2 (n → 𝕜)).symm ((Matrix.toLin' A) x)

@[simp]

theorem Matrix.piLp_equiv_toEuclideanCLM {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] (A : Matrix n n 𝕜) (x : EuclideanSpace 𝕜 n) : (WithLp.equiv 2 ((i : n) → (fun (x : n) => 𝕜) i)) ((Matrix.toEuclideanCLM A) x) = (Matrix.toLin' A) ((WithLp.equiv 2 (n → 𝕜)) x)

def Matrix.l2OpNormedAddCommGroupAux {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] : NormedAddCommGroup (Matrix m n 𝕜)

An auxiliary definition used only to construct the true NormedAddCommGroup (and Metric) structure provided by Matrix.instMetricSpaceL2Op and Matrix.instNormedAddCommGroupL2Op.

Equations

• Matrix.l2OpNormedAddCommGroupAux = NormedAddCommGroup.induced (Matrix m n 𝕜) (EuclideanSpace 𝕜 n →L[𝕜] EuclideanSpace 𝕜 m) (Matrix.toEuclideanLin.trans LinearMap.toContinuousLinearMap) ⋯

def Matrix.l2OpNormedRingAux {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] : NormedRing (Matrix n n 𝕜)

An auxiliary definition used only to construct the true NormedRing (and Metric) structure provided by Matrix.instMetricSpaceL2Op and Matrix.instNormedRingL2Op.

Equations

• Matrix.l2OpNormedRingAux = NormedRing.induced (Matrix n n 𝕜) (EuclideanSpace 𝕜 n →L[𝕜] EuclideanSpace 𝕜 n) Matrix.toEuclideanCLM ⋯

def Matrix.instL2OpMetricSpace {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] : MetricSpace (Matrix m n 𝕜)

The metric on Matrix m n 𝕜 arising from the operator norm given by the identification with (continuous) linear maps of EuclideanSpace.

Equations

• Matrix.instL2OpMetricSpace = NormedAddCommGroup.toMetricSpace.replaceUniformity ⋯

def Matrix.instL2OpNormedAddCommGroup {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] : NormedAddCommGroup (Matrix m n 𝕜)

The norm structure on Matrix m n 𝕜 arising from the operator norm given by the identification with (continuous) linear maps of EuclideanSpace.

Equations

• Matrix.instL2OpNormedAddCommGroup = NormedAddCommGroup.mk ⋯

theorem Matrix.l2_opNorm_def {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) : ‖A‖ = ‖(Matrix.toEuclideanLin ≪≫ₗ LinearMap.toContinuousLinearMap) A‖

@[deprecated Matrix.l2_opNorm_def]

theorem Matrix.l2_op_norm_def {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) : ‖A‖ = ‖(Matrix.toEuclideanLin ≪≫ₗ LinearMap.toContinuousLinearMap) A‖

Alias of Matrix.l2_opNorm_def.

theorem Matrix.l2_opNNNorm_def {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) : ‖A‖₊ = ‖(Matrix.toEuclideanLin ≪≫ₗ LinearMap.toContinuousLinearMap) A‖₊

@[deprecated Matrix.l2_opNNNorm_def]

theorem Matrix.l2_op_nnnorm_def {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) : ‖A‖₊ = ‖(Matrix.toEuclideanLin ≪≫ₗ LinearMap.toContinuousLinearMap) A‖₊

Alias of Matrix.l2_opNNNorm_def.

theorem Matrix.l2_opNorm_conjTranspose {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] [DecidableEq m] (A : Matrix m n 𝕜) : ‖A.conjTranspose‖ = ‖A‖

@[deprecated Matrix.l2_opNorm_conjTranspose]

theorem Matrix.l2_op_norm_conjTranspose {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] [DecidableEq m] (A : Matrix m n 𝕜) : ‖A.conjTranspose‖ = ‖A‖

Alias of Matrix.l2_opNorm_conjTranspose.

theorem Matrix.l2_opNNNorm_conjTranspose {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] [DecidableEq m] (A : Matrix m n 𝕜) : ‖A.conjTranspose‖₊ = ‖A‖₊

@[deprecated Matrix.l2_opNNNorm_conjTranspose]

theorem Matrix.l2_op_nnnorm_conjTranspose {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] [DecidableEq m] (A : Matrix m n 𝕜) : ‖A.conjTranspose‖₊ = ‖A‖₊

Alias of Matrix.l2_opNNNorm_conjTranspose.

theorem Matrix.l2_opNorm_conjTranspose_mul_self {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) : ‖A.conjTranspose * A‖ = ‖A‖ * ‖A‖

@[deprecated Matrix.l2_opNorm_conjTranspose_mul_self]

theorem Matrix.l2_op_norm_conjTranspose_mul_self {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) : ‖A.conjTranspose * A‖ = ‖A‖ * ‖A‖

Alias of Matrix.l2_opNorm_conjTranspose_mul_self.

theorem Matrix.l2_opNNNorm_conjTranspose_mul_self {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) : ‖A.conjTranspose * A‖₊ = ‖A‖₊ * ‖A‖₊

@[deprecated Matrix.l2_opNNNorm_conjTranspose_mul_self]

theorem Matrix.l2_op_nnnorm_conjTranspose_mul_self {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) : ‖A.conjTranspose * A‖₊ = ‖A‖₊ * ‖A‖₊

Alias of Matrix.l2_opNNNorm_conjTranspose_mul_self.

theorem Matrix.l2_opNorm_mulVec {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) (x : EuclideanSpace 𝕜 n) : ‖(EuclideanSpace.equiv m 𝕜).symm (A.mulVec x)‖ ≤ ‖A‖ * ‖x‖

@[deprecated Matrix.l2_opNorm_mulVec]

theorem Matrix.l2_op_norm_mulVec {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) (x : EuclideanSpace 𝕜 n) : ‖(EuclideanSpace.equiv m 𝕜).symm (A.mulVec x)‖ ≤ ‖A‖ * ‖x‖

Alias of Matrix.l2_opNorm_mulVec.

theorem Matrix.l2_opNNNorm_mulVec {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) (x : EuclideanSpace 𝕜 n) : ‖(EuclideanSpace.equiv m 𝕜).symm (A.mulVec x)‖₊ ≤ ‖A‖₊ * ‖x‖₊

@[deprecated Matrix.l2_opNNNorm_mulVec]

theorem Matrix.l2_op_nnnorm_mulVec {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] (A : Matrix m n 𝕜) (x : EuclideanSpace 𝕜 n) : ‖(EuclideanSpace.equiv m 𝕜).symm (A.mulVec x)‖₊ ≤ ‖A‖₊ * ‖x‖₊

Alias of Matrix.l2_opNNNorm_mulVec.

theorem Matrix.l2_opNorm_mul {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} {l : Type u_4} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] [Fintype l] [DecidableEq l] (A : Matrix m n 𝕜) (B : Matrix n l 𝕜) : ‖A * B‖ ≤ ‖A‖ * ‖B‖

@[deprecated Matrix.l2_opNorm_mul]

theorem Matrix.l2_op_norm_mul {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} {l : Type u_4} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] [Fintype l] [DecidableEq l] (A : Matrix m n 𝕜) (B : Matrix n l 𝕜) : ‖A * B‖ ≤ ‖A‖ * ‖B‖

Alias of Matrix.l2_opNorm_mul.

theorem Matrix.l2_opNNNorm_mul {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} {l : Type u_4} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] [Fintype l] [DecidableEq l] (A : Matrix m n 𝕜) (B : Matrix n l 𝕜) : ‖A * B‖₊ ≤ ‖A‖₊ * ‖B‖₊

@[deprecated Matrix.l2_opNNNorm_mul]

theorem Matrix.l2_op_nnnorm_mul {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} {l : Type u_4} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] [Fintype l] [DecidableEq l] (A : Matrix m n 𝕜) (B : Matrix n l 𝕜) : ‖A * B‖₊ ≤ ‖A‖₊ * ‖B‖₊

Alias of Matrix.l2_opNNNorm_mul.

def Matrix.instL2OpNormedSpace {𝕜 : Type u_1} {m : Type u_2} {n : Type u_3} [RCLike 𝕜] [Fintype m] [Fintype n] [DecidableEq n] : NormedSpace 𝕜 (Matrix m n 𝕜)

The normed algebra structure on Matrix n n 𝕜 arising from the operator norm given by the identification with (continuous) linear endmorphisms of EuclideanSpace 𝕜 n.

Equations

• Matrix.instL2OpNormedSpace = NormedSpace.mk ⋯

def Matrix.instL2OpNormedRing {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] : NormedRing (Matrix n n 𝕜)

The normed ring structure on Matrix n n 𝕜 arising from the operator norm given by the identification with (continuous) linear endmorphisms of EuclideanSpace 𝕜 n.

Equations

• Matrix.instL2OpNormedRing = NormedRing.mk ⋯ ⋯

theorem Matrix.cstar_norm_def {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] (A : Matrix n n 𝕜) : ‖A‖ = ‖Matrix.toEuclideanCLM A‖

This is the same as Matrix.l2_opNorm_def, but with a more bundled RHS for square matrices.

theorem Matrix.cstar_nnnorm_def {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] (A : Matrix n n 𝕜) : ‖A‖₊ = ‖Matrix.toEuclideanCLM A‖₊

This is the same as Matrix.l2_opNNNorm_def, but with a more bundled RHS for square matrices.

def Matrix.instL2OpNormedAlgebra {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] : NormedAlgebra 𝕜 (Matrix n n 𝕜)

The normed algebra structure on Matrix n n 𝕜 arising from the operator norm given by the identification with (continuous) linear endmorphisms of EuclideanSpace 𝕜 n.

Equations

• Matrix.instL2OpNormedAlgebra = NormedAlgebra.mk ⋯

theorem Matrix.instCstarRing {𝕜 : Type u_1} {n : Type u_3} [RCLike 𝕜] [Fintype n] [DecidableEq n] : CstarRing (Matrix n n 𝕜)

The operator norm on Matrix n n 𝕜 given by the identification with (continuous) linear endmorphisms of EuclideanSpace 𝕜 n makes it into a L2OpRing.