Mehmet Emre Tiryaki
Back to Notes

Unitary Matrices and Schur Decomposition

Unitary Matrices

UU is unitary when U∗U=IU^*U = I.

UU is unitary   ⟺  \iff the columns of UU are orthonormal, since

U∗U=[U1∗U2∗⋮][U1U2⋯]=[ Ui∗Uj ]ijU^*U = \begin{bmatrix} U_1^* \\ U_2^* \\ \vdots \end{bmatrix} \begin{bmatrix} U_1 & U_2 & \cdots \end{bmatrix} = \big[\, U_i^* U_j \,\big]_{ij}
  • If U,VU, V are unitary, UVUV is unitary.
  • For all x∈Cnx \in \mathbb{C}^n, ∥Ux∥2=∥x∥2\|Ux\|_2 = \|x\|_2.

A,BA, B are unitarily similar when A=UBU∗A = UBU^* with UU unitary. Then ∥A∥F=∥B∥F\|A\|_F = \|B\|_F, since for unitary U,VU, V

∥UAV∗∥F2=tr((UAV∗)∗UAV∗)=tr(VA∗U∗UAV∗)=tr(VA∗AV∗)=tr(A∗A)=∥A∥F2\|UAV^*\|_F^2 = \mathrm{tr}\big((UAV^*)^* UAV^*\big) = \mathrm{tr}(VA^*U^*UAV^*) = \mathrm{tr}(VA^*AV^*) = \mathrm{tr}(A^*A) = \|A\|_F^2

Householder Matrices

For w∈Cnw \in \mathbb{C}^n with ∥w∥2=1\|w\|_2 = 1,

Hw:=I−2ww∗H_w := I - 2ww^*

HwH_w is unitary and Hermitian.

For x≠y∈Rnx \neq y \in \mathbb{R}^n with ∥x∥2=∥y∥2\|x\|_2 = \|y\|_2, if

w=1∥x−y∥2(x−y)w = \frac{1}{\|x - y\|_2}(x - y)

then Hwx=yH_w x = y and Hwy=xH_w y = x.

For x∈Cnx \in \mathbb{C}^n with ∥x∥2=1\|x\|_2 = 1, there is a unitary UU whose first column is xx, by extending xx to an orthonormal basis with Gram-Schmidt.

Schur Decomposition

Let A∈MnA \in M_n have eigenvalues λ1,…,λn\lambda_1, \ldots, \lambda_n in any order. Then there are a unitary UU and an upper triangular TT with diagonal λ1,…,λn\lambda_1, \ldots, \lambda_n such that

A=UTU∗A = UTU^*

UU and TT can be taken real if AA and its eigenvalues are real.

Proof Let xx be a normalized eigenvector with eigenvalue λ1\lambda_1, and UU unitary with first column xx. Then

U∗AU=[x∗U2∗⋮][ Ax∣AU2∣⋯ ]=[λ1∗0B]U^*AU = \begin{bmatrix} x^* \\ U_2^* \\ \vdots \end{bmatrix} [\, Ax \mid AU_2 \mid \cdots \,] = \begin{bmatrix} \lambda_1 & * \\ 0 & B \end{bmatrix}

and σ(B)={λ2,…,λn}\sigma(B) = \{\lambda_2, \ldots, \lambda_n\}. Let yy be a normalized eigenvector of BB for λ2\lambda_2, and V∈Mn−1V \in M_{n-1} unitary with first column yy. Then

(U[100V])∗A(U[100V])=[λ1∗0V∗BV]=[λ1∗∗0λ2∗00C]\left(U \begin{bmatrix} 1 & 0 \\ 0 & V \end{bmatrix}\right)^* A \left(U \begin{bmatrix} 1 & 0 \\ 0 & V \end{bmatrix}\right) = \begin{bmatrix} \lambda_1 & * \\ 0 & V^*BV \end{bmatrix} = \begin{bmatrix} \lambda_1 & * & * \\ 0 & \lambda_2 & * \\ 0 & 0 & C \end{bmatrix}

