Home page for accesible maths 6 Jordan normal form

Style control - access keys in brackets

Font (2 3) - + Letter spacing (4 5) - + Word spacing (6 7) - + Line spacing (8 9) - +

6.E Jordan normal form

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.

Definition 6.35:

A Jordan block of size r, for the eigenvalue λ is the r×r matrix:

Jλ(r):=[λ1000λ1000λ1000λ].
Example 6.36.
  1. J7(2)=[7107]

  2. Ja(3)=[a100a100a]

  3. J0(4)=[0100001000010000]

Definition 6.37:

The direct sum of two matrices is defined as follows. Let AMn(), BMm(). Then we let

AB:=[A0n×m0m×nB]Mn+m().

It is the square matrix made by putting A in the upper-left, B in the lower right, and zeroes elsewhere.

Example 6.38.
J2(2)J5(1)J-1(2)=[210000200000500000-110000-1].
Definition 6.39:

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 AMn(C), is any matrix which is the direct sum of Jordan blocks and is similar to A. In other words, if P-1AP is in Jordan normal form, then it is a JNF of A.

Exercise 6.40:

Find a matrix in M10() 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 A is as follows: first find a Jordan basis, and then use the corresponding change of basis matrix to put A 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:

Theorem 6.41.

Let AMn(C), and B a Jordan basis. For each eigenvalue λ, the number of Jordan blocks of size i in JNF is equal to the number of Jordan chains of length i in B.

Here is the most obvious example of this correspondence: If A=Jλ(n) is a single Jordan block, then the generalized eigenspaces for λ are Vλ(i)=span{e1,,ei}, and the standard basis e1,,en is a Jordan chain of length n.

Example 6.42.

Find a Jordan normal form of A=[321031-1-4-1].

Solution: In Example 6.30 we found a Jordan basis for A which consisted of one chain of length 1 for λ=1 and one chain of length 2 for λ=2. So by Theorem 6.41 there exists a matrix P:

P-1AP=J1(1)J2(2).

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 A.

It is often called “The JNF of A”, but you should know that it is not quite unique:

Example 6.43.

Consider the following two matrices:

A=Jλ(1)Jμ(2)=[λ000μ100μ][μ100μ000λ]=Jμ(2)Jλ(1)=B.

These two matrices are in Jordan normal form, since they are both the direct sum of two Jordan blocks. Also notice that if P=[001100010] then P-1AP=B. Therefore these two matrices, which are both in JNF, are similar to each other.

Exercise 6.44:

Find the JNF of A=[04-1-4] (see also Exercise 6.31).

[End of Exercise]

Exercise 6.45:

Find the JNF of A=[-101-1] (see also Exercise 6.32).

[End of Exercise]

Exercise 6.46:

Find the JNF of A=[2000201-12] (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.

Theorem 6.47.

Let AMn(C) be a matrix with B a Jordan basis (which exists, by Theorem 6.33). If P is the change of basis matrix from B to the standard basis, then P-1AP is in Jordan normal form; in other words, it is the direct sum of Jordan blocks.

Furthermore, the Jordan blocks occurring in P-1AP are uniquely determined by A (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.

Theorem 6.48.

Let AMn(C), and λC an eigenvalue. Then the number of Jordan blocks of size i for λ is equal to

dimVλ(i)-dimVλ(i-1)

for i=1,2,.

In particular, the number of Jordan blocks for λ equals dimVλ(1). Recall Vλ(0)={0}.

Furthermore, the sum of the sizes of all the blocks for all eigenvalues, must equal n.

Example 6.49.

Find the Jordan normal form of A=[-30000-31000-3010-3-3].

(Solution:) The characteristic polynomial is cA(x)=det(A-xI4)=(-3-x)4, so the only eigenvalue is λ=-3. Let’s find the dimensions of the generalized eigenspaces. We have that

A+3I4=[00000010000010-30],

and

(A+3I4)2=[00000010000010-30][00000010000010-30]=0.

Since A+3I4 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

  1. dimV-3(1)=2

  2. dimV-3(2)=4

  3. dimV-3(i)=4 for i3

So by Theorem 6.48, the number of Jordan blocks is dimV-3(1)=2.

Applying the Theorem 6.48 to i=2, we see there are dimV-3(2)-dimV-3(1)=2 Jordan blocks of size 2. 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 A is

J-3(2)J-3(2)=[-31000-30000-31000-3].
Exercise 6.50:

Assume AM5() has a single eigenvalue, λ=3. Furthermore, assume ker(A-3I5) has dimension 2, and ker(A-3I5)2 has dimension 3.

  • What is the JNF of A?

  • What can you say about the dimensions of ker(A-3I5)3 and ker(A-3I5)4?

[End of Exercise]

Example 6.51.

Find a Jordan basis for A=[-30000-31000-3010-3-3].

(Solution:) Since the Jordan blocks correspond to some Jordan chain, and we already found that the JNF is J-3(2)J-3(2), we know that a Jordan basis must consist of two Jordan chains of length 2, each for the eigenvalue λ=-3. To make a Jordan chain of length 2, we need to find elements in V-3(2)\V-3(1). According to our calculation above,

V-3(2)=ker(A+3I4)2=ker0=4.

Also,

V-3(1)=ker(A+3I4)={v|(A+3I4)v=0}={[0y0w]|y,w}=span{[0100],[0001]}.

So any vector x2 in C4 which is not in V-3(1) will create a Jordan chain, by taking x1:=(A+3I4)x2. But we want two such chains, x1,x2, and y1,y2 which together form a basis of C4. So we must ensure that the resulting 4 vectors are linearly independent; this isn’t guaranteed. For example, if we choose x2=(1,1,0,0) and y2=(1,0,0,0) then this would imply x1=(0,0,0,1) and y1=(0,0,0,1); so they wouldn’t form a Jordan basis.

But let’s take the two Jordan chains as follows:

  1. x1=[0001]

  2. x2=[1000]

  3. y1=[010-3]

  4. y2=[0010]

To verify we haven’t made a mistake, let’s write the change of basis matrix:

P=[01000010000110-30]

and compute

P-1AP=[-31000-30000-31000-3].

This is, indeed, the Jordan normal form, as we found above.

Exercise 6.52:

Find the JNF, and Jordan basis for A=[-1-3-1002100020031-1].

[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: Vλ(1),Vλ(2),.

  • 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 P-1AP is the JNF, using the change of basis matrix P.