Linear Algebra Exercises-n-Answers.pdf
Linear Algebra Exercises-n-Answers.pdf
Linear Algebra Exercises-n-Answers.pdf
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
204 <strong>Linear</strong> <strong>Algebra</strong>, by Hefferon<br />
Five.IV.2.20 For each, because many choices of basis are possible, many other answers are possible.<br />
Of course, the calculation to check if an answer gives that P T P −1 is in Jordan form is the arbiter of<br />
what’s correct.<br />
(a) Here is the arrow diagram.<br />
C 3 t<br />
w.r.t. E 3<br />
−−−−→ C 3 w.r.t. E T 3<br />
⏐<br />
⏐<br />
id↓P<br />
id↓P<br />
C 3 t<br />
w.r.t. B −−−−→ C 3 w.r.t. B<br />
J<br />
The matrix to move from the lower left to the upper left is this.<br />
⎛<br />
P −1 = ( Rep ) −1<br />
E3,B(id) = RepB,E3 (id) = ⎝ 1 −2 0<br />
⎞<br />
1 0 1⎠<br />
−2 0 0<br />
The matrix P to move from the upper right to the lower right is the inverse of P −1 .<br />
(b) We want this matrix and its inverse.<br />
⎛<br />
P −1 = ⎝ 1 0 3<br />
⎞<br />
0 1 4⎠<br />
0 −2 0<br />
(c) The concatenation of these bases for the generalized null spaces will do for the basis for the entire<br />
space.<br />
⎛ ⎞ ⎛ ⎞<br />
⎛ ⎞ ⎛ ⎞ ⎛ ⎞<br />
−1 −1<br />
1 0 −1<br />
0<br />
B −1 = 〈<br />
⎜ 0<br />
⎟<br />
⎝ 1 ⎠ , 0<br />
⎜−1<br />
⎟<br />
⎝ 0 ⎠ 〉 B 1<br />
3 = 〈<br />
⎜−1<br />
⎟<br />
⎝ 0 ⎠ , 0<br />
⎜ 0<br />
⎟<br />
⎝−2⎠ , −1<br />
⎜ 1<br />
⎟<br />
⎝ 2 ⎠ 〉<br />
0 1<br />
0 2 0<br />
The change of basis matrices are this one<br />
⎛<br />
and its inverse.<br />
⎞<br />
−1 −1 1 0 −1<br />
0 0 1 0 −1<br />
P −1 =<br />
⎜ 0 −1 −1 0 1<br />
⎟<br />
⎝ 1 0 0 −2 2 ⎠<br />
0 1 0 2 0<br />
Five.IV.2.21 The general procedure is to factor the characteristic polynomial c(x) = (x − λ 1 ) p 1<br />
(x −<br />
λ 2 ) p2 · · · to get the eigenvalues λ 1 , λ 2 , etc. Then, for each λ i we find a string basis for the action of the<br />
transformation t − λ i when restricted to N ∞ (t − λ i ), by computing the powers of the matrix T − λ i I<br />
and finding the associated null spaces, until these null spaces settle down (do not change), at which<br />
point we have the generalized null space. The dimensions of those null spaces (the nullities) tell us<br />
the action of t − λ i on a string basis for the generalized null space, and so we can write the pattern of<br />
subdiagonal ones to have N λi . From this matrix, the Jordan block J λi associated with λ i is immediate<br />
J λi = N λi + λ i I. Finally, after we have done this for each eigenvalue, we put them together into the<br />
canonical form.<br />
(a) The characteristic polynomial of this matrix is c(x) = (−10 − x)(10 − x) + 100 = x 2 , so it has<br />
only the single eigenvalue λ = 0.<br />
power p (T + 0 · I) p N ((t − 0) p ) nullity<br />
( ) ( )<br />
−10 4 2y/5 ∣∣<br />
1<br />
{ y ∈ C} 1<br />
−25<br />
(<br />
10<br />
)<br />
y<br />
0 0<br />
2<br />
C 2 2<br />
0 0<br />
(Thus, this transformation is nilpotent: N ∞ (t − 0) is the entire space). From the nullities we know<br />
that t’s action on a string basis is β ⃗ 1 ↦→ β ⃗ 2 ↦→ ⃗0. This is the canonical form matrix for the action of<br />
t − 0 on N ∞ (t − 0) = C 2 ( )<br />
0 0<br />
N 0 =<br />
1 0<br />
and this is the Jordan form of the matrix.<br />
( )<br />
0 0<br />
J 0 = N 0 + 0 · I =<br />
1 0