Hard

The Inverse of a 2×2 Matrix

Simple Explanation

The inverse of a matrix A, written A⁻¹, is the matrix that "undoes" A — multiplying A by A⁻¹ (in either order) gives the identity matrix. For a 2×2 matrix, A⁻¹ is found by swapping the main diagonal entries, negating the other two, and dividing everything by the determinant.

Why Do We Need It?

The inverse plays the same role for matrices that reciprocals play for ordinary numbers — it is the key tool for "dividing" by a matrix, most importantly to solve matrix equations.

Formula

Inverse of a 2×2 Matrix

For A = [[a, b], [c, d]]: A⁻¹ = (1/det(A)) · [[d, −b], [−c, a]] (det(A) ≠ 0)

The inverse of a 2×2 matrix — swap the two diagonal entries, negate the two off-diagonal entries, then divide every entry by the determinant.

A⁻¹: — the inverse of A, satisfying A·A⁻¹ = A⁻¹·A = I (the identity matrix)
det(A): — the determinant, ad − bc (must be nonzero)

When to use it: Whenever you need to "undo" a 2×2 matrix's effect, or solve a matrix equation of the form AX = B.

Worked Example

Find the inverse of a 2×2 matrix

Find the inverse of A = [[4, 7], [2, 6]].

Why Does This Work?

Multiplying the original matrix by this constructed inverse, A · A⁻¹, can be checked directly to always produce the identity matrix [[1,0],[0,1]] — the swap-and-negate pattern combined with dividing by ad−bc is specifically engineered so that the row-times-column products cancel out to exactly this result.

Real-Life Example

Decoding an encrypted message

Simple matrix-based encryption multiplies a message by a matrix to scramble it; decoding requires the inverse matrix.

Multiplying the scrambled message by the encryption matrix's inverse exactly reverses the encryption, recovering the original message.

Practice

Find the inverse of [[2, 3], [1, 4]]. (det = 8−3 = 5.)

Hard

Common mistake

Forgetting that a matrix with det(A) = 0 has NO inverse at all — always check the determinant is nonzero before attempting to find an inverse.

Quick Review

A⁻¹ = (1/det(A)) · [[d,−b],[−c,a]], for A=[[a,b],[c,d]].
Swap the diagonal entries, negate the off-diagonal entries, divide by det(A).
Only exists when det(A) ≠ 0.