Full Rank Matrices
You'll learn how to identify matrices with maximum possible rank and understand what that means for their invertibility.
What Does "Full Rank" Mean?
A matrix has full rank when its rank equals the maximum value it could possibly have. Since rank equals the number of linearly independent rows (or columns), there are three important cases:
- Full column rank: When rank equals the number of columns. All columns are linearly independent.
- Full row rank: When rank equals the number of rows. All rows are linearly independent.
- Full rank (square matrices): When a square matrix has rank equal to both its number of rows and columns.
Think of rank like the "effective dimension" of a matrix. Full rank means no dimension is wasted—no redundancy exists.
Full Column Rank
If matrix A is m × n with full column rank, then rank(A) = n. This means:
- The columns span an n-dimensional subspace of ℝᵐ
- The null space contains only the zero vector
- The equation Ax = b has at most one solution for any b
Full Row Rank
If matrix A is m × n with full row rank, then rank(A) = m. This means:
- The rows span all of ℝᵐ
- The column space is all of ℝᵐ
- The equation Ax = b has at least one solution for every b
Full Rank Square Matrices
When A is square (n × n) with rank(A) = n, it has both full row and full column rank. This is special:
- A is invertible (has an inverse A⁻¹)
- Ax = b has exactly one solution for every b: x = A⁻¹b
- All four fundamental subspaces have their maximum dimensions
Key Takeaway: Full rank matrices have maximum independence—no wasted dimensions. Square full rank matrices are exactly the invertible ones.