1.4 Free Variables and Parametric Form
The previous section made elimination safe: no row operation moves the intersection — adding a multiple of one equation to another can swap in a different plane through it, while swapping and scaling leave the planes themselves alone — so reducing a system never disturbs its solutions. Safety is only half the job. Once a system is fully reduced you still have to read the answer off it, and when the answer is larger than a single point, reading it off requires a form we have not yet written down.
Start with a system so small that it is already reduced — a single equation in three unknowns:
Its augmented matrix is the one row , and there is nothing to eliminate: no second row exists to clear anything against. The leading sits in the column, which makes a pivot variable. No leading entry appears in the column or the column, so and are free variables — free in the strict sense that you may assign them any values you like, whereupon the equation dictates what must be. Three unknowns against one real constraint should leave two degrees of freedom, and it does: the solution set is a plane. The figure draws that plane along with a machine for naming its points.
Explore in 3D (opens in a new tab)A single semi-transparent tilted plane, the solution set of the equation x minus y plus 2z equals 2, drawn as the graph z equals 1 minus 0.5x plus 0.5y. A white dot on the sheet marks the particular solution (2, 0, 0). Two straight lines run through that dot inside the sheet: a pink one in the direction (1, 1, 0) and a teal one in the direction (-2, 0, 1). Two amber lines lie in the sheet as well, one parallel to the pink direction and one parallel to the teal; they cross at a single point. Two sliders, s running from -2 to 2 and a running from -0.5 to 2.5, slide the amber lines across the sheet, and their crossing point is the solution with coordinates 2 plus s minus 2a, then s, then a. The figure opens with both sliders at 1, so the crossing sits at (1, 1, 1) and the amber lines stand apart from the pink and teal ones; with both sliders at 0 the amber lines lie exactly on the pink and teal lines and cross on the white dot. Every setting of the two sliders puts the crossing at a point of the same tilted sheet, and no setting ever lifts it off that sheet.
Explore the figure
- The figure opens at , , where the amber lines stand clear of the pink and teal ones. Set , : the two amber lines slide onto the pink and teal lines and cross exactly on the white dot at ; check it in the equation: . That is the solution you get by setting both free variables to zero.
- Drag to . The crossing slides to , travelling along the pink line — the direction the solution moves when only is changed. Confirm: .
- Now drag to as well. The crossing lands on : raising by one has forced down by two, which is exactly what the teal direction records. Confirm: .
- Set and sweep across its whole range. The crossing runs from to , staying on the drawn sheet the whole way — an entire line of solutions at one fixed height. Two sliders, two independent directions of travel: the solution set is a plane, not a line.
Reading the answer off the pivot
A reduced row asks you to do exactly one thing: solve it for its pivot variable. Here that gives
Now hand the free variables names of their own. Write and — the two sliders — and every solution of the equation is
Splitting that into the part carrying no parameter and the parts carrying and turns it into the parametric form:
Every piece of this has a job. The vector is a particular solution: one point that works, obtained by switching both free variables off. The other two are directions, and what qualifies them is that each solves the homogeneous version of the equation, . For : . For : . A vector that changes the left-hand side by zero can be added to any solution without breaking it, which is why sliding or never lifts the crossing point off the sheet.
Notice also that the naming is exact rather than merely generous. The second and third coordinates of the parametric form are the parameters, so distinct pairs give distinct points and every point of the plane is produced once. The free variables have become coordinates on the solution set. Solving the same equation for instead would give , the graph form the figure renders as a surface; it describes the identical set, but only parametric form survives when there is no single variable you can conveniently isolate.
The augmented matrix of handed to a computer algebra system for reduction — and returned unchanged, because there is nothing left to do. One row, one pivot, and it sits in the column. Of the three variable columns, two carry no pivot, and those two are the free variables: unknowns minus pivot leaves the parameters the figure puts on sliders.
An equation that says nothing
Nothing in that argument depended on the system having only one equation, and it is worth seeing why. Add a second equation, , and reduce the pair. Subtracting twice the first row from the second turns into . A row of zeros is the equation : true, and true at every point of space, so it excludes nothing. The reduced system still has one pivot and two free variables, and its solution set is still the plane you have been sweeping. The second equation was a multiple of the first — geometrically, the same plane written twice.
Two equations in, one equation out. The reduced matrix's second row is entirely zero, so the second equation imposed no condition the first had not already imposed. The lesson is a counting one: the number of equations is not the number of constraints — the number of pivots is. Here that count is either way, and free variables survive.
An original work of XYZ Homework, built around interactive XYZ 3D figures. Chapters 1–6 follow the topic sequence of Interactive Linear Algebra (Margalit & Rabinoff, Georgia Tech, GNU FDL). Chapter 0's scope (its topics, their order, and the idea each figure shows) follows the Vectors chapter of Ximera's Linear Algebra: An Interactive Introduction. The prose, worked examples and figures were written for this book, which is not affiliated with or endorsed by the authors of either work. License: CC-BY-NC-SA-4.0.