Linear AlgebraDeterminants5 of 6
Determinants · 5

Cramer's Rule and the Adjugate

We want a way to solve a system of linear equations directly from determinants, without having to row-reduce the matrix.

1

Why Cramer's Rule Works

Suppose we want to solve the system

3x+y\displaystyle \colone{3x} + \coltwo{y} =7\displaystyle = \target{7}
x+2y\displaystyle \colone{x} + \coltwo{2y} =4\displaystyle = \target{4}

Instead of combining rows algebraically, we can read the system by its columns, c1=[31]\colone{c_1 = \begin{bmatrix} 3 \\ 1 \end{bmatrix}} and c2=[12]\coltwo{c_2 = \begin{bmatrix} 1 \\ 2 \end{bmatrix}}, and ask what stretch factors x\colone{x} and y\coltwo{y} make xc1+yc2\colone{xc_1} + \coltwo{yc_2} land on the target vector b=[74]\target{b = \begin{bmatrix} 7 \\ 4 \end{bmatrix}}.

Remember that when we put two column vectors into a 2×22 \times 2 matrix A=[abcd]A = \begin{bmatrix} a & b \\ c & d \end{bmatrix}, the determinant det⁡(A)=ad−bc\det(A) = ad - bc gives the signed area of the parallelogram formed by those columns.

Why Cramer's Rule Works
x[31]+y[12]=[74]x, y=  ?\colone{x}\colone{\begin{bmatrix} 3 \\ 1 \end{bmatrix}} + \coltwo{y}\coltwo{\begin{bmatrix} 1 \\ 2 \end{bmatrix}} = \target{\begin{bmatrix} 7 \\ 4 \end{bmatrix}} \qquad \colone{x},\ \coltwo{y} = \;?
c1\htmlClass{lc-green}{c_1}
c2\htmlClass{lc-pink}{c_2}
b\htmlClass{lc-blue}{b}
Text solution
Original parallelogram areaPut the system's columns into the matrix A=[3112]A = \begin{bmatrix} \colone{3} & \coltwo{1} \\ \colone{1} & \coltwo{2} \end{bmatrix} and find the signed area of their parallelogram.
det⁡(A)=det⁡[3112]=(3)(2)−(1)(1)=5\displaystyle \det(A) = \det\begin{bmatrix} \colone{3} & \coltwo{1} \\ \colone{1} & \coltwo{2} \end{bmatrix} = (3)(2) - (1)(1) = 5
Replace column 1 with b\target{b} to find x\colone{x}Because sliding xc1\colone{xc_1} by yc2\coltwo{yc_2} parallel to c2\coltwo{c_2} does not change the parallelogram's area, we replace the first column of AA with b=[74]\target{b = \begin{bmatrix} 7 \\ 4 \end{bmatrix}} and divide by det⁡(A)\det(A).
x=det⁡[7142]det⁡(A)=(7)(2)−(1)(4)5=105=2\displaystyle \colone{x} = \frac{\det\begin{bmatrix} \target{7} & \coltwo{1} \\ \target{4} & \coltwo{2} \end{bmatrix}}{\det(A)} = \frac{(7)(2) - (1)(4)}{5} = \frac{10}{5} = 2
Replace column 2 with b\target{b} to find y\coltwo{y}By the same parallel slide along c1\colone{c_1}, we replace the second column of AA with b\target{b} and divide by det⁡(A)\det(A).
y=det⁡[3714]det⁡(A)=(3)(4)−(7)(1)5=55=1\displaystyle \coltwo{y} = \frac{\det\begin{bmatrix} \colone{3} & \target{7} \\ \colone{1} & \target{4} \end{bmatrix}}{\det(A)} = \frac{(3)(4) - (7)(1)}{5} = \frac{5}{5} = 1

Stretching the first column by x=2\colone{x} = 2 and the second column by y=1\coltwo{y} = 1 makes the two vectors add tip-to-tail to reach [74]\target{\begin{bmatrix} 7 \\ 4 \end{bmatrix}}.

In the parallelogram below, sliding the target vector b\target{b} parallel to c2\coltwo{c_2} changes the stretch factor y\coltwo{y} while keeping the base c2\coltwo{c_2}, the perpendicular height, and Area(b,c2)\text{Area}(\target{b}, \coltwo{c_2}) unchanged, so dividing Area(b,c2)\text{Area}(\target{b}, \coltwo{c_2}) by Area(c1,c2)\text{Area}(\colone{c_1}, \coltwo{c_2}) always gives x\colone{x}.

Sliding the target vector along one column vector changes that column vector's stretch factor without changing the area between the target vector and that column vector, so dividing that area by the original area between the two column vectors always gives the other column vector's stretch factor.

Whenever det⁡(A)≠0\det(A) \neq 0, a system A[xy]=bA\begin{bmatrix} \colone{x} \\ \coltwo{y} \end{bmatrix} = \target{b} with columns c1\colone{c_1} and c2\coltwo{c_2} has one unique solution given by Cramer's Rule:

