Step by step
The question
Question: find all the solutions of x − 2y + z = 0.
We want every x, y and z that make it true.
1 Write the augmented matrix
Each row is one equation: the numbers in front of x, y and z, then the number on the right, after the bar.
We call the rows R 1.
2 Row reduce
We use the three row moves: swap two rows, times a row by a number that is not 0, add a multiple of one row to another.
They never change the answers.
Our goal: a leading 1 in each row, with 0s above and below it.
The matrix already has its leading 1s, with 0s above and below.
No moves are needed.
3 Find the free letters
The first number that is not 0 in each row is a 1.
We call it a leading 1, and ring it.
The letter x has a leading 1 in its column.
The letters y and z have none: they are free.
A free letter can be any number.
4 Write the leading letters with the free ones
Row 1 as an equation: x − 2y + z = 0.
We want x alone.
To remove − 2y and + z, we add 2y and take away z on both sides.
They cancel on the left.
So x = 2y − z.
Careful!
The − 2y moves to the other side, so its sign changes.
So x is not − 2y.
5 Write it as vectors
We stack the letters in a column.
The free letters stay as they are.
We split it up.
The numbers alone make one vector: (0, 0, 0).
What goes with y makes another: (2, 1, 0), and the same for z.
So every solution is one point, plus any amount of each direction.
Two free letters: the solutions make a flat plane.
6 Check
Let's check.
First the point: all free letters 0.
We put x = 0, y = 0 and z = 0 into every equation.
The point works in every equation.
Now the direction (2, 1, 0).
Its left sides must give 0, so adding it changes nothing.
Now the direction (−1, 0, 1).
Its left sides must give 0, so adding it changes nothing.
Every left side gives 0.
So adding any amount of it keeps every equation true.
The answer is right!
Let's look back.
First: write the augmented matrix.
Then: row reduce.
Then: find the free letters.
Then: write the leading letters with the free ones.
Then: write it as vectors.
Last: check.