What a Map Collapses and What It Reaches
Two subspaces describe any linear transformation .
The kernel (null space) is everything sends to zero: It measures what the map collapses. The kernel is a subspace of the domain. A crucial fact: is injective (one-to-one) exactly when its kernel is just — if only the zero vector maps to zero, no two distinct inputs can collide.
The image (range) is everything can produce: It measures what the map reaches. The image is a subspace of the codomain, and is surjective (onto) exactly when its image is all of . The dimension of the image is the rank of ; the dimension of the kernel is the nullity.
These are tied by the Rank–Nullity Theorem, one of the central results of linear algebra: i.e. nullity + rank = dimension of the domain. Every dimension of the input is accounted for: some directions get collapsed (the kernel) and the rest survive into the image. If a map from has a 2-dimensional kernel, its image is exactly 3-dimensional — the numbers must add up.
This theorem instantly settles many questions. A linear map between spaces of the same finite dimension is injective if and only if it is surjective (if and only if it is bijective) — because rank + nullity is fixed, one forces the other. This is why a square matrix is invertible exactly when its kernel is trivial.
Common pitfall: confusing the kernel (in the domain, what maps to zero) with the image (in the codomain, what is reached), and forgetting that rank and nullity must sum to the domain's dimension. If a map from an -dimensional space has a -dimensional kernel, its image is -dimensional — not free to be anything. Rank–Nullity is a hard accounting constraint, not a rough guide.
An input space split into an accent kernel band (collapsed to the zero point) and the complementary directions surviving into the image, their dimensions summing to the domain dimension.