06.09.2021 Views

Fundamentals of Matrix Algebra, 2011a

Fundamentals of Matrix Algebra, 2011a

Fundamentals of Matrix Algebra, 2011a

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.

Chapter 2<br />

<strong>Matrix</strong> Arithmec<br />

We have a soluon, so<br />

⎡<br />

⎤<br />

0.5 0.5 0<br />

A = ⎣ 0.2 −0.4 0.2 ⎦ .<br />

−0.3 0.1 0.2<br />

Mulply AA −1 to verify that it is indeed the inverse <strong>of</strong> A. .<br />

In general, given a matrix A, to find A −1 we need to form the augmented matrix<br />

[ A I<br />

]<br />

and put it into reduced row echelon form and interpret the result. In the case<br />

<strong>of</strong> a 2 × 2 matrix, though, there is a shortcut. We give the shortcut in terms <strong>of</strong> a<br />

theorem. 18<br />

.<br />

Ṫheorem 7<br />

The Inverse <strong>of</strong> a 2×2 <strong>Matrix</strong><br />

Let<br />

[ a b<br />

A =<br />

c d<br />

.<br />

]<br />

.<br />

A is inverble if and only if ad − bc ≠ 0.<br />

If ad − bc ≠ 0, then<br />

A −1 =<br />

1<br />

ad − bc<br />

[ d −b<br />

−c a<br />

]<br />

.<br />

We can’t divide by 0, so if ad − bc = 0, we don’t have an inverse. Recall Example<br />

54, where<br />

[ ] 1 2<br />

A = .<br />

2 4<br />

Here, ad − bc = 1(4) − 2(2) = 0, which is why A didn’t have an inverse.<br />

Although this idea is simple, we should pracce it.<br />

. Example 56 .Use Theorem 7 to find the inverse <strong>of</strong><br />

if it exists.<br />

A =<br />

[ 3<br />

] 2<br />

−1 9<br />

18 We don’t prove this theorem here, but it really isn’t hard to do. Put the matrix<br />

[ a b 1<br />

] 0<br />

c d 0 1<br />

108<br />

into reduced row echelon form and you’ll discover the result <strong>of</strong> the theorem. Alternavely, mulply A by<br />

what we propose is the inverse and see that we indeed get I.

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

Saved successfully!

Ooh no, something went wrong!