DWG NO. 7.4 — Lesson 4 of 5
Unit 7: Systems of Equations and Matrices · ~30 min
Elimination in Lesson 7.1 worked fine for two equations, but it gets unwieldy fast for three or more. Matrices, introduced in Lesson 7.3, fix that: strip away the variable names and keep only the coefficients, and elimination becomes a mechanical process on rows of numbers — Gaussian elimination. This is the same idea every graphing calculator and computer algebra system uses under the hood.
Write the coefficients of each equation as a row, and attach the constants as one extra column, separated by a dashed divider. The system
becomes the augmented matrix
| 1 | 2 | 7 |
| 3 | −1 | 7 |
Each row is one equation; the dashed line separates coefficients from constants
Three operations on the rows of a matrix always produce an equivalent system — the same solution set, just repackaged:
The goal is row-echelon form: each row's leading (leftmost nonzero) entry is a 1, and every entry below that leading 1 is 0, producing a staircase of zeros in the lower-left. Once the matrix is in this form, translate the bottom row back into an equation and solve — it involves only the last variable. Then work upward, substituting each solved variable into the row above it.
Row-echelon form: leading 1s on the diagonal, zeros in the staircase below (* = any value)
| 1 | 2 | 7 |
| 3 | −1 | 7 |
| 1 | 2 | 7 |
| 0 | −7 | −14 |
| 1 | 1 | 1 | 6 |
| 0 | 2 | 5 | −4 |
| 2 | 5 | −1 | 27 |
| 1 | 1 | 1 | 6 |
| 0 | 2 | 5 | −4 |
| 0 | 3 | −3 | 15 |