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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

312 L<strong>in</strong>ear Transformations<br />

Theorem 5.58: C B is a L<strong>in</strong>ear Transformation<br />

For any basis B of R n , the coord<strong>in</strong>ate function<br />

C B : R n → R n<br />

is a l<strong>in</strong>ear transformation, and moreover an isomorphism.<br />

We now discuss the ma<strong>in</strong> result of this section, that is how to represent a l<strong>in</strong>ear transformation with<br />

respect to different bases.<br />

Theorem 5.59: The Matrix of a L<strong>in</strong>ear Transformation<br />

Let T : R n ↦→ R m be a l<strong>in</strong>ear transformation, and let B 1 and B 2 be bases of R n and R m respectively.<br />

Then the follow<strong>in</strong>g holds<br />

C B2 T = M B2 B 1<br />

C B1 (5.5)<br />

where M B2 B 1<br />

is a unique m × n matrix.<br />

If the basis B 1 is given by B 1 = {⃗v 1 ,···,⃗v n } <strong>in</strong> this order, then<br />

M B2 B 1<br />

=[C B2 (T (⃗v 1 )) C B2 (T (⃗v 2 )) ···C B2 (T (⃗v n ))]<br />

Proof. The above equation 5.5 can be represented by the follow<strong>in</strong>g diagram.<br />

T<br />

R n → R m<br />

C B1 ↓ ◦ ↓C B2<br />

R n → R m<br />

M B2 B 1<br />

S<strong>in</strong>ce C B1 is an isomorphism, then the matrix we are look<strong>in</strong>g for is the matrix of the l<strong>in</strong>ear transformation<br />

C B2 TCB −1<br />

1<br />

: R n ↦→ R m .<br />

By Theorem 5.6, the columns are given by the image of the standard basis {⃗e 1 ,⃗e 2 ,···,⃗e n }. But s<strong>in</strong>ce<br />

CB −1<br />

1<br />

(⃗e i )=⃗v i , we readily obta<strong>in</strong> that<br />

[<br />

]<br />

M B2 B 1<br />

= C B2 TCB −1<br />

1<br />

(⃗e 1 ) C B2 TCB −1<br />

1<br />

(⃗2 2 ) ··· C B2 TCB −1<br />

1<br />

(⃗e n )<br />

=[C B2 (T (⃗v 1 )) C B2 (T (⃗v 2 )) ··· C B2 (T(⃗v n ))]<br />

and this completes the proof.<br />

♠<br />

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

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

Saved successfully!

Ooh no, something went wrong!