Linear Algebra & Optimization
Intermediate
6 min

Rank-Nullity Theorem

The rank-nullity theorem splits the domain of a linear map into what survives (column space) and what collapses to zero (null space).

1. The idea

The rank of is the dimension of its column space (the space of outputs it can produce), and the nullity is the dimension of its null space (inputs it destroys).

The rank-nullity theorem states that for , rank plus nullity equals , the number of columns. This ties together how much information a linear map preserves versus loses.

Rank also equals the number of nonzero singular values or eigenvalues (for a diagonalizable matrix), and it determines whether a system has a unique solution, infinitely many, or none.

2. Why it matters

Rank deficiency in a covariance matrix (e.g. more assets than time periods) signals collinearity, and interviewers use rank arguments to check whether a system of constraints is solvable.

3. Core mathematics

Rank-nullity theorem

Full rank (square)

Null space

4. How to recognize it

Think of this when…

  • Questions about whether a system has a unique solution
  • Collinear assets or redundant constraints in a portfolio problem
  • 'How many free parameters remain' type phrasing

5. Worked example

Worked example

Let . Find rank and nullity.

  1. 1

    Row 2 is twice row 1, so rank is 1.

  2. 2

    Apply rank-nullity with columns.

  3. Answer: rank = 1, nullity = 2

6. Common mistakes

  • Applying rank-nullity with (rows) instead of (columns)
  • Assuming a matrix with no zero rows must be full rank
  • Forgetting that rank is bounded by

7. Quick check

For a matrix with rank 3, the nullity is:

A square matrix with nontrivial null space has determinant:

8. Practice

2 QuantSolve questions use this concept.

Practice this concept

9. Related methods

This lesson is conceptual; see the topic hub for methods.