What is the inverse of a matrix?

The inverse of a square matrix A is the unique matrix A⁻¹ satisfying AA⁻¹ = A⁻¹A = I. It effectively undoes the action of A. Not every square matrix has an inverse — a matrix is invertible if and only if its determinant is nonzero.

How do you find the inverse of a 2×2 matrix?

For a 2×2 matrix with entries a, b, c, d, swap the diagonal entries, negate the off-diagonal entries, and divide by the determinant ad − bc. The formula is A⁻¹ = (1/(ad−bc)) times the matrix [d, −b; −c, a]. The inverse exists only when ad − bc is nonzero.

What conditions make a matrix invertible?

A square matrix is invertible if and only if its determinant is nonzero, its rank equals its order, its columns are linearly independent, the homogeneous system Ax = 0 has only the trivial solution, and zero is not an eigenvalue. All of these conditions are equivalent.

Why is computing the inverse often avoided in practice?

Computing A⁻¹ requires roughly three times the work of solving Ax = b by row reduction and introduces more rounding error. For solving linear systems, LU decomposition is faster and more stable. The inverse is best reserved for theoretical work, symbolic formulas, and small matrices computed by hand.

Inverse Matrix: Formula & Computation

Q: How do you compute the inverse using row reduction?

Form the augmented matrix [A | I] and apply row operations to reduce the left half to the identity matrix. If the reduction succeeds, the right half becomes A⁻¹. If a row of zeros appears in the left half during reduction, the matrix is singular and has no inverse.

Definition of the Inverse

For a square matrix

A

of order

n

, the inverse — if it exists — is the unique matrix

A^{-1}

satisfying

AA^{-1} = A^{-1}A = I

Both products must equal the identity. A matrix possessing an inverse is called invertible or nonsingular. A matrix with no inverse is called singular.

Uniqueness follows from a short argument. Suppose both

B

and

C

satisfy

AB = I

and

CA = I

. Then

B = IB = (CA)B = C(AB) = CI = C

, so

B

and

C

must be the same matrix. This means a matrix either has no inverse or has exactly one.

The inverse is defined only for square matrices. A rectangular matrix cannot satisfy

AA^{-1} = A^{-1}A = I

because the products would require incompatible dimensions. One-sided inverses (left or right) can exist for rectangular matrices with full column or full row rank, but the two-sided inverse is a strictly square concept.

The 2×2 Inverse Formula

For a

2 \times 2

matrix

A = \begin{pmatrix} a & b \\ c & d \end{pmatrix}

with

ad - bc \neq 0

, the inverse is

A^{-1} = \frac{1}{ad - bc} \begin{pmatrix} d & -b \\ -c & a \end{pmatrix}

The recipe is: swap the diagonal entries, negate the off-diagonal entries, and divide everything by the determinant

ad - bc

.

Worked Examples

For

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

, the determinant is

3 \cdot 2 - 1 \cdot 5 = 1

. The inverse is

A^{-1} = \begin{pmatrix} 2 & -1 \\ -5 & 3 \end{pmatrix}

. Since

\det(A) = 1

, every entry of

A^{-1}

is an integer.

Verification:

AA^{-1} = \begin{pmatrix} 3 & 1 \\ 5 & 2 \end{pmatrix} \begin{pmatrix} 2 & -1 \\ -5 & 3 \end{pmatrix} = \begin{pmatrix} 6 - 5 & -3 + 3 \\ 10 - 10 & -5 + 6 \end{pmatrix} = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}

.

For

A = \begin{pmatrix} 2 & 4 \\ 3 & 6 \end{pmatrix}

, the determinant is

2 \cdot 6 - 4 \cdot 3 = 0

. The second column is twice the first, the columns are linearly dependent, and no inverse exists.

For

A = \begin{pmatrix} 1 & 3 \\ 2 & 7 \end{pmatrix}

, the determinant is

7 - 6 = 1

. The inverse is

A^{-1} = \begin{pmatrix} 7 & -3 \\ -2 & 1 \end{pmatrix}

.

When Does the Inverse Exist?

The invertible matrix theorem collects a list of conditions that are all equivalent for an

n \times n

matrix

A

. Each approaches invertibility from a different angle — algebraic, geometric, computational, spectral — but they are all either simultaneously true or simultaneously false.

A

is invertible. The determinant

\det(A) \neq 0

. The rank of

A

equals

n

. The columns of

A

