Systems with More Variables
Learning goals
- Write and solve for ordered triples
- Eliminate the same variable from two different pairs
- Reduce to a two-variable system, then back-substitute
- Explain why each round removes an unknown and terminates
- Picture each equation as a plane meeting at a point
- Read a false or always-true leftover as the special cases
From two unknowns to three
Take the system
The triple solves it, because , and , and are all true. Each equation now holds three letters instead of two, and a solution is three numbers instead of two, one for each letter.
An equation like these, written in the standard form
is a linear equation in three variables: , , , and are numbers, , , and are not all zero, and each variable appears only to the first power. Its solutions are ordered triples . A system of three linear equations stacks three such equations and asks for the triple that satisfies all three at the same time. A single three-variable equation, like a single two-variable equation, has far too many solutions to pin the unknowns down. Fixing three unknowns takes three equations that each contribute a genuinely new condition, not one that just repeats another: three independent equations, one condition for each unknown.
The plan is to shrink the system one variable at a time. You already own the tool that removes a variable: elimination, from two lessons ago. Adding or subtracting two equations to cancel a variable worked no matter what the other letters were, so that same move works just as well when a third letter is riding along. The new idea in this lesson is purely organizational. You will run elimination twice, on two different pairs of the three equations, and both times you must cancel the same variable. Canceling the same variable is what leaves you two equations sharing the same two remaining unknowns.
Check your understanding
Which of these is written in the standard form for a linear equation in three variables?
matches with , , , and : each variable appears only to the first power, and the terms are added to equal a constant.
has a term, two variables multiplied together, so it is not linear. has squared, also not first power. has no equals sign, so it is an expression, not an equation, and cannot be solved.
The reduction strategy step by step
Every three-variable system yields to the same routine.
- Choose a variable to eliminate. Pick whichever one has the friendliest coefficients, often a variable that already appears with matching or opposite coefficients somewhere.
- Eliminate it from one pair of equations. Combine two of the three equations, by adding or subtracting (scaling first if needed), so that variable cancels. You now have one equation in the other two unknowns.
- Eliminate the same variable from a second pair. Combine a different pair, being sure to use the equation you have not touched yet, and cancel the same variable again. This gives a second equation in the same two unknowns.
- Solve the two-variable system. Those two new equations form an ordinary system in two unknowns. Solve it by substitution or elimination.
- Back-substitute for the third variable. Put the two values you found into any one of the three original equations and solve for the variable you eliminated.
- Check the triple in all three original equations. A genuine solution satisfies every one of them, not just the two you happened to use.
The one step people get wrong is step 3. If you eliminate from the first pair but then eliminate from the second, your two leftover equations do not share the same unknowns. Without the same two unknowns, those two leftover equations cannot be solved together. Cancel the same variable both times.
Worked example 1 Solve , , and
Number the equations so the bookkeeping stays clear:
Choose to eliminate . Look at the terms: equations and both have , while equation has . That makes equation the convenient partner, because adding it to either of the others cancels on the spot.
Eliminate from the first pair, equations and . Add them:
Now eliminate the same variable from a second pair, equations and , using the equation not yet touched. Add them:
Equations and form an ordinary two-variable system. Solve it by substitution: equation gives , so replace in :
Then . Back-substitute and into equation to recover :
The candidate is . Check it in all three originals, not just the two pairs you combined:
All three hold, so the solution is .
Check your understanding
You want to eliminate from the pair and . What do you get by adding the two equations?
The terms are and , opposites, so adding the equations cancels .
What remains is a single equation in and , which you would pair with a second such equation to finish.
Check your understanding
Which ordered triple solves all three equations , , and ?
Check in all three equations.
All three hold. looks tempting: it satisfies the first two equations, and , but fails the third, , not . A solution has to satisfy every equation, not just the ones you happen to check first.
Why the reduction works and always finishes
The routine trades a big system for a smaller one and repeats, and that is trustworthy only if each step keeps exactly the same solutions and the shrinking actually stops. Both follow from what you already proved for two equations.
Why eliminating a variable preserves the solution set, and why two rounds finish it#
A solution of the system is a triple that satisfies all three equations at once, and the reduction must not lose or invent one. Recall the guarantee from the elimination lesson: keep one equation untouched, replace a second equation by that equation plus a multiple of the kept one, and the new pair has exactly the same solutions as the old pair, because you can undo the step by subtracting the same multiple back. Nothing in that argument counted the letters, so it holds just as well with three variables as with two.
Apply it twice, first reordering the equations if needed so the kept equation’s coefficient on the target variable is not zero. Keep the first equation. Replace the second equation with the second minus the right multiple of the first, chosen so the target variable cancels; the solution set is unchanged. Replace the third equation the same way, subtracting a multiple of the first so its copy of the target variable cancels too; the solution set is unchanged again. What is left is the untouched first equation, still carrying all three unknowns, plus two equations that hold only the other two unknowns. Those two form an ordinary two-variable system, which you already know how to solve; back-substituting into the untouched first equation then finds the last unknown. Two rounds of elimination take three unknowns down to two, then to one, and solving that last equation directly finishes the job: the process cannot run forever.
Check your understanding
Why does the reduction always come to an end, instead of running forever, no matter which three-variable system you start with?
Each round of elimination strips away exactly one unknown: three unknowns become two, then two become one. Since a system starts with a fixed, finite number of unknowns, that shrinking cannot continue forever; it must stop once a single equation in a single unknown is left to solve directly. Which variable you eliminate is a choice, not a rule, and a three-variable system can also have no solution or infinitely many, not only one.
Because every step preserves the solution set, the strange endings carry a clear meaning. If a stage ever collapses to a false statement such as , then the original system had no triple satisfying it, so the system has no solution. Suppose instead a stage collapses to an always-true statement such as . That step added no new condition, so it did nothing to narrow the triples down. Whatever equations survive still have to be checked: infinitely many triples solve the system, or none do. In the two-variable case, with only two equations to begin with, hitting leaves nothing standing in the way, so the answer there is always infinitely many. A third equation changes that: it can still contradict the others. Consider paired with , which collapses to . Now add to that pair: eliminating against the first equation leaves as well, so the enlarged system has no solution at all.
Check your understanding
After eliminating and solving the resulting two-variable system, you find and . How do you find ?
Eliminating only set it aside; it still has a definite value. Put the two knowns back into any original equation that contains .
That is the back-substitution step, and it recovers the variable you removed.
A three-variable word problem
Three-variable systems earn their keep on problems with three unknowns and three facts. A clean example is recovering unknown prices from several receipts, where each receipt is one equation.
Worked example 2 Unknown prices from three receipts
At a snack stand the popcorn, pretzels, and drinks each have a fixed price. Three customers pay:
- one popcorn, one pretzel, and one drink cost dollars,
- two popcorns, one pretzel, and three drinks cost dollars,
- one popcorn, two pretzels, and four drinks cost dollars.
Find the price of each item.
Name the unknowns. Let , , and be the price in dollars of a popcorn, a pretzel, and a drink. Each receipt becomes one equation:
Eliminate , whose coefficient is in the first equation. Subtract twice equation from equation :
Eliminate the same variable from the untouched equation by subtracting equation :
Add and to cancel :
From , , so . Back-substitute into equation : , so .
The prices are dollars for popcorn, dollars for a pretzel, and dollar for a drink. Check the third receipt, the one held back the longest: , correct. The other two receipts check the same way.
The geometry: three planes in space
Two variables live on a flat page, and a linear equation there draws a line. Three variables live in space, and a linear equation draws a flat sheet stretching out forever, a plane. A system of three equations is then three planes, and a solution triple is a point lying on all three at once.
In the ordinary case the three planes tilt in different directions and meet at exactly one point, the single triple that solves the system. This is the picture behind almost every example in this lesson.
Check your understanding
In the ordinary case, three planes in space, one for each equation of a three-variable system, cross at exactly one shared point. What does that point represent?
A point lying on all three planes is a triple that makes every one of the three equations true at the same time, exactly the definition of a solution to the system. Parallel planes never cross at all, so that describes no shared point, not one. The point is not tied to the size of any one unknown. And a single shared point is one solution, not one of many: three planes share infinitely many points only when they meet along a whole line or coincide.
Special arrangements break that single crossing, and they match the same two exceptions you met with lines. If the planes never share a common point, the system is inconsistent and has no solution. That happens when two of them are parallel, or when all three cross each other in pairs without ever sharing one point in common. If the three planes instead share a whole common line, or even coincide as one plane, then endlessly many points lie on all three. In that case the system has infinitely many solutions. The algebra flags each case for you: eliminating variables leaves a false statement in the first situation and an always-true statement in the second.
When the reduction hits no solution or infinitely many
Worked example 3 A system with no solution
Solve
Eliminate using the first equation. Subtract equation from equation :
Now clear the same variable from equation by subtracting times equation :
Equations and read and . The same expression cannot equal both and . Subtract from to see it plainly:
This is false, so no triple satisfies all three equations, and the system has no solution. Geometrically the three planes fail to share any common point.
Worked example 4 A system with infinitely many solutions
Solve
Eliminate again with the first equation. Subtract equation from equation :
Subtract equation from equation :
Equation is exactly twice equation , so it says nothing new. Subtract times from :
The statement is always true, so the third equation added no new condition beyond the first two, and the system has infinitely many solutions: pick any value for , and gives , then equation gives . Try a few values and see the pattern:
| Triple | |||
|---|---|---|---|
Every row solves all three original equations; check the first one: , , and , all true. A different choice of gives a different triple on the same line, and there is no limit to how many you could list.
The three planes meet along this whole line rather than at a single point.
Check your understanding
Reducing a system of three equations in three unknowns, you eliminate a variable from two pairs and arrive at and . What does this tell you?
is exactly twice , so it adds nothing new: one of the two reduced equations was redundant.
Both pairs have already been eliminated by this point, using all three original equations, so no equation is left in reserve to contradict this pair. One real condition remains for two unknowns, so infinitely many pairs , and so infinitely many triples, solve the system, exactly as in Worked Example 4.
Check your understanding
Reducing a system of three equations in three unknowns, you eliminate a variable from two pairs and arrive at . What does this tell you?
When a step collapses to a false numerical statement, no triple can satisfy every equation.
The three planes share no common point. An always-true ending like would instead say that one equation added no new condition, leaving the surviving equations to decide between infinitely many solutions and none.