06.09.2021 Views

A First Course in Linear Algebra, 2017a

A First Course in Linear Algebra, 2017a

A First Course in Linear Algebra, 2017a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

508 Vector Spaces<br />

there would exist ⃗w /∈ span{T (⃗v 1 ),···,T (⃗v n )} and it follows that {T (⃗v 1 ),···,T (⃗v n ),⃗w} would be l<strong>in</strong>early<br />

<strong>in</strong>dependent which is impossible because there exists a basis for W of n vectors. Hence<br />

span{T (⃗v 1 ),···,T (⃗v n )} = W<br />

and so {T (⃗v 1 ),···,T (⃗v n )} is a basis. Hence, if ⃗w ∈ W, there exist scalars c i such that<br />

⃗w =<br />

n<br />

∑<br />

i=1<br />

c i T (⃗v i )=T<br />

( n∑<br />

i=1c i ⃗v i<br />

)<br />

show<strong>in</strong>g that T is onto. This shows that 1. ⇒ 2.<br />

Next consider the claim that 2. ⇒ 3. S<strong>in</strong>ce 2. holds, it follows that T is onto. It rema<strong>in</strong>s to verify that<br />

T is one to one. S<strong>in</strong>ce T is onto, there exists a basis of the form {T (⃗v i ),···,T (⃗v n )}. If{⃗v 1 ,···,⃗v n } is<br />

l<strong>in</strong>early <strong>in</strong>dependent, then this set of vectors must also be a basis for V because if not, there would exist<br />

⃗u /∈ span{⃗v 1 ,···,⃗v n } so {⃗v 1 ,···,⃗v n ,⃗u} would be a l<strong>in</strong>early <strong>in</strong>dependent set which is impossible because by<br />

assumption, there exists a basis which has n vectors. So why is{⃗v 1 ,···,⃗v n } l<strong>in</strong>early <strong>in</strong>dependent? Suppose<br />

Then<br />

n<br />

∑<br />

i=1<br />

n<br />

∑<br />

i=1<br />

c i ⃗v i =⃗0<br />

c i T⃗v i =⃗0<br />

Hence each c i = 0 and so, as just discussed, {⃗v 1 ,···,⃗v n } is a basis for V. Now it follows that a typical<br />

vector <strong>in</strong> V is of the form ∑ n i=1 c i⃗v i .IfT (∑ n i=1 c i⃗v i )=⃗0, it follows that<br />

n<br />

∑<br />

i=1<br />

c i T (⃗v i )=⃗0<br />

and so, s<strong>in</strong>ce {T (⃗v i ),···,T (⃗v n )} is <strong>in</strong>dependent, it follows each c i = 0 and hence ∑ n i=1 c i⃗v i =⃗0. Thus T is<br />

one to one as well as onto and so it is an isomorphism.<br />

If T is an isomorphism, it is both one to one and onto by def<strong>in</strong>ition so 3. implies both 1. and 2. ♠<br />

Note the <strong>in</strong>terest<strong>in</strong>g way of def<strong>in</strong><strong>in</strong>g a l<strong>in</strong>ear transformation <strong>in</strong> the first part of the argument by describ<strong>in</strong>g<br />

what it does to a basis and then “extend<strong>in</strong>g it l<strong>in</strong>early”.<br />

Consider the follow<strong>in</strong>g example.<br />

Example 9.76:<br />

Let V = R 3 and let W denote the polynomials of degree at most 2. Show that these two vector<br />

spaces are isomorphic.<br />

Solution. <strong>First</strong>, observe that a basis for W is { 1,x,x 2} and a basis for V is {⃗e 1 ,⃗e 2 ,⃗e 3 }. S<strong>in</strong>ce these two<br />

have the same dimension, the two are isomorphic. An example of an isomorphism is this:<br />

T (⃗e 1 )=1,T (⃗e 2 )=x,T (⃗e 3 )=x 2<br />

and extend T l<strong>in</strong>early as <strong>in</strong> the above proof. Thus<br />

T (a,b,c)=a + bx + cx 2<br />

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!