are linearly independent. The rows of

A

are linearly independent. The columns of

A

span

\mathbb{R}^n

. The columns of

A

form a basis for

\mathbb{R}^n

. The homogeneous system

Ax = \mathbf{0}

has only the trivial solution. The system

Ax = \mathbf{b}

has a unique solution for every

\mathbf{b} \in \mathbb{R}^n

. The null space of

A

is

\{\mathbf{0}\}

. The reduced row echelon form of

A

is

I

. The matrix

A

is a product of elementary matrices. Zero is not an eigenvalue of

A

.

The power of this theorem is that proving any one condition automatically establishes all the others. Checking the determinant is often the fastest single test, but in large-scale computation, rank determination via row reduction is more practical.

Category	Equivalent condition (for n × n matrix A)
Determinant	det(A) ≠ 0
Rank	rank(A) = n (full rank)
Columns	linearly independent; span ℝⁿ; form a basis for ℝⁿ
Rows	linearly independent
Null space	null(A) = {0}
Homogeneous system	Ax = 0 has only the trivial solution
General system	Ax = b has a unique solution for every b ∈ ℝⁿ
Row reduction	rref(A) = I
Factorization	A is a product of elementary matrices
Spectrum	0 is not an eigenvalue of A

Computing the Inverse by Row Reduction

The standard algorithm for computing the inverse of an

n \times n

matrix

A

is to form the

n \times 2n

augmented matrix

[A \mid I]

and apply row operations to reduce the left half to the identity. If the reduction succeeds, the right half becomes

A^{-1}

:

[A \mid I] \xrightarrow{\text{row ops}} [I \mid A^{-1}]

Each row operation is left-multiplication by an elementary matrix. If the sequence of operations is

E_1, E_2, \dots, E_k

, then

E_k \cdots E_2 E_1 A = I

, which means

A^{-1} = E_k \cdots E_2 E_1

. Applying the same operations to

I

produces exactly this product.

Worked Example

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

Form

[A \mid I]

and reduce. Subtract

2

times row

1

from row

2

, and subtract row

1

from row

3

:

\begin{pmatrix} 1 & 2 & 1 & 1 & 0 & 0 \\ 0 & 1 & 1 & -2 & 1 & 0 \\ 0 & 1 & 2 & -1 & 0 & 1 \end{pmatrix}

Subtract row

2

from row

3

:

\begin{pmatrix} 1 & 2 & 1 & 1 & 0 & 0 \\ 0 & 1 & 1 & -2 & 1 & 0 \\ 0 & 0 & 1 & 1 & -1 & 1 \end{pmatrix}

Subtract row

3

from row

2

, and subtract row

3

from row

1

:

\begin{pmatrix} 1 & 2 & 0 & 0 & 1 & -1 \\ 0 & 1 & 0 & -3 & 2 & -1 \\ 0 & 0 & 1 & 1 & -1 & 1 \end{pmatrix}

Subtract

2

times row

2

from row

1

:

\begin{pmatrix} 1 & 0 & 0 & 6 & -3 & 1 \\ 0 & 1 & 0 & -3 & 2 & -1 \\ 0 & 0 & 1 & 1 & -1 & 1 \end{pmatrix}

So

A^{-1} = \begin{pmatrix} 6 & -3 & 1 \\ -3 & 2 & -1 \\ 1 & -1 & 1 \end{pmatrix}

.

If at any point during reduction the left half develops a row of all zeros,

A

is singular and no inverse exists.

Computing the Inverse via the Adjugate

The adjugate identity

A \cdot \operatorname{adj}(A) = \det(A) \cdot I

gives an explicit formula when

\det(A) \neq 0

:

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

The adjugate is the transpose of the cofactor matrix, so each entry of

A^{-1}

is a cofactor of

A

divided by

\det(A)

.

For the

2 \times 2

case, the adjugate formula reduces to the swap-and-negate formula from section

2

. The cofactor matrix of

\begin{pmatrix} a & b \\ c & d \end{pmatrix}

is

\begin{pmatrix} d & -c \\ -b & a \end{pmatrix}

, and transposing gives

\begin{pmatrix} d & -b \\ -c & a \end{pmatrix}

, which is exactly the numerator matrix in the

2 \times 2

inverse formula.

For

3 \times 3

and larger matrices, the adjugate formula remains exact and fully symbolic — it shows explicitly how each entry of

A^{-1}

depends on the entries of