x\displaystyle \colone{x} =Area(b,c2)Area(c1,c2),y\displaystyle = \frac{\text{Area}(\target{b}, \coltwo{c_2})}{\text{Area}(\colone{c_1}, \coltwo{c_2})}, \qquad \coltwo{y} =Area(c1,b)Area(c1,c2)\displaystyle = \frac{\text{Area}(\colone{c_1}, \target{b})}{\text{Area}(\colone{c_1}, \coltwo{c_2})}

In 3D, determinants measure volume instead of area, and the exact same column-replacement rule works.

If det⁡(A)=0\det(A) = 0, the denominator is zero and the original parallelogram is squished flat onto a single line, so there is no unique solution and Cramer's Rule cannot be used.

det⁡(A)=0\det(A) = 0
b\htmlClass{lc-blue}{b}
c2\htmlClass{lc-pink}{c_2}
c1\htmlClass{lc-green}{c_1}
no solution
b\htmlClass{lc-blue}{b}
c2\htmlClass{lc-pink}{c_2}
c1\htmlClass{lc-green}{c_1}
infinitely many solutions
2

Systems with an Unknown Parameter

When a matrix is full of plain numbers, row reduction is fast. Cramer's Rule becomes much easier than row reduction when an unknown parameter kk is in the matrix, where row-reducing would immediately force us to divide by expressions with kk.

Let's find which values of kk give the system

kx+2y\displaystyle \colone{kx} + \coltwo{2y} =3\displaystyle = \target{3}
2x+ky\displaystyle \colone{2x} + \coltwo{ky} =1\displaystyle = \target{1}

a unique solution, and then solve for x\colone{x} and y\coltwo{y} in terms of kk.

Systems with an Unknown Parameter
kx+2y=32x+ky=1\displaystyle \begin{aligned} \colone{kx} + \coltwo{2y} &= \target{3} \\ \colone{2x} + \coltwo{ky} &= \target{1} \end{aligned}
one solution for which k ?\displaystyle \text{one solution for which } k\,?
x\displaystyle \colone{x} =  ?y\displaystyle = \;? \qquad \coltwo{y} =  ?\displaystyle = \;?
Text solution
Set det⁡(A)≠0\det(A) \neq 0 for a unique solutionThe matrix A=[k22k]A = \begin{bmatrix} \colone{k} & \coltwo{2} \\ \colone{2} & \coltwo{k} \end{bmatrix} is invertible and gives a unique solution when its determinant is not zero.
det⁡(A)\displaystyle \det(A) =(k)(k)−(2)(2)\displaystyle = (k)(k) - (2)(2) =k2−4≠0  ⟹  k≠2 and k≠−2\displaystyle = k^2 - 4 \neq 0 \implies k \neq 2 \text{ and } k \neq -2
Replace column 1 with [31]\target{\begin{bmatrix} 3 \\ 1 \end{bmatrix}} to find x\colone{x}For k≠±2k \neq \pm 2, we put the target vector into the first column and divide by det⁡(A)\det(A).
x=det⁡[321k]k2−4=3k−2k2−4\displaystyle \colone{x} = \frac{\det\begin{bmatrix} \target{3} & \coltwo{2} \\ \target{1} & \coltwo{k} \end{bmatrix}}{k^2 - 4} = \frac{3k - 2}{k^2 - 4}
Replace column 2 with [31]\target{\begin{bmatrix} 3 \\ 1 \end{bmatrix}} to find y\coltwo{y}Putting the target vector into the second column and dividing by det⁡(A)\det(A) gives y\coltwo{y}.
y=det⁡[k321]k2−4=k−6k2−4\displaystyle \coltwo{y} = \frac{\det\begin{bmatrix} \colone{k} & \target{3} \\ \colone{2} & \target{1} \end{bmatrix}}{k^2 - 4} = \frac{k - 6}{k^2 - 4}

For every value of kk except 22 and −2-2, the system has the unique solution x=3k−2k2−4\colone{x} = \frac{3k - 2}{k^2 - 4} and y=k−6k2−4\coltwo{y} = \frac{k - 6}{k^2 - 4}.

3

From Cramer's Rule to the Adjugate

Cramer's Rule solves Ax=bAx = \target{b} for one target vector b\target{b} at a time. If we want a single inverse matrix A−1A^{-1} that takes any target vector b=[b1b2b3]\target{b = \begin{bmatrix} b_1 \\ b_2 \\ b_3 \end{bmatrix}} and immediately gives x=[x1x2x3]x = \begin{bmatrix} x_1 \\ x_2 \\ x_3 \end{bmatrix}, we can leave b1,b2,b3\target{b_1}, \target{b_2}, \target{b_3} as unknown inputs inside Cramer's Rule and factor out the matrix multiplying b\target{b}. That transposed grid of cofactors is the adjugate of AA, written adj(A)\text{adj}(A).

