A linear system has exactly one of three fates: one solution, none, or infinitely many. Which one happens is governed by the rank of the matrix — the number of genuinely independent rows (equivalently, independent columns). Rank counts how much real information the system carries.

• Full rank (rank = number of unknowns) → a single unique solution.
• Rank-deficient, consistent → infinitely many solutions (not enough equations to pin everything down).
• Inconsistent (the equations contradict) → no solution at all.

The three pictures

Flip between the cases. Two lines that cross are full rank — one solution. Two parallel lines never meet — no solution. Two lines that are secretly the same line overlap everywhere — infinitely many solutions. Same kind of system, three very different outcomes, all read from the rank.

Why rank is the right idea

Rank cuts through the bookkeeping. A full-rank square matrix is exactly an invertible one — non-zero determinant, columns that span the space, one clean solution. Drop the rank and you've lost a dimension's worth of certainty. It is the single number that ties together everything in this stage — and it closes out our tour of linear systems.