A

. This makes it valuable for theoretical work and for deriving sensitivity formulas. For numerical computation, however, it is vastly more expensive than row reduction: computing the adjugate requires

n^2

cofactors, each of which is an

(n-1) \times (n-1)

determinant.

Properties of the Inverse

The inverse satisfies a collection of identities that mirror and extend the familiar rules for reciprocals of real numbers.

Applying the inverse twice recovers the original:

(A^{-1})^{-1} = A

. The inverse of a product reverses the order:

(AB)^{-1} = B^{-1}A^{-1}

. This generalizes to any number of factors —

(A_1 A_2 \cdots A_k)^{-1} = A_k^{-1} \cdots A_2^{-1} A_1^{-1}

.

Transpose and inverse commute:

(A^T)^{-1} = (A^{-1})^T

. It does not matter whether you transpose first and then invert, or invert first and then transpose.

Scalars pass through as expected:

(cA)^{-1} = \frac{1}{c} A^{-1}

for any nonzero scalar

c

. Powers behave cleanly:

(A^k)^{-1} = (A^{-1})^k = A^{-k}

.

The determinant of the inverse is the reciprocal of the determinant:

\det(A^{-1}) = 1/\det(A)

. This follows immediately from the multiplicative property of the determinant:

\det(A)\det(A^{-1}) = \det(AA^{-1}) = \det(I) = 1

.

Solving Systems with the Inverse

When

A

is invertible, the system

Ax = \mathbf{b}

has the unique solution

\mathbf{x} = A^{-1}\mathbf{b}

This is the matrix analogue of dividing both sides by

A

. Multiplying both sides on the left by

A^{-1}

gives

A^{-1}A\mathbf{x} = A^{-1}\mathbf{b}

, which simplifies to

\mathbf{x} = A^{-1}\mathbf{b}

.

In principle, this solves the system in one matrix-vector multiplication — but only if

A^{-1}

is already known. Computing

A^{-1}

from scratch requires roughly as much work as solving the system by Gaussian elimination, and the elimination approach is more numerically stable. Even when multiple systems share the same coefficient matrix

A

with different right-hand sides, the LU decomposition is preferred: factor

A = LU

once, then solve each system with two cheap triangular substitutions.

The formula

\mathbf{x} = A^{-1}\mathbf{b}

is most valuable as a theoretical tool. It proves that an invertible system always has a unique solution, and it makes the dependence of

\mathbf{x}

on

\mathbf{b}

explicit and linear.

Inverses of Special Matrix Types

Several matrix types have inverses with guaranteed structure, and some are trivially cheap to compute.

A diagonal matrix

D = \text{diag}(d_1, \dots, d_n)

is invertible if and only if every diagonal entry is nonzero, and its inverse is

D^{-1} = \text{diag}(1/d_1, \dots, 1/d_n)

— simply reciprocate each entry.

An orthogonal matrix

Q

satisfies

Q^{-1} = Q^T

. The inverse is the transpose, which costs nothing to compute — just reinterpret the matrix with rows and columns swapped.

The inverse of an upper triangular matrix is upper triangular, and the inverse of a lower triangular matrix is lower triangular. The computation can be done by back-substitution without forming the full augmented matrix.

If

A

is symmetric and invertible, then

A^{-1}

is also symmetric:

(A^{-1})^T = (A^T)^{-1} = A^{-1}

.

A block diagonal matrix

\text{diag}(A_1, \dots, A_k)

is invertible if and only if each block is invertible, and the inverse is

\text{diag}(A_1^{-1}, \dots, A_k^{-1})

— each block is inverted independently.

Type	Invertible when	Inverse
Diagonal D = diag(d₁,…,dₙ)	every dᵢ ≠ 0	D⁻¹ = diag(1/d₁,…,1/dₙ)
Orthogonal Q	always (det Q = ±1)	Q⁻¹ = Qᵀ (free — just transpose)
Upper triangular	every diagonal entry ≠ 0	upper triangular (back-substitution)
Lower triangular	every diagonal entry ≠ 0	lower triangular (forward substitution)
Symmetric	det(A) ≠ 0	also symmetric: (A⁻¹)ᵀ = A⁻¹
Block diagonal diag(A₁,…,Aₖ)	each block Aᵢ invertible	diag(A₁⁻¹,…,Aₖ⁻¹) (block-wise)

Common Errors

