Back Substitution from Echelon Form
You'll learn how to extract solutions from a system of equations once it's been transformed into row echelon form.
What Is Back Substitution?
Once you've used elementary row operations to reduce an augmented matrix to row echelon form (where each leading entry is to the right of the one above it, creating a "staircase" pattern), you're almost done solving the system. Back substitution is the process of reading the solution by starting from the bottom row and working your way upward.
Think of it like climbing down a ladder: you start at the highest rung (last equation) where the answer is obvious, then use that answer to solve the equation above it, and so on.
How It Works
Consider a system in echelon form:
[ 1 2 -1 | 3 ]
[ 0 1 2 | 5 ]
[ 0 0 1 | 2 ]
This represents:
- Row 3: z = 2 ← Start here! The solution is immediate.
- Row 2: y + 2z = 5 → Substitute z = 2: y + 2(2) = 5, so y = 1
- Row 1: x + 2y - z = 3 → Substitute y = 1 and z = 2: x + 2(1) - 2 = 3, so x = 3
You work backward through the rows, substituting known values into equations above.
The Process
- Start at the bottom row with the fewest variables
- Solve for that variable directly
- Move up one row and substitute the value(s) you just found
- Repeat until you reach the top
Key Takeaway: Back substitution converts a row echelon matrix into actual solutions by solving from the bottom up, substituting known values as you climb upward through the equations.