Consistent and Inconsistent Systems
You'll learn: How to determine whether a system of linear equations has solutions by inspecting its augmented matrix in row echelon form.
The Core Idea
After performing Gaussian elimination and back substitution on a system of linear equations, you need to answer a fundamental question: Does this system actually have a solution?
A consistent system is one that has at least one solution (it could have one unique solution or infinitely many). An inconsistent system has no solutions at all—the equations contradict each other.
The Test: Look at the Row Echelon Form
Once you've reduced your augmented matrix to row echelon form, examine each row carefully:
-
Inconsistent (No Solution): If you see a row that looks like
[0 0 0 | b]whereb ≠ 0, the system is inconsistent. This represents the equation0x + 0y + 0z = b, which is impossible whenb ≠ 0. Think of it as saying "0 = 5"—that's a contradiction! -
Consistent: If no such contradictory row exists, the system is consistent and has at least one solution.
What Consistent Looks Like
For consistent systems, count the pivot positions (leading entries):
- If every variable has a pivot, you have one unique solution
- If some variables are "free" (no pivot in their column), you have infinitely many solutions
Analogy
Imagine trying to schedule a meeting where Alice says "Monday at 2pm," Bob says "Monday at 3pm," and Carol says "Not Monday." That's inconsistent—no single time works. But if their constraints can all be satisfied simultaneously, the scheduling system is consistent.
Key Takeaway: A system is inconsistent if and only if its row echelon form contains a row of the form [0 0 ... 0 | b] with b ≠ 0; otherwise it's consistent.