MAT 242 Chap.1 Linear Systems and Gaussian Elimination
Linear Systems and Gaussian Elimination
Why the course starts with systems
Almost every later calculation in the course, from inverses to eigenvectors to least squares, ends with row reducing a matrix. This chapter builds that habit from the ground up. It begins with the two-equation elimination you already know: scale the equations so one variable cancels, add them, solve for the surviving variable, then substitute back.
The same move, repeated in a disciplined order, solves a system of any size.
From equations to an augmented matrix
Writing the variables over and over is wasted effort, since only the numbers change. So the coefficients go into a rectangular array, a bar separates them from the right-hand sides, and a variable missing from an equation is recorded as a zero.
Three moves on the rows never change the solutions: exchanging two rows, scaling one row by a nonzero constant, and adding some multiple of one row onto a different row. The course notes use a compact label for each move, and the older textbook used another; either is accepted as long as every step is written down.
The strategy that makes the moves work
Legal moves alone can go in circles.
Gaussian elimination fixes an order: make the top-left entry a 1 and everything under it 0, then set that row and column aside and repeat on what remains. The staircase shape that results is row echelon form, and back substitution from the bottom row finishes the solution.
The paid chapter solves a full three-variable system this way and marks the places where marks usually disappear: an unlabelled operation, a sign error carried into the next row, and a row that was used again after its column was finished.
Vocabulary matters from day one.
A system is consistent when it has at least one solution and inconsistent when it has none, and two systems are equivalent when their solution sets coincide.
How this is tested
Test 1 covers this material and is taken without a calculator, so the elimination has to be reliable by hand. The published Test 1 skills list starts with solving systems by Gaussian and Gauss-Jordan elimination.
Keep the arithmetic small by choosing a row with a leading 1 as the first pivot when a swap makes that possible, and clear fractions only when you are forced to.
A final substitution into every original equation turns a plausible answer into a verified one, and it costs less time than reworking a whole reduction after a grader finds the slip.
Reading a solution geometrically
For two variables each equation is a line, and solving the system means finding where the lines meet: once, never when they are parallel, or everywhere when they coincide.
With three variables each equation is a plane, and the same three outcomes appear. The algebra never needs the picture, but the picture explains why no other outcome is possible and prepares the counting rules of the next chapter.
What this chapter covers
- 01
Elimination and back substitution
- 02
Consistent, inconsistent and equivalent systems
- 03
Augmented matrices
- 04
The three row operations
- 05
Row echelon form
Worked example · free
Solve a 2 × 2 system by elimination
- 2Add the two equations so y cancels: 3x = 6, so x = 2.
- 1Back substitute into the first equation: y = 5 − 2 = 3.
- 1Check both originals: 2 + 3 = 5 and 4 − 3 = 1.
Key terms
- Back Substitution
- Back substitution is the step that solves for the last variable first and feeds each value into the rows above it.
- Row Operation
- A row operation is one of three moves on an augmented matrix (exchange two rows, rescale a row, or add a multiple of a different row) that leaves the solutions unchanged.
- Row Echelon Form
- Row echelon form is a staircase arrangement with a leading 1 in each nonzero row and zeros beneath every leading 1.
Linear Systems and Gaussian Elimination FAQ
Why can a row be multiplied by any number except zero?
Multiplying an equation by zero erases its information and can create new solutions. Any nonzero multiple keeps exactly the same solution set, which is the property every legal row operation must preserve.
Do I have to use the course's row-operation labels?
The course notes show two labelling styles, the instructor's compact notation and the one from the previous textbook. What graders require is that every operation is written next to the step where it happens.
What should I do when the top-left entry is zero?
Swap in a lower row that has a nonzero entry in that column. If the whole column is zero, move right to the next column and continue the strategy on the smaller matrix.
Exam move
Solve two small systems by hand each day during the first weeks, labelling every move. Then redo one from memory with a different right-hand side to see which step you hesitate on. When a reduction goes wrong, find the first row that disagrees with a correct version rather than restarting; the error pattern tells you which move to slow down on.
Working through Linear Systems and Gaussian Elimination in MAT 242? Sia is AskSia’s AI Mathematics tutor — ask any MAT 242 Linear Systems and Gaussian Elimination question and get a clear, step-by-step explanation grounded in how MAT 242 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.