Remember that to expand a 3×33 \times 3 determinant down a column, we multiply each entry by its cofactor CijC_{ij}: cross out row ii and column jj, take the 2×22 \times 2 determinant left over, and apply the sign from the checkerboard grid [+−+−+−+−+]\begin{bmatrix} + & - & + \\ - & + & - \\ + & - & + \end{bmatrix}.

From Cramer's Rule to the Adjugate
A−1=  ?\colthree{A^{-1}} = \;?
b=[b1b2b3]\target{b = \begin{bmatrix} b_1 \\ b_2 \\ b_3 \end{bmatrix}}
A−1\colthree{A^{-1}}
[x1x2x3]\begin{bmatrix} x_1 \\ x_2 \\ x_3 \end{bmatrix}

Expanding the Cramer's Rule numerator for x1x_1 down the first column separates the inputs b1,b2,b3\target{b_1}, \target{b_2}, \target{b_3} from the first column's cofactors, which depend only on AA:

det⁡[b1a12a13b2a22a23b3a32a33]=C11b1+C21b2+C31b3\displaystyle \det\begin{bmatrix} \target{b_1} & \coltwo{a_{12}} & \colthree{a_{13}} \\ \target{b_2} & \coltwo{a_{22}} & \colthree{a_{23}} \\ \target{b_3} & \coltwo{a_{32}} & \colthree{a_{33}} \end{bmatrix} = \colone{C_{11}}\target{b_1} + \colone{C_{21}}\target{b_2} + \colone{C_{31}}\target{b_3}

Because matrix multiplication multiplies rows by columns, we have to turn each column of cofactors sideways into a row so that it multiplies [b1b2b3]\target{\begin{bmatrix} b_1 \\ b_2 \\ b_3 \end{bmatrix}}:

[C11C21C31C12C22C32C13C23C33]⏟adj(A)[b1b2b3]=[C11b1+C21b2+C31b3C12b1+C22b2+C32b3C13b1+C23b2+C33b3]\displaystyle \underbrace{\begin{bmatrix} \colone{C_{11}} & \colone{C_{21}} & \colone{C_{31}} \\ \coltwo{C_{12}} & \coltwo{C_{22}} & \coltwo{C_{32}} \\ \colthree{C_{13}} & \colthree{C_{23}} & \colthree{C_{33}} \end{bmatrix}}_{\text{adj}(A)} \target{\begin{bmatrix} b_1 \\ b_2 \\ b_3 \end{bmatrix}} = \begin{bmatrix} \colone{C_{11}}\target{b_1} + \colone{C_{21}}\target{b_2} + \colone{C_{31}}\target{b_3} \\ \coltwo{C_{12}}\target{b_1} + \coltwo{C_{22}}\target{b_2} + \coltwo{C_{32}}\target{b_3} \\ \colthree{C_{13}}\target{b_1} + \colthree{C_{23}}\target{b_2} + \colthree{C_{33}}\target{b_3} \end{bmatrix}

Dividing by det⁡(A)\det(A) gives x=1det⁡(A)adj(A)bx = \frac{1}{\det(A)}\text{adj}(A)\target{b}, so whenever det⁡(A)≠0\det(A) \neq 0, the matrix in front of b\target{b} is the inverse of AA:

A−1\displaystyle A^{-1} =1det⁡(A)adj(A)\displaystyle = \frac{1}{\det(A)}\text{adj}(A)
4

Why adj(A)\text{adj}(A) Times AA Equals det⁡(A)I\det(A)I

We can see how the adjugate works by multiplying adj(A)\text{adj}(A) directly by the original matrix AA and checking the entries on and off the main diagonal.

Why adj(A) Times A Equals det(A)I
[C11C21C31C12C22C32C13C23C33]adj(A)[a11a12a13a21a22a23a31a32a33]A\underset{\textstyle \text{adj}(A)}{\begin{bmatrix} \colone{C_{11}} & \colone{C_{21}} & \colone{C_{31}} \\ \coltwo{C_{12}} & \coltwo{C_{22}} & \coltwo{C_{32}} \\ \colthree{C_{13}} & \colthree{C_{23}} & \colthree{C_{33}} \end{bmatrix}}\underset{\textstyle A}{\begin{bmatrix} \colone{a_{11}} & \coltwo{a_{12}} & \colthree{a_{13}} \\ \colone{a_{21}} & \coltwo{a_{22}} & \colthree{a_{23}} \\ \colone{a_{31}} & \coltwo{a_{32}} & \colthree{a_{33}} \end{bmatrix}}
==

On the main diagonal, row 1\colone{1} of adj(A)\text{adj}(A) multiplies column 1\colone{1} of AA, pairing the first column's cofactors with the first column's own entries to give the cofactor expansion of det⁡(A)\det(A):

