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 inverse of a scalar multiple of an invertible matrix is the reciprocal of the scalar times the original inverse. For A given, (3A)−1=31A−1, and A−1 is computed explicitly.
We start with the core idea: if you scale a matrix by a nonzero constant, its inverse simply scales back by the reciprocal. This is because matrix multiplication is linear in each factor — scaling the whole matrix is like scaling every entry, and the inverse must undo that scaling.
1. Proving the general property
Let A be an n×n invertible matrix and k=0 a scalar. We need to show that (kA)−1=k1A−1.
Recall the definition: B is the inverse of C if BC=I=CB. So check:
(kA)(k1A−1)=k⋅k1⋅AA−1=1⋅I=I.
Similarly, (k1A−1)(kA)=I. Since the inverse is unique, the result follows.
Watch out
This only holds if k=0. If k=0, the matrix kA is the zero matrix, which is not invertible.
2. Applying to the given matrix
We have A=2−11−12−11−12. First, find A−1.
A common method: use the formula A−1=detA1adj(A). Compute detA: