Solving a System of Equations by the Matrix Method
A system of linear equations can be written as a single matrix equation and solved in one clean step using the inverse of a matrix. This is the Class-12 "matrix method" for simultaneous equations.
If det(A)=0, then A−1 exists, and multiplying both sides on the left by A−1 gives
X=A−1B,where A−1=det(A)1adj(A).
So you compute det(A), then adj(A), form A−1, and multiply by B. The single column X=A−1B hands you x, y, z at once, and because A−1 is unique, the solution is unique.
Watch out
Multiply in the correct order: X=A−1B, not BA−1. Matrix multiplication is not commutative, and BA−1 is not even defined here.
When det(A)=0
If det(A)=0, A−1 does not exist and the inverse method fails. The system is then either inconsistent (no solution) or has infinitely many solutions. Decide which by computing (adjA)B:
(adjA)B=O → no solution (inconsistent).
(adjA)B=O → infinitely many solutions (consistent, dependent). …
Multiply the scalars in, add, and equate entries. Every constraint gives x=4 (the (2,2) entry also allows x=0, which is excluded). So the non-zero value is x=4.
Turning the matrix equation into scalar equations
Two matrices are equal iff their corresponding entries are equal, so we simplify each side and compare positions.