Systems of Linear Equations (3+ Variables)

A system of linear equations with three or more variables consists of multiple equations that must all be satisfied simultaneously. In three variables — typically x, y, and z — each equation represents a plane in three-dimensional space. The solution to the system is the point (or set of points) where all these planes intersect at once. Just as two lines in 2D can intersect at a single point, be parallel, or overlap, three planes in 3D can meet at a unique point, along a line, along a plane, or not at all. These systems arise naturally in science and engineering: balancing chemical equations, analyzing electrical circuits with multiple loops, or optimising a mixture of three ingredients in a recipe. The tools used to solve them — substitution, elimination, and matrix methods — are direct extensions of the techniques you already know from two-variable systems, scaled up to handle greater complexity. The two main systematic methods taught at high school level are Gaussian elimination (row reduction) and back-substitution. Both methods transform the original system into a simpler, triangular form from which the values of each variable can be read off one at a time. Mastering these methods builds the foundation for linear algebra, a cornerstone of university mathematics and data science.

Key takeaways

Write the augmented matrix
Use row operations to create zeros below the first pivot
Create zeros below the second pivot
Back-substitution
Interpreting special cases

Write the augmented matrix

List the coefficients of each variable and the constant term in a rectangular array called an augmented matrix. For the system a1x + b1y + c1z = d1, a2x + b2y + c2z = d2, a3x + b3y + c3z = d3, the augmented matrix is [a1 b1 c1 | d1; a2 b2 c2 | d2; a3 b3 c3 | d3]. This compact notation makes row operations easier to track.

Use row operations to create zeros below the first pivot

Choose the top-left entry as the first pivot. Use the operation Ri → Ri − (ai1/a11) R1 on each row i below row 1 to eliminate x from those rows. Allowed row operations are: (i) swap two rows, (ii) multiply a row by a non-zero constant, (iii) add a multiple of one row to another. These operations preserve the solution set.

Create zeros below the second pivot

Focus on the second column starting from row 2. Use the second row to eliminate y from all rows below it, applying R3 → R3 − (a32_new/a22_new) R2. After this step the matrix is in row-echelon form: a staircase of leading (non-zero) entries descends from top-left to bottom-right, with zeros below each pivot.

Back-substitution

The last non-zero row now contains only z (or one variable). Solve for it directly. Substitute that value into the second row to find y, then substitute both z and y into the first row to find x. Always check your answer by substituting all three values back into every original equation.

Interpreting special cases

If a row reduces to 0 = k (where k ≠ 0), the system is inconsistent — there is no solution, and the planes do not share a common point. If a row reduces to 0 = 0, the system is dependent — infinitely many solutions exist along a line or plane. The number of free parameters equals the number of such zero rows.

The Key Equation

\begin{pmatrix} a_1 & b_1 & c_1 \\ a_2 & b_2 & c_2 \\ a_3 & b_3 & c_3 \end{pmatrix} \begin{pmatrix} x \\ y \\ z \end{pmatrix} = \begin{pmatrix} d_1 \\ d_2 \\ d_3 \end{pmatrix}

a_i,\, b_i,\, c_i — Coefficients (dimensionless): The numerical multipliers of x, y, and z in the i-th equation.
x,\, y,\, z — Unknown variables (dimensionless): The three quantities to be determined that satisfy all equations simultaneously.
d_i — Constant (right-hand side) (dimensionless): The known value on the right side of the i-th equation.

Worked Example

Problem. Solve the system: x + y + z = 6, 2x − y + z = 3, x + 2y − z = 4.

x = \dfrac{11}{7},\quad y = \dfrac{16}{7},\quad z = \dfrac{15}{7}

Answer. x = 11/7, y = 16/7, z = 15/7

Figure

Diagram

Origins · 1 minCarl Friedrich Gauss and how this was discovered

Carl Friedrich Gauss

1777–1855 · German

Gauss developed the method of systematic elimination for solving linear systems — now called Gaussian elimination — while computing the orbit of the asteroid Ceres in 1801. He used the method to handle large systems of equations arising from least-squares fitting of astronomical data, laying the groundwork for numerical linear algebra. Gauss reportedly summed the integers from 1 to 100 in seconds as a young child by recognising the pairing trick: 1+100 = 2+99 = … = 50 pairs of 101, giving 5050.

Substitution Method for Linear Equations — Substitution is the foundational technique extended in back-substitution when solving triangular systems from Gaussian elimination.
Elimination Method for Linear Equations — Gaussian elimination is a systematic, matrix-based generalisation of the elimination method used for 2-variable systems.
Introduction to Matrices — Systems of linear equations are naturally represented as matrix equations Av = d, making matrix knowledge essential.
Determinant of a Matrix — The determinant of the coefficient matrix tells you immediately whether a unique solution exists (det ≠ 0) or not (det = 0).
Graphical Interpretation of Linear Equations — Understanding that each 3-variable equation is a plane in 3D space gives geometric intuition for why systems can have unique, infinite, or no solutions.