Free Mathematics Class 12 CBSE notes · practise this chapter with an AI quiz

← All study notes

How a Matrix Inverse Solves a Whole System of Equations at Once

Build the adjoint of a square matrix and verify A(adj A) = |A|I, tell singular from non-singular matrices and compute inverses, decide whether a linear system is consistent, and solve systems with a unique solution by the matrix method.

How can matrices solve a system of equations in one go?

A set of linear equations can be written as a single matrix equation AX=BAX = B. If AA has an inverse, the solution is simply X=A−1BX = A^{-1}B — and determinants tell us when that inverse exists.

This part covers the adjoint, singular matrices and the inverse, the consistency of linear systems, and the matrix method.

How do you construct the adjoint of a square matrix and verify that A(adj A) = (adj A)A = |A|I?

The adjoint of a square matrix is the transpose of its matrix of cofactors, and multiplying a matrix by its adjoint in either order gives ∣A∣|A| times the identity matrix.

Construction.
Replace every entry by its cofactor, then take the transpose:

adj A=[Aij]′\text{adj } A = [A_{ij}]'

Shortcut for order 2. For A=[abcd]A = \begin{bmatrix} a & b \\ c & d \end{bmatrix}, swap the diagonal entries and change the signs of the other two:

adj A=[d−b−ca]\text{adj } A = \begin{bmatrix} d & -b \\ -c & a \end{bmatrix}

Worked example — verify. Let A=[2314]A = \begin{bmatrix} 2 & 3 \\ 1 & 4 \end{bmatrix}, so ∣A∣=8−3=5|A| = 8 - 3 = 5 and adj A=[4−3−12]\text{adj } A = \begin{bmatrix} 4 & -3 \\ -1 & 2 \end{bmatrix}.

A(adj A)=[8−3−6+64−4−3+8]=[5005]=5IA(\text{adj } A) = \begin{bmatrix} 8 - 3 & -6 + 6 \\ 4 - 4 & -3 + 8 \end{bmatrix} = \begin{bmatrix} 5 & 0 \\ 0 & 5 \end{bmatrix} = 5I

An everyday example. A cook who has scaled up every ingredient can recover the original recipe by reversing the steps and then dividing — the adjoint handles the reversal, and ∣A∣|A| the scaling.

The substance. For order 3, forgetting the final transpose leaves the cofactor matrix, which is not the adjoint.

How do you tell singular from non-singular matrices and find an inverse using the adjoint?

A square matrix is singular if its determinant is zero and non-singular otherwise, and only a non-singular matrix has an inverse, given by A−1=1∣A∣ adj AA^{-1} = \dfrac{1}{|A|}\,\text{adj } A.

Classification:

-
Singular
— ∣A∣=0|A| = 0; no inverse
- Non-singular — ∣A∣≠0|A| \ne 0; invertible, with AA−1=A−1A=IAA^{-1} = A^{-1}A = I

Worked example — an inverse. For A=[2314]A = \begin{bmatrix} 2 & 3 \\ 1 & 4 \end{bmatrix} with ∣A∣=5|A| = 5:

A−1=15[4−3−12]A^{-1} = \frac{1}{5}\begin{bmatrix} 4 & -3 \\ -1 & 2 \end{bmatrix}

Worked example — a singular matrix. ∣2436∣=12−12=0\begin{vmatrix} 2 & 4 \\ 3 & 6 \end{vmatrix} = 12 - 12 = 0, so [2436]\begin{bmatrix} 2 & 4 \\ 3 & 6 \end{bmatrix} has no inverse — its second row is 1.51.5 times its first.

An everyday example. Converting a recipe from 4 servings to 10 and back again works because the scaling can be undone; a step that throws information away, like a singular matrix, cannot be reversed.

The substance. Check ∣A∣≠0|A| \ne 0 before computing an inverse — the adjoint exists even when the inverse does not.

How do determinants decide whether a system of linear equations is consistent and how many solutions it has?

For AX=BAX = B: if ∣A∣≠0|A| \ne 0 the system is consistent with a unique solution; if ∣A∣=0|A| = 0, compute (adj A)B(\text{adj } A)B — a non-zero result means no solution, and a zero result means infinitely many solutions or none.

The test:


- ∣A∣≠0|A| \ne 0 — unique solution
- ∣A∣=0|A| = 0 and (adj A)B≠O(\text{adj } A)B \ne O — no solution
- ∣A∣=0|A| = 0 and (adj A)B=O(\text{adj } A)B = O — infinitely many solutions or none; check further

Worked example — inconsistent. x+2y=3x + 2y = 3 and 2x+4y=72x + 4y = 7.

∣A∣=∣1224∣=0(adj A)B=[4−2−21][37]=[−21]≠O|A| = \begin{vmatrix} 1 & 2 \\ 2 & 4 \end{vmatrix} = 0 \qquad (\text{adj } A)B = \begin{bmatrix} 4 & -2 \\ -2 & 1 \end{bmatrix}\begin{bmatrix} 3 \\ 7 \end{bmatrix} = \begin{bmatrix} -2 \\ 1 \end{bmatrix} \ne O

The system is inconsistent: the lines are parallel.

Worked example — infinitely many. For x+2y=3x + 2y = 3 and 2x+4y=62x + 4y = 6, (adj A)B=[12−12−6+6]=O(\text{adj } A)B = \begin{bmatrix} 12 - 12 \\ -6 + 6 \end{bmatrix} = O, and both equations describe the same line.

