A matrix is diagonalizable if there exists a nonsingular matrix such that is diagonal. In other words, a diagonalizable matrix is one that is similar to a diagonal matrix.
The condition is equivalent to with nonsingular, that is, , , where . Hence is diagonalizable if and only if it has a complete set of linearly independent eigenvectors.
A Hermitian matrix is diagonalizable because the eigenvectors can be taken to be mutually orthogonal. The same is true for a normal matrix (one for which ). A matrix with distinct eigenvalues is also diagonalizable.
If has distinct eigenvalues then it is diagonalizable.
Proof. Let have eigenvalues with corresponding eigenvectors . Suppose that for some . Then
which implies since for and . Premultiplying by shows, in the same way, that . Continuing in this way we find that . Therefore the are linearly independent and hence is diagonalizable.
A matrix can have repeated eigenvalues and be diagonalizable, as diagonal matrices with repeated diagonal entries show. What is needed for diagonalizability is that every -times repeated eigenvalue has linearly independent eigenvectors associated with it. Equivalently, the algebraic and geometric multiplicities of every eigenvalue must be equal, that is, the eigenvalues must all be semisimple. Another equivalent condition is that the degree of the minimal polynomial is equal to the number of distinct eigenvalues.
The simplest example of a matrix that is not diagonalizable is . This matrix is a Jordan block with the eigenvalue . Diagonalizability is easily understood in terms of the Jordan canonical form: is diagonalizable if and only if all the Jordan blocks in its Jordan form are .
Most matrices are diagonalizable, in the sense that the diagonalizable matrices are dense in , that is, any matrix in is arbitrarily close to a diagonalizable matrix. This property is useful because it can be convenient to prove a result by first proving it for diagonalizable matrices and then arguing that by continuity the result holds for a general matrix.
Is a rank- matrix diagonalizable, where are nonzero? There are zero eigenvalues with eigenvectors any set of linearly independent vectors orthogonal to . If then is the remaining eigenvalue, with eigenvector , which is linearly independent of the eigenvectors for , and is diagonalizable. If then all the eigenvalues of are zero and so cannot be diagonalizable, as the only diagonalizable matrix whose eigenvalues are all zero is the zero matrix. For the matrix mentioned above, and , so , confirming that this matrix is not diagonalizable.
Related Blog Posts
- What Is an Eigenvalue? (2022)
- What Is the Jordan Canonical Form? (2022)
This article is part of the “What Is” series, available from https://nhigham.com/category/what-is and in PDF form from the GitHub repository https://github.com/higham/what-is.
One thought on “What Is a Diagonalizable Matrix?”
I think you meant that x,y are elements of C^(nx1) !