Equivalent Conditions of the Theorem
For a real matrix , the following two conditions are equivalent to each other.
-
There exists an orthonormal basis of consisting of eigenvectors of matrix
-
Matrix is normal and the characteristic polynomial of factors into linear factors in
The main difference from the case of complex matrices lies in the additional requirement about the factorization of the characteristic polynomial. In real numbers, all roots of the characteristic polynomial must be real numbers.
Based on this theorem, several types of matrices can be diagonalized using an orthonormal basis of eigenvectors. Complex Hermitian matrices, complex unitary matrices, and real symmetric matrices always satisfy this condition. Orthogonal matrices can be orthogonally diagonalized only if their characteristic polynomial factors into linear factors in real numbers.
Normal Matrix without Orthonormal Basis
Consider a rotation matrix for angle that is not a multiple of .
This matrix is orthogonal and therefore automatically normal. However, its characteristic polynomial
does not factor into linear factors in real numbers for most values of . Imagine searching for solutions to a quadratic equation that has no real roots. As a result, even though the matrix is normal, there is no orthonormal basis of real eigenvectors.
Non-Normal Matrix that is Diagonalizable
The following matrix has eigenvalues and with algebraic multiplicity 1 each.
Since the eigenvalues are different, the matrix can be diagonalized. However, this matrix is not normal because
These two matrices are not equal, so .
The eigenspaces of this matrix are
Here the kernel (null space) is the set of all vectors that are mapped to the zero vector by the matrix, while the span is the set of all linear combinations of that vector. Although the matrix can be diagonalized, there is no orthonormal basis of eigenvectors because the eigenvectors are not orthogonal to each other.