A solution is a triple that satisfies all three equations
(1, 2, 3) means x = 1, y = 2, z = 3, together. A triple that satisfies two of the three equations is not a partial solution; it is not a solution.
A solution is now an ordered triple, and each equation describes a plane. The method is elimination used twice: remove one variable from two different pairs of equations, solve the two-variable system that remains, and back-substitute.
Core ideas
Nothing new is needed. What is new is the bookkeeping, and one decision that is easy to get wrong.
(1, 2, 3) means x = 1, y = 2, z = 3, together. A triple that satisfies two of the three equations is not a partial solution; it is not a solution.
This is the step that goes wrong. Removing x from one pair and y from another leaves two equations containing three unknowns between them, and nothing has been reduced.
One solution, none, or infinitely many. In three variables the infinite case can be a line or a plane, and the algebra reports which by how many variables are left free.
The material
The reduction to a two-variable system, the geometry of each outcome, and the bookkeeping that keeps it honest.
An equation that can be written ax + by + cz = d with a, b, c not all zero. Its graph is a plane in space. A solution of a system of such equations is an ordered triple (x, y, z) satisfying every equation in the system.
The method: choose a variable, eliminate it from two different pairs of equations, and you are left with two equations in the remaining two unknowns — the situation of “Solving by Elimination”. Solve that, then back-substitute into any original equation to recover the variable that was eliminated.
Suppose x is eliminated from E₁ and E₂ to give A, and from E₁ and E₃ to give B, where the coefficient of x in E₁ is not zero. Then every solution of the original system satisfies A and B; and for each pair (y, z) satisfying A and B, equation E₁ determines exactly one x, and the resulting triple solves the original system.
The theorem is “Solving by Elimination”'s theorem used twice, which is why every elimination must keep E₁ intact and combine it with something else. It also explains the requirement that the two new equations come from different pairs: two combinations of E₁ and E₂ alone tell you only what E₁ and E₂ already said, and E₃ never enters the calculation.
That picture is worth having and is not worth relying on. Nobody reads a triple off a drawing of three planes, and the prism case in particular is invisible until the algebra produces a false statement. The algebra is the arbiter here even more completely than in “Systems of Two Linear Equations”.
Replace E₃ above by 3x + 4z = 15, which is E₁ + E₂. Eliminating x twice now ends in 0 = 0, and the solution set is a line: (9 − 4t, t, 3t − 3).
At t = 1 the triple is (5, 1, 0), and 5 + 1 + 0 = 6, 10 − 1 + 0 = 9, 15 + 0 = 15. At t = 2 it is (1, 2, 3), the solution the original system had on its own. One equation of the three was never carrying any information.
A false statement means the opposite. x + y + z = 3 together with 2x + 2y + 2z = 7 gives 0 = 1 on the first elimination, and the system is inconsistent no matter what the third equation says.
This bookkeeping is the entire content of “Matrices and Row Operations”. Once the columns are aligned and every coefficient has a fixed position, the letters x, y, z are doing no work, and deleting them costs nothing.
Interactive
Gaussian elimination on the augmented matrix, then back substitution
Method
Four moves. Write the plan down before doing any arithmetic.
x, y, z in that order in every equation, constants on the right, and a 0 written in for any variable that does not appear. Alignment errors account for most of the wrong answers in this lesson.
Look for a coefficient of 1 or −1, or two coefficients that are already opposites. Ten seconds spent here saves a page.
E1 with E2, and E1 with E3, is the standard choice and uses all three equations. Label each result with the combination that made it.
The third check is not ceremonial: it is the only test of the arithmetic you did during the elimination itself.
x has coefficients 1, 2, −1, so it is the cheap variable to remove: E2 − 2E1 and E3 + E1, both against E1.
Both eliminations removed x, which is the point of the whole exercise. E2 + 2E3 would also have been acceptable — a different pair, the same variable, giving 3y + 11z = 39. What is not acceptable is removing a different variable the second time: 2E2 + E3 gives 3x + 10z = 33, a perfectly true equation in x and z, which together with A in y and z involves three unknowns and leaves the system exactly as large as it was.
The back-substitution runs backwards through the work: z from the sum, y from A, x from E1. Substituting into E2 or E3 instead is equally valid and slightly more arithmetic; what matters is that all three are used for the final check.
Faded rehearsal: for x + y + z = 4, 2x − y + z = 1, −x + 3y + 2z = 9, the plan is supplied: form E2 − 2E1 and E3 + E1, so x leaves both new equations. Carry out those two combinations, solve the resulting system, and test the triple in all three originals.
State which variable is leaving and which two pairs will remove it, then execute in exact fractions and check in all three original equations. A three-variable system solved by improvising comes out right about half the time; solved to a plan it is routine, and the plan is precisely what “Gaussian Elimination” automates.
Something to change about this lesson? Write it down, tick it off when it is handled, and export the list when you want to act on it. Kept in this browser only: nothing is sent anywhere, and nobody is notified.
No recommendations yet for this lesson.