Math

Fall 2012 Solutions to Assignment 4

Linear Maps
4. Suppose that T is a linear map from V to F . Prove that if u V is not in null T , then V = nullT {au : a F } Proof: Let x V such that x null(T) span(u). Since x span(u), There exist (F ) such that x = u; since x null(T ), therefore T(x) = 0. Combine both equations to obtain T (u) = 0. Since T is linear we get T (u) = 0. Since by assumption, u is not in the null(T), therefore T(u)= 0. So = 0, Therefore x = 0 and null(T) span(u) = 0 . 5. Suppose That T L(V, W ) is injective and (v1 , . . . , vn ) is linearly independent in V . Prove that (T v1 , . . . , T vn ) is linearly independent in W .
n n n

Proof: Let
j=1 n

aj Tvj = 0 Then T(
j=1

aj vj ) =
j=1

aj Tvj = 0 Since T is injective, this

implies
j=1

aj vj = 0 Since (v1 , . . . , vn ) is linearly independent in V then all the aj are

0. Thus (T v1 , . . . , T vn ) is linearly independent in W . 7. Prove that if (v1 , . . . , vn ) spans V and T L(V, W ) is surjective, then (T v1 , . . . , T vn ) spans W . Proof: Suppose w W . Since T is surjective there is a v V with T v = w. Since (v1 , . . . , vn ) spans V we write v as v = 1 v1 + . . . + n vn .Then W = T v = 1 T v1 + . . . + n T vn , and (T v1 , . . . , T vn ) spans W . 9. Prove that if T is a linear map from F 4 to F 2 such that nullT = {(x1 , x2 , x3 , x4 ) F 4 : x1 = 5x2 and x3 = 7x4 }, Then T is surjective. Proof: Null T = {(x1 , x2 , x3 , x4 ) F 4 : x1 = 5x2 and x3 = 7x4 } = {(5x2 , x2 , 7x4 , x4 ) : x2 , x4 F } = {x2 (5, 1, 0, 0) + x4 (0, 0, 7, 1) : x2 , x4 F } = span((5, 1, 0, 0), (0, 0, 7, 1)). By theorem 3.4 dim V = dim nullT + dim range T . Since ((5, 1, 0, 0), (0, 0, 7, 1)) is a basis of null T and dim null T is = 2 and the dim of F 4 = 4 the range of T = 2. Therefore T is surjective. 1

10. Prove that there does not exist a linear map from F 5 to F 2 whose null space equals. {(x1 , x2 , x3 , x4 , x5 ) F 5 : x1 = 3x2 and x3 = x4 = x5 } Proof: Proof by contradiction. Let there exists a linear map T : F 5 F 2 , and that the null(T) = U. By theorem 3.4 we would obtain dim(F 5 ) = dim(N ull(T )) + dim(range(T )) 5 = 2 + dim(range(T )) 3 = dim(range(T )) dim(F 2 ) = 2 which gives us a contradiction. 17. Prove that the distributive property holds for matrix addition and matrix multiplication. in other words, suppose A, B, and C are matrices whose sizes are such that A(B + C) makes sense. Prove that AB + AC makes sense and that A(B + C) = AB + AC. Proof: 18. Prove that matrix multiplication is associative. In other words, suppose A, B, and C are matrices whose sizes are such that (AB)C makes sense. Prove that A(BC) makes sense and that (AB)C = A(BC). Proof: 19. Suppose T L(F n , F m ) and that a1,1 . M(T ) = . . . . . a1,n . . .

am,1 . . . am,n Where we are using the standard bases. Prove that T (x1 , . . . , xn ) = (a1,1 x1 + + a1,n xn , . . . am,1 x1 + + am,n xn ) for every (x1 , . . . , xn ) F n Proof: 21. Prove that every linear map form Mat(n,1,F ) to Mat(m, 1,F ) is given by a matrix multiplication. In other words, prove that if T L(M at(n, 1, F ), M at(m, 1, F )), then there exists an m-by-n matrix A such that TB = AB for every B M at(n, 1, F ). Proof: Let (1 , . . . , n ) be a standard basis for M at(n, 1, F ) and ((1 , . . . , m ) be a standard basis for M at(M, 1, F ) If T : M at(N, 1, F ) M at(M, 1, F ) is a linear map, then it has a matrix M(T) with respect to these basis. Multiplication by a matrix is a linear map and T En = M(T )En , n = 1, . . . , N. Since T and multiplication by M(T ) are linear maps with similar basis, they are the same, T B = M(T )B, F orallB M at(N, 1, F ) 2

20. Suppose (v1 , . . . , vn ) is a basis of V. Prove that the function T : V M at(n, 1, F ) dene by T v = M (v) is an invertible linear map of V onto M at(n, 1, F ); here M (v) is the matrix of v V with respect to the basis (v1 , . . . , vn ). Proof: Since V is nite dim of dim(n) and its basis contains n vectors v1 , . . . , vn and the function dened form V to M is onto, so T will be invertible if T is one to one. We need to show that T is injective. Let and be two vectors in V . We obtain to linear combinations of vectors of basis of V = a1 v1 + . . . + an vn = b1 v1 + + bn vn Let T () = T () We then have T( = a1 v1 + . . . + an vn ) = T( = b1 v1 + + bn vn ) or M( = a1 v1 + . . . + an vn )= M( = b1 v1 + + bn vn ). We then obtain a1 M v 1 + . . . + an M v n = b 1 M v 1 + . . . + b n M v n or (a1 b1 )M v1 + . . . + (an bn )M vn = 0 Since M v1 , . . . , M vn are linearly independent as are v1 , . . . , vn are linearly independent we obtain, a1 b1 = 0andan bn = 0 which gives a1 = b1 and an = bn there fore = which implies that if T () = T () then = and T is injective and therefore T is invertible. 22. Suppose that V is nite dimensional and S, T L(V ). Prove that ST is invertible if and only if both S and T are invertible. Proof: Suppose S and T are invertible. Then S and T are both injective and surjective, and ST is injective and Surjective. Thus ST is invertible. Suppose ST is invertible and since nullT nullST = {0}, T is injective. Also since ST is invertible, it is surjective. For any w V there exists a v V such that (ST)v = w. Rewrite this as S(T v) = w which shows that S is surjective and S is invertible. 23. Suppose that V is nite dimensional and S, T L(V ). Prove that ST = I if and only if TS = 1. Proof: Suppose that ST = I. The identity map I is invertible, and therefore S and T are invertible. Multiply ST = I on the right by T 1 to get S = T 1 We then have T T 1 = T S = I as required. 26. Suppose n is a positive integer and ai,j F for i, j = 1, . . . , n. Prove that the following are equivalent: (a) The trivial solution x1 = = xn = 0 is the only solution to the homogeneouos system of the equations
n

a1,k xk = 0
k=1

. . .
n

an,k xk = 0.
k=1

(b) For every c1 , . . . , cn F , there exists a solution to the system of equations

n

a1,k xk = c1
k=1

. . .
n

an,k xk = cn .
k=1

clS = S bdS Solution: (a) (b)