Mathematics
The Rank-Nullity Theorem and the Dimensions of Linear Maps
Quick fact
For any linear map from a finite-dimensional vector space to another, the dimension of the domain is exactly the sum of the dimensions of its kernel and its image—this is the rank-nullity theorem.
Why this is interesting
What if a linear map 'squishes' a whole line of points into a single point? How much information is lost, and can we still know the dimension of the original space?
Read the full explanation
Understanding The Rank-Nullity Theorem and the Dimensions of Linear Maps
Think of a linear map as a machine that takes vectors from one space (the domain) and transforms them into vectors in another (the codomain). Some vectors might get sent to zero—these form the kernel. The set of all outputs that are actually produced is called the image. The rank-nullity theorem says that the dimension of the original space (the number of independent directions in the domain) equals the dimension of the kernel plus the dimension of the image. If the map's kernel is large (many vectors collapse to zero), then the image must be correspondingly smaller—and vice versa. This is like saying that when you project a 3D object onto a 2D screen, you lose one dimension—the depth—so the screen image is 2D.
A deeper explanation
The rank-nullity theorem is a direct consequence of the fact that a linear map is determined by its action on a basis. Let T: V → W be a linear transformation, with V finite-dimensional. Choose a basis for the kernel of T and extend it to a basis for all of V. The images of the extension vectors form a basis for the image of T. This construction shows that the dimension of V equals the sum of the dimension of the kernel (nullity) and the dimension of the image (rank). The theorem is fundamental because it immediately gives insights into the behavior of linear maps: a map is injective if and only if its kernel is zero, meaning nullity is 0, so then rank equals dim(V). It also implies that for a linear map from a space to a space of the same dimension, injectivity, surjectivity, and invertibility are all equivalent, since a zero kernel forces the image to have the same dimension as the codomain, making the map surjective. This result is used across mathematics to reason about matrices, differential equations, and more.