The method from the previous section is, in general, a lot of work. For some matrices, and in particular matrices of size or , there is a faster way. In these cases, if you know the characteristic polynomial and the minimal polynomial, then the JNF can be deduced directly from them. If is the JNF of , then
and
This is one of the good things about similar matrices. So to understand the different situations, we will simply write down all possible JNF’s for and matrices.
Let . The only possible JNF’s for are as follows; we also list the corresponding characteristic and minimal polynomials. Here we assume that , but that .
, , .
, , .
, , .
So there are only three possibilities in the case. Let’s also say how to find a Jordan basis in each of these cases:
: Here is a scalar multiple of the identity. So if , then by multiplying that equation by on the left and on the right, we see that . So any basis of is a basis of eigenvectors, and in particular, it is a Jordan basis.
: If we take any vector in the generalized eigenspace which is not in , then set , so that is a Jordan chain of length 2. So it must be a Jordan basis.
, where : If is an eigenvector of and is an eigenvector of , then forms a Jordan basis of (consisting of two Jordan chains of length 1).
Find the JNF and Jordan basis for .
(Solution:) The characteristic polynomial of is
This means has distinct eigenvalues and . So by Theorem 6.53 the JNF is . A Jordan basis consists of an eigenvector for , such as , and an eigenvector of , such as . So a Jordan basis is .
To check that we haven’t made a mistake, we could use the change of basis matrix:
then
Find the JNF and Jordan basis for .
(Solution:) The characteristic polynomial of is . So is the only eigenvalue. Since is not a scalar multiple of the identity, it doesn’t satisfy the matrix equation . In other words, the minimal polynomial is not . The only other option for the minimal polynomial is . Therefore, the JNF of is .
To find a Jordan basis we just need to take any non-zero vector which is not an eigenvector (because , and is the eigenspace). Since is not an eigenvector, it will do. Define . Therefore a Jordan basis is .
To verify that this is a Jordan basis, create the change of basis matrix, and multiply:
Find the JNF of the following matrices, by first finding the characteristic and minimal polynomials, and then applying Theorem 6.53:
,
,
.
[End of Exercise]
Next we consider the matrix case. Again, the JNF can be completely described, just from looking at the characteristic polynomial together with the minimal polynomial.
Let . The only possible JNF’s are listed as follows; we also list the corresponding characteristic and minimal polynomials. We assume that are all different from each other.
, , .
, , .
, , .
, , .
, , .
, .
Here “” means 0.
Using analogous arguments to the case, we can find a Jordan basis in each case. Instead of writing out how this is done for each case, we will consider a few examples.
Find the JNF and Jordan basis for .
(Solution:) The characteristic polynomial is , so the eigenvalues are 0 and 1. Since the minimal polynomial is a factor of , and shares the same roots (by Theorem 6.10), it must be either or . One can check, by matrix multiplication, that . Therefore, the minimal polynomial is . So by Theorem 6.57, the JNF of is .
To find a Jordan basis, we need three Jordan chains of length 1. In other words, we need three linearly independent eigenvectors. We can choose the eigenvectors for the eigenvalue 1, and the eigenvector for the eigenvalue 0. These together form a Jordan basis.
To verify that we haven’t made a mistake, we can use the change of basis matrix:
Find the JNF and Jordan basis for .
(Solution:) We have already found the Jordan normal form (Example 6.42), and Jordan basis for in (Example 6.30). But let’s do it again, this time using the minimal polynomial method. We compute the characteristic polynomial by expanding the determinant and find that . In general, cubic polynomials are difficult to factor by hand; in this case we are lucky that is a root, because ; so is a factor. Therefore
So there are two eigenvalues, 1 and 2. Since the minimal polynomial must also have 1 and 2 as roots, and is divisible by , the only choices are
or
To check whether or not the first one is the minimal polynomial, we perform the matrix multiplication:
Therefore, is not the minimal polynomial, so it must be
By Theorem 6.57, the JNF must be .
So a Jordan basis consists of a Jordan chain of length 2, for the eigenvalue , and a Jordan chain of length 1 (i.e. an eigenvector), for the eigenvalue . See Example 6.42 for the details.
Find the JNF of the following matrices, by first finding the characteristic and minimal polynomials, and then applying Theorem 6.57:
,
.
[End of Exercise]
Find the JNF and Jordan basis for .
(Solution:) Find we find the characteristic polynomial:
So there is only one eigenvalue, . Therefore, the minimal polynomial is one of the following three polynomials:
or
or
Since is not equal to , it is not the first one. To test whether the middle polynomial is the correct one:
This proves that the minimal polynomial is
So, according the Theorem 6.57, the JNF of is .
To find a Jordan basis, we need to find two Jordan chains for the eigenvalue , of length 1 and 2, which together are linearly independent (and hence form a basis of ). To form a Jordan chain of length 2, we need a vector in the generalized eigenspace , which is not an eigenvector. Since , the kernel of this matrix is all of . Also, . Therefore
.
Let’s define , because this vector is in but not in . Therefore the following vectors define a Jordan chain of length 2:
To complete the Jordan basis, we just need another Jordan chain of length 1, which is linearly independent to the one above. Pretty much any other eigenvector will do, such as . We can verify that we haven’t made a mistake, using the change of basis matrix whose columns are the basis vectors:
Therefore, a Jordan basis is , where these vectors are the columns of .
Find the JNF and Jordan basis for .
(Solution:) First, we compute its characteristic polynomial, and find the eigenvalues.
As in the previous example, we have only one eigenvalue, . So the only possibilities for the minimal polynomial are:
,
,
.
Since is not , we can rule out the first one. To determine whether or not the middle one is the minimal polynomial:
This rules out the middle polynomial. Therefore, the minimal polynomial is
So, by Theorem 6.57, the JNF must be .
To find a Jordan basis, we just need to find a single Jordan chain of length 3, since there is only one Jordan block, and it is size 3. We need a vector in . According to the above calculation, we can express as the span of two vectors as follows:
,
.
So define , which is clearly not in . This vector defines the rest of the Jordan chain:
So this is our Jordan basis. To verify that we haven’t made a mistake, let’s form the change of basis matrix whose columns are the basis elements:
Since this matrix equation holds, we have found a Jordan basis, .