Abstract Linear Algebra, Fall 2011 - Problems II

Please turn in by Thur. Sept. 22 1. Suppose v1 , . . . , vn is a basis of a vector space V . Show that v1 , v1 +v2 , . . . , v1 +v2 + +vn is also a basis of V . 2. Let V be an n-dimensional vector space and suppose the vectors v1 , . . . , vn generate (or span) V . Show that v1 , . . . , vn is a basis of V . 3. Let A = (aij ) be an n n matrix over a eld F . Dene tr(A), the trace of A, to be the sum of the diagonal elements of A:
n

tr(A) =
i=1

aii .

a. Show that A tr(A) : Mn (F ) F is a linear map. b. Let B be an m n matrix and C be an n m matrix (both over F ). Show that tr(BC) = tr(CB). c. Show that, for any invertible n n matrix B (over F ), tr(BAB 1 ) = tr(A). 4. Let v1 , . . . , vm and w1 , . . . , wn be bases of a vector space V (over a eld F ). We know from class that m = n (the number of vectors in a basis of V is uniquely determined). This problem outlines another way to see this (at least for certain elds F ). Writing the vectors in each basis as linear combinations of vectors in the other, we see that there are scalars ij and kl such that
n m

vi =
j=1

ij wj ,

wk =
l=1

kl vl .

Put A = (ij ), B = (kl ) (so A is an m n matrix over F and B is an n m matrix over F ). a. Show that AB = Im and BA = In . b. Suppose F contains Q. Use 3b to show that m = n. [In a previous life, you probably encountered the notion of the row echelon form of a matrix. You can use this to see that m = n without the assumption that F contains Q.] 5. Consider the real vector space S of all innite sequences of real numbers (under componentwise operations). We write the elements of S as innite tuples (0 , 1 , 2 , . . .) or sometimes as (n ) or simply (n ). n=1 a. Show that S is innite-dimensional. b. Give an example of a proper subspace of S that is again innite-dimensional. c. Let F denote the set of sequences (n ) in S such that n = n1 + n2 , for all n 2. Put 1 5 1+ 5 , 2 = . 1 = 2 2

2 n n We saw in class that w1 = (1 ) and w2 = (2 ) form a basis of the subspace F of S. Consider the Lucas sequence l = (ln ) given by

l0 = 2, l1 = 1, ln = ln1 + ln2 (n 2). Show that l = w1 + w2 in F and deduce that

n n ln = 1 + 2 (n 0).