An everyday example. If one shop says 1 pen and 2 pencils cost ₹30, and another says 2 pens and 4 pencils cost ₹70, no single set of prices fits both — the system is inconsistent.

The substance. ∣A∣=0|A| = 0 alone never decides between no solution and infinitely many — the extra check is essential.

How do you solve a system of linear equations by the matrix-inverse method?

Write the system as AX=BAX = B, check that ∣A∣≠0|A| \ne 0, find A−1A^{-1} using the adjoint, and compute X=A−1BX = A^{-1}B to read off the unique solution.

Worked example — two variables.
Solve 2x+3y=132x + 3y = 13 and x+4y=14x + 4y = 14.

A=[2314],B=[1314],∣A∣=5A = \begin{bmatrix} 2 & 3 \\ 1 & 4 \end{bmatrix}, \quad B = \begin{bmatrix} 13 \\ 14 \end{bmatrix}, \quad |A| = 5

X=A−1B=15[4−3−12][1314]=15[52−42−13+28]=[23]X = A^{-1}B = \frac{1}{5}\begin{bmatrix} 4 & -3 \\ -1 & 2 \end{bmatrix}\begin{bmatrix} 13 \\ 14 \end{bmatrix} = \frac{1}{5}\begin{bmatrix} 52 - 42 \\ -13 + 28 \end{bmatrix} = \begin{bmatrix} 2 \\ 3 \end{bmatrix}

So x=2x = 2 and y=3y = 3. Check: 2(2)+3(3)=132(2) + 3(3) = 13 and 2+4(3)=142 + 4(3) = 14.

Three variables. The same steps work for a 3×33 \times 3 system, using all nine cofactors.

An everyday example. A shopkeeper who knows the total cost of two different mixes of rice and dal can find the price per kilogram of each by solving exactly this kind of system.

The substance. The method needs ∣A∣≠0|A| \ne 0 — when the determinant is zero, use the consistency test instead.
Exam tip

What earns full marks on the adjoint, inverse and matrix method?

Find ∣A∣|A| first and write it down — if it is zero, say so and switch to the consistency test instead of forcing an inverse.

-
Adjoint
: transpose of the cofactor matrix; for order 2, swap aa and dd and negate bb and cc
- Identity: A(adj A)=(adj A)A=∣A∣IA(\text{adj } A) = (\text{adj } A)A = |A|I
- Inverse: A−1=1∣A∣adj AA^{-1} = \dfrac{1}{|A|}\text{adj } A, only when ∣A∣≠0|A| \ne 0
- Consistency: ∣A∣≠0|A| \ne 0 gives a unique solution; ∣A∣=0|A| = 0 with (adj A)B≠O(\text{adj } A)B \ne O gives none
- Matrix method: X=A−1BX = A^{-1}B, then substitute back

The trap. Computing BA−1BA^{-1} instead of A−1BA^{-1}B. Order matters — the inverse goes on the left.
Did you know

How can a matrix inverse unlock a secret code?

One classic way to scramble a message turns letters into numbers — A as 1, B as 2 and so on — groups them in pairs, and multiplies each pair by a fixed 2×22 \times 2 encoding matrix.

The scrambled numbers look random. Anyone who knows the matrix can unscramble them by multiplying by its inverse, recovering the original pairs.

This only works if the encoding matrix is non-singular — a singular matrix would send different messages to the same code, and no inverse could separate them again.
Exam relevance

How are the adjoint, inverse and linear systems tested in JEE Main?

Determinants completes the JEE Main unit Matrices and Determinants, and the adjoint-inverse results are among its most used tools.

What gets asked. Properties such as ∣adj A∣=∣A∣n−1|\text{adj } A| = |A|^{n-1} and (AB)−1=B−1A−1(AB)^{-1} = B^{-1}A^{-1}, values of a parameter for which a system has a unique solution, no solution or infinitely many, and specific entries of an inverse. JEE Advanced regularly tests the consistency of systems containing a parameter.

Question types. Multiple-choice and numerical-value questions, often built around a parameter in the coefficient matrix.

The trap that costs marks. Concluding infinitely many solutions just because ∣A∣=0|A| = 0.
Key takeaways

What must you be able to do from this part?

- Adjoint: transpose of the cofactor matrix; A(adj A)=(adj A)A=∣A∣IA(\text{adj } A) = (\text{adj } A)A = |A|I
- Inverse: only for non-singular AA; A−1=1∣A∣adj AA^{-1} = \dfrac{1}{|A|}\text{adj } A
- Consistency: ∣A∣≠0|A| \ne 0 gives a unique solution; ∣A∣=0|A| = 0 needs the (adj A)B(\text{adj } A)B check
- Matrix method: X=A−1BX = A^{-1}B; 2x+3y=132x + 3y = 13 and x+4y=14x + 4y = 14 give x=2x = 2, y=3y = 3

For which value of kk does the system x+ky=2x + ky = 2, 2x+6y=52x + 6y = 5 fail to have a unique solution — and is it then inconsistent?

Ready to put this into practice?

Create a personalized quiz on this exact topic — free to start.

Create your own quiz on Determinants — Part 2Create a free account
← Back to all articles