Unitary Matrices
U U U is unitary when U ∗ U = I U^*U = I U ∗ U = I .
U U U is unitary ⟺ \iff ⟺ the columns of U U U are orthonormal, since
U ∗ U = [ U 1 ∗ U 2 ∗ ⋮ ] [ U 1 U 2 ⋯ ] = [ U i ∗ U j ] i j U^*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} U ∗ U = U 1 ∗ U 2 ∗ ⋮ [ U 1 U 2 ⋯ ] = [ U i ∗ U j ] ij
If U , V U, V U , V are unitary, U V UV U V is unitary.
For all x ∈ C n x \in \mathbb{C}^n x ∈ C n , ∥ U x ∥ 2 = ∥ x ∥ 2 \|Ux\|_2 = \|x\|_2 ∥ Ux ∥ 2 = ∥ x ∥ 2 .
A , B A, B A , B are unitarily similar when A = U B U ∗ A = UBU^* A = U B U ∗ with U U U unitary. Then ∥ A ∥ F = ∥ B ∥ F \|A\|_F = \|B\|_F ∥ A ∥ F = ∥ B ∥ F , since for unitary U , V U, V U , V
∥ U A V ∗ ∥ F 2 = t r ( ( U A V ∗ ) ∗ U A V ∗ ) = t r ( V A ∗ U ∗ U A V ∗ ) = t r ( V A ∗ A V ∗ ) = t r ( A ∗ A ) = ∥ A ∥ F 2 \|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 ∥ U A V ∗ ∥ F 2 = tr ( ( U A V ∗ ) ∗ U A V ∗ ) = tr ( V A ∗ U ∗ U A V ∗ ) = tr ( V A ∗ A V ∗ ) = tr ( A ∗ A ) = ∥ A ∥ F 2
Householder Matrices
For w ∈ C n w \in \mathbb{C}^n w ∈ C n with ∥ w ∥ 2 = 1 \|w\|_2 = 1 ∥ w ∥ 2 = 1 ,
H w : = I − 2 w w ∗ H_w := I - 2ww^* H w := I − 2 w w ∗
H w H_w H w is unitary and Hermitian.
For x ≠ y ∈ R n x \neq y \in \mathbb{R}^n x = y ∈ R n with ∥ x ∥ 2 = ∥ y ∥ 2 \|x\|_2 = \|y\|_2 ∥ x ∥ 2 = ∥ y ∥ 2 , if
w = 1 ∥ x − y ∥ 2 ( x − y ) w = \frac{1}{\|x - y\|_2}(x - y) w = ∥ x − y ∥ 2 1 ( x − y )
then H w x = y H_w x = y H w x = y and H w y = x H_w y = x H w y = x .
For x ∈ C n x \in \mathbb{C}^n x ∈ C n with ∥ x ∥ 2 = 1 \|x\|_2 = 1 ∥ x ∥ 2 = 1 , there is a unitary U U U whose first column is x x x , by extending x x x to an orthonormal basis with Gram-Schmidt.
Schur Decomposition
Let A ∈ M n A \in M_n A ∈ M n have eigenvalues λ 1 , … , λ n \lambda_1, \ldots, \lambda_n λ 1 , … , λ n in any order. Then there are a unitary U U U and an upper triangular T T T with diagonal λ 1 , … , λ n \lambda_1, \ldots, \lambda_n λ 1 , … , λ n such that
A = U T U ∗ A = UTU^* A = U T U ∗
U U U and T T T can be taken real if A A A and its eigenvalues are real.
Proof Let x x x be a normalized eigenvector with eigenvalue λ 1 \lambda_1 λ 1 , and U U U unitary with first column x x x . Then
U ∗ A U = [ x ∗ U 2 ∗ ⋮ ] [ A x ∣ A U 2 ∣ ⋯ ] = [ λ 1 ∗ 0 B ] U^*AU = \begin{bmatrix} x^* \\ U_2^* \\ \vdots \end{bmatrix} [\, Ax \mid AU_2 \mid \cdots \,] = \begin{bmatrix} \lambda_1 & * \\ 0 & B \end{bmatrix} U ∗ A U = x ∗ U 2 ∗ ⋮ [ A x ∣ A U 2 ∣ ⋯ ] = [ λ 1 0 ∗ B ]
and σ ( B ) = { λ 2 , … , λ n } \sigma(B) = \{\lambda_2, \ldots, \lambda_n\} σ ( B ) = { λ 2 , … , λ n } . Let y y y be a normalized eigenvector of B B B for λ 2 \lambda_2 λ 2 , and V ∈ M n − 1 V \in M_{n-1} V ∈ M n − 1 unitary with first column y y y . Then
( U [ 1 0 0 V ] ) ∗ A ( U [ 1 0 0 V ] ) = [ λ 1 ∗ 0 V ∗ B V ] = [ λ 1 ∗ ∗ 0 λ 2 ∗ 0 0 C ] \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} ( U [ 1 0 0 V ] ) ∗ A ( U [ 1 0 0 V ] ) = [ λ 1 0 ∗ V ∗ B V ] = λ 1 0 0 ∗ λ 2 0 ∗ ∗ C
Continuing, in the end the middle matrix is upper triangular with λ 1 , … , λ n \lambda_1, \ldots, \lambda_n λ 1 , … , λ n on the diagonal, and the product of the unitaries Ω \Omega Ω is unitary, so A = Ω T Ω ∗ A = \Omega T \Omega^* A = Ω T Ω ∗ .
Cayley-Hamilton
p A ( A ) = 0 p_A(A) = 0 p A ( A ) = 0
Proof Let A = U T U ∗ A = UTU^* A = U T U ∗ and p A ( t ) = ( t − λ 1 ) ⋯ ( t − λ n ) p_A(t) = (t - \lambda_1) \cdots (t - \lambda_n) p A ( t ) = ( t − λ 1 ) ⋯ ( t − λ n ) . Then
p A ( A ) = U p A ( T ) U ∗ = U [ ( T − λ 1 I ) ( T − λ 2 I ) ⋯ ( T − λ n I ) ] 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^* p A ( A ) = U p A ( T ) U ∗ = U [ ( T − λ 1 I ) ( T − λ 2 I ) ⋯ ( T − λ n I ) ] U ∗
T − λ 1 I T - \lambda_1 I T − λ 1 I has its first column zero. Since T − λ k I T - \lambda_k I T − λ k I is upper triangular with a zero in position ( k , k ) (k,k) ( k , k ) , multiplying on the right by it keeps the first k − 1 k - 1 k − 1 columns zero and makes the k k k th column zero too. So the product of the first k k k factors has its first k k k columns zero, and the full product is 0.
Diagonalizable Matrices are Dense
For all A ∈ M n A \in M_n A ∈ M n and ε > 0 \varepsilon > 0 ε > 0 there is E ∈ M n E \in M_n E ∈ M n with ∥ E ∥ F < ε \|E\|_F < \varepsilon ∥ E ∥ F < ε such that A + E A + E A + E is diagonalizable.
Proof
A = U T U ∗ A = UTU^* A = U T U ∗ .
Let D D D be diagonal such that T + D T + D T + D has distinct diagonal entries and ∥ D ∥ F < ε \|D\|_F < \varepsilon ∥ D ∥ F < ε .
E : = U D U ∗ E := UDU^* E := U D U ∗ , so ∥ E ∥ F = ∥ D ∥ F < ε \|E\|_F = \|D\|_F < \varepsilon ∥ E ∥ F = ∥ D ∥ F < ε .
A + E = U T U ∗ + U D U ∗ = U ( T + D ) U ∗ A + E = UTU^* + UDU^* = U(T + D)U^* A + E = U T U ∗ + U D U ∗ = U ( T + D ) U ∗ .
The diagonal of T + D T + D T + D is distinct, so A + E A + E A + E has distinct eigenvalues and is diagonalizable.
Almost Diagonal Similarity
For all ε > 0 \varepsilon > 0 ε > 0 there are an invertible S S S , a diagonal D D D , and E E E with ∥ E ∥ F < ε \|E\|_F < \varepsilon ∥ E ∥ F < ε such that
A = S ( D + E ) S − 1 A = S(D + E)S^{-1} A = S ( D + E ) S − 1
Proof Let A = U T U ∗ A = UTU^* A = U T U ∗ and for δ > 0 \delta > 0 δ > 0 let D δ = d i a g ( δ , δ 2 , … , δ n ) D_\delta = \mathrm{diag}(\delta, \delta^2, \ldots, \delta^n) D δ = diag ( δ , δ 2 , … , δ n ) . Then
( D δ − 1 T D δ ) i j = t i j δ j − i (D_\delta^{-1} T D_\delta)_{ij} = t_{ij} \delta^{j-i} ( D δ − 1 T D δ ) ij = t ij δ j − i
so the diagonal is unchanged and the entries above it are O ( δ ) O(\delta) O ( δ ) . Hence
A = ( U D δ ) ( D δ − 1 T D δ ) ( U D δ ) − 1 A = (U D_\delta)(D_\delta^{-1} T D_\delta)(U D_\delta)^{-1} A = ( U D δ ) ( D δ − 1 T D δ ) ( U D δ ) − 1
with D δ − 1 T D δ = D + E D_\delta^{-1} T D_\delta = D + E D δ − 1 T D δ = D + E , D = d i a g ( λ 1 , … , λ n ) D = \mathrm{diag}(\lambda_1, \ldots, \lambda_n) D = diag ( λ 1 , … , λ n ) and ∥ E ∥ F → 0 \|E\|_F \to 0 ∥ E ∥ F → 0 as δ → 0 \delta \to 0 δ → 0 .
Schur's Inequality
∥ A ∥ F 2 ≥ ∑ i = 1 n ∣ λ i ∣ 2 \|A\|_F^2 \ge \sum_{i=1}^{n} |\lambda_i|^2 ∥ A ∥ F 2 ≥ i = 1 ∑ n ∣ λ i ∣ 2
Proof With A = U T U ∗ A = UTU^* A = U T U ∗ ,
∥ A ∥ F 2 = ∥ T ∥ F 2 = ∑ i ≠ j ∣ t i j ∣ 2 + ∑ i = 1 n ∣ t i i ∣ 2 ≥ ∑ i = 1 n ∣ t i i ∣ 2 = ∑ i = 1 n ∣ λ 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 ∥ A ∥ F 2 = ∥ T ∥ F 2 = i = j ∑ ∣ t ij ∣ 2 + i = 1 ∑ n ∣ t ii ∣ 2 ≥ i = 1 ∑ n ∣ t ii ∣ 2 = i = 1 ∑ n ∣ λ i ∣ 2
Equality holds iff T T T is diagonal, i.e. iff A A A is normal .