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.

5.2. The Matrix of a L<strong>in</strong>ear Transformation I 271<br />

[ 4<br />

Therefore<br />

4<br />

]<br />

is the first column of A.<br />

Comput<strong>in</strong>g the second column is done <strong>in</strong> the same way, and is left as an exercise.<br />

The result<strong>in</strong>g matrix A is given by [ ] 4 −3<br />

A =<br />

4 −2<br />

♠<br />

This example illustrates a very long procedure for f<strong>in</strong>d<strong>in</strong>g the matrix of A. While this method is reliable<br />

and will always result <strong>in</strong> the correct matrix A, the follow<strong>in</strong>g procedure provides an alternative method.<br />

Procedure 5.10: F<strong>in</strong>d<strong>in</strong>g the Matrix of Inconveniently Def<strong>in</strong>ed L<strong>in</strong>ear Transformation<br />

Suppose T : R n → R m is a l<strong>in</strong>ear transformation. Suppose there exist vectors {⃗a 1 ,···,⃗a n } <strong>in</strong> R n<br />

such that [ ⃗a 1 ··· ⃗a n<br />

] −1 exists, and<br />

T (⃗a i )= ⃗ b i<br />

Then the matrix of T must be of the form<br />

[ ⃗b1 ··· ⃗ bn<br />

][<br />

⃗a1 ··· ⃗a n<br />

] −1<br />

We will illustrate this procedure <strong>in</strong> the follow<strong>in</strong>g example. You may also f<strong>in</strong>d it useful to work through<br />

Example 5.9 us<strong>in</strong>g this procedure.<br />

Example 5.11: Matrix of a L<strong>in</strong>ear Transformation<br />

Given Inconveniently<br />

Suppose T : R 3 → R 3 is a l<strong>in</strong>ear transformation and<br />

⎡ ⎤ ⎡ ⎤ ⎡ ⎤ ⎡<br />

1 0 0 2<br />

T ⎣ 3 ⎦ = ⎣ 1 ⎦,T ⎣ 1 ⎦ = ⎣ 1<br />

1 1 1 3<br />

F<strong>in</strong>d the matrix of this l<strong>in</strong>ear transformation.<br />

Solution. By Procedure 5.10, A = ⎣<br />

⎡<br />

1 0 1<br />

3 1 1<br />

1 1 0<br />

⎤<br />

⎦<br />

−1<br />

⎤<br />

and B = ⎣<br />

⎡<br />

⎦,T ⎣<br />

⎡<br />

1<br />

1<br />

0<br />

⎤<br />

0 2 0<br />

1 1 0<br />

1 3 1<br />

Then, Procedure 5.10 claims that the matrix of T is<br />

⎡<br />

2 −2<br />

⎤<br />

4<br />

C = BA −1 = ⎣ 0 0 1 ⎦<br />

4 −3 6<br />

Indeed you can first verify that T (⃗x)=C⃗x for the 3 vectors above:<br />

⎡<br />

⎦ = ⎣<br />

⎤<br />

⎦<br />

0<br />

0<br />

1<br />

⎤<br />

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

Saved successfully!

Ooh no, something went wrong!