Rank-Nullity Theorem for Linear Transformations
What You'll Learn
You'll learn how the dimension of a linear transformation's kernel and range always add up to the dimension of its domain—a fundamental relationship that connects input and output spaces.
The Core Idea
The Rank-Nullity Theorem states that for any linear transformation T: V → W, where V is finite-dimensional:
dim(V) = dim(ker(T)) + dim(range(T))
In other words:
- dim(ker(T)) = the nullity (number of dimensions "lost" or collapsed to zero)
- dim(range(T)) = the rank (number of dimensions preserved in the output)
Think of it like a sorting machine: if you feed in a 5-dimensional space, some directions might get crushed to zero (the kernel), while others get preserved and span the output (the range). The theorem says these two counts must add up to your original 5 dimensions.
Why This Matters
This theorem tells us there's a conservation principle at work. A transformation can't create or destroy dimensions—it can only redistribute them between "what gets zeroed out" and "what survives in the output."
Example: If T: ℝ⁴ → ℝ³ has a 1-dimensional kernel, then its range must be 3-dimensional (since 4 = 1 + 3). This means T is onto—it covers all of ℝ³.
Another Example: If a transformation from ℝ⁵ to ℝ⁴ has rank 3, then its kernel must be 2-dimensional (since 5 = 2 + 3).
The Intuition
Every vector in the domain either contributes something new to the range or lies in the kernel (gets mapped to zero). The dimension count must account for both possibilities exactly once.
Key Takeaway: The Rank-Nullity Theorem guarantees that for any linear transformation, the dimension of the domain equals the sum of the nullity (kernel dimension) and rank (range dimension).