C11a11+C21a21+C31a31\displaystyle \colone{C_{11}}\colone{a_{11}} + \colone{C_{21}}\colone{a_{21}} + \colone{C_{31}}\colone{a_{31}} =det⁡(A)\displaystyle = \det(A)

Off the main diagonal, row 1\colone{1} of adj(A)\text{adj}(A) multiplies column 2\coltwo{2} of AA, pairing column 1\colone{1}'s cofactors with column 2\coltwo{2}'s entries. That is the determinant of a matrix whose first two columns are identical, which forms a 3D box flattened into a plane of volume 00:

C11a12+C21a22+C31a32=det⁡[a12a12a13a22a22a23a32a32a33]=0\displaystyle \colone{C_{11}}\coltwo{a_{12}} + \colone{C_{21}}\coltwo{a_{22}} + \colone{C_{31}}\coltwo{a_{32}} = \det\begin{bmatrix} \coltwo{a_{12}} & \coltwo{a_{12}} & \colthree{a_{13}} \\ \coltwo{a_{22}} & \coltwo{a_{22}} & \colthree{a_{23}} \\ \coltwo{a_{32}} & \coltwo{a_{32}} & \colthree{a_{33}} \end{bmatrix} = 0

Putting the diagonal and off-diagonal entries together gives an equation that holds for every matrix AA, even when det⁡(A)=0\det(A) = 0:

adj(A)⋅A=[det⁡(A)000det⁡(A)000det⁡(A)]=det⁡(A)I\displaystyle \text{adj}(A) \cdot A = \begin{bmatrix} \det(A) & 0 & 0 \\ 0 & \det(A) & 0 \\ 0 & 0 & \det(A) \end{bmatrix} = \det(A)I

In the product adj(A)⋅A\text{adj}(A) \cdot A below, pairing row ii of adj(A)\text{adj}(A) with the matching column ii of AA keeps the full 3D box of volume det⁡(A)\det(A), while pairing row ii with a different column jj replaces column ii with a copy of column jj and flattens the box into a plane of volume zero.

When multiplying the adjugate by the matrix, pairing a row of cofactors with its matching column keeps the full 3D box volume, while pairing it with any other column repeats an edge and flattens the box to zero volume.
5

Finding the Adjugate and Inverse

Let's cross out rows and columns to find the cofactor grid, adj(A)\text{adj}(A), det⁡(A)\det(A), and A−1A^{-1} for the matrix

A=[120012101]\displaystyle A = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 2 \\ 1 & 0 & 1 \end{bmatrix}
Finding the Adjugate and Inverse
A=[120012101]\displaystyle A = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 2 \\ 1 & 0 & 1 \end{bmatrix}
adj(A)=  ?A−1=  ?\displaystyle \begin{aligned} \text{adj}(A) &= \;? \\ A^{-1} &= \;? \end{aligned}
Text solution
Find the nine 2×22 \times 2 leftover determinantsCover each row and column of AA one spot at a time and take the 2×22 \times 2 determinant of the four entries left uncovered.
[det⁡[1201]det⁡[0211]det⁡[0110]det⁡[2001]det⁡[1011]det⁡[1210]det⁡[2012]det⁡[1002]det⁡[1201]]=[1−2−121−2421]\displaystyle \begin{bmatrix} \det\begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix} & \det\begin{bmatrix} 0 & 2 \\ 1 & 1 \end{bmatrix} & \det\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} \\[8pt] \det\begin{bmatrix} 2 & 0 \\ 0 & 1 \end{bmatrix} & \det\begin{bmatrix} 1 & 0 \\ 1 & 1 \end{bmatrix} & \det\begin{bmatrix} 1 & 2 \\ 1 & 0 \end{bmatrix} \\[8pt] \det\begin{bmatrix} 2 & 0 \\ 1 & 2 \end{bmatrix} & \det\begin{bmatrix} 1 & 0 \\ 0 & 2 \end{bmatrix} & \det\begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix} \end{bmatrix} = \begin{bmatrix} 1 & -2 & -1 \\ 2 & 1 & -2 \\ 4 & 2 & 1 \end{bmatrix}
Flip the four minus spots to get the cofactor gridApply the checkerboard signs [+−+−+−+−+]\begin{bmatrix} + & - & + \\ - & + & - \\ + & - & + \end{bmatrix} by flipping the signs of the four edge entries.
Cofactors=[12−1−2124−21]\displaystyle \text{Cofactors} = \begin{bmatrix} \colone{1} & \coltwo{2} & \colthree{-1} \\ \colone{-2} & \coltwo{1} & \colthree{2} \\ \colone{4} & \coltwo{-2} & \colthree{1} \end{bmatrix}
Multiply row 1 of AA by row 1 of the cofactors to get det⁡(A)\det(A)Before transposing, multiply the top row of AA, [120]\begin{bmatrix} 1 & 2 & 0 \end{bmatrix}, by the top row of the cofactor grid, [12−1]\begin{bmatrix} \colone{1} & \coltwo{2} & \colthree{-1} \end{bmatrix}, to get the determinant right away.
det⁡(A)\displaystyle \det(A) =(1)(1)+(2)(2)+(0)(−1)\displaystyle = (1)(1) + (2)(2) + (0)(-1) =5\displaystyle = 5
Transpose the cofactor grid to get adj(A)\text{adj}(A)Turn each column of the cofactor grid into a row.
adj(A)=[1−2421−2−121]\displaystyle \text{adj}(A) = \begin{bmatrix} \colone{1} & \colone{-2} & \colone{4} \\ \coltwo{2} & \coltwo{1} & \coltwo{-2} \\ \colthree{-1} & \colthree{2} & \colthree{1} \end{bmatrix}
Divide by det⁡(A)\det(A) to get A−1A^{-1}Since det⁡(A)=5≠0\det(A) = 5 \neq 0, divide the adjugate matrix by 55.
A−1=15[1−2421−2−121]\displaystyle A^{-1} = \frac{1}{5}\begin{bmatrix} 1 & -2 & 4 \\ 2 & 1 & -2 \\ -1 & 2 & 1 \end{bmatrix}

