Professional Documents
Culture Documents
Jorden C F
Jorden C F
Here is a method to nd a Jordan canonical form of matrices and some examples showing the method at
work:
Method Outline
(i) For a transformation T : V V , use a basis to get a matrix A = [T ] for the transformation. If
you are just given a matrix, use that matrix.
pA (x) = det(xI A), the characteristic polynomial of the transformation and factor is as
Qm(ii) Compute
k
(x
)
where k 6= j for k 6= j and k 1 for all k. If the characteristic polynomial does not
k
k=1
split, we will not be able to put the transformation into Jordan canonical form.
(iii) For each k , compute the dimensions of N ((Ak I)r ) for r = 1, 2, . . . until dim N ((Ak I)r ) = k ,
say dim N ((A I)rk ) = k . Letting di = dim N ((A k I)i ), this will give us a sequence 0 = d0 < d1 <
d2 < < d`k = k .
(iv) The sequence d0 , . . . , d`k determines how many Jordan blocks corresponding to k we have and their
respective sizes. Here is one way to interpret the sequence: d1 d0 = d1 tells us how many blocks of size
at least one there are. Then, d2 d1 tells how many of those blocks are actually of size at least two. Then,
d3 d2 tells us how many of those blocks are actually of size at least three. Repeating this, we can see
exactly how many blocks of each size we have.
Let's look at some examples.
Example 1.
2
Let T be a transformation with matrix A = 1
1
2
3
2
3
3 .
2
x2
2
3
(ii) We see det(xI A) = det 1 x 3 3 = (x 2)((x 3)(x + 2) + 6) + 2((x + 2) + 3)
1
2
x+2
3(2 (x 3)) = (x 2)(x2 x) + 2(x + 1) 3(x + 1) which is x3 2x2 x2 + 2x 2x + 2 + 3x 3 =
x3 3x2 + 3x 1 = (x 1)3 .
1
2
3
2
3 which has rank 1. Thus, d1 = dim N ((A I)) = 2.
(iii) For = 1, we have A I = 1
1 2 3
Now, (A I)2 = 0, so d2 = 3 (note that the di sequence strictly increases until it reaches k , so because
= 3 for = 1 and dim N ((A I)) = 2, we could actually immediately conclude dim N ((A I)2 ) = 3
(iv) The d1 = 2 tells us the Jordan canonical form of our matrix has 2 blocks with eigenvalue 1. The
d2 d1 = 1 condition tells us one
of these
blocks has size at least 2, and so the other has size 1. Thus, a
1 0 0
Jordan canonical form for A is 0 1 1.
0 0 1
1
0 0 0 0
1 1 0 0 1
1 0 0 1
Example 2. Let T be a transformation with matrix A = 1
.
0
0 0 0 1
1 1 0 0 1
(i) This is already in matrix form.
x1
0
0 0
0
x+1
1
x+1 0 0
1
1
1
x 0
1
(ii) det(xI A) = det
= (x 1) det 0
1
0
0
0 x
1
1
1
1
0 0 x1
1)x2 (x 1) (x 1)(x2 ) = (x2 1)x2 (x 1) + x2 (x 1) This is x4 (x 1).
0
x
0
0
0
1
0
1
= (x 1)(x +
x
1
0 x1
1
0 0 0
1 1 0 0
=
1 1 0 0
0
0 0 0
1 1 0 0
0
0
0
which has rank
1
0
0
1
1
1
1
0 0 0
1
0 0 0
1
0 0 0
2, so
which has rank 3 and hence d1 = dim N (A) = 2. Now, A2 =
1 1 0 0
1 0 0 0
1 0 0 0 0
1 0 0 0 0
(iv) From the above, we have 1 Jordan block with eigenvalue 1 and 2 Jordan blocks with eigenvalue 0. The
sequence 2, 3, 4 tells us there are 2 blocks, with 32 = 1 having size at least 2 and 43 = 1 having
size at least
1
0
3. That is, there is 1 block of size 1 and 1 of size 3. Hence, a Jordan canonical form for A is
0
0
0
1
0 0 0 0 0
0
0 0 0 1 1
1 1 1 1 1 1
0
1 0 0 2 0
0
0 0 0 0 1
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
1
0
x1 0
0
0
0
0
0
x
0
0
1
1
x
0
0
1
1 x1
1
1
1
1
1
= (x1)2 det 1 x 1
=
(ii)det(xIA) = det
0
0
0
x1
0
0
0
0
x1
0
0
1
0
0
x2
0
1
0
0
x2
0
0
0
0
0
x1
x
0
1
1 This is (x 1)3 (x(x 1)(x 2)) + (x 1)3 (x 1) = (x 1)3 (x3 3x2 +
(x 1)3 det 1 x 1
1
0
x2
2x + x 1) = (x 1)3 (x3 3x2 + 3x 1) = (x 1)6 .
0 0
0 0
0 0
I)) = 3. Now, (A I)2 =
0 0
0 0
0 0
0
0 0
0 1 0
1 1 0
=
0
0 0
0
1 0
0
0 0
0 0 0 0
0 0 0 1
0 0 0 1
,
0 0 0 0
0 0 0 1
0 0 0 0
d3 = 6.
0 0 0
0 1 1
1 1 1
which has rank 3. Thus, d1 = dim N ((A
0 0 0
0 1 0
0 0 0
we have 1 block of
1
0
0
size 1, 1 block of size 2, and 1 block of size 3. Hence, a Jordan canonical form for A is
0
0
0
0
1
0
0
0
0
0
1
1
0
0
0
0
0
0
1
0
0
0
0
0
1
1
0
0
0
1
1