Positive Definite Matrices

This file defines positive (semi)definite matrices and connects the notion to positive definiteness of quadratic forms. Most results require 𝕜 = ℝ or ℂ.

Main definitions

• Matrix.PosDef : a matrix M : Matrix n n 𝕜 is positive definite if it is hermitian and xᴴMx is greater than zero for all nonzero x.
• Matrix.PosSemidef : a matrix M : Matrix n n 𝕜 is positive semidefinite if it is hermitian and xᴴMx is nonnegative for all x.

## Main results

• Matrix.posSemidef_iff_eq_transpose_mul_self : a matrix M : Matrix n n 𝕜 is positive semidefinite iff it has the form Bᴴ * B for some B.
• Matrix.PosSemidef.sqrt : the unique positive semidefinite square root of a positive semidefinite matrix. (See Matrix.PosSemidef.eq_sqrt_of_sq_eq for the proof of uniqueness.)

Positive semidefinite matrices

def Matrix.PosSemidef {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] (M : Matrix n n R) : Prop

A matrix M : Matrix n n R is positive semidefinite if it is Hermitian and xᴴ * M * x is nonnegative for all x.

Equations

• M.PosSemidef = (M.IsHermitian ∧ ∀ (x : n → R), 0 ≤ Matrix.dotProduct (star x) (M.mulVec x))

theorem Matrix.posSemidef_diagonal_iff {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] [StarOrderedRing R] [DecidableEq n] {d : n → R} : (Matrix.diagonal d).PosSemidef ↔ ∀ (i : n), 0 ≤ d i

A diagonal matrix is positive semidefinite iff its diagonal entries are nonnegative.

theorem Matrix.PosSemidef.isHermitian {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] {M : Matrix n n R} (hM : M.PosSemidef) : M.IsHermitian

theorem Matrix.PosSemidef.re_dotProduct_nonneg {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] {M : Matrix n n 𝕜} (hM : M.PosSemidef) (x : n → 𝕜) : 0 ≤ RCLike.re (Matrix.dotProduct (star x) (M.mulVec x))

theorem Matrix.PosSemidef.conjTranspose_mul_mul_same {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] {A : Matrix n n R} (hA : A.PosSemidef) {m : Type u_5} [Fintype m] (B : Matrix n m R) : (B.conjTranspose * A * B).PosSemidef

theorem Matrix.PosSemidef.mul_mul_conjTranspose_same {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] {A : Matrix n n R} (hA : A.PosSemidef) {m : Type u_5} [Fintype m] (B : Matrix m n R) : (B * A * B.conjTranspose).PosSemidef

theorem Matrix.PosSemidef.submatrix {m : Type u_1} {n : Type u_2} {R : Type u_3} [Fintype m] [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] {M : Matrix n n R} (hM : M.PosSemidef) (e : m → n) : (M.submatrix e e).PosSemidef

theorem Matrix.PosSemidef.transpose {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] {M : Matrix n n R} (hM : M.PosSemidef) : M.transpose.PosSemidef

theorem Matrix.PosSemidef.conjTranspose {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] {M : Matrix n n R} (hM : M.PosSemidef) : M.conjTranspose.PosSemidef

theorem Matrix.PosSemidef.zero {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] : Matrix.PosSemidef 0

theorem Matrix.PosSemidef.one {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] [StarOrderedRing R] [DecidableEq n] : Matrix.PosSemidef 1

theorem Matrix.PosSemidef.pow {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] [StarOrderedRing R] [DecidableEq n] {M : Matrix n n R} (hM : M.PosSemidef) (k : ℕ) : (M ^ k).PosSemidef

theorem Matrix.PosSemidef.inv {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] [DecidableEq n] {M : Matrix n n R} (hM : M.PosSemidef) : M⁻¹.PosSemidef

theorem Matrix.PosSemidef.zpow {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] [StarOrderedRing R] [DecidableEq n] {M : Matrix n n R} (hM : M.PosSemidef) (z : ℤ) : (M ^ z).PosSemidef

theorem Matrix.PosSemidef.add {m : Type u_1} {R : Type u_3} [Fintype m] [CommRing R] [PartialOrder R] [StarRing R] [StarOrderedRing R] {A : Matrix m m R} {B : Matrix m m R} (hA : A.PosSemidef) (hB : B.PosSemidef) : (A + B).PosSemidef