We now have the complete inverse matrix A−1A^{-1}, and applying these same steps (covering a row and column, applying the sign, and transposing) to a 2×22 \times 2 matrix [abcd]\begin{bmatrix} a & b \\ c & d \end{bmatrix} gives the familiar 2×22 \times 2 inverse formula A−1=1ad−bc[d−b−ca]A^{-1} = \frac{1}{ad - bc}\begin{bmatrix} d & -b \\ -c & a \end{bmatrix}.

Across the nine entries of AA below, covering row ii and column jj leaves a 2×22 \times 2 determinant whose signed cofactor always lands in the transposed position (row jj, column ii) of adj(A)\text{adj}(A) and A−1A^{-1}.

Covering a row and column of the starting matrix gives a signed smaller determinant that goes into the swapped row and column of the adjugate and inverse.
6

Finding One Entry of an Inverse

What if a question asks for just one entry of A−1A^{-1} instead of the whole inverse? Row reduction would force us to reduce the entire matrix, whereas the adjugate formula needs only det⁡(A)\det(A) and a single cofactor.

Let's find the entry in row 22, column 33 of A−1A^{-1} for the same matrix

A=[120012101]\displaystyle A = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 2 \\ 1 & 0 & 1 \end{bmatrix}

using det⁡(A)=5\det(A) = 5.

Finding One Entry of an Inverse
(A−1)2,3=  ?(A^{-1})_{2,3} = \;?
A=[120012101]A = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 2 \\ 1 & 0 & 1 \end{bmatrix}
??
A−1A^{-1}
Text solution
Flip the indices to pick the cofactorBecause adj(A)\text{adj}(A) is the transpose of the cofactor grid, the entry in row 22, column 33 of A−1A^{-1} comes from row 33, column 22 of the cofactors.
(A−1)2,3\displaystyle (A^{-1})_{2,3} =C3,2det⁡(A)\displaystyle = \frac{\coltwo{C_{3,2}}}{\det(A)}
Cover row 3 and column 2 of AA and apply the signCrossing out row 33 and column 22 of AA leaves a 2×22 \times 2 determinant in a minus spot of the sign grid.
C3,2=−det⁡[1002]=−((1)(2)−(0)(0))=−2\displaystyle \coltwo{C_{3,2}} = -\det\begin{bmatrix} 1 & 0 \\ 0 & 2 \end{bmatrix} = -((1)(2) - (0)(0)) = -2
Divide by det⁡(A)\det(A)Divide C3,2=−2\coltwo{C_{3,2}} = -2 by det⁡(A)=5\det(A) = 5.
(A−1)2,3\displaystyle (A^{-1})_{2,3} =−25\displaystyle = -\frac{2}{5}

The entry in row 22, column 33 of A−1A^{-1} is −25-\frac{2}{5}, which matches row 22, column 33 of our full inverse above while needing only one cofactor instead of nine.

Key concepts

Both Cramer's Rule and the adjugate inverse formula divide by det⁡(A)\det(A), so they work only when det⁡(A)≠0\det(A) \neq 0. If det⁡(A)=0\det(A) = 0, the columns flatten onto a line or plane and there is no unique solution or inverse; and if you need to solve a larger system made of plain numbers, ordinary row reduction is faster.

When a 2×22 \times 2 system gives you parallelogram areas directly or has an unknown parameter kk (like [k22k][xy]=[31]\begin{bmatrix} \colone{k} & \coltwo{2} \\ \colone{2} & \coltwo{k} \end{bmatrix}\begin{bmatrix} \colone{x} \\ \coltwo{y} \end{bmatrix} = \target{\begin{bmatrix} 3 \\ 1 \end{bmatrix}}, where row reduction would divide by messy expressions with kk), use Cramer's Rule by checking det⁡(A)=k2−4≠0\det(A) = k^2 - 4 \neq 0 and replacing one column at a time with b\target{b}:

