In this section we define what it means for a matrix to be in Jordan normal form; such matrices could be thought as a being “almost” diagonal.
A Jordan block of size , for the eigenvalue is the matrix:
The direct sum of two matrices is defined as follows. Let , . Then we let
It is the square matrix made by putting in the upper-left, in the lower right, and zeroes elsewhere.
A matrix is said to be in Jordan normal form (JNF), if it is the direct sum of Jordan blocks.
A JNF of a matrix , is any matrix which is the direct sum of Jordan blocks and is similar to . In other words, if is in Jordan normal form, then it is a JNF of .
Find a matrix in which is in Jordan normal form, is the direct sum of exactly 5 Jordan blocks, and has exactly 3 different eigenvalues.
[End of Exercise]
A reliable (if long) method to compute a Jordan normal form of is as follows: first find a Jordan basis, and then use the corresponding change of basis matrix to put into the required form. This is the reason Jordan bases are important: When a matrix is written in a Jordan basis, it is the direct sum of Jordan blocks (one for each Jordan chain). A consequence of this statement is:
Let , and a Jordan basis. For each eigenvalue , the number of Jordan blocks of size in JNF is equal to the number of Jordan chains of length in .
Here is the most obvious example of this correspondence: If is a single Jordan block, then the generalized eigenspaces for are , and the standard basis is a Jordan chain of length .
Find a Jordan normal form of .
Solution: In Example 6.30 we found a Jordan basis for which consisted of one chain of length 1 for and one chain of length 2 for . So by Theorem 6.41 there exists a matrix :
In fact, immediately after Example 6.30 we did two additional computations which also produced this matrix, which is in Jordan normal form. So we have found a Jordan normal form of .
It is often called “The JNF of ”, but you should know that it is not quite unique:
Consider the following two matrices:
These two matrices are in Jordan normal form, since they are both the direct sum of two Jordan blocks. Also notice that if then . Therefore these two matrices, which are both in JNF, are similar to each other.
Find the JNF of (see also Exercise 6.31).
[End of Exercise]
Find the JNF of (see also Exercise 6.32).
[End of Exercise]
Find the JNF of (see also Exercise 6.34).
[End of Exercise]
The next theorem states that the only way two matrices in Jordan normal form can be similar to each other is if they have the same Jordan blocks but are written in a different order, like the previous example. It is closely related to Theorem 6.41.
Let be a matrix with a Jordan basis (which exists, by Theorem 6.33). If is the change of basis matrix from to the standard basis, then is in Jordan normal form; in other words, it is the direct sum of Jordan blocks.
Furthermore, the Jordan blocks occurring in are uniquely determined by (but the order of the blocks is not determined)
According to this theorem, one might say “The Jordan normal form of a matrix is unique up to a permutation of the Jordan blocks”.
A key difficulty, therefore, is to determine for each eigenvalue, how many Jordan blocks there are, and what size they are. Once you know that, you know the Jordan normal form. To find the size and number of Jordan blocks, the only piece of information you need is the dimensions of the generalized eigenspaces. The next theorem says how this works.
Let , and an eigenvalue. Then the number of Jordan blocks of size for is equal to
for .
In particular, the number of Jordan blocks for equals . Recall .
Furthermore, the sum of the sizes of all the blocks for all eigenvalues, must equal .
Find the Jordan normal form of .
(Solution:) The characteristic polynomial is , so the only eigenvalue is . Let’s find the dimensions of the generalized eigenspaces. We have that
and
Since clearly has rank 2 (if we swap the first and fourth rows it is in echelon form, in which case the rank is the number of non-zero rows), by the dimension theorem, the dimension of its kernel is also 2. So
for
So by Theorem 6.48, the number of Jordan blocks is .
Applying the Theorem 6.48 to , we see there are Jordan blocks of size . Since the sum of the sizes of all the blocks must add up to 4, the two blocks must both have size 2. In other words, the JNF of is
Assume has a single eigenvalue, . Furthermore, assume has dimension 2, and has dimension 3.
What is the JNF of ?
What can you say about the dimensions of and ?
[End of Exercise]
Find a Jordan basis for .
(Solution:) Since the Jordan blocks correspond to some Jordan chain, and we already found that the JNF is , we know that a Jordan basis must consist of two Jordan chains of length 2, each for the eigenvalue . To make a Jordan chain of length 2, we need to find elements in . According to our calculation above,
Also,
So any vector in which is not in will create a Jordan chain, by taking . But we want two such chains, and which together form a basis of . So we must ensure that the resulting 4 vectors are linearly independent; this isn’t guaranteed. For example, if we choose and then this would imply and ; so they wouldn’t form a Jordan basis.
But let’s take the two Jordan chains as follows:
To verify we haven’t made a mistake, let’s write the change of basis matrix:
and compute
This is, indeed, the Jordan normal form, as we found above.
Find the JNF, and Jordan basis for .
[End of Exercise]
Summary of the above method of finding the Jordan normal form:
Find the characteristic polynomial, and solve for the eigenvalues
For each eigenvalue, find the dimensions of each generalized eigenspace: .
For each eigenvalue, use Theorem 6.48 to compute the number of Jordan blocks, and their sizes
The sum of all the Jordan blocks, found above, is the JNF
Summary of the above method of finding a Jordan basis, once you know the JNF:
For each eigenvalue, find Jordan chains whose lengths correspond to the Jordan blocks, being careful to ensure distinct Jordan chains are linearly independent
If done correctly, those Jordan chains together should form a Jordan basis
Check that is the JNF, using the change of basis matrix .