theorem Matrix.PosSemidef.eigenvalues_nonneg {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {A : Matrix n n 𝕜} (hA : A.PosSemidef) (i : n) : 0 ≤ ⋯.eigenvalues i

The eigenvalues of a positive semi-definite matrix are non-negative

noncomputable def Matrix.PosSemidef.sqrt {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {A : Matrix n n 𝕜} (hA : A.PosSemidef) : Matrix n n 𝕜

The positive semidefinite square root of a positive semidefinite matrix

Equations

• hA.sqrt = ↑⋯.eigenvectorUnitary * Matrix.diagonal (RCLike.ofReal ∘ Real.sqrt ∘ ⋯.eigenvalues) * star ↑⋯.eigenvectorUnitary

def Matrix.PosSemidef.delabSqrt : Lean.PrettyPrinter.Delaborator.Delab

Custom elaborator to produce output like (_ : PosSemidef A).sqrt in the goal view.

Equations

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

theorem Matrix.PosSemidef.posSemidef_sqrt {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {A : Matrix n n 𝕜} (hA : A.PosSemidef) : hA.sqrt.PosSemidef

@[simp]

theorem Matrix.PosSemidef.sq_sqrt {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {A : Matrix n n 𝕜} (hA : A.PosSemidef) : hA.sqrt ^ 2 = A

@[simp]

theorem Matrix.PosSemidef.sqrt_mul_self {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {A : Matrix n n 𝕜} (hA : A.PosSemidef) : hA.sqrt * hA.sqrt = A

theorem Matrix.PosSemidef.eq_of_sq_eq_sq {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {A : Matrix n n 𝕜} (hA : A.PosSemidef) {B : Matrix n n 𝕜} (hB : B.PosSemidef) (hAB : A ^ 2 = B ^ 2) : A = B

theorem Matrix.PosSemidef.sqrt_sq {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {A : Matrix n n 𝕜} (hA : A.PosSemidef) : (⋯ : (A ^ 2).PosSemidef).sqrt = A

theorem Matrix.PosSemidef.eq_sqrt_of_sq_eq {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {A : Matrix n n 𝕜} (hA : A.PosSemidef) {B : Matrix n n 𝕜} (hB : B.PosSemidef) (hAB : A ^ 2 = B) : A = hB.sqrt

@[simp]

theorem Matrix.posSemidef_submatrix_equiv {m : Type u_1} {n : Type u_2} {R : Type u_3} [Fintype m] [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] {M : Matrix n n R} (e : m ≃ n) : (M.submatrix ⇑e ⇑e).PosSemidef ↔ M.PosSemidef

theorem Matrix.posSemidef_conjTranspose_mul_self {m : Type u_1} {n : Type u_2} {R : Type u_3} [Fintype m] [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] [StarOrderedRing R] (A : Matrix m n R) : (A.conjTranspose * A).PosSemidef

The conjugate transpose of a matrix mulitplied by the matrix is positive semidefinite

theorem Matrix.posSemidef_self_mul_conjTranspose {m : Type u_1} {n : Type u_2} {R : Type u_3} [Fintype m] [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] [StarOrderedRing R] (A : Matrix m n R) : (A * A.conjTranspose).PosSemidef

A matrix multiplied by its conjugate transpose is positive semidefinite

theorem Matrix.eigenvalues_conjTranspose_mul_self_nonneg {m : Type u_1} {n : Type u_2} {𝕜 : Type u_4} [Fintype m] [Fintype n] [RCLike 𝕜] (A : Matrix m n 𝕜) [DecidableEq n] (i : n) : 0 ≤ ⋯.eigenvalues i

theorem Matrix.eigenvalues_self_mul_conjTranspose_nonneg {m : Type u_1} {n : Type u_2} {𝕜 : Type u_4} [Fintype m] [Fintype n] [RCLike 𝕜] (A : Matrix m n 𝕜) [DecidableEq m] (i : m) : 0 ≤ ⋯.eigenvalues i

theorem Matrix.posSemidef_iff_eq_transpose_mul_self {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] {A : Matrix n n 𝕜} : A.PosSemidef ↔ ∃ (B : Matrix n n 𝕜), A = B.conjTranspose * B

A matrix is positive semidefinite if and only if it has the form Bᴴ * B for some B.

theorem Matrix.IsHermitian.posSemidef_of_eigenvalues_nonneg {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {A : Matrix n n 𝕜} (hA : A.IsHermitian) (h : ∀ (i : n), 0 ≤ hA.eigenvalues i) : A.PosSemidef

theorem Matrix.PosSemidef.dotProduct_mulVec_zero_iff {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] {A : Matrix n n 𝕜} (hA : A.PosSemidef) (x : n → 𝕜) : Matrix.dotProduct (star x) (A.mulVec x) = 0 ↔ A.mulVec x = 0

For A positive semidefinite, we have x⋆ A x = 0 iff A x = 0.

theorem Matrix.PosSemidef.toLinearMap₂'_zero_iff {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {A : Matrix n n 𝕜} (hA : A.PosSemidef) (x : n → 𝕜) : (((Matrix.toLinearMap₂' 𝕜) A) (star x)) x = 0 ↔ (Matrix.toLin' A) x = 0

For A positive semidefinite, we have x⋆ A x = 0 iff A x = 0 (linear maps version).

Positive definite matrices

def Matrix.PosDef {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] (M : Matrix n n R) : Prop

A matrix M : Matrix n n R is positive definite if it is hermitian and xᴴMx is greater than zero for all nonzero x.

Equations

• M.PosDef = (M.IsHermitian ∧ ∀ (x : n → R), x ≠ 0 → 0 < Matrix.dotProduct (star x) (M.mulVec x))

theorem Matrix.PosDef.isHermitian {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] {M : Matrix n n R} (hM : M.PosDef) : M.IsHermitian

theorem Matrix.PosDef.re_dotProduct_pos {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] {M : Matrix n n 𝕜} (hM : M.PosDef) {x : n → 𝕜} (hx : x ≠ 0) : 0 < RCLike.re (Matrix.dotProduct (star x) (M.mulVec x))

theorem Matrix.PosDef.posSemidef {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] {M : Matrix n n R} (hM : M.PosDef) : M.PosSemidef

theorem Matrix.PosDef.transpose {n : Type u_2} {R : Type u_3} [Fintype n] [CommRing R] [PartialOrder R] [StarRing R] {M : Matrix n n R} (hM : M.PosDef) : M.transpose.PosDef

theorem Matrix.PosDef.add_posSemidef {m : Type u_1} {R : Type u_3} [Fintype m] [CommRing R] [PartialOrder R] [StarRing R] [StarOrderedRing R] {A : Matrix m m R} {B : Matrix m m R} (hA : A.PosDef) (hB : B.PosSemidef) : (A + B).PosDef

theorem Matrix.PosDef.posSemidef_add {m : Type u_1} {R : Type u_3} [Fintype m] [CommRing R] [PartialOrder R] [StarRing R] [StarOrderedRing R] {A : Matrix m m R} {B : Matrix m m R} (hA : A.PosSemidef) (hB : B.PosDef) : (A + B).PosDef

theorem Matrix.PosDef.add {m : Type u_1} {R : Type u_3} [Fintype m] [CommRing R] [PartialOrder R] [StarRing R] [StarOrderedRing R] {A : Matrix m m R} {B : Matrix m m R} (hA : A.PosDef) (hB : B.PosDef) : (A + B).PosDef

theorem Matrix.PosDef.of_toQuadraticForm' {n : Type u_2} [Fintype n] [DecidableEq n] {M : Matrix n n ℝ} (hM : M.IsSymm) (hMq : M.toQuadraticMap'.PosDef) : M.PosDef

theorem Matrix.PosDef.toQuadraticForm' {n : Type u_2} [Fintype n] [DecidableEq n] {M : Matrix n n ℝ} (hM : M.PosDef) : M.toQuadraticMap'.PosDef

theorem Matrix.PosDef.eigenvalues_pos {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {A : Matrix n n 𝕜} (hA : A.PosDef) (i : n) : 0 < ⋯.eigenvalues i

The eigenvalues of a positive definite matrix are positive

theorem Matrix.PosDef.det_pos {n : Type u_2} {𝕜 : Type u_4} [Fintype n] [RCLike 𝕜] [DecidableEq n] {M : Matrix n n 𝕜} (hM : M.PosDef) : 0 < M.det

theorem QuadraticForm.posDef_of_toMatrix' {n : Type u_1} [Fintype n] [DecidableEq n] {Q : QuadraticForm ℝ (n → ℝ)} (hQ : (QuadraticMap.toMatrix' Q).PosDef) : QuadraticMap.PosDef Q

theorem QuadraticForm.posDef_toMatrix' {n : Type u_1} [Fintype n] [DecidableEq n] {Q : QuadraticForm ℝ (n → ℝ)} (hQ : QuadraticMap.PosDef Q) : (QuadraticMap.toMatrix' Q).PosDef

@[reducible, inline]

noncomputable abbrev Matrix.NormedAddCommGroup.ofMatrix {𝕜 : Type u_1} [RCLike 𝕜] {n : Type u_2} [Fintype n] {M : Matrix n n 𝕜} (hM : M.PosDef) : NormedAddCommGroup (n → 𝕜)

A positive definite matrix M induces a norm ‖x‖ = sqrt (re xᴴMx).

Equations

• Matrix.NormedAddCommGroup.ofMatrix hM = InnerProductSpace.Core.toNormedAddCommGroup

def Matrix.InnerProductSpace.ofMatrix {𝕜 : Type u_1} [RCLike 𝕜] {n : Type u_2} [Fintype n] {M : Matrix n n 𝕜} (hM : M.PosDef) : InnerProductSpace 𝕜 (n → 𝕜)

A positive definite matrix M induces an inner product ⟪x, y⟫ = xᴴMy.

Equations

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