Skip to main content
SingaporeFurther MathsSyllabus dot point

How do we invert a matrix and use it to solve a system of linear equations?

Find the inverse of a non-singular matrix and use matrices to solve systems of linear equations, recognising consistent, inconsistent and dependent cases

A focused answer to the H2 Further Mathematics outcome on inverse matrices and linear systems. The 2x2 inverse formula, the adjugate method and row reduction for 3x3, solving systems by the inverse, and classifying consistent, inconsistent and dependent systems.

Generated by Claude Opus 4.811 min answer

Reviewed by: AI editorial process; not yet individually human-reviewed

Have a quick question? Jump to the Q&A page

Jump to a section
  1. What this dot point is asking
  2. The answer
  3. Examples in context
  4. Try this

What this dot point is asking

SEAB wants you to find the inverse of a non-singular square matrix and use it to solve a system of linear equations written in the form Ax=b\mathbf{Ax} = \mathbf{b}. You must also classify a system as having a unique solution, no solution (inconsistent), or infinitely many solutions (dependent), and interpret each case.

The answer

When an inverse exists

A square matrix A\mathbf{A} has an inverse A1\mathbf{A}^{-1} (with AA1=A1A=I\mathbf{A}\mathbf{A}^{-1} = \mathbf{A}^{-1}\mathbf{A} = \mathbf{I}) if and only if detA0\det\mathbf{A} \neq 0. If detA=0\det\mathbf{A} = 0 the matrix is singular and has no inverse.

The 2x2 inverse

For A=(abcd)\mathbf{A} = \begin{pmatrix} a & b \\ c & d \end{pmatrix} with detA=adbc0\det\mathbf{A} = ad - bc \neq 0,

A1=1adbc(dbca).\mathbf{A}^{-1} = \frac{1}{ad - bc}\begin{pmatrix} d & -b \\ -c & a \end{pmatrix}.

Swap the leading diagonal, negate the off-diagonal, and divide by the determinant.

The 3x3 inverse

Two reliable methods:

  • Adjugate method: A1=1detAadjA\mathbf{A}^{-1} = \dfrac{1}{\det\mathbf{A}}\operatorname{adj}\mathbf{A}, where the adjugate is the transpose of the cofactor matrix.
  • Row reduction: augment [AI][\mathbf{A} \mid \mathbf{I}] and apply row operations until the left block becomes I\mathbf{I}; the right block is then A1\mathbf{A}^{-1}.

In practice the graphing calculator computes a numerical inverse, but the method must be shown when a question asks for it.

Solving a system by the inverse

A system of nn equations in nn unknowns is Ax=b\mathbf{Ax} = \mathbf{b}. If A\mathbf{A} is invertible, the unique solution is

x=A1b.\mathbf{x} = \mathbf{A}^{-1}\mathbf{b}.

Classifying systems

When detA0\det\mathbf{A} \neq 0 there is a unique solution. When detA=0\det\mathbf{A} = 0 the system is either:

  • inconsistent: the equations contradict (parallel planes with no common point), giving no solution; or
  • dependent: the equations are not independent, giving infinitely many solutions described by one or more parameters (planes meeting in a line, or all the same plane).

Row reduction reveals which case holds: a row (000c)\begin{pmatrix} 0 & 0 & 0 \mid c \end{pmatrix} with c0c \neq 0 is inconsistent, while (0000)\begin{pmatrix} 0 & 0 & 0 \mid 0 \end{pmatrix} signals a free parameter.

Examples in context

Example 1. Balancing a network. Currents in a circuit obeying Kirchhoff's laws, or flows in a transport network, form a linear system Ax=b\mathbf{Ax} = \mathbf{b}. A non-singular A\mathbf{A} gives a unique set of currents; a singular one signals a redundancy or an impossible demand.

Example 2. Three planes in space. Three linear equations in x,y,zx, y, z are three planes. They meet in a single point (unique solution), in a common line or plane (dependent, infinitely many), or in no common point (inconsistent), exactly mirroring the algebraic classification.