x=Area(b,c2)Area(c1,c2)=det⁡[321k]k2−4=3k−2k2−4,y=Area(c1,b)Area(c1,c2)=det⁡[k321]k2−4=k−6k2−4\displaystyle \begin{aligned} \colone{x} &= \frac{\text{Area}(\target{b}, \coltwo{c_2})}{\text{Area}(\colone{c_1}, \coltwo{c_2})} = \frac{\det\begin{bmatrix} \target{3} & \coltwo{2} \\ \target{1} & \coltwo{k} \end{bmatrix}}{k^2 - 4} \\ &= \frac{3k - 2}{k^2 - 4}, \\[8pt] \coltwo{y} &= \frac{\text{Area}(\colone{c_1}, \target{b})}{\text{Area}(\colone{c_1}, \coltwo{c_2})} = \frac{\det\begin{bmatrix} \colone{k} & \target{3} \\ \colone{2} & \target{1} \end{bmatrix}}{k^2 - 4} \\ &= \frac{k - 6}{k^2 - 4} \end{aligned}

Expanding Cramer's Rule down each column puts the signed leftover determinants CijC_{ij} (with signs [+−+−+−+−+]\begin{bmatrix} + & - & + \\ - & + & - \\ + & - & + \end{bmatrix}) into the transposed cofactor matrix adj(A)\text{adj}(A), giving the inverse formula

A−1\displaystyle A^{-1} =1det⁡(A)adj(A)\displaystyle = \frac{1}{\det(A)}\text{adj}(A)

If a problem asks for only one entry of A−1A^{-1}, skip the other cofactors and flip the indices right away: to find row 22, column 33 of A−1A^{-1}, cover row 33 and column 22 of AA to get (A−1)2,3=C3,2det⁡(A)(A^{-1})_{2,3} = \frac{\coltwo{C_{3,2}}}{\det(A)}. And whenever cofactors multiply matrix entries directly, use adj(A)⋅A=det⁡(A)I\text{adj}(A) \cdot A = \det(A)I: multiplying a column's cofactors by its own entries gives det⁡(A)\det(A) (such as a11C11+a21C21+a31C31=det⁡(A)\colone{a_{11}}\colone{C_{11}} + \colone{a_{21}}\colone{C_{21}} + \colone{a_{31}}\colone{C_{31}} = \det(A)), while multiplying them by a different column's entries gives 00.

7

Practice

1

Use Cramer's Rule to solve the system 4x−y=54x - y = 5, 2x+3y=132x + 3y = 13.

Which column of [4−123]\begin{bmatrix} 4 & -1 \\ 2 & 3 \end{bmatrix} gets replaced by [513]\begin{bmatrix} 5 \\ 13 \end{bmatrix} when you solve for xx?

Find the determinant of the coefficient matrix A=[4−123]A = \begin{bmatrix} \colone{4} & \coltwo{-1} \\ \colone{2} & \coltwo{3} \end{bmatrix}, being careful to subtract (−1)(2)=−2(-1)(2) = -2 rather than dropping the minus sign on −1-1 (which would give 12−2=1012 - 2 = 10 instead of 1414):
det⁡(A)=det⁡[4−123]=(4)(3)−(−1)(2)=14\displaystyle \det(A) = \det\begin{bmatrix} \colone{4} & \coltwo{-1} \\ \colone{2} & \coltwo{3} \end{bmatrix} = (4)(3) - (-1)(2) = 14
Replace column 1\colone{1} with [513]\target{\begin{bmatrix} 5 \\ 13 \end{bmatrix}} to find x\colone{x}, and replace column 2\coltwo{2} with [513]\target{\begin{bmatrix} 5 \\ 13 \end{bmatrix}} to find y\coltwo{y}:
x=det⁡[5−1133]14=(5)(3)−(−1)(13)14=2814=2\displaystyle \colone{x} = \frac{\det\begin{bmatrix} \target{5} & \coltwo{-1} \\ \target{13} & \coltwo{3} \end{bmatrix}}{14} = \frac{(5)(3) - (-1)(13)}{14} = \frac{28}{14} = 2
y=det⁡[45213]14=(4)(13)−(5)(2)14=4214=3\displaystyle \coltwo{y} = \frac{\det\begin{bmatrix} \colone{4} & \target{5} \\ \colone{2} & \target{13} \end{bmatrix}}{14} = \frac{(4)(13) - (5)(2)}{14} = \frac{42}{14} = 3
2

Two column vectors c1c_1 and c2c_2 form a parallelogram with signed area Area(c1,c2)=6\text{Area}(c_1, c_2) = 6. A target vector b=xc1+yc2b = xc_1 + yc_2 forms a parallelogram with c2c_2 of signed area Area(b,c2)=−18\text{Area}(b, c_2) = -18, and a parallelogram with c1c_1 of signed area Area(c1,b)=15\text{Area}(c_1, b) = 15. Find xx and yy.

