Diagonal matrices are the easiest kind of matrices to understand: they just scale the coordinate directions by their diagonal entries. In Section 6.3, we saw that similar matrices behave in the same way, with respect to different coordinate systems. Therefore, if a matrix is similar to a diagonal matrix, it is also relatively easy to understand. This section is devoted to the question: “When is a matrix similar to a diagonal matrix?”
Subsection6.4.1Diagonalizability
Before answering the above question, first we give it a name.
Definition
An matrix is diagonalizable if it is similar to a diagonal matrix: that is, if there exists an invertible matrix and a diagonal matrix such that
Example
Any diagonal matrix is is diagonalizable because it is similar to itself. For instance,
If a matrix is diagonalizable, and if is similar to then is diagonalizable as well by this proposition in Section 6.3.
Powers of diagonalizable matrices
Multiplying diagonal matrices together just multiplies their diagonal entries:
Therefore, it is easy to take powers of a diagonal matrix:
By this fact in Section 6.3, if then so it is also easy to take powers of diagonalizable matrices. This will be very important in applications to discrete dynamical systems in Section 7.3 and Section 7.4.
Recipe: Compute powers of a diagonalizable matrix
If where is a diagonal matrix, then
The always holds for and for all including (giving the inverse of ), when all the diagonal entries of are non-zero.
A fundamental question about a square matrix is whether or not it is diagonalizable. The following is the primary criterion for diagonalizability. It shows that diagonalizability is an eigenvalue problem.
Diagonalization Theorem
An matrix is diagonalizable if and only if has linearly independent eigenvectors.
In this case, for
where are linearly independent eigenvectors, and are the corresponding eigenvalues, in the same order.
Therefore, the columns of are multiples of the standard coordinate vectors:
Now suppose that where has columns and is diagonal with diagonal entries Since is invertible, its columns are linearly independent. We have to show that is an eigenvector of with eigenvalue We know that the standard coordinate vector is an eigenvector of with eigenvalue so:
By this fact in Section 6.1, if an matrix has distinct eigenvalues then a choice of corresponding eigenvectors is automatically linearly independent.
An matrix with distinct eigenvalues is diagonalizable.
We saw in the above example that changing the order of the eigenvalues and eigenvectors produces a different diagonalization of the same matrix. There are generally many different ways to diagonalize a matrix, corresponding to different orderings of the eigenvalues of that matrix. The important thing is that the eigenvalues and eigenvectors have to be listed in the same order.
There are other ways of finding different diagonalizations of the same matrix. For instance, you can scale one of the eigenvectors by a constant
you can find a different basis entirely for an eigenspace of dimension at least etc.
In the above example, the (non-invertible) matrix is similar to the diagonal matrix Since is not invertible, zero is an eigenvalue by the invertible matrix theorem, so one of the diagonal entries of is necessarily zero. Also see this example below.
The following point is often a source of confusion.
Diagonalizability has nothing to do with invertibility
Of the following matrices, the first is diagonalizable and invertible, the second is diagonalizable but not invertible, the third is invertible but not diagonalizable, and the fourth is neither invertible nor diagonalizable, as the reader can verify:
As in the above example, one can check that the matrix
is not diagonalizable for any number We claim that any non-diagonalizable matrix with a real eigenvalue is similar to Therefore, up to similarity, these are the only such examples.
To prove this, let be such a matrix. Let be an eigenvector with eigenvalue and let be any vector in that is not collinear with so that forms a basis for Let be the matrix with columns and consider We have and so and We can compute the first column of as follows:
Therefore, has the form
Since is similar to it also has only one eigenvalue since is upper-triangular, this implies so
As is not diagonalizable, we know is not diagonal ( is similar to ), so Now we observe that
We have shown that is similar to which is similar to so is similar to by the transitivity property of similar matrices.
Subsection6.4.2The Geometry of Diagonalizable Matrices¶ permalink
A diagonal matrix is easy to understand geometrically, as it just scales the coordinate axes:
Therefore, we know from Section 6.3 that a diagonalizable matrix simply scales the “axes” with respect to a different coordinate system. Indeed, if are linearly independent eigenvectors of an matrix then scales the -direction by the eigenvalue
In the following examples, we visualize the action of a diagonalizable matrix in terms of its dynamics. In other words, we start with a collection of vectors (drawn as points), and we see where they move when we multiply them by repeatedly.
Subsection6.4.3Algebraic and Geometric Multiplicity
In this subsection, we give a variant of the diagonalization theorem that provides another criterion for diagonalizability. It is stated in the language of multiplicities of eigenvalues.
In algebra, we define the multiplicity of a root of a polynomial to be the number of factors of that divide For instance, in the polynomial
the root has multiplicity and the root has multiplicity
Definition
Let be an matrix, and let be an eigenvalue of
The algebraic multiplicity of is its multiplicity as a root of the characteristic polynomial of
The geometric multiplicity of is the dimension of the -eigenspace.
Since the -eigenspace of is its dimension is the number of free variables in the system of equations i.e., the number of columns without pivots in the matrix
We saw in the above examples that the algebraic and geometric multiplicities need not coincide. However, they do satisfy the following fundamental inequality, the proof of which is beyond the scope of this text.
Theorem(Algebraic and Geometric Multiplicity)
Let be a square matrix and let be an eigenvalue of Then
In particular, if the algebraic multiplicity of is equal to then so is the geometric multiplicity.
If has an eigenvalue with algebraic multiplicity then the -eigenspace is a line.
The sum of the geometric multiplicities of the eigenvalues of is equal to
The sum of the algebraic multiplicities of the eigenvalues of is equal to and for each eigenvalue, the geometric multiplicity equals the algebraic multiplicity.
We will show First suppose that is diagonalizable. Then has linearly independent eigenvectors This implies that the sum of the geometric multiplicities is at least for instance, if have the same eigenvalue then the geometric multiplicity of is at least (as the -eigenspace contains three linearly independent vectors), and so on. But the sum of the algebraic multiplicities is greater than or equal to the sum of the geometric multiplicities by the theorem, and the sum of the algebraic multiplicities is at most because the characteristic polynomial has degree Therefore, the sum of the geometric multiplicities equals
Now suppose that the sum of the geometric multiplicities equals As above, this forces the sum of the algebraic multiplicities to equal as well. As the algebraic multiplicities are all greater than or equal to the geometric multiplicities in any case, this implies that they are in fact equal.
Finally, suppose that the third condition is satisfied. Then the sum of the geometric multiplicities equals Suppose that the distinct eigenvectors are and that is a basis for the -eigenspace, which we call We claim that the collection of all vectors in all of the eigenspace bases is linearly independent. Consider the vector equation
Grouping the eigenvectors with the same eigenvalues, this sum has the form
Since eigenvectors with distinct eigenvalues are linearly independent, each “something in ” is equal to zero. But this implies that all coefficients are equal to zero, since the vectors in each are linearly independent. Therefore, has linearly independent eigenvectors, so it is diagonalizable.
The first part of the third statement simply says that the characteristic polynomial of factors completely into linear polynomials over the real numbers: in other words, there are no complex (non-real) roots. The second part of the third statement says in particular that for any diagonalizable matrix, the algebraic and geometric multiplicities coincide.
Let be a square matrix and let be an eigenvalue of If the algebraic multiplicity of does not equal the geometric multiplicity, then is not diagonalizable.
The examples at the beginning of this subsection illustrate the theorem. Here we give some general consequences for diagonalizability of and matrices.
Diagonalizability of Matrices
Let be a matrix. There are four cases:
has two different eigenvalues. In this case, each eigenvalue has algebraic and geometric multiplicity equal to one. This implies is diagonalizable. For example:
has one eigenvalue of algebraic and geometric multiplicity To say that the geometric multiplicity is means that i.e., that every vector in is in the null space of This implies that is the zero matrix, so that is the diagonal matrix In particular, is diagonalizable. For example:
has one eigenvalue of algebraic multiplicity and geometric multiplicity In this case, is not diagonalizable, by part 3 of the theorem. For example, a shear:
has no eigenvalues. This happens when the characteristic polynomial has no real roots. In particular, is not diagonalizable. For example, a rotation:
Recall from this fact in Section 6.3 that similar matrices have the same eigenvalues. It turns out that both notions of multiplicity of an eigenvalue are preserved under similarity.
Theorem
Let and be similar matrices, and let be an eigenvalue of and Then:
Since and have the same characteristic polynomial, the multiplicity of as a root of the characteristic polynomial is the same for both matrices, which proves the first statement. For the second, suppose that for an invertible matrix By this fact in Section 6.3, the matrix takes eigenvectors of to eigenvectors of both with eigenvalue
Let be a basis of the -eigenspace of We claim that is linearly independent. Suppose that
Since are linearly independent, we get as desired.
By the previous paragraph, the dimension of the -eigenspace of is greater than or equal to the dimension of the -eigenspace of By symmetry ( is similar to as well), the dimensions are equal, so the geometric multiplicities coincide.
For instance, the four matrices in this example are not similar to each other, because the algebraic and/or geometric multiplicities of the eigenvalues do not match up. Or, combined with the above theorem, we see that a diagonalizable matrix cannot be similar to a non-diagonalizable one, because the algebraic and geometric multiplicities of such matrices cannot both coincide.
The converse of the theorem is false: there exist matrices whose eigenvalues have the same algebraic and geometric multiplicities, but which are not similar. See the example below. However, for and matrices whose characteristic polynomial has no complex (non-real) roots, the converse of the theorem is true. (We will handle the case of complex roots in Section 6.5.)
On the other hand, suppose that and are diagonalizable matrices with the same characteristic polynomial. Since the geometric multiplicities of the eigenvalues coincide with the algebraic multiplicities, which are the same for and we conclude that there exist linearly independent eigenvectors of each matrix, all of which have the same eigenvalues. This shows that and are both similar to the same diagonal matrix. Using the transitivity property of similar matrices, this shows:
Diagonalizable matrices are similar if and only if they have the same characteristic polynomial, or equivalently, the same eigenvalues with the same algebraic multiplicities.
