IB Syllabus Requirements for Systems of Equations
AHL 1.16
Solutions of systems of linear equations
AHL 1.16
SOLUTIONS OF SYSTEMS OF LINEAR EQUATIONS
A linear equation is an equation where each unknown appears only to the first power, and no unknown is multiplied by another unknown. For example,
Here and are unknown quantities, and are coefficients multiplying those unknowns, and is the constant term. The units of , and depend on the context; and take whatever units are needed to make the equation dimensionally consistent.
A system of linear equations is a set of linear equations that all have to be true at the same time. A solution is an ordered pair or ordered triple of values that satisfies every equation in the system simultaneously. In this topic, the IB limit is a maximum of three equations in three unknowns, so you are working with systems such as
where and are further coefficients and is a further constant term, or
where is a third unknown, , , and are further coefficients, and and are further constant terms.
Geometrically, represents a straight line in the -plane. A two-variable system is asking where the lines meet. In the same way, represents a plane in three-dimensional space, so a three-variable system asks where the planes meet. The intersection might be one point, no point, or infinitely many points.

A system is consistent if it has at least one solution. A system is inconsistent if it has no solution. A system has a unique solution if exactly one ordered pair or ordered triple satisfies all equations. It has infinitely many solutions if a whole line, plane, or coincident object satisfies the system.
For two equations in two unknowns, the picture helps a lot:
For three equations in three unknowns, use planes rather than lines. Three planes can meet in one point, fail to share a common point, or share a whole line or plane. The algebra tells you which case you have.

Elimination is an algebraic method where equations are replaced by equivalent equations so that one unknown is removed. Equivalent is the key word here: the solution set is not changing. The system is just being rewritten in a more useful form.
For example, suppose
Multiplying the second equation by would make the coefficients match. Multiplying the first by and the second by would help eliminate . One efficient route is
which gives
So , and substituting into gives . The solution is therefore .
With three equations, repeat the same idea: eliminate one unknown from two pairs of equations, leaving two equations in two unknowns; solve those; then substitute backwards. The working can get bulky, so row reduction gives a tidier notation for the same thinking.
A matrix is a rectangular array of numbers arranged in rows and columns. An augmented matrix stores the coefficients of a linear system together with the constant terms, separated by a vertical bar.
For the system
the augmented matrix is
The columns before the bar correspond, in order, to , and . The column after the bar contains the constants. This notation saves time because the letters are not rewritten each time, but every row still represents an equation.
A row operation is a change to an augmented matrix that preserves the solution set of the corresponding system. The allowed row operations are:
Row echelon form is a stepped matrix form where leading non-zero entries move to the right as you go down the rows, with any all-zero rows at the bottom. Reduced row echelon form is a row echelon form in which each leading entry is and is the only non-zero entry in its column.
For a unique solution in three unknowns, you are aiming for something like
where , and are constants representing the solved values of , and respectively. In that case, the answer is , , .
For the previous example, one row-reduction route is
using and , where , and are the first, second and third rows of the matrix.
Continuing the reduction gives
So the solution is
When you write row-reduction by hand, label your row operations beside the matrix. This is not decoration; it makes your algebra traceable and helps you spot where a wrong multiple has crept in.

The last row often carries the key row-reduction information. If row reduction produces
with , then the row represents
which is impossible. The system is inconsistent and has no solution.
If row reduction produces an all-zero row,
then that row adds no new restriction. The system may have infinitely many solutions, provided there is at least one free variable. A free variable is an unknown that is not fixed by a leading entry and can be chosen as a parameter.
For instance, after reduction you might have
The last row is harmless, but there are only two independent equations for three unknowns. Let , where is a real parameter. Then the second row gives
so
The first row gives
so
The infinitely many solutions can be written as
This is the algebraic version of saying the planes share a line.
Final augmented-matrix row patterns and the system type they indicate.
| Final augmented-matrix pattern | What it means | System type | Key condition |
|---|---|---|---|
| , | Contradiction: is impossible | No solution | Inconsistent system |
| No new restriction | Infinitely many solutions | At least one free variable remains | |
| Pivots in every variable column, e.g. , , | Each variable is fixed by a leading 1 | Unique solution | No free variables |
A parameter is a symbol that represents a fixed but unspecified constant. Parameters often appear in systems of equations when you are asked when a system is consistent, or when it changes from one type of solution to another.
Suppose row reduction leads to the final row
where is a parameter. This row represents
For the system to be consistent, the right-hand side must be zero, so
and hence
If , the last row says equals a non-zero number, so there is no solution. If , the last row becomes , and the remaining rows determine whether there is a unique solution or infinitely many solutions.
The syllabus expects both algebraic and technological methods. On a technology-allowed paper, a calculator or graphing tool can solve simultaneous equations directly, or reduce an augmented matrix to row echelon or reduced row echelon form.
The technological method is not different mathematics. It is the same system shown in another form. For a two-variable system, graphing the two lines and finding their intersection is also a valid technological approach. For three variables, matrix or simultaneous-equation tools are usually the sensible route.
Build the habit of linking the calculator output back to the system type:
That final interpretation is where many marks live. The calculator may reduce the matrix, but you still have to say what the result means.