Look at which original column was replaced by bb inside Area(b,c2)\text{Area}(b, c_2) and Area(c1,b)\text{Area}(c_1, b).

In Area(b,c2)\text{Area}(\target{b}, \coltwo{c_2}), the target b\target{b} replaced the first column c1\colone{c_1}, so do not pair Area(b,c2)\text{Area}(\target{b}, \coltwo{c_2}) with y\coltwo{y} just because c2\coltwo{c_2} is still in the parentheses (which would swap the answers to x=52\colone{x} = \frac{5}{2} and y=−3\coltwo{y} = -3):
x\displaystyle \colone{x} =Area(b,c2)Area(c1,c2)\displaystyle = \frac{\text{Area}(\target{b}, \coltwo{c_2})}{\text{Area}(\colone{c_1}, \coltwo{c_2})} =−186\displaystyle = \frac{-18}{6} =−3\displaystyle = -3
y\displaystyle \coltwo{y} =Area(c1,b)Area(c1,c2)\displaystyle = \frac{\text{Area}(\colone{c_1}, \target{b})}{\text{Area}(\colone{c_1}, \coltwo{c_2})} =156\displaystyle = \frac{15}{6} =52\displaystyle = \frac{5}{2}
3

Consider the system kx+3y=6kx + 3y = 6, 3x+ky=23x + ky = 2. (a) For what values of kk does this system have a unique solution? (b) For those values of kk, use Cramer's Rule to find xx and yy in terms of kk.

(a) What must be true about det⁡[k33k]\det\begin{bmatrix} k & 3 \\ 3 & k \end{bmatrix} for the system to have a unique solution? (b) Replace one column at a time with [62]\begin{bmatrix} 6 \\ 2 \end{bmatrix}.

(a) Set the determinant of the coefficient matrix not equal to zero, remembering both 33 and −3-3 when solving k2=9k^2 = 9 so you don't miss k≠−3k \neq -3 and write only k≠3k \neq 3:
det⁡(A)=det⁡[k33k]=k2−9≠0  ⟹  k≠3 and k≠−3\displaystyle \det(A) = \det\begin{bmatrix} \colone{k} & \coltwo{3} \\ \colone{3} & \coltwo{k} \end{bmatrix} = k^2 - 9 \neq 0 \implies k \neq 3 \text{ and } k \neq -3
(b) Replace the first and second columns with [62]\target{\begin{bmatrix} 6 \\ 2 \end{bmatrix}} and divide by k2−9k^2 - 9:
x=det⁡[632k]k2−9=6k−6k2−9\displaystyle \colone{x} = \frac{\det\begin{bmatrix} \target{6} & \coltwo{3} \\ \target{2} & \coltwo{k} \end{bmatrix}}{k^2 - 9} = \frac{6k - 6}{k^2 - 9}
y=det⁡[k632]k2−9=2k−18k2−9\displaystyle \coltwo{y} = \frac{\det\begin{bmatrix} \colone{k} & \target{6} \\ \colone{3} & \target{2} \end{bmatrix}}{k^2 - 9} = \frac{2k - 18}{k^2 - 9}
4

Let A=[201112011]A = \begin{bmatrix} 2 & 0 & 1 \\ 1 & 1 & 2 \\ 0 & 1 & 1 \end{bmatrix}. Find the cofactor matrix, adj(A)\text{adj}(A), det⁡(A)\det(A), and A−1A^{-1}.

After finding the nine 2×22 \times 2 leftover determinants, apply the checkerboard signs [+−+−+−+−+]\begin{bmatrix} + & - & + \\ - & + & - \\ + & - & + \end{bmatrix} before transposing.

