An matrix is diagonalizable exactly when it has independent eigenvectors. In practice: find the eigenvalues, and for each repeated one check that its eigenspace is as large as its multiplicity.
| Step | On | |
|---|---|---|
| 1 | Find the eigenvalues with multiplicities. Use finding eigenvalues; a triangular matrix shows them on the diagonal. | (), () |
| 2 | Apply the quick tests. If all eigenvalues are distinct, or is real symmetric, the answer is yes: stop. | not distinct, not symmetric: continue |
| 3 | Skip the simple eigenvalues. An eigenvalue with always has . | is fine |
| 4 | Compute the geometric multiplicity of each repeated eigenvalue. Find the rank of ; then . | has one nonzero row: |
| 5 | Compare. Diagonalizable if for every eigenvalue, equivalently if the add up to . | and : diagonalizable ✓ |