Processing math: 100%
Skip to main content

Section 34.4 Examples

Subsection 34.4.1 Determining the form indirectly

Here we will carry out the indirect analysis method described in Subsection 34.3.4 in a fairly simple case.

Example 34.4.1. Determining Jordan normal form.

Consider the matrix

A=[3411040034040000511000022300006120004505104311031]

from Example 30.2.1. This matrix has two eigenvalues: λ1=3 of multiplicity m1=4, and λ2=1 of multiplicity m2=3. So we expect the Jordan normal form of A to have “macro” blocks

J=[3I+N1(1)I+N2],

where the first block 3I+N1 is a 4×4 block-diagonal matrix of Jordan blocks for λ1=3, and the second block (1)I+N2 is a 3×3 block-diagonal matrix of Jordan blocks for λ2=1.

Analyze Aλ1I first. We calculate the ranks of powers of Aλ1I, subtracting off the multiplicity of the other eigenvalue λ2:

rank(A3I)m2=1,rank(A3I)2m2=0.

We can stop here, since only the zero matrix has rank zero. So we know the 4×4 nilpotent part of the λ1 block has already become zero at the second power. (In general, we know it will at worst become zero at exponent equal to the algebraic multiplicity for that eigenvalue.) From the first rank, we know that there are m11=3 Jordan blocks for λ1=3, and from the second rank, we know that the largest is of size 2×2. From the first rank again, we can conclude that there is only one 2×2 block, so there must be two more 1×1 blocks, from which we get the partial Jordan form

J=[31333X(1)I+N2X].

Now analyze Aλ2I. Again, we calculate the ranks of powers of Aλ2I, subtracting off the multiplicity of the other eigenvalue λ1:

rank(A+I)m1=2,rank(A+I)2m1=1,rank(A+I)3m1=0.

From the first rank, we know that there is only m22=1 Jordan block for λ2=1. The third rank corroborates this, since it tells us that the largest block has size 3×3 (which is equal to the overall size m2=3 of the blocks for λ2=1). And the second rank corroborates this as well, since it tells us that there is only one block of that largest size 3×3. With this information, we now have the exact Jordan form for A:

J=[3133311111].

Subsection 34.4.2 Using the procedure

Now a simple example of using Procedure 34.3.1 to calculate a transition matrix to put a given matrix into Jordan normal form. Notice that the matrix we analyze is the same as in Example 34.4.1.

Example 34.4.2. Calculating a transition matrix for Jordan form.

In Example 30.2.1, we determined a matrix Q that puts the following 7×7 matrix A in triangular-block form:

A=[3411040034040000511000022300006120004505104311031],Q=[1000011010000100100000011001001000101000101000100]Q1AQ=[3001300313112111].

(Note that we called the transition matrix P in that example).

Now, let's put the nilpotent part of each block of Q1AQ into nilpotent triangular form. Since the blocks are small, we will determine cyclic space bases by inspection, using our knowledge of the theory from Section 33.6, instead of using either of the procedures from Subsection 33.4.3. Break each of the two blocks of Q1AQ into its scalar and nilpotent parts:

A1=[3001300313],N1=[0001000010]A1=3I4+N1;A2=[112111],N2=[012010]A2=(1)I3+N2.

Start with N1. Let N1 represent the nilpotent triangular form for N1. Since N21=0, the largest block in N1 has size 2×2. We have rankN1=1, so there is only one 2×2 block, and from nullityN1=3 (nullity is size minus rank), we see that N1 will have three blocks. Therefore, we need one two-dimensional N1-cyclic subspace of R4, and two one-dimensional subspaces. Since the fourth column of N1 is nonzero, we can use e4 to generate the two-dimensional space. We can use any vectors in the null space of N1 that are linearly independent with that fourth column to generate the one-dimensional spaces. For example, one can easily see by inspection that e1,e2 both lie in the null space of N1. Thus, set

W1=Span{e4,N1e4},W2=Span{e1},W3=Span{e2}.

Using these cyclic bases, we get

R1=[0110000101001000]N1=R11N1R1=[01000].

For N2, we have

N2=[012010],N22=[001000],N32=0.

Since N2 is 3×3 and the first power of N2 that is zero is the 3rd power, N2 should be similar to a matrix in elementary nilpotent form. The third column of N22 is nonzero, so we can set

U=Span{e3,N2e3,N22e3},

and use this cyclic basis to get

R2=[021010100]N2=R21N2R2=[01010].

We can also apply R1,R2 to A1,A2:

R11A1R1R21A2R2=R11(3I+N1)R1=R21((1)I+N2)R2=3R11IR1+R11N1R1=(1)R21IR2+R21N2R2=3I+N2=3I+N1=(1)I+N2=[31333],=[11111].

Recall that the matrix Q puts A into triangular-block form. We see above that the matrices R1,R2 break each block of Q1AQ into Jordan blocks. We can combine these by forming the block-diagonal matrix

R=[R1R2]

and setting P=QR. Then,

P1AP=R1Q1AQR=[R11R21][A1A2][R1R2]=[R11A1R1R21A2R2]=[3I+N1(1)I+N2]=[3133311111],

the Jordan normal form of A as desired.