Covering each row and column gives the 2×22 \times 2 leftover determinants [−111−122−132]\begin{bmatrix} -1 & 1 & 1 \\ -1 & 2 & 2 \\ -1 & 3 & 2 \end{bmatrix}. Flip the signs on the four minus spots of [+−+−+−+−+]\begin{bmatrix} + & - & + \\ - & + & - \\ + & - & + \end{bmatrix} to get the cofactor matrix:
Cofactors=[−1−1112−2−1−32]\displaystyle \text{Cofactors} = \begin{bmatrix} \colone{-1} & \coltwo{-1} & \colthree{1} \\ \colone{1} & \coltwo{2} & \colthree{-2} \\ \colone{-1} & \coltwo{-3} & \colthree{2} \end{bmatrix}
Transpose the cofactor matrix by turning its columns into rows (forgetting to transpose here would leave rows and columns swapped and give the wrong inverse [11−1−1−2213−2]\begin{bmatrix} 1 & 1 & -1 \\ -1 & -2 & 2 \\ 1 & 3 & -2 \end{bmatrix}):
adj(A)=[−11−1−12−31−22]\displaystyle \text{adj}(A) = \begin{bmatrix} \colone{-1} & \colone{1} & \colone{-1} \\ \coltwo{-1} & \coltwo{2} & \coltwo{-3} \\ \colthree{1} & \colthree{-2} & \colthree{2} \end{bmatrix}
Multiply row 11 of AA by row 11 of the cofactor matrix to find det⁡(A)\det(A), and divide adj(A)\text{adj}(A) by det⁡(A)\det(A):
det⁡(A)\displaystyle \det(A) =(2)(−1)+(0)(−1)+(1)(1)\displaystyle = (2)(-1) + (0)(-1) + (1)(1) =−1\displaystyle = -1
A−1=1−1[−11−1−12−31−22]=[1−111−23−12−2]\displaystyle A^{-1} = \frac{1}{-1}\begin{bmatrix} -1 & 1 & -1 \\ -1 & 2 & -3 \\ 1 & -2 & 2 \end{bmatrix} = \begin{bmatrix} 1 & -1 & 1 \\ 1 & -2 & 3 \\ -1 & 2 & -2 \end{bmatrix}
5

The matrix A=[312021143]A = \begin{bmatrix} 3 & 1 & 2 \\ 0 & 2 & 1 \\ 1 & 4 & 3 \end{bmatrix} has det⁡(A)=3\det(A) = 3. Without finding the whole inverse, find the entry in row 11, column 22 of A−1A^{-1}.

Because adj(A)\text{adj}(A) is transposed, which row and column of AA should you cover to get row 11, column 22 of A−1A^{-1}?

Flip the indices first so you cover row 22, column 11 of AA rather than row 11, column 22 (covering row 11, column 22 without flipping would give C1,2=1\coltwo{C_{1,2}} = 1 and the wrong answer 13\frac{1}{3}):
(A−1)1,2\displaystyle (A^{-1})_{1,2} =C2,1det⁡(A)\displaystyle = \frac{\colone{C_{2,1}}}{\det(A)}
Covering row 22 and column 11 leaves [1243]\begin{bmatrix} 1 & 2 \\ 4 & 3 \end{bmatrix}, and applying the minus sign from the checkerboard grid at row 22, column 11 (don't leave it off and get −53-\frac{5}{3}) gives:
C2,1=−det⁡[1243]=−((1)(3)−(2)(4))=5\displaystyle \colone{C_{2,1}} = -\det\begin{bmatrix} 1 & 2 \\ 4 & 3 \end{bmatrix} = -((1)(3) - (2)(4)) = 5
(A−1)1,2\displaystyle (A^{-1})_{1,2} =53\displaystyle = \frac{5}{3}
6

Let A=[251−1304−26]A = \begin{bmatrix} 2 & 5 & 1 \\ -1 & 3 & 0 \\ 4 & -2 & 6 \end{bmatrix}. The cofactors of the first column of AA are C11=18C_{11} = 18, C21=−32C_{21} = -32, and C31=−3C_{31} = -3. Without finding any other cofactors, find: (a) det⁡(A)\det(A) (b) the value of 5C11+3C21−2C315C_{11} + 3C_{21} - 2C_{31} (c) the matrix product adj(A)⋅A\text{adj}(A) \cdot A

Compare the numbers multiplying the cofactors in (a) and (b) to the columns of AA, and remember what happens when column 11's cofactors multiply column 11 versus column 22.

(a) Expand down column 11 by multiplying column 1\colone{1}'s entries (2,−1,4)(\colone{2}, \colone{-1}, \colone{4}) by column 1\colone{1}'s cofactors (be careful not to multiply column 1\colone{1}'s cofactors by row 11's entries 2,5,12, 5, 1, which would give −127-127):
det⁡(A)\displaystyle \det(A) =2(18)+(−1)(−32)+4(−3)\displaystyle = \colone{2}(18) + (\colone{-1})(-32) + \colone{4}(-3) =56\displaystyle = 56
(b) The numbers 5,3,−2\coltwo{5}, \coltwo{3}, \coltwo{-2} are the entries of column 2\coltwo{2}, and multiplying column 1\colone{1}'s cofactors by column 2\coltwo{2}'s entries gives the determinant of a matrix whose first two columns are identical:
5C11+3C21−2C31\displaystyle \coltwo{5}\colone{C_{11}} + \coltwo{3}\colone{C_{21}} - \coltwo{2}\colone{C_{31}} =0\displaystyle = 0
(c) Multiply det⁡(A)=56\det(A) = 56 by the 3×33 \times 3 identity matrix II so the result is a 3×33 \times 3 matrix rather than the single number 5656:
adj(A)⋅A=det⁡(A)I=[560005600056]\displaystyle \text{adj}(A) \cdot A = \det(A)I = \begin{bmatrix} 56 & 0 & 0 \\ 0 & 56 & 0 \\ 0 & 0 & 56 \end{bmatrix}