Notes 15

What The Rank+Nullity Theorem Tells us

When we rst discussed linear transformations we really only thought of them as functions. Then we saw that T (V ) and Ker(T ) were subspaces. Then the Rank+Nullity Theorem gave us an idea of the size of these subspaces. Lets look at what else this says: First lets see how to compare Rank(T ) with Dim(W ). Proposition 10: Let V be a vectors space that is nite dimensional. Let W be a subspace of V . Then W is nite dimensional and Dim(W ) Dim(V ) . Also if Dim(W ) = Dim(V ) then V = W . Proof: Suppose Dim(V ) = n. Let S be a basis for V . If W = {0}, then Dim(W ) = 0 n = Dim(V ). So now suppose W = {0}, then there is some w1 W such that w1 = 0. The set L = {w1 } is then linearly independent(only one non-zero element). Now continue to add vectors w2 , w3 , ... , wm W to L so that the set L = {w1 , w2 , ... , wm } remains linearly independent. This process must stop because the Replacement Theorem says if S has n elements then any linearly independent set L that has m elements has m n. So we cant choose any more than m elements for W and have L still be linearly independent. So lets suppose L = {w1 , w2 , .., wk } is the largest linearly independent set. First k n and being the largest says if v V and v is not an element of L, then L {v } is linearly independent. By Theorem 3, L{v } is linearly dependent v Span(L). Therefore L is a (linearly independent) spanning set, thus L is a basis for W . Therefore Dim(W ) = k n = Dim(V ). Now lets suppose Dim(W ) = Dim(V ). Let BW = {w1 , w2 , ... , wn } and BV = {v1 , v2 , ... , vn } be bases for W and V , respectively. Let S = BV and L = BW , by the Replacement Theorem, RS S with n n = 0 elements such that V = Span(L RS ) = Span(BW ) = W, since L = BW and RS = . Now very surprisingly, if V and W are vector spaces such that Dim(W ) = Dim(V ) If T : V W is linear, injective and surjective are equivalent. This never happens!

Theorem 7: Suppose V and W are nite dimensional and Dim(W ) = Dim(V ). If T is linear, then the following are equivalent: (a)T is injective, (b)T is surjective, (c)Rank (T ) = Dim(V ). Proof: To prove this theorem we need to prove (a) (c) (b). Now you prove (a) (c) on TakeHome 4. So whats left to prove is (c) (b). ((b) (c)) Assume T is surjective T (V ) = W so Dim(T (V )) = Dim(W ) but by assumption Dim(V ) = Dim(W ) so Dim(T (V )) = Dim(V ) that is, Rank (T ) = Dim(V ). ((c) (b)) Assume Rank (T ) = Dim(V ). By assumption, Dim(V ) = Dim(W ) so Rank (T ) = Dim(W ) that is, Dim(T (V )) = Dim(W ) By Proposition 10 T (V ) = W So T is surjective.

What does the Rank+Nullity Theorem say if T is invertible? Proposition 11: Let V and W be nite dimensional vector spaces and suppose T : V W is invertible. Then Dim(V ) = Dim(W ). Proof: If T is invertible, by exercise 18, T is bijective, that is injective and surjective. Because T is injective, Ker(T ) = {0} so N ull(T ) = 0. Because T is surjective Rank (T ) = Dim(T (V )) = Dim(W ). By the Rank+Nullity Theorem Dim(V ) = Rank (T ) + N ull(T ) = Dim(W ) + 0 = Dim(W )

Theorem 8: Let V and W be nite dimensional vector space. Then V = W Dim(V ) = Dim(W ). Proof: () Suppose V = W , then there is an isomorphism T : V W . In particular, T is invertible, so by Proposition 11, Dim(V ) = Dim(W ).

 Now assume Dim(V ) = Dim(W ). Let BV = {v1 , v2 , ... , vn } and BW = {w1 , w2 , ... , wn } be bases for V and W , respectively. By Lemma 3, there is a unique linear transformation T : V W such that T (vi ) = wi i = 1, 2, ... , n. By Proposition 9, T (V ) = Span({T (v1 ), T (v2 ), ... , T (vn )}) = Span({w1 , w2 , ... , wn }) = W. So T is surjective. But now since Dim(V ) = Dim(W ), by Theorem 7, T is injective so T is bijective, so T is invertible, so T is an isomorphism, so V = W.