evan's notes
cal 3discreteodeenv systems

On this page

  • 1. The Big Idea
  • 2. Determinant of a 2×22\times 22×2 Matrix
  • Example
  • 3. What the Determinant Tells You
  • 4. Minors and Cofactors
  • How to Find a Cofactor
  • 5. Cofactor Expansion
  • Practical Tip
  • 6. Shortcut for 3×33\times 33×3 Determinants
  • 7. Determinants and Row Operations
  • 8. Fast Determinant Facts
  • Triangular Matrices
  • Zero Row or Column
  • Repeated Rows or Columns
  • Multiple Rows or Columns
  • 9. Determinants and Matrix Operations
  • Important Warning
  • 10. The Adjoint Matrix
  • 11. Inverse Using the Adjoint
  • 12. Useful Adjoint Properties
  • 13. Cramer’s Rule
  • 14. Worked Example: Cramer’s Rule
  • Find xxx
  • Find yyy
  • 15. Problem-Solving Routine
  • 16. Key Takeaways
  • Mini-Self-Check

Linear Algebra

§3 Determinants, Adjoints, and Cramer’s Rule

Evan Luo · Feb 24, 2026

Linear Algebra

§3 Determinants, Adjoints, and Cramer’s Rule

Evan LuoFeb 24, 2026

9 min read

1. The Big Idea

A determinant is a single number attached to a square matrix.

That number carries a lot of information. It can tell us whether a matrix is invertible, whether a square system has a unique solution, and whether rows or columns are secretly dependent on each other.

Only square matrices have determinants.

The most important test is:

DeterminantMeaning
det⁡(A)≠0\det(A)\neq 0det(A)=0AAA is invertible
det⁡(A)=0\det(A)=0det(A)=0AAA is not invertible

For a square system, det⁡(A)≠0\det(A)\neq 0det(A)=0 means the system has exactly one solution. If det⁡(A)=0\det(A)=0det(A)=0, something collapses: the rows or columns do not contain enough independent information to undo the matrix.


2. Determinant of a 2×22\times 22×2 Matrix

For

A=[abcd]A= \begin{bmatrix} a&b\\ c&d \end{bmatrix} A=[ac​bd​]

the determinant is

det⁡(A)=ad−bc\det(A)=ad-bc det(A)=ad−bc

You may also see determinant notation written as

∣A∣=ad−bc|A|=ad-bc ∣A∣=ad−bc

Example

Let

A=[321−3]A= \begin{bmatrix} 3&2\\ 1&-3 \end{bmatrix} A=[31​2−3​]

Then

det⁡(A)=3(−3)−2(1)\det(A)=3(-3)-2(1) det(A)=3(−3)−2(1)

so

det⁡(A)=−9−2=−11\det(A)=-9-2=-11 det(A)=−9−2=−11

Since det⁡(A)≠0\det(A)\neq 0det(A)=0, the matrix is invertible.


3. What the Determinant Tells You

The determinant is often used as a quick decision tool.

For a square matrix AAA:

QuestionDeterminant test
Is AAA invertible?yes if det⁡(A)≠0\det(A)\neq 0det(A)=0
Does Ax⃗=b⃗A\vec{x}=\vec{b}Ax=b have a unique solution for every b⃗\vec{b}b?yes if det⁡(A)≠0\det(A)\neq 0det(A)=0
Are the rows/columns independent?yes if det⁡(A)≠0\det(A)\neq 0det(A)=0
Did the matrix collapse information?yes if det⁡(A)=0\det(A)=0det(A)=0

So when you see a determinant problem, ask first: is the goal to compute a number, or is the goal to decide invertibility/uniqueness?


4. Minors and Cofactors

For larger matrices, determinants are built from smaller determinants.

The minor MijM_{ij}Mij​ is found by deleting row iii and column jjj, then taking the determinant of what remains.

The cofactor CijC_{ij}Cij​ is the minor with a sign attached:

Cij=(−1)i+jMijC_{ij}=(-1)^{i+j}M_{ij} Cij​=(−1)i+jMij​

For a 3×33\times 33×3 matrix, the sign pattern is

[+−+−+−+−+]\begin{bmatrix} +&-&+\\ -&+&-\\ +&-&+ \end{bmatrix} ​+−+​−+−​+−+​​

That means cofactors alternate signs like a checkerboard.

How to Find a Cofactor

