Section 29.5 Examples
Example 29.5.1. Scalar-triangularization procedure: a small matrix.
Is matrix
similar to some upper triangular matrix?
We begin by investigating the eigenvalues of A. Compute the characteristic polynomial:
So A has eigenvalue λ=−1, with algebraic multiplicity 3. From our analysis in Subsection 29.4.3, since A has a single eigenvalue, we are confident it can be made similar to a scalar triangular matrix.
Next, compute a basis for the eigenspace E−1(A).
As you can see, the geometric multiplicity of the eigenvalue λ=−1 is not equal to the algebraic multiplicity, so A is not diagonalizable. So we continue with the scalar-triangularization procedure (Procedure 29.4.1).
Now compute a basis for the generalized eigensubspace of degree 2:
Note that we have included our basis vector for E−1(A) as the first vector in our basis for E2−1(A).
We are only up to two linearly independent vectors, so we need to keep going by computing a basis for E3−1(A). But if you compute (−I−A)3 you will find that it is the zero matrix. What does this mean? Every vector in R3 is in the null space of the zero matrix, so we have E3−1(A)=R3.
However, we don't want to choose just any basis for R3, as we need to maintain independence from the basis vectors for E2−1(A) that we already have. That is, we need to choose a vector in R3 that is not already in the span of our existing two generalized eigenvectors (Proposition 18.5.6). But since dimE2−1(A)=2, we know that it is not possible for all three of the standard basis vectors for R3 to be in E2−1(A), and so we can just choose any of them that is not. We will choose the third standard basis vector.
We now have our column vectors for a suitable transition matrix P:
Finally, let's determine the form matrix P−1AP. We already know that Ap1=−p1, since p1 is an eigenvector of A corresponding to the eigenvalue λ=−1. Next, compute (A−(−1)I)p2 and you will find that it is equal to p1. Thus, the entry above the diagonal in the second column must be 1. Lastly, compute
Thus, the entries above the diagonal in the third column are 2, −1. Putting all this together yields
Example 29.5.2. Scalar-triangularization procedure: a larger matrix.
Is matrix
similar to some upper triangular matrix?
Again, we start by investigating eigenvalues. If you compute the characteristic polynomial for A, you will find that it factors as cA(λ)=(λ−3)5, so that A has a single eigenvalue 3 of multiplicity 5. So from our analysis in Subsection 29.4.3, we are confident that A can be made similar to a scalar triangular matrix.
Next, compute a basis for the eigenspace E3(A).
We need five vectors for the columns of the transition matrix P, so this is not enough.
Next, compute a basis for E23(A).
The above spanning vectors are the ones arrived at from row reducing (3I−A)2. But remember that we want to use our already obtained vectors from E3(A), so we just need to choose two of these four that are independent from our eigenvectors. Those first two standard basis vectors will work, so take
Still not enough vectors, but (3I−A)3=0, so we can choose any vector in R5 that is not in the span of the four we already have. The third standard basis vector for R5 will work, and we now have
Now place these matrices in the transition matrix
To determine the form matrix, we can reduce [PAP] as
obtaining