06.09.2021 Views

College Algebra, 2013a

College Algebra, 2013a

College Algebra, 2013a

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.

620 Systems of Equations and Matrices<br />

2. To use Cramer’s Rule to find z, weidentifyx 3 as z. Wehave<br />

⎡<br />

A = ⎣<br />

2 −3 1<br />

1 −1 1<br />

3 0 −4<br />

⎤<br />

⎡<br />

⎦ X = ⎣<br />

x<br />

y<br />

z<br />

⎤<br />

⎡<br />

⎦ B = ⎣<br />

−1<br />

1<br />

0<br />

⎤<br />

⎡<br />

⎦ A 3 = A z = ⎣<br />

2 −3 −1<br />

1 −1 1<br />

3 0 0<br />

⎤<br />

⎦<br />

Expanding both det(A) and det (A z ) along the third rows (to take advantage of the 0’s) gives<br />

z = det (A z)<br />

det(A) = −12<br />

−10 = 6 5<br />

The reader is encouraged to solve this system for x and y similarly and check the answer.<br />

Our last application of determinants is to develop an alternative method for finding the inverse of<br />

a matrix. 5 Let us consider the 3 × 3 matrix A which we so extensively studied in Section 8.5.1<br />

⎡<br />

A = ⎣<br />

3 1 2<br />

0 −1 5<br />

2 1 4<br />

We found through a variety of methods that det(A) =−13. To our surprise and delight, its inverse<br />

below has a remarkable number of 13’s in the denominators of its entries. This is no coincidence.<br />

⎡<br />

A −1 ⎢<br />

= ⎣<br />

9<br />

13<br />

− 10<br />

13<br />

− 8<br />

13<br />

− 2<br />

13<br />

⎤<br />

⎦<br />

2<br />

13<br />

− 7<br />

13<br />

15<br />

Recall that to find A −1 , we are essentially solving the matrix equation AX = I 3 ,whereX =[x ij ] 3×3<br />

is a 3 × 3 matrix. Because of how matrix multiplication is defined, the first column of I 3 is the<br />

product of A with the first column of X, the second column of I 3 is the product of A with the<br />

second column of X andthethirdcolumnofI 3 is the product of A with the third column of X. In<br />

other words, we are solving three equations 6<br />

⎡<br />

A ⎣<br />

x 11<br />

x 21<br />

x 31<br />

⎤<br />

⎡<br />

⎦ = ⎣<br />

1<br />

0<br />

0<br />

⎤<br />

⎦<br />

⎡<br />

A ⎣<br />

x 12<br />

x 22<br />

x 32<br />

⎤<br />

1<br />

13<br />

⎡<br />

⎦ = ⎣<br />

0<br />

1<br />

0<br />

13<br />

3<br />

13<br />

⎤<br />

⎦<br />

⎤<br />

⎥<br />

⎦<br />

⎡<br />

A ⎣<br />

x 13<br />

x 23<br />

x 33<br />

⎤<br />

⎡<br />

⎦ = ⎣<br />

We can solve each of these systems using Cramer’s Rule. Focusing on the first system, we have<br />

⎡<br />

1 1<br />

⎤<br />

2<br />

⎡<br />

3 1<br />

⎤<br />

2<br />

⎡<br />

3 1<br />

⎤<br />

1<br />

A 1 = ⎣ 0 −1 5 ⎦ A 2 = ⎣ 0 0 5 ⎦ A 3 = ⎣ 0 −1 0 ⎦<br />

0 1 4<br />

2 0 4<br />

2 1 0<br />

5 We are developing a method in the forthcoming discussion. As with the discussion in Section 8.4 when we<br />

developed the first algorithm to find matrix inverses, we ask that you indulge us.<br />

6 The reader is encouraged to stop and think this through.<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!