To find CijC_{ij}Cij​:

  1. Delete row iii.
  2. Delete column jjj.
  3. Compute the determinant of the smaller matrix. That is MijM_{ij}Mij​.
  4. Apply the sign (−1)i+j(-1)^{i+j}(−1)i+j.

The minor is the smaller determinant. The cofactor is the signed minor.


5. Cofactor Expansion

Cofactor expansion is a general method for computing determinants.

The idea is to choose a row or column, multiply each entry by its cofactor, and add the results.

Expansion along row iii:

det⁡(A)=ai1Ci1+ai2Ci2+⋯+ainCin\det(A)=a_{i1}C_{i1}+a_{i2}C_{i2}+\cdots+a_{in}C_{in} det(A)=ai1​Ci1​+ai2​Ci2​+⋯+ain​Cin​

Expansion along column jjj:

det⁡(A)=a1jC1j+a2jC2j+⋯+anjCnj\det(A)=a_{1j}C_{1j}+a_{2j}C_{2j}+\cdots+a_{nj}C_{nj} det(A)=a1j​C1j​+a2j​C2j​+⋯+anj​Cnj​

Practical Tip

Choose the row or column with the most zeros.

If an entry is zero, then its whole term becomes zero, so you do not need to compute that cofactor. This can save a lot of work.


6. Shortcut for 3×33\times 33×3 Determinants

For

A=[abcdefghi]A= \begin{bmatrix} a&b&c\\ d&e&f\\ g&h&i \end{bmatrix} A=​adg​beh​cfi​​

the 3×33\times 33×3 shortcut gives

det⁡(A)=aei+bfg+cdh−ceg−bdi−afh\det(A)=aei+bfg+cdh-ceg-bdi-afh det(A)=aei+bfg+cdh−ceg−bdi−afh

Your notes also use the “copy the first two columns” diagonal method. That method is another way to remember the same formula.

Important warning: this shortcut works only for 3×33\times 33×3 matrices. Do not try to extend the diagonal-copy trick to 4×44\times 44×4 matrices.

For larger matrices, use cofactor expansion or row-reduction methods.


7. Determinants and Row Operations

Row operations are useful for determinants, but you must track how each operation changes the determinant.

Row operationEffect on determinant
Swap two rowschanges the sign
Multiply one row by kkkmultiplies determinant by kkk
Add a multiple of one row to another rowdoes not change the determinant

In symbols:

row swap⟹det⁡(B)=−det⁡(A)\text{row swap}\quad\Longrightarrow\quad \det(B)=-\det(A) row swap⟹det(B)=−det(A) Ri→kRi⟹det⁡(B)=kdet⁡(A)R_i\to kR_i\quad\Longrightarrow\quad \det(B)=k\det(A) Ri​→kRi​⟹det(B)=kdet(A) Ri→Ri+kRj⟹det⁡(B)=det⁡(A)R_i\to R_i+kR_j\quad\Longrightarrow\quad \det(B)=\det(A) Ri​→Ri​+kRj​⟹det(B)=det(A)

These rules are especially useful when reducing a matrix to triangular form. Once the matrix is triangular, the determinant is much easier to compute.


8. Fast Determinant Facts

Some determinant results can be recognized immediately.

Triangular Matrices

If AAA is triangular, meaning all entries above or below the main diagonal are zero, then

det⁡(A)=a11a22⋯ann\det(A)=a_{11}a_{22}\cdots a_{nn} det(A)=a11​a22​⋯ann​

So for triangular matrices, just multiply the diagonal entries.

Zero Row or Column

If AAA has a row or column of zeros, then

det⁡(A)=0\det(A)=0 det(A)=0

There is not enough information in the rows or columns for the matrix to be invertible.

Repeated Rows or Columns

If AAA has two equal rows or two equal columns, then

det⁡(A)=0\det(A)=0 det(A)=0

Multiple Rows or Columns

If one row is a multiple of another row, or one column is a multiple of another column, then

det⁡(A)=0\det(A)=0 det(A)=0

This is a sign of linear dependence.


9. Determinants and Matrix Operations

For square matrices AAA and BBB of the same size:

det⁡(AT)=det⁡(A)\det(A^T)=\det(A) det(AT)=det(A) det⁡(AB)=det⁡(A)det⁡(B)\det(AB)=\det(A)\det(B) det(AB)=det(A)det(B)

If AAA is invertible:

det⁡(A−1)=1det⁡(A)\det(A^{-1})=\frac{1}{\det(A)} det(A−1)=det(A)1​

For an n×nn\times nn×n matrix:

