What the inverse of a 3×3 matrix is and why you need it
The inverse of a 3×3 matrix is another 3×3 matrix that, when multiplied by the original, gives you the identity matrix (a matrix with 1s on the diagonal and 0s everywhere else). If you have a matrix A, its inverse is written as A⁻¹, and A × A⁻¹ = I, where I is the identity matrix.
You need the inverse when you are solving systems of linear equations, working with transformations in graphics or physics, or inverting a transformation to undo it. Not every matrix has an inverse — only square matrices with a non-zero determinant are invertible.
There are two main methods to compute the inverse by hand: the adjugate method (also called the classical adjoint method) and Gaussian elimination. The adjugate method is more direct for 3×3 matrices and is what most people learn first.
Key Takeaways
- A matrix has an inverse only if its determinant is non-zero; if the determinant is zero, the matrix is singular and has no inverse.
- The adjugate method requires you to find the determinant, then the matrix of minors, then the matrix of cofactors, then transpose it, and finally divide by the determinant.
- The determinant of a 3×3 matrix is found by expanding along any row or column using the rule of Sarrus or cofactor expansion.
- Gaussian elimination (row reduction) is an alternative method that works by augmenting your matrix with the identity and reducing both sides simultaneously.
- Always verify your answer by multiplying the original matrix by your computed inverse; the result should be the identity matrix.
Step 1: Calculate the determinant of your matrix
Before you do anything else, find the determinant. If it is zero, the matrix has no inverse and you can stop.
For a 3×3 matrix with entries arranged as:
| a b c | | d e f | | g h i |
The determinant is: a(ei − fh) − b(di − fg) + c(dh − eg). This is called expansion along the first row. You multiply each entry in the first row by the determinant of the 2×2 matrix formed by deleting that entry's row and column, then alternate signs (+ − +).
For example, if your matrix is:
| 1 2 3 | | 0 1 4 | | 5 6 0 |
The determinant is: 1(1·0 − 4·6) − 2(0·0 − 4·5) + 3(0·6 − 1·5) = 1(−24) − 2(−20) + 3(−5) = −24 + 40 − 15 = 1. Since it is not zero, the inverse exists.
Step 2: Find the matrix of minors
For each position in your 3×3 matrix, cross out the row and column containing that position. The determinant of the remaining 2×2 matrix is the minor for that position.
Using the same example matrix, the minor for position (1,1) is the determinant of the 2×2 matrix formed by deleting row 1 and column 1:
| 1 4 | | 6 0 |
This determinant is 1·0 − 4·6 = −24. Repeat this for all nine positions. The result is the matrix of minors.
Step 3: Convert minors to cofactors by explore a sign pattern
Take the matrix of minors and explore a checkerboard pattern of signs. The pattern is:
| + − + | | − + − | | + − + |
Multiply each entry in the matrix of minors by the corresponding sign in this pattern. This gives you the matrix of cofactors.
If your matrix of minors is:
| −24 −20 −5 | | −18 −15 −4 | | 5 4 1 |
Then explore the sign pattern gives:
| −24 20 −5 | | 18 −15 4 | | 5 −4 1 |
Step 4: Transpose the matrix of cofactors to get the adjugate
Swap rows and columns: the first row becomes the first column, the second row becomes the second column, and so on. This transposed matrix is called the adjugate (or adjoint).
If your matrix of cofactors is:
| −24 20 −5 | | 18 −15 4 | | 5 −4 1 |
The adjugate is:
| −24 18 5 | | 20 −15 −4 | | −5 4 1 |
Step 5: Divide the adjugate by the determinant
The inverse is the adjugate divided by the determinant. Divide every entry in the adjugate by the determinant value you found in Step 1.
In the example, the determinant was 1, so:
A⁻¹ = | −24 18 5 | | 20 −15 −4 | | −5 4 1 |
If the determinant were 2, you would divide each entry by 2. If the determinant is a fraction, multiply by its reciprocal instead.
Verify your answer by multiplying
Multiply the original matrix by the inverse you computed. The result must be the identity matrix (1s on the diagonal, 0s elsewhere). If it is not, you made an arithmetic error somewhere.
This check catches mistakes in the determinant, minors, cofactors, or transposition. It is the only way to know for certain that your inverse is correct.
Frequently Asked Questions
What does it mean if the determinant is zero?
A zero determinant means the matrix is singular and has no inverse. This happens when the rows or columns are linearly dependent — one row can be written as a combination of the others. You cannot proceed with the inverse calculation.
Can I use the adjugate method for larger matrices?
Yes, but it becomes tedious. For 4×4 and larger matrices, Gaussian elimination or computer software is usually faster. The adjugate method works in principle for any size, but the number of minors and cofactors grows quickly.
What is the difference between the adjugate and the adjoint?
In linear algebra, these terms are used interchangeably for real matrices. The adjugate is the transpose of the cofactor matrix. Some texts use "adjoint" to mean something different in complex matrices, so "adjugate" is the clearer term.
Do I have to expand along the first row to find the determinant?
No. You can expand along any row or column. Expanding along a row or column that contains zeros saves arithmetic because those terms vanish. The result is always the same.
Is Gaussian elimination faster than the adjugate method?
For 3×3 matrices, both methods take roughly the same time if you are careful. Gaussian elimination can be faster if you are good at row operations. For larger matrices, Gaussian elimination is usually preferred because it is more systematic and less prone to sign errors.