Continuing, in the end the middle matrix is upper triangular with λ1,…,λn\lambda_1, \ldots, \lambda_n on the diagonal, and the product of the unitaries Ω\Omega is unitary, so A=ΩTΩ∗A = \Omega T \Omega^*.

Cayley-Hamilton

pA(A)=0p_A(A) = 0

Proof Let A=UTU∗A = UTU^* and pA(t)=(t−λ1)⋯(t−λn)p_A(t) = (t - \lambda_1) \cdots (t - \lambda_n). Then

pA(A)=UpA(T)U∗=U[(T−λ1I)(T−λ2I)⋯(T−λnI)]U∗p_A(A) = U p_A(T) U^* = U \big[(T - \lambda_1 I)(T - \lambda_2 I) \cdots (T - \lambda_n I)\big] U^*

T−λ1IT - \lambda_1 I has its first column zero. Since T−λkIT - \lambda_k I is upper triangular with a zero in position (k,k)(k,k), multiplying on the right by it keeps the first k−1k - 1 columns zero and makes the kkth column zero too. So the product of the first kk factors has its first kk columns zero, and the full product is 0.

Diagonalizable Matrices are Dense

For all A∈MnA \in M_n and ε>0\varepsilon > 0 there is E∈MnE \in M_n with ∥E∥F<ε\|E\|_F < \varepsilon such that A+EA + E is diagonalizable.

Proof

  1. A=UTU∗A = UTU^*.
  2. Let DD be diagonal such that T+DT + D has distinct diagonal entries and ∥D∥F<ε\|D\|_F < \varepsilon.
  3. E:=UDU∗E := UDU^*, so ∥E∥F=∥D∥F<ε\|E\|_F = \|D\|_F < \varepsilon.
  4. A+E=UTU∗+UDU∗=U(T+D)U∗A + E = UTU^* + UDU^* = U(T + D)U^*.
  5. The diagonal of T+DT + D is distinct, so A+EA + E has distinct eigenvalues and is diagonalizable.

Almost Diagonal Similarity

For all ε>0\varepsilon > 0 there are an invertible SS, a diagonal DD, and EE with ∥E∥F<ε\|E\|_F < \varepsilon such that

A=S(D+E)S−1A = S(D + E)S^{-1}

Proof Let A=UTU∗A = UTU^* and for δ>0\delta > 0 let Dδ=diag(δ,δ2,…,δn)D_\delta = \mathrm{diag}(\delta, \delta^2, \ldots, \delta^n). Then

(Dδ−1TDδ)ij=tijδj−i(D_\delta^{-1} T D_\delta)_{ij} = t_{ij} \delta^{j-i}

so the diagonal is unchanged and the entries above it are O(δ)O(\delta). Hence

A=(UDδ)(Dδ−1TDδ)(UDδ)−1A = (U D_\delta)(D_\delta^{-1} T D_\delta)(U D_\delta)^{-1}

with Dδ−1TDδ=D+ED_\delta^{-1} T D_\delta = D + E, D=diag(λ1,…,λn)D = \mathrm{diag}(\lambda_1, \ldots, \lambda_n) and ∥E∥F→0\|E\|_F \to 0 as δ→0\delta \to 0.

Schur's Inequality

∥A∥F2≥∑i=1n∣λi∣2\|A\|_F^2 \ge \sum_{i=1}^{n} |\lambda_i|^2

Proof With A=UTU∗A = UTU^*,

∥A∥F2=∥T∥F2=∑i≠j∣tij∣2+∑i=1n∣tii∣2≥∑i=1n∣tii∣2=∑i=1n∣λi∣2\|A\|_F^2 = \|T\|_F^2 = \sum_{i \neq j} |t_{ij}|^2 + \sum_{i=1}^{n} |t_{ii}|^2 \ge \sum_{i=1}^{n} |t_{ii}|^2 = \sum_{i=1}^{n} |\lambda_i|^2

Equality holds iff TT is diagonal, i.e. iff AA is normal.