Mehmet Emre Tiryaki
Back to Notes

Normal Matrices and the Spectral Theorem

Normal Matrices

AA is normal when A∗A=AA∗A^*A = AA^*. Diagonal, Hermitian, skew-Hermitian and unitary matrices are normal.

For unitarily similar A=UBU∗A = UBU^*, AA is normal   ⟺  \iff BB is normal, since

A∗A=UB∗BU∗,AA∗=UBB∗U∗A^*A = UB^*BU^*, \qquad AA^* = UBB^*U^*

An upper triangular TT is normal   ⟺  \iff TT is diagonal.

Proof (⇒)(\Rightarrow) Compare the diagonals of T∗TT^*T and TT∗TT^*. (T∗T)ii(T^*T)_{ii} is the squared norm of the iith column of TT, and (TT∗)ii(TT^*)_{ii} is the squared norm of the iith row. The first column is just t11t_{11}, so ∣t11∣2=∑j∣t1j∣2|t_{11}|^2 = \sum_j |t_{1j}|^2 and t1j=0t_{1j} = 0 for j>1j > 1. Continuing row by row, TT is diagonal.

Spectral Theorem for Normal Matrices

AA is unitarily diagonalizable when A=UDU∗A = UDU^* with UU unitary and DD diagonal. The following are equivalent

  1. AA is normal,
  2. AA is unitarily diagonalizable,
  3. ∥A∥F2=∑∣λi∣2\|A\|_F^2 = \sum |\lambda_i|^2.

Proof

(2⇒1,3)(2 \Rightarrow 1, 3) A=UDU∗A = UDU^*. DD is normal so AA is normal, and ∥A∥F2=∥UDU∗∥F2=∥D∥F2=∑∣λi∣2\|A\|_F^2 = \|UDU^*\|_F^2 = \|D\|_F^2 = \sum |\lambda_i|^2.

(1⇒2)(1 \Rightarrow 2) A=UTU∗A = UTU^* by Schur. AA normal ⇒\Rightarrow TT normal ⇒\Rightarrow TT diagonal.

(3⇒2)(3 \Rightarrow 2) A=UTU∗A = UTU^* and

∑i<j∣tij∣2+∑i∣tii∣2=∥T∥F2=∥A∥F2=∑∣λi∣2=∑i∣tii∣2\sum_{i < j} |t_{ij}|^2 + \sum_{i} |t_{ii}|^2 = \|T\|_F^2 = \|A\|_F^2 = \sum |\lambda_i|^2 = \sum_i |t_{ii}|^2

so tij=0t_{ij} = 0 for i<ji < j and TT is diagonal.

Spectral Theorem for Hermitian Matrices

AA is Hermitian   ⟺  \iff AA is unitarily diagonalizable and all eigenvalues are real.

Proof

(⇒)(\Rightarrow) AA Hermitian ⇒\Rightarrow normal ⇒\Rightarrow A=UDU∗A = UDU^*. Then A=A∗⇒UDU∗=UD∗U∗⇒D=D∗A = A^* \Rightarrow UDU^* = UD^*U^* \Rightarrow D = D^*, so DD is real.

(⇐)(\Leftarrow) (UDU∗)∗=UD∗U∗=UDU∗(UDU^*)^* = UD^*U^* = UDU^* for real DD.

A unitary diagonalization is a sum of rank-1 matrices,

UDU∗=∑idii U(i)U(i)∗UDU^* = \sum_i d_{ii} \, U^{(i)} U^{(i)*}

Classes of Normal Matrices

For a normal AA, the location of the eigenvalues decides the class:

  • AA is Hermitian iff all λ∈R\lambda \in \mathbb{R},
  • AA is skew-Hermitian iff all λ\lambda are purely imaginary,
  • AA is unitary iff all ∣λ∣=1|\lambda| = 1.

So Hermitian and unitary means λ∈{1,−1}\lambda \in \{1, -1\}, unitary and skew-Hermitian means λ∈{i,−i}\lambda \in \{i, -i\}, and the only matrix that is Hermitian and skew-Hermitian is 0.

Matrix Exponential

eB=I+B+12!B2+13!B3+⋯e^B = I + B + \frac{1}{2!}B^2 + \frac{1}{3!}B^3 + \cdots

AA is unitary   ⟺  \iff there is a skew-Hermitian BB with A=eBA = e^B.

Proof

(⇐)(\Leftarrow) BB is skew-Hermitian, so B=Udiag(iθ1,…,iθn)U∗B = U \mathrm{diag}(i\theta_1, \ldots, i\theta_n) U^* with θj∈R\theta_j \in \mathbb{R}. Then

eB=Uediag(iθ1,…,iθn)U∗=Udiag(eiθ1,…,eiθn)U∗e^B = U e^{\mathrm{diag}(i\theta_1, \ldots, i\theta_n)} U^* = U \mathrm{diag}(e^{i\theta_1}, \ldots, e^{i\theta_n}) U^*

which is unitary.

(⇒)(\Rightarrow) A=UDU∗=Udiag(eiω1,…,eiωn)U∗A = UDU^* = U \mathrm{diag}(e^{i\omega_1}, \ldots, e^{i\omega_n}) U^* since ∣λ∣=1|\lambda| = 1. Let B:=Udiag(iω1,…,iωn)U∗B := U \mathrm{diag}(i\omega_1, \ldots, i\omega_n) U^*. Then B∗=Udiag(−iω1,…,−iωn)U∗=−BB^* = U \mathrm{diag}(-i\omega_1, \ldots, -i\omega_n) U^* = -B, so BB is skew-Hermitian and eB=Ae^B = A.

Real Symmetric Matrices

For A∈Mn(R)A \in M_n(\mathbb{R}), AA is symmetric   ⟺  \iff there are Q,D∈Mn(R)Q, D \in M_n(\mathbb{R}), QQ orthogonal and DD diagonal, with A=QDQTA = QDQ^T.

Proof

(⇐)(\Leftarrow) AT=QDTQT=QDQT=AA^T = QD^TQ^T = QDQ^T = A.

(⇒)(\Rightarrow) AA is Hermitian, so σ(A)⊆R\sigma(A) \subseteq \mathbb{R}. AA is real with real eigenvalues, so A=QTQTA = QTQ^T with QQ and TT real. AA Hermitian ⇒\Rightarrow AA normal ⇒\Rightarrow TT normal ⇒\Rightarrow TT diagonal.