Normal Matrices
A is normal when A∗A=AA∗. Diagonal, Hermitian, skew-Hermitian and unitary matrices are normal.
For unitarily similar A=UBU∗, A is normal ⟺ B is normal, since
A∗A=UB∗BU∗,AA∗=UBB∗U∗
An upper triangular T is normal ⟺ T is diagonal.
Proof (⇒) Compare the diagonals of T∗T and TT∗. (T∗T)ii is the squared norm of the ith column of T, and (TT∗)ii is the squared norm of the ith row. The first column is just t11, so ∣t11∣2=∑j∣t1j∣2 and t1j=0 for j>1. Continuing row by row, T is diagonal.
Spectral Theorem for Normal Matrices
A is unitarily diagonalizable when A=UDU∗ with U unitary and D diagonal. The following are equivalent
- A is normal,
- A is unitarily diagonalizable,
- ∥A∥F2=∑∣λi∣2.
Proof
(2⇒1,3) A=UDU∗. D is normal so A is normal, and ∥A∥F2=∥UDU∗∥F2=∥D∥F2=∑∣λi∣2.
(1⇒2) A=UTU∗ by Schur. A normal ⇒ T normal ⇒ T diagonal.
(3⇒2) A=UTU∗ and
i<j∑∣tij∣2+i∑∣tii∣2=∥T∥F2=∥A∥F2=∑∣λi∣2=i∑∣tii∣2
so tij=0 for i<j and T is diagonal.
Spectral Theorem for Hermitian Matrices
A is Hermitian ⟺ A is unitarily diagonalizable and all eigenvalues are real.
Proof
(⇒) A Hermitian ⇒ normal ⇒ A=UDU∗. Then A=A∗⇒UDU∗=UD∗U∗⇒D=D∗, so D is real.
(⇐) (UDU∗)∗=UD∗U∗=UDU∗ for real D.
A unitary diagonalization is a sum of rank-1 matrices,
UDU∗=i∑diiU(i)U(i)∗
Classes of Normal Matrices
For a normal A, the location of the eigenvalues decides the class:
- A is Hermitian iff all λ∈R,
- A is skew-Hermitian iff all λ are purely imaginary,
- A is unitary iff all ∣λ∣=1.
So Hermitian and unitary means λ∈{1,−1}, unitary and skew-Hermitian means λ∈{i,−i}, and the only matrix that is Hermitian and skew-Hermitian is 0.
Matrix Exponential
eB=I+B+2!1B2+3!1B3+⋯
A is unitary ⟺ there is a skew-Hermitian B with A=eB.
Proof
(⇐) B is skew-Hermitian, so B=Udiag(iθ1,…,iθn)U∗ with θj∈R. Then
eB=Uediag(iθ1,…,iθn)U∗=Udiag(eiθ1,…,eiθn)U∗
which is unitary.
(⇒) A=UDU∗=Udiag(eiω1,…,eiωn)U∗ since ∣λ∣=1. Let B:=Udiag(iω1,…,iωn)U∗. Then B∗=Udiag(−iω1,…,−iωn)U∗=−B, so B is skew-Hermitian and eB=A.
Real Symmetric Matrices
For A∈Mn(R), A is symmetric ⟺ there are Q,D∈Mn(R), Q orthogonal and D diagonal, with A=QDQT.
Proof
(⇐) AT=QDTQT=QDQT=A.
(⇒) A is Hermitian, so σ(A)⊆R. A is real with real eigenvalues, so A=QTQT with Q and T real. A Hermitian ⇒ A normal ⇒ T normal ⇒ T diagonal.