Inconsistent systems
An inconsistent system has no solution; its row-reduced augmented matrix contains zero coefficients with a nonzero right-hand side.
On this page 7 sections
01A solution must satisfy every row#
A solution must satisfy every row. A row demands , regardless of the variable values. One such contradiction rules out every candidate.
Read the last column as the right-hand side. In , both variable coefficients vanish but the 1 remains. The equation is impossible. In , it is always true.
Consistent?
Show answer and explanation
The last row says .
02Sometimes the right-hand side contains a fixed measurement#
Sometimes the right-hand side contains a fixed measurement. If the residual row is , consistency requires , so the measurement must be 4.
A reading leaves . Other rows are consistent. Which avoids contradiction?
Show answer and explanation
The right side must be zero: .
03Count contradictions, not equations#
Count contradictions, not equations. Three rows can be consistent in two unknowns: , , and all hold at . A zero coefficient by itself is harmless; every coefficient must vanish before the row reads .
Claim: three rows force no solution. Correct it: ; ; .
Show answer and explanation
adds no restriction.
Read the whole row: zero coefficients with a nonzero right-hand side mean no solution.
- Detect a contradictory row in an augmented system.
Sources & further reading
- [1]Margalit and Rabinoff: Interactive Linear Algebra, 1.2 Row Reduction ↗Interactive Linear Algebra · Book