Try this

Q1. State the condition for a square matrix to be invertible. [1 mark]

  • Cue. Its determinant is non-zero (detA0\det\mathbf{A} \neq 0).

Q2. Write the inverse of (2013)\begin{pmatrix} 2 & 0 \\ 1 & 3 \end{pmatrix}. [2 marks]

  • Cue. det=6\det = 6, so 16(3012)\dfrac{1}{6}\begin{pmatrix} 3 & 0 \\ -1 & 2 \end{pmatrix}.

Q3. A 3×33\times3 system has detA=0\det\mathbf{A} = 0 and reduces to a row (0 0 04)(0\ 0\ 0 \mid 4). What can you conclude? [1 mark]

  • Cue. The system is inconsistent and has no solution.

Exam-style practice questions

Practice questions written in the style of SEAB exam questions on this dot point, with worked answer explainers. The year tag is the paper they imitate, not the source.

Original5 marksFind the inverse of A=(4322)\mathbf{A} = \begin{pmatrix} 4 & 3 \\ 2 & 2 \end{pmatrix} and hence solve {4x+3y=12x+2y=0\begin{cases} 4x + 3y = 1 \\ 2x + 2y = 0 \end{cases}.
Show worked answer →

Determinant: detA=4(2)3(2)=86=20\det\mathbf{A} = 4(2) - 3(2) = 8 - 6 = 2 \neq 0, so A\mathbf{A} is invertible.

For a 2×22\times2 matrix, A1=1detA(dbca)=12(2324)=(13212)\mathbf{A}^{-1} = \dfrac{1}{\det\mathbf{A}}\begin{pmatrix} d & -b \\ -c & a \end{pmatrix} = \dfrac{1}{2}\begin{pmatrix} 2 & -3 \\ -2 & 4 \end{pmatrix} = \begin{pmatrix} 1 & -\tfrac{3}{2} \\ -1 & 2 \end{pmatrix}.

Write the system as A(xy)=(10)\mathbf{A}\begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} 1 \\ 0 \end{pmatrix}, so (xy)=A1(10)=(11)\begin{pmatrix} x \\ y \end{pmatrix} = \mathbf{A}^{-1}\begin{pmatrix} 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 1 \\ -1 \end{pmatrix}.

Hence x=1x = 1, y=1y = -1.

Markers reward the non-zero determinant, the swap-and-negate inverse formula, expressing the system as Ax=b\mathbf{Ax} = \mathbf{b}, and the solution x=1x = 1, y=1y = -1.

Original6 marksThe system {x+y+z=22x+3y+z=33x+4y+2z=k\begin{cases} x + y + z = 2 \\ 2x + 3y + z = 3 \\ 3x + 4y + 2z = k \end{cases} is to be solved. Determine the value of kk for which the system is consistent, and describe the solution set in that case.
Show worked answer →

Add the first two equations cleverly or use elimination. Note that (row 1) + (row 2) gives 3x+4y+2z=53x + 4y + 2z = 5. The third equation says 3x+4y+2z=k3x + 4y + 2z = k.

For consistency the two expressions for 3x+4y+2z3x + 4y + 2z must agree, so k=5k = 5.

When k=5k = 5 the third equation is the sum of the first two, so it carries no new information; the system reduces to two independent equations in three unknowns. There is therefore a one-parameter family of solutions (a line of solutions), not a unique point.

Let z=tz = t. From row 1, x+y=2tx + y = 2 - t; from row 2, 2x+3y=3t2x + 3y = 3 - t. Solving: y=(3t)2(2t)=t1y = (3 - t) - 2(2 - t) = t - 1, and x=(2t)(t1)=32tx = (2 - t) - (t - 1) = 3 - 2t. So (x,y,z)=(32t, t1, t)(x, y, z) = (3 - 2t,\ t - 1,\ t).

Markers reward spotting the dependence, the condition k=5k = 5 for consistency, recognising a one-parameter (line) solution set, and a correct parametric solution.

Related dot points