Rank-Nullity Theorem
BasisPrerequisites
The rank-nullity theorem is a conservation law for dimensions. When a linear map acts on a vector space, no dimensions disappear without a trace: they either survive in the image or get absorbed into the kernel. The theorem makes this precise and immediately explains why injectivity and surjectivity coincide for square linear maps.
Statement
Rank-nullity theorem: Let be a finite-dimensional vector space over a field , and let be a linear map. Then
\dim(V) = \text{rank}(T) + \text{nullity}(T). \tag{1}
In words: the dimension of the domain equals the dimension of the image plus the dimension of the kernel.
Proof
Let , and choose a basis of .
Step 1: Extend to a basis of . Since is a subspace of the finite-dimensional space , we can extend to a full basis of . Call the extra vectors , so
is a basis of . Then .
Step 2: spans . Take any ; write for some . Expand in the basis :
Apply and use linearity. Since each , we get :
So is a linear combination of , confirming they span .
Step 3: is linearly independent. Suppose . By linearity, , so . Therefore this vector is a linear combination of the basis of :
for some scalars . Rearranging: . Since is a basis of , all coefficients are zero — in particular .
Step 4: Conclude. is a basis of , so . Therefore:
Interpretation
Informally, splits into two parts: the -dimensional kernel (which crushes entirely to zero) and an -dimensional complement (which maps isomorphically onto ). The total dimension is preserved: . No dimensions are created or destroyed — they are simply rerouted.
Consequences for square matrices
Now suppose is a linear map with matrix (a square matrix). Applying (1):
The domain and codomain have the same dimension , and the dimensions of the kernel and image must sum to exactly . This rigid budget creates the following equivalence:
Theorem: For (equivalently, for an matrix ), the following statements are all equivalent:
- is injective (, i.e., ).
- is surjective (, i.e., ).
- is bijective (and hence has an inverse ).
- (all columns — equivalently, all rows — of are linearly independent).
The reason: if nullity is , then rank must be (from (1)), so is both injective and surjective. There is no room for the rank to be without the nullity being , and vice versa — the two quantities share a fixed budget of .
This is a purely dimension-counting phenomenon: in infinite dimensions, injectivity and surjectivity can fail independently. In finite dimensions, they are inseparable for square maps.
A concrete example
Let be a matrix with . The domain is , so . By (1):
The kernel is three-dimensional: there are three linearly independent vectors in that maps to zero. The image is three-dimensional inside — cannot be surjective (since ).
Summary
- Rank-nullity theorem: for any linear map with finite-dimensional.
- Proof idea: extend a basis of to a basis of ; the extra vectors map to a basis of .
- Interpretation: the domain splits between the kernel (dimensions collapsed to zero) and a complement (dimensions mapped isomorphically to the image).
- For square maps : injectivity, surjectivity, and bijectivity (invertibility) are all equivalent — they run out of the same -dimensional budget simultaneously.