Many problems reduce to a system of linear equations, for example
2x+3yx−y=8=−1.
The inverse matrix method solves such a system by writing it as a single matrix equation and then undoing the coefficient matrix with its inverse — the matrix analogue of dividing.
Writing the system as AX=B
Collect the coefficients, the unknowns and the constants:
A=(213−1),X=(xy),B=(8−1),
so the whole system becomes AX=B.
The idea
For numbers, ax=b gives x=a−1b provided a=0. The same works for matrices: if A is invertible, multiply AX=B on the left by A−1:
A−1(AX)=A−1B⇒IX=A−1B⇒X=A−1B.
X=A−1B
Multiplying on the left matters — matrix products do not commute, so BA−1 would be wrong.
When it works
The inverse A−1 exists only when detA=0, so:
detA=0: the system is consistent with the unique solution X=A−1B.
detA=0: no inverse; the system is either inconsistent (no solution) or has infinitely many — handle it by another method.
Worked steps
For the system above, detA=(2)(−1)−(3)(1)=−5=0, and
The system is solved by writing it as AX=B, finding A−1 via the adjoint method, and computing X=A−1B. The solution is x=1, y=1, z=1.
The Inverse Matrix Method is a clean, algebraic way to solve a system of linear equations when the number of equations equals the number of unknowns. The idea is simple: if you can write the system as a single matrix equation AX=B, and if the coefficient matrix A is invertible (i.e., its determinant is non-zero), then you can multiply both sides by A−1 to get X=A−1B. This turns the problem of solving for x,y,z into a single matrix multiplication — elegant and systematic.
Let’s apply it step by step.
1. Write the system in matrix form
The given equations are:
3x+2y−2zx+2y+3z2x−y+z=3=6=2
This becomes:
A=31222−1−231,X=xyz,B=362
So AX=B.
2. Check that A is invertible
We need detA=0. Compute the determinant:
detA=32−131−21231+(−2)122−1
=3(2⋅1−3⋅(−1))−2(1⋅1−3⋅2)−2(1⋅(−1)−2⋅2)
=3(2+3)−2(1−6)−2(−1−4)
=3(5)−2(−5)−2(−5)=15+10+10=35
Since detA=35=0, A−1 exists.
Watch out
A common mistake is to forget the sign pattern in the cofactor expansion. The (−2) in the third term already carries the sign from its position (1,3): the cofactor sign is (−1)1+3=+1, so we simply multiply by −2 (the entry itself). No extra sign change.
3. Find A−1 using the adjoint method
Recall:
A−1=detA1⋅adj(A)
where adj(A) is the transpose of the cofactor matrix.
First, find all cofactors Cij=(−1)i+jMij, where Mij is the minor (determinant after removing row i, column j).
Method: Solving a System of Linear Equations by the Matrix (Inverse) Method
Use this method whenever a problem explicitly asks you to "solve using the matrix method" a system with as many equations as unknowns.
Steps
Step 1: Write the system as AX=B
Collect the coefficients of x,y,z into a matrix A, the unknowns into a column X, and the constants into a column B, so the whole system becomes the single matrix equation AX=B.
Step 2: Confirm A is invertible
Compute ∣A∣ by cofactor expansion. If ∣A∣=0, the system has a unique solution and the inverse method applies directly (if ∣A∣=0, this method fails, and consistency must instead be checked via (adjA)B).
Step 3: Find A−1 via the adjoint
Compute every cofactor Cij, transpose to get adj(A), then …
Mistake 1: Dropping or mis-assigning the cofactor sign (−1)i+j
Why it's wrong: with nine 2×2 minors to compute, it's easy to forget the alternating +,−,+ pattern (e.g. treating C12 or C32 as positive) — a single sign error silently produces a wrong adjoint and a wrong solution even though every individual 2×2 minor was computed correctly.
Mistake 2: Using the cofactor matrix directly as the adjoint, without transposing
Why it's wrong: adj(A) is the transpose of the cofactor matrix, not the cofactor matrix itself. Skipping the transpose swaps off-diagonal entries (e.g. using C12 where C21 belongs) and gives a matrix that isn't actually A−1 once divided by detA. …