Overview
Cramer's Rule is a determinant-based procedure utilized to solve systems of equations. In these notes we first discuss Cramer's Rule for systems of three linear equations with three unknowns and then state the Cramer's rule for general systems of equations.
Cramer's Rule - Three Equations, Three Unknowns
Given a system of three linear equations, with three unknowns,
![]() |
Cramer's Rule depends on the calculation of four determinants.
If we define
to be the determinant defined by
![]() |
Note that the determinants are easily generated. The columns of
are just the
coefficients of
,
and
respectively in the
linear equations and
is produced by
replacing the
th row by the row
Example
Suppose we are given a point
in space and a
frame
.
By the definition of a frame, the point
can be written
![]() |
![]() |
The Homogeneous Case
Given a system of three linear equations, with three unknowns,
![]() |
The Example without Determinants
If we look closely at the determinants in the above example, we can see that
they can actually be expressed in terms of the vectors
,
,
, and
. In particular,
![]() |
Thus, in this case, we can eliminate the determinants and utilize dot and cross products.
If Everything is Nice
It is worth looking at the vector-based Cramer's rule one more time
for the case when the frame
is
orthonormal. If the vectors are all mutually perpendicular and
of unit length then the above equations simplify significantly .
In particular, if we assume that
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
The General Cramer's Rule
Given a system of
linear equations
![]() |
![]() |
Also, if the system is homogeneous and
, then it has only
the trivial solution
. If
, the
homogeneous system has nontrivial solutions.