det⁡(kA)=kndet⁡(A)\det(kA)=k^n\det(A) det(kA)=kndet(A)

The last rule is easy to misuse. Multiplying a whole n×nn\times nn×n matrix by kkk multiplies every row by kkk, so the determinant gets nnn factors of kkk.

Important Warning

Determinants do not distribute over addition:

det⁡(A+B)≠det⁡(A)+det⁡(B)\det(A+B)\neq \det(A)+\det(B) det(A+B)=det(A)+det(B)

in general.

They also do not distribute over subtraction:

det⁡(A−B)≠det⁡(A)−det⁡(B)\det(A-B)\neq \det(A)-\det(B) det(A−B)=det(A)−det(B)

in general.


10. The Adjoint Matrix

The adjoint is built from cofactors.

First, form the cofactor matrix:

C=[C11C12⋯C21C22⋯⋮⋮⋱]C= \begin{bmatrix} C_{11}&C_{12}&\cdots\\ C_{21}&C_{22}&\cdots\\ \vdots&\vdots&\ddots \end{bmatrix} C=​C11​C21​⋮​C12​C22​⋮​⋯⋯⋱​​

Then transpose it.

The adjoint of AAA, written adj⁡(A)\operatorname{adj}(A)adj(A), is

adj⁡(A)=CT\operatorname{adj}(A)=C^T adj(A)=CT

So the process is:

  1. Find every cofactor.
  2. Put the cofactors into a matrix.
  3. Transpose that matrix.

11. Inverse Using the Adjoint

If AAA is invertible, then

A−1=1det⁡(A)adj⁡(A)A^{-1}=\frac{1}{\det(A)}\operatorname{adj}(A) A−1=det(A)1​adj(A)

This formula works for any square invertible matrix.

For large matrices, row-reduction is usually easier. Still, this formula is important because it connects three major ideas:

  • determinants
  • cofactors/adjoints
  • inverses

It also explains why det⁡(A)≠0\det(A)\neq 0det(A)=0 is required. If det⁡(A)=0\det(A)=0det(A)=0, then the formula would require division by zero.


12. Useful Adjoint Properties

For an invertible n×nn\times nn×n matrix:

adj⁡(A)=det⁡(A)A−1\operatorname{adj}(A)=\det(A)A^{-1} adj(A)=det(A)A−1 det⁡(adj⁡(A))=det⁡(A)n−1\det(\operatorname{adj}(A))=\det(A)^{n-1} det(adj(A))=det(A)n−1 adj⁡(AB)=adj⁡(B)adj⁡(A)\operatorname{adj}(AB)=\operatorname{adj}(B)\operatorname{adj}(A) adj(AB)=adj(B)adj(A) adj⁡(A−1)=1det⁡(A)A\operatorname{adj}(A^{-1})=\frac{1}{\det(A)}A adj(A−1)=det(A)1​A adj⁡(kA)=kn−1adj⁡(A)\operatorname{adj}(kA)=k^{n-1}\operatorname{adj}(A) adj(kA)=kn−1adj(A)

These are useful for formula-based determinant problems. Notice that the product rule reverses order, just like inverse and transpose product rules do.


13. Cramer’s Rule

Cramer’s Rule solves square systems using determinants.

Suppose a system is written as

Ax⃗=b⃗A\vec{x}=\vec{b} Ax=b

and

det⁡(A)≠0\det(A)\neq 0 det(A)=0

Then the system has a unique solution.

For variables x1,x2,…,xnx_1,x_2,\dots,x_nx1​,x2​,…,xn​,

xi=det⁡(Ai)det⁡(A)x_i=\frac{\det(A_i)}{\det(A)} xi​=det(A)det(Ai​)​

where AiA_iAi​ is the matrix formed by replacing column iii of AAA with the constant vector b⃗\vec{b}b.

In words:

  • replace the first column to find x1x_1x1​
  • replace the second column to find x2x_2x2​
  • keep going one column at a time

Cramer’s Rule is most practical for small systems, especially 2×22\times 22×2 or sometimes 3×33\times 33×3 systems.


14. Worked Example: Cramer’s Rule

Solve the system

