Rank and collapse
Here are two matrices. They differ in a single entry.
One of them destroys a dimension. The other does not. Nothing about their appearance tells you which.
Read the columns
Use the column picture. For , the columns are and . Look closely: is just . The second column points along the same line as the first.
So whatever vector you feed in, the output is
Every possible output is a multiple of . The whole plane — every point in it — is squeezed onto that single line. There is no input you could choose that lands anywhere else.
Now . Its columns are and , and is not a multiple of . Those two directions are independent, so combinations of them reach every point in the plane. Nothing is lost.
The word for this
The set of all reachable outputs is the column space, and its dimension is the rank.
- has rank 1. Its column space is a line. A dimension was crushed.
- has rank 2. Its column space is the whole plane. Full rank.
You can also see it in the determinant: , while . Zero determinant and rank below full are two descriptions of the same collapse — area is destroyed exactly when a dimension is.
Why it decides everything downstream
If a transformation is full rank, no information was lost, and you can run it backwards. If the rank dropped, many different inputs were mapped to the same output, and no reverse motion can possibly tell them apart.
That is not a rule to memorise. It is the reason the next two ideas — invertibility and the null space — exist at all.