Several incorrect analogies from scalar arithmetic cause persistent mistakes when working with matrix inverses.

The inverse does not distribute over addition. The expression

(A + B)^{-1}

is not equal to

A^{-1} + B^{-1}

, and there is no simple formula relating the two. If

A = B = I

, then

(A + B)^{-1} = (2I)^{-1} = \frac{1}{2}I

, while

A^{-1} + B^{-1} = I + I = 2I

— these are clearly different.

The inverse of a product reverses order. Writing

(AB)^{-1} = A^{-1}B^{-1}

is wrong; the correct identity is

(AB)^{-1} = B^{-1}A^{-1}

. The reversal is a consequence of non-commutativity: to undo the operation "first apply

B

, then apply

A

," you must first undo

A

, then undo

B

.

Not every matrix is invertible. Assuming an inverse exists without checking the determinant or rank leads to division-by-zero errors in the

2 \times 2

formula and to contradictions in row reduction.

The inverse is not the entry-by-entry reciprocal. The matrix

A^{-1}

is not obtained by replacing each

a_{ij}

with

1/a_{ij}

. The inverse is a global operation that depends on all entries simultaneously.

Mistake	Wrong	Correct
Distributing over sum	(A + B)⁻¹ = A⁻¹ + B⁻¹	no simple formula relates them
Order in a product	(AB)⁻¹ = A⁻¹B⁻¹	(AB)⁻¹ = B⁻¹A⁻¹ (order reverses)
Assuming invertibility	every square A has an inverse	A⁻¹ exists iff det(A) ≠ 0
Entry-by-entry reciprocal	(A⁻¹)ᵢⱼ = 1/aᵢⱼ	inverse is a global operation depending on all entries

When Not to Compute the Inverse

The formula

\mathbf{x} = A^{-1}\mathbf{b}

is clean on paper but misleading as a computational strategy. In almost every practical setting, solving

Ax = \mathbf{b}

by row reduction or LU decomposition is faster and more numerically stable than computing

A^{-1}

first and then multiplying.

Row reduction requires roughly

\frac{2}{3}n^3

operations to factor a system. Computing the full inverse requires roughly

2n^3

operations — three times the cost — and introduces additional rounding error in floating-point arithmetic. When multiple systems with the same

A

need to be solved, the LU factorization should be computed once and reused, not replaced by an explicit inverse.

The inverse is the right object when

A^{-1}

itself — the entire matrix, not just its action on a specific

\mathbf{b}

— is what matters. This happens in theoretical derivations, in symbolic formulas where the dependence on parameters must be made explicit, in sensitivity analysis, and when working with small matrices by hand. For a

2 \times 2

or

3 \times 3

matrix, computing the inverse directly is perfectly reasonable. For an

n \times n

matrix with

n

in the hundreds or thousands, it is almost never the right approach.

Methods of Computing the Inverse

Three methods can produce

A^{-1}

explicitly — the

2 \times 2

swap-and-negate formula, row reduction of

[A \mid I]

, and the adjugate identity — and a fourth strategy, often the best one in practice, is to skip computing

A^{-1}

altogether and solve

A\mathbf{x} = \mathbf{b}

directly. The table below collects them with the conditions each requires, the cost in operations, and the situation each fits.

Method	Applies when	Cost (n × n)	Best for
2 × 2 swap-and-negate formula	n = 2 and ad − bc ≠ 0	trivial (constant time)	by-hand work on 2 × 2 matrices
Row reduction of [A \| I]	det(A) ≠ 0 (verified during reduction)	≈ 2n³ operations	numerical computation when A⁻¹ itself is needed
Adjugate formula A⁻¹ = adj(A)/det(A)	det(A) ≠ 0; symbolic entries	n² cofactors, each an (n−1)-determinant	theoretical derivations, sensitivity formulas
Solve Ax = b directly (skip A⁻¹)	only A⁻¹b is needed, not A⁻¹ itself	≈ ⅔ n³ (Gaussian elimination) + reusable LU	virtually every practical linear system

Inverse of a Matrix

Undoing a Matrix

Definition of the Inverse

The 2×2 Inverse Formula

Worked Examples

When Does the Inverse Exist?

Computing the Inverse by Row Reduction

Worked Example

Computing the Inverse via the Adjugate

Properties of the Inverse

Solving Systems with the Inverse

Inverses of Special Matrix Types

Common Errors

When Not to Compute the Inverse

Methods of Computing the Inverse