Three Types of Exceptional Cases
There are three qualitatively different exceptional situations that arise in linear systems, each corresponding to a different geometric configuration.
Exception 1: The system has no solution (inconsistent). Geometrically: the lines/planes are parallel but do not coincide. Algebraically: elimination produces with .
Exception 2: The system has infinitely many solutions because one equation is a redundant consequence of others. Geometrically: coincident lines. Algebraically: elimination produces .
Exception 3: More subtle — the system has a unique solution or is inconsistent due to equations that are not obviously redundant but encode a hidden dependency. For example, three planes in might have no common point even though each pair of planes intersects.
Understanding which exception you have is the first step to understanding the structure of the solution set.
Formal View
Why This Matters
Recognizing exceptional behavior early in elimination saves computation and reveals system structure.
- In robotics, a redundant constraint means the robot has more freedom of motion than designed
- In network analysis, a linearly dependent set of loop equations reveals redundant wiring
- In statistics, collinear predictors in regression reveal exceptional behavior in the normal equations
Quiz
During elimination, you reach the row . This means:
Common Mistakes
- Confusing a zero row with zero RHS (infinitely many solutions) vs. nonzero RHS (no solution).
- Assuming "exceptional" means rare — these cases are common in applications with physical constraints.