How this instrument works
A matrix inverse, A⁻¹, is the matrix satisfying A · A⁻¹ = I, the 2×2 identity — the matrix version of 'the number you multiply by to get 1 back'. For a 2×2 matrix this sheet already has two of the ingredients built elsewhere on this site: the adjoint page swaps A's diagonal and negates its off-diagonal to get adj(A), and the determinant page computes det(A) = ad − bc. The inverse is simply that adjoint divided through by that determinant, A⁻¹ = adj(A) ⁄ det(A) — nothing new to derive, just one division applied to four numbers you can already compute separately.
The division explains itself geometrically. A matrix scales every area in the plane by a factor of det(A); its inverse has to undo that scaling, so dividing by det(A) is exactly the correction the adjoint needs to become a true inverse. This is also the two-variable case of Cramer's rule, the classical method for solving linear systems by dividing determinants — for A x = b with a 2×2 A, the inverse computed here is what turns that system into x = A⁻¹ b directly, one matrix-vector multiplication instead of substitution.
Division by det(A) only works when det(A) is not zero. A matrix with a zero determinant is called singular, and it has no inverse at all — not a large or undefined one, simply none, for the same reason 5 ⁄ 0 has no answer. Geometrically a singular matrix squashes the plane onto a line or a point, an operation with no way back; algebraically the adjoint still exists, but dividing it by zero is exactly as meaningless as dividing an ordinary number by zero, so this sheet's determinant field doubles as the invertibility test.
- Enter the top row of your matrix into a (row1,col1) and b (row1,col2).
- Enter the bottom row into c (row2,col1) and d (row2,col2).
- Check Determinant first — if it reads 0, stop here, since no inverse exists.
- Read Inverse: row1,col1 and Inverse: row1,col2 for the top row of A⁻¹.
- Read Inverse: row2,col1 and Inverse: row2,col2 for the bottom row of A⁻¹.
Worked example — inverting [[4, 7], [2, 6]]
Take a = 4, b = 7, c = 2, d = 6, the matrix [[4, 7], [2, 6]]. Determinant first: det = a×d − b×c = 4×6 − 7×2 = 24 − 14 = 10, comfortably away from zero, so an inverse exists. The adjoint swaps the diagonal and negates the off-diagonal — [[6, −7], [−2, 4]] — and dividing each of those four entries by 10 gives the inverse directly: Inverse: row1,col1 = 6 ⁄ 10 = 0.6, Inverse: row1,col2 = −7 ⁄ 10 = −0.7, Inverse: row2,col1 = −2 ⁄ 10 = −0.2, and Inverse: row2,col2 = 4 ⁄ 10 = 0.4.
Multiply the original matrix by that result and the identity falls out exactly: 4×0.6 + 7×(−0.2) = 2.4 − 1.4 = 1, and 4×(−0.7) + 7×0.4 = −2.8 + 2.8 = 0, with the second row completing the same way. That round trip — original times inverse equals the identity, on the nose — is the one check worth running whenever an inverse matters more than the arithmetic that produced it.
Questions
What is the formula for a 2×2 matrix inverse?
A⁻¹ = adj(A) ⁄ det(A): swap the diagonal and negate the off-diagonal of A to get the adjoint, then divide every entry by det(A) = ad − bc. For [[4, 7], [2, 6]] that is [[6, −7], [−2, 4]] divided by 10, giving [[0.6, −0.7], [−0.2, 0.4]].
Why does a matrix need a nonzero determinant to have an inverse?
Because the inverse formula divides the adjoint by det(A), and division by zero has no answer, for ordinary numbers or matrices alike. A matrix with det(A) = 0 is called singular: it collapses the plane onto a line or a point, an operation nothing can undo, so no inverse — not a large one, not an undefined one, simply none — exists.
How does this inverse relate to the adjoint and determinant calculators?
It combines them: the adjoint page produces [[d, −b], [−c, a]] by swapping and negating, the determinant page produces ad − bc, and this page's only extra step is dividing the first result entry by entry by the second. Nothing about either underlying computation changes.
How can I check that a computed inverse is correct?
Multiply the original matrix by the inverse and confirm the identity matrix comes back: for [[4, 7], [2, 6]] and its inverse [[0.6, −0.7], [−0.2, 0.4]], both diagonal entries land on exactly 1 and both off-diagonal entries land on exactly 0. Any deviation means an arithmetic slip somewhere upstream.
What mistake do students most often make finding a matrix inverse?
Dividing only one or two entries by the determinant instead of all four, or forgetting the sign flip on the off-diagonal entries before dividing. Every entry of the adjoint — both diagonal and both off-diagonal — needs the same division by det(A); skipping one leaves a matrix that looks plausible but fails the A × A⁻¹ = I check.
Does a larger matrix use the same adjoint-over-determinant formula?
The relation A⁻¹ = adj(A) ⁄ det(A) holds for any size of square matrix, but building the adjoint gets harder fast — a 3×3 adjoint needs nine 2×2 cofactor determinants instead of the four leftover entries a 2×2 matrix hands you for free. Most software switches to row reduction once the matrix grows past 3×3, since it scales far better than cofactor expansion.