Rank-Nullity Theorem
What You'll Learn
You'll discover a fundamental relationship that ties together the dimension of a matrix's column space (rank) and its null space (nullity).
The Core Idea
The Rank-Nullity Theorem states that for any matrix A with n columns:
rank(A) + nullity(A) = n
Where:
- rank(A) = dimension of the column space (how many linearly independent columns)
- nullity(A) = dimension of the null space (the solution space of Ax = 0)
- n = total number of columns in A
Think of it like a conservation law: the total "degrees of freedom" in your matrix must be split between two things—vectors that get transformed into the column space, and vectors that collapse to zero (the null space). These dimensions must add up to the total number of input dimensions.
An Example
Consider a 3×5 matrix A (3 rows, 5 columns).
If rank(A) = 2 (the column space is 2-dimensional), then:
- nullity(A) = 5 - 2 = 3
- The null space is 3-dimensional
This tells us that out of 5 input dimensions, 2 contribute to independent outputs, while 3 dimensions worth of inputs collapse to the zero vector.
Why It Matters
This theorem connects two seemingly different aspects of a matrix: what it produces (column space) and what it kills (null space). It's especially useful for understanding systems of linear equations—it tells you how many free variables you'll have based on the rank.
Key Takeaway: The Rank-Nullity Theorem guarantees that rank plus nullity always equals the number of columns, revealing how a matrix partitions input space between information preserved and information lost.