Matrix Inverse via the Adjugate Method

April 13, 2026

Problem

Find the inverse of A = [[2,1],[5,3]] using A⁻¹ = (1/det A) · adj(A). Verify A · A⁻¹ = I.

Explanation

What is a matrix inverse?

A square matrix AA is invertible if there exists a matrix A1A^{-1} with AA1=A1A=IA A^{-1} = A^{-1} A = I

Not every square matrix has an inverse. AA is invertible if and only if detA0\det A \ne 0. A matrix without an inverse is called singular.

The 2×2 formula

For A=(abcd)A = \begin{pmatrix} a & b \\ c & d \end{pmatrix} with detA=adbc0\det A = ad - bc \ne 0: A1=1detA(dbca)A^{-1} = \dfrac{1}{\det A} \begin{pmatrix} d & -b \\ -c & a \end{pmatrix}

Swap the diagonal, negate the off-diagonal, divide by the determinant.

Step-by-step

A=(2153)A = \begin{pmatrix} 2 & 1 \\ 5 & 3 \end{pmatrix}

Step 1 — Compute detA\det A: detA=(2)(3)(1)(5)=65=1\det A = (2)(3) - (1)(5) = 6 - 5 = 1

Step 2 — Build the adjugate (for 2×22 \times 2): swap diagonal, negate off-diagonal: adj(A)=(3152)\mathrm{adj}(A) = \begin{pmatrix} 3 & -1 \\ -5 & 2 \end{pmatrix}

Step 3 — Divide by determinant: A1=11(3152)=(3152)A^{-1} = \dfrac{1}{1} \begin{pmatrix} 3 & -1 \\ -5 & 2 \end{pmatrix} = \begin{pmatrix} 3 & -1 \\ -5 & 2 \end{pmatrix}

Verification

AA1=(2153)(3152)A A^{-1} = \begin{pmatrix} 2 & 1 \\ 5 & 3 \end{pmatrix} \begin{pmatrix} 3 & -1 \\ -5 & 2 \end{pmatrix}

  • Row 1, col 1: 2(3)+1(5)=65=12(3) + 1(-5) = 6 - 5 = 1
  • Row 1, col 2: 2(1)+1(2)=2+2=02(-1) + 1(2) = -2 + 2 = 0
  • Row 2, col 1: 5(3)+3(5)=1515=05(3) + 3(-5) = 15 - 15 = 0
  • Row 2, col 2: 5(1)+3(2)=5+6=15(-1) + 3(2) = -5 + 6 = 1

AA1=(1001)=IA A^{-1} = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} = I

Generalization: adjugate method for any nn

For a general n×nn \times n invertible AA: A1=1detAadj(A)A^{-1} = \dfrac{1}{\det A} \, \mathrm{adj}(A)

where adj(A)\mathrm{adj}(A) is the adjugate (or classical adjoint) — the transpose of the cofactor matrix. The (i,j)(i, j) entry of the cofactor matrix is (1)i+jMij(-1)^{i+j} M_{ij} where MijM_{ij} is the (n1)×(n1)(n-1) \times (n-1) determinant obtained by deleting row ii and column jj.

For n3n \ge 3, this is often slower than using Gauss–Jordan elimination on [AI][A \mid I], but the adjugate formula gives a clean closed-form.

Why the inverse matters

  • Solving Ax=bA \mathbf{x} = \mathbf{b}: if AA is invertible, x=A1b\mathbf{x} = A^{-1} \mathbf{b}.
  • Change of basis: converting coordinates between different bases uses inverses.
  • Undoing linear transformations: rotation, scaling, shear — each has an inverse that undoes it.

Common mistakes

  • Forgetting to check detA0\det A \ne 0. If the determinant is zero, A1A^{-1} does not exist.
  • Not negating the off-diagonal. It's (b,c)(-b, -c), not (b,c)(b, c).
  • Dropping the 1/detA1/\det A factor. Without it you compute adj(A)\mathrm{adj}(A), not A1A^{-1}.
  • Trying to invert a non-square matrix. Only square matrices can have a (two-sided) inverse; non-square matrices have pseudo-inverses instead.

Try it in the visualization

Modify entries of AA with sliders; the determinant and A1A^{-1} update live. When detA=0\det A = 0, the inverse panel turns red and shows "singular — no inverse exists." The product AA1A A^{-1} also updates to confirm II.

Interactive Visualization

Parameters

2.00
1.00
5.00
3.00
Your turn

Got your own math or physics problem?

Turn any problem into an interactive visualization like this one — powered by AI, generated in seconds. Free to try, no credit card required.

Sign Up Free to Try It30 free visualizations every day
Matrix Inverse via the Adjugate Method | MathSpin