Cramer's Rule
Today we'll use matrices to derive Cramer's Rule, a rule by which we can
solve systems of equations by just plugging in numbers. (Cramer's Rule
works for
matrices but we'll use the
case only.)
Let's start with a generic system of two linear equations in two
unknowns:
|
(1) |
Now let ; ; .
We can see that the equation
is equivalent to the system (1):
Finding a solution means finding values for
and that make it true, or in the language
of matrices, finding a value for that
makes it true. Well, we already have a single (matrix) equation
involving :
How do we solve it? If we were solving a simple equation about numbers,
we could divide both sides by , or
equivalently, multiply both sides by .
With matrices, we can do almost the same thing: multiply both sides by
:
|
(2) |
And, just like, say, ,
it is also true that
so .
Thus we can simplify equation (2) thus:
This tells us our solution! Because we learned recently that , we can work out
the matrix multiplication:
This (4) is Cramer's Rule.
Example
Solve the system
Solution (using Cramer's Rule):
Now we should check that we have a solution. We can either plug into the
system or into the matrix form. Let's try the latter.
Whew. Let's try one more: Solve the system
So let ; ; , and we wish to
solve .
Cramer's Rule says
Let's check: . Whew again.