Exercise 7.1.7

Answers

1.
If Uk(x) = 0, then Uk+1(x) = Uk(U(x)) = 0.
2.
We know Um+1(V ) = Um(U(V )) Um(V ). With the assumption rank (Um) = rank (Um+1), we know that
Um+1(V ) = Um(V ).

This means

U(Um(V )) = Um(V )

and so Uk(V ) = Um(V ) for all integer k m.

3.
The assumption rank (Um) = rank (Um+1) implies
null (Um) = null (Um+1)

by Dimension Theorem. This means N(Um) = N(Um+1) by the previous argument. If Um+2(x) = 0, then U(x) is an element in N(Um+1) = N(Um). Hence we have Um(U(x)) = 0 and thus x is an element in N(Um+1). This means that N(Um+2) N(Um+1) and so they are actually the same. Doing this inductively, we know that N(Um) = N(Uk) for all integer k m.

4.
By the definition of Kλ, we know
Kλ = p1N((T λI)p).

But by the previous argument we know that

N((T λI)m) = N((T λI)k)

for all integer k m and the set is increasing as k increases. So actually Kλ is N((T λI)m).

5.
Since the characteristic polynomial splits, the transformation T is diagonalizable if and only if Kλ = Eλ. By the previous argument, we know that
Kλ = N(T λI) = Eλ.
6.
If λ is an eigenvalue of TW, then λ is also an eigenvalue of T by Theorem 5.21. Since T is diagonalizable, we have the condition
rank (T λI) = rank ((T λI)2)

and so

N(T λI) = N((T λI)2)

by the previous arguments. This implies

N(TW λIW) = N((TW λIW)2).

By Dimension Theorem, we get that

rank (TW λIW) = rank ((TW λIW)2).

So TW is diagonalizable.

User profile picture
2011-06-27 00:00
Comments