Inverse of a Matrix

The inverse of a matrix is one of the most powerful concepts in linear algebra. Just as the reciprocal of a nonzero real number a is 1/a (satisfying a · (1/a) = 1), the inverse of a square matrix A is another matrix A⁻¹ such that A · A⁻¹ = A⁻¹ · A = I, where I is the identity matrix. Not every matrix has an inverse — only square matrices with a nonzero determinant do, and such matrices are called invertible or nonsingular. One elegant method for computing the inverse uses two objects built from the matrix: its determinant and its adjoint (also called the classical adjoint or adjugate). The determinant tells us whether an inverse exists at all, while the adjoint provides the 'shape' of the inverse. Together they give the formula A⁻¹ = (1/det(A)) · adj(A). This formula is theoretically beautiful and especially practical for 2×2 and 3×3 matrices. Understanding matrix inverses is essential for solving systems of linear equations, performing coordinate transformations in geometry and physics, and underpinning algorithms in computer graphics, cryptography, and machine learning. Mastering the adjoint-determinant method gives you a concrete, formula-based way to compute inverses and deepens your understanding of why invertibility is tied so closely to the determinant.

Key takeaways
  • Check that the determinant is nonzero
  • Find the matrix of minors
  • Form the matrix of cofactors
  • Transpose the cofactor matrix to get the adjoint
  • Divide the adjoint by the determinant

Check that the determinant is nonzero

Compute det(A). If det(A) = 0, the matrix is singular and has no inverse — stop here. If det(A) ≠ 0, proceed. For a 2×2 matrix A = [[a, b],[c, d]], det(A) = ad − bc.

Find the matrix of minors

For each entry aᵢⱼ of A, delete row i and column j to obtain a smaller submatrix. The determinant of that submatrix is the minor Mᵢⱼ. For a 3×3 matrix this produces nine minors arranged in a 3×3 matrix of minors.

Form the matrix of cofactors

Each cofactor Cᵢⱼ is obtained by applying a sign based on position: Cᵢⱼ = (−1)^(i+j) · Mᵢⱼ. The sign pattern for a 3×3 matrix is [[+,−,+],[−,+,−],[+,−,+]]. The matrix C whose entries are the cofactors is called the cofactor matrix.

Transpose the cofactor matrix to get the adjoint

The adjoint (adjugate) of A is the transpose of the cofactor matrix: adj(A) = Cᵀ. This means the (i,j) entry of adj(A) is Cⱼᵢ (note the swap of indices). For a 2×2 matrix A = [[a,b],[c,d]], adj(A) = [[d,−b],[−c,a]] — simply swap the diagonal entries and negate the off-diagonal entries.

Divide the adjoint by the determinant

The inverse is A⁻¹ = (1/det(A)) · adj(A). Multiply every entry of adj(A) by the scalar 1/det(A). You can verify correctness by checking that A · A⁻¹ equals the identity matrix I.

The Key Equation

A−1=1det⁡(A) adj⁡(A)=1det⁡(A) C⊤A^{-1} = \frac{1}{\det(A)}\,\operatorname{adj}(A) = \frac{1}{\det(A)}\,C^{\top}
  • A^{-1} — Inverse matrix (dimensionless): The matrix that, when multiplied by A on either side, gives the identity matrix I.
  • \det(A) — Determinant of A (dimensionless): A scalar value encoding the scaling factor of the linear transformation represented by A; must be nonzero for the inverse to exist.
  • \operatorname{adj}(A) — Adjoint (adjugate) of A (dimensionless): The transpose of the cofactor matrix of A; its (i,j) entry is the cofactor Cⱼᵢ.
  • C^{\top} — Transpose of cofactor matrix (dimensionless): The cofactor matrix C with rows and columns swapped; equivalent to adj(A).
  • C_{ij} = (-1)^{i+j}M_{ij} — Cofactor (dimensionless): The signed minor obtained by deleting row i and column j from A and computing the determinant of the resulting submatrix.

Worked Example

Problem. Find the inverse of the matrix A = [[2, 1],[5, 3]] using the adjoint-determinant method.

A−1=(3−1−52)A^{-1} = \begin{pmatrix} 3 & -1 \\ -5 & 2 \end{pmatrix}

Answer. The inverse of A is [[3, −1],[−5, 2]].

Figure
Diagram
Matrix Inverse: Geometric InterpretationOriginal gride₁=(1,0)e₂=(0,1)Unit square, area=1→ A →Transformed grid (by A)A·e₁A·e₂Parallelogram, area=|det A|Key Idea: A maps the unit square to a parallelogram.det(A) = area of parallelogram. If det(A)≠0, A⁻¹ maps it back.det(A) = 0 ⟹ area collapses to 0 ⟹ no inverse exists.
Origins · 1 minArthur Cayley and how this was discovered
AC
Arthur Cayley
1821–1895 · British

Arthur Cayley was the first mathematician to publish a systematic theory of matrices, introducing matrix multiplication, the identity matrix, and the concept of a matrix inverse in his 1858 paper 'A Memoir on the Theory of Matrices.' He stated the Cayley–Hamilton theorem, which relates a matrix to its own characteristic polynomial and has deep connections to invertibility. Cayley was trained as a lawyer and worked for 14 years as a barrister before accepting a mathematics professorship at Cambridge — yet he published nearly 300 mathematical papers during his legal career.

  • Determinant of a Matrix — The determinant is the critical scalar in the inverse formula; a nonzero determinant is the exact condition for invertibility.
  • Cofactors and Minors — Cofactors are the signed minors used to build the adjoint matrix, which is the numerator of the inverse formula.
  • Solving Linear Systems Using Matrix Inverses — The system Ax = b has the unique solution x = A⁻¹b when A is invertible, making the inverse directly applicable to solving equations.
  • Transpose of a Matrix — The adjoint is defined as the transpose of the cofactor matrix, so understanding the transpose operation is essential.
  • Cramer's Rule — Cramer's Rule is a related determinant-based formula for solving linear systems, sharing the same theoretical foundation as the adjoint inverse method.