{3x+2y=7x−3y=−5\begin{cases} 3x+2y=7\\ x-3y=-5 \end{cases} {3x+2y=7x−3y=−5​

The coefficient matrix is

A=[321−3]A= \begin{bmatrix} 3&2\\ 1&-3 \end{bmatrix} A=[31​2−3​]

and the constant vector is

b⃗=[7−5]\vec{b}= \begin{bmatrix} 7\\ -5 \end{bmatrix} b=[7−5​]

First compute the determinant of AAA:

det⁡(A)=3(−3)−2(1)=−11\det(A)=3(-3)-2(1)=-11 det(A)=3(−3)−2(1)=−11

Since det⁡(A)≠0\det(A)\neq 0det(A)=0, Cramer’s Rule applies.

Find xxx

Replace the xxx-column with b⃗\vec{b}b:

Ax=[72−5−3]A_x= \begin{bmatrix} 7&2\\ -5&-3 \end{bmatrix} Ax​=[7−5​2−3​]

Then

det⁡(Ax)=7(−3)−2(−5)=−21+10=−11\det(A_x)=7(-3)-2(-5)=-21+10=-11 det(Ax​)=7(−3)−2(−5)=−21+10=−11

So

x=det⁡(Ax)det⁡(A)=−11−11=1x=\frac{\det(A_x)}{\det(A)}=\frac{-11}{-11}=1 x=det(A)det(Ax​)​=−11−11​=1

Find yyy

Replace the yyy-column with b⃗\vec{b}b:

Ay=[371−5]A_y= \begin{bmatrix} 3&7\\ 1&-5 \end{bmatrix} Ay​=[31​7−5​]

Then

det⁡(Ay)=3(−5)−7(1)=−15−7=−22\det(A_y)=3(-5)-7(1)=-15-7=-22 det(Ay​)=3(−5)−7(1)=−15−7=−22

So

y=det⁡(Ay)det⁡(A)=−22−11=2y=\frac{\det(A_y)}{\det(A)}=\frac{-22}{-11}=2 y=det(A)det(Ay​)​=−11−22​=2

Therefore,

(x,y)=(1,2)(x,y)=(1,2) (x,y)=(1,2)

15. Problem-Solving Routine

When working with determinants, use this checklist:

  1. Check that the matrix is square. If it is not square, it has no determinant.
  2. For 2×22\times 22×2, use ad−bcad-bcad−bc. This is the fastest method.
  3. For 3×33\times 33×3, use the shortcut or cofactor expansion. The shortcut works only for 3×33\times 33×3.
  4. For larger matrices, look for zeros. Cofactor expansion is easier along rows or columns with many zeros.
  5. If using row operations, track determinant changes. Swaps, scaling, and row replacement affect determinants differently.
  6. For invertibility, only check whether the determinant is zero. Nonzero means invertible; zero means not invertible.
  7. For Cramer’s Rule, replace one column at a time. Each replaced-column determinant gives one variable.

16. Key Takeaways

  • Determinants are only defined for square matrices.
  • det⁡(A)≠0\det(A)\neq 0det(A)=0 means AAA is invertible.
  • det⁡(A)=0\det(A)=0det(A)=0 means AAA is not invertible.
  • Cofactors are signed minors.
  • Cofactor expansion breaks a determinant into smaller determinants.
  • Row swaps change determinant sign.
  • Scaling one row scales the determinant.
  • Adding a multiple of one row to another does not change the determinant.
  • The adjoint is the transpose of the cofactor matrix.
  • Cramer’s Rule solves square systems using determinant ratios.

Mini-Self-Check

  1. What does det⁡(A)=0\det(A)=0det(A)=0 tell you about a square matrix AAA?

It tells you that AAA is not invertible. The rows or columns are dependent, so the matrix cannot be undone.

Click to reveal
  1. Which row operation does not change the determinant?

Adding a multiple of one row to another row does not change the determinant.

Click to reveal
  1. Why does Cramer’s Rule require det⁡(A)≠0\det(A)\neq 0det(A)=0?

Because each variable is found by dividing by det⁡(A)\det(A)det(A). If det⁡(A)=0\det(A)=0det(A)=0, division by zero would occur, and the system would not have a unique solution.

Click to reveal
  1. How do you build the adjoint matrix?

Find the cofactor matrix first, then transpose it. In symbols, adj⁡(A)=CT\operatorname{adj}(A)=C^Tadj(A)=CT.

Click to reveal

Source: https://notes.ohevan.com/notes/linear/03-determinants-adjoints-cramers-rule

© 2026 Evan Luo. All rights reserved.

Back to Linear Algebra

0 reads

·Last edited May 23, 2026
  • newsletter

  • about me

  • sponsor

© 2026 Evan Luo. All rights reserved.