Back substitution is the method for solving an upper triangular system by starting with the last equation and working upward. In Linear Algebra and Differential Equations, it usually comes right after Gaussian elimination.
Back substitution is the step you use after a system has been turned into upper triangular form, usually by Gaussian elimination. In Linear Algebra and Differential Equations, it is the part where you stop eliminating and start solving. The matrix is arranged so the bottom equation has only one unknown, the equation above it has two unknowns, and so on.
The name says exactly what you do: you substitute known values back into earlier equations. You begin with the last row, solve for the last variable, then move up one row and plug that value in. Each new equation gives you one more variable until the whole system is solved. This works cleanly because the triangular shape removes the need to solve everything at once.
For example, suppose elimination gives you something like x3 = 2, then x2 + 3x3 = 11, then x1 - x2 + x3 = 4. You solve x3 first, get x2 from the second equation, and then get x1 from the first. The process is mechanical, but it depends on careful arithmetic. A small sign mistake early on can throw off every variable above it.
Back substitution is not a separate trick from Gaussian elimination, it is the finish. Gaussian elimination gets the system into a form that is easy to read, and back substitution reads it from bottom to top. If a row turns into something impossible, like 0 = 5, the system is inconsistent and there is no solution to back substitute. If a row becomes 0 = 0, the system may have infinitely many solutions and you will need free variables instead of a single value for every unknown.
You will also see this method written with matrices and augmented matrices. The row operations happen first, then the solved values are carried upward through the rows. That makes back substitution one of the most practical skills in the unit on Gaussian Elimination and Matrix Operations.
Back substitution is the payoff for Gaussian elimination. Once you can turn a messy system into upper triangular form, this method gives you the actual variable values instead of leaving you with a transformed matrix. It is the bridge between row operations and the final solution set.
This matters because a lot of the work in linear algebra is about organizing a problem so it can be solved efficiently. Back substitution shows how structure changes the difficulty of the problem. A system that looked hard at the start becomes a step-by-step calculation once the leading entries are lined up in triangular form.
It also helps you read what kind of solution a system has. If you hit a contradictory row, you know the system is inconsistent. If you get a row of zeros, you may be looking at dependent equations and more than one solution. So back substitution is not just arithmetic, it is part of checking whether the system actually makes sense.
In differential equations, this same kind of stepwise thinking shows up when systems are reduced to easier forms. The habit of solving one unknown at a time carries over to larger methods later in the course, especially when you work with matrices and systems that depend on previous results.
Keep studying Linear Algebra and Differential Equations Unit 1
Visual cheatsheet
view galleryGaussian Elimination
Back substitution comes after Gaussian elimination. Elimination is the part where you use row operations to create zeros below the pivots, and back substitution is the part where you solve the simplified system from the bottom up. If elimination is done poorly, back substitution becomes messy or impossible.
Upper Triangular Matrix
This is the matrix shape that makes back substitution work. An upper triangular matrix has zeros below the main diagonal, so the last row usually gives you one variable right away. Each row above it includes one more unknown, which is why you can solve upward in order.
Row Echelon Form
Row echelon form is the broader target after elimination, and an upper triangular system is a common version of it. Back substitution uses the leading entries in row echelon form to isolate variables. If the matrix is not yet in echelon form, you usually need more elimination before you can start solving.
Consistent System
Back substitution only gives a full solution when the system is consistent. If the algebra produces a contradiction, there is no solution to compute. When the system is consistent, back substitution helps you find either one unique solution or a parameterized family of solutions if free variables appear.
A problem set or quiz question will usually give you a system in matrix form or a row-echelon matrix and ask you to finish the solve. Your job is to start with the bottom row, isolate the last variable, then substitute that value into the row above it and keep going upward. If the system includes a zero row, you need to decide whether it means infinitely many solutions or no solution. Work carefully with negatives and fractions, since back substitution is where arithmetic errors show up fast.
You may also be asked to explain why back substitution is valid after Gaussian elimination. The short answer is that the triangular form leaves each lower row with fewer unknowns, so one value can be found at a time.
Forward elimination and back substitution are two different stages of the same solving process. Forward elimination changes the system into upper triangular form by clearing entries below the pivots. Back substitution starts after that, using the triangular form to solve variables from the last equation upward.
Back substitution is the step where you solve an upper triangular system from the bottom row up.
It usually comes after Gaussian elimination has already simplified the matrix.
Each solved variable gets plugged into the equation above it, so the values move upward through the system.
A contradiction like 0 = 5 means the system is inconsistent, so there is no solution to back substitute.
A row of zeros can mean the system has dependent equations and may need free variables.
Back substitution is the method for solving a system once it has been reduced to upper triangular form. You solve the last equation first, then substitute that value into the equation above it, and keep moving upward. It is the finishing step after Gaussian elimination.
Start with the bottom equation and isolate the last variable. Plug that value into the row above, solve the next variable, and continue upward until every unknown is found. The main mistake is skipping arithmetic cleanup, especially with negatives and fractions.
No. Gaussian elimination is the process that turns the system into upper triangular form using row operations. Back substitution happens after that, when you use the simplified rows to solve for the variables.
A zero row usually means the equations were dependent, so the system may have infinitely many solutions. If you get a contradiction instead, like 0 = 7, the system is inconsistent and has no solution. The row pattern tells you how to interpret the system.