Proving Equal Ranks in Linear Maps: The Case of T^2 = TT and T(V) = V

mathmathmad
Messages
50
Reaction score
0

Homework Statement


let T(V)=V be a linear map, where V is a finite-dimensional vector space. Then T^2 is defined to be the composite TT of T with itself, and similarly T^(i+1) = TT^i for all i >=1. Suppose Rank (T) = Rank (T^2)


Homework Equations



a) prove that Im(T) = Im(T^2)

b) for i>=1, let U_i(Im(T))=Im(T) be definied as the restriction of T^i to the subspace Im(T) of V. Show that U_i is nonsingular for all i

c) Deduce that Rank (T) = Rank (T^i) for all i >= 1

The Attempt at a Solution



a) since Rank (T) = Rank (T^2), then
dim( Im(T) ) = dim ( Im(T^2) )
since I am (T) = V and TT(V) = T(V) = V = Im(T^2)
so Im(T) = I am (T^2) because V=V
-does that make sense?-

b) U_i (Im(T)) = Im(T)
so U_i (V) = V
since V is mapped to itself, U_i has to be an identity matrix
and identity matrix has an inverse because its determinant is not zero,
so U_i is nonsingular
-does that make sense?-

c) since T is a linear map that V to itself, T^i (V) = V for all i>=1,
implies that image would be the same
hence dimension of image is the same
so the Rank (T) = Rank (T^i) for all i>=1
-again, does that make sense?-
 
Physics news on Phys.org
b) Just because T(V)=V does not mean T is the identity. It doesn't mean "Tv=v for all v in V". It just means it's a surjective map. However, you can conclude that T is invertible.

c) Right idea, but you should probably use induction explicitly.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top