Compute the rank via RREF for 2x2 and 3x3 matrices
Enter 2x2 Matrix
Enter 3x3 Matrix
Result
Step-by-Step Derivation
Rank Formula
Rank = number of non-zero rows in RREF
rank(A) <= min(rows, cols)
Full rank: rank = min(m,n)
Nullity = cols - rank
The rank of a matrix measures its non-degeneracy. It equals the dimension of the column space (or row space). Computing rank via RREF is the standard method. The rank-nullity theorem states that rank + nullity = number of columns.
⚠A matrix has full rank if all rows and columns are linearly independent. Rank deficiency indicates linear dependence. For square matrices, full rank = non-singular = det != 0.
What is Matrix Rank?
The rank of a matrix is the maximum number of linearly independent row vectors (or column vectors). It is a fundamental measure of the matrix information content. A matrix with full rank has all rows/columns independent. A rank-deficient matrix has dependencies, meaning some information is redundant.
Row Rank
The number of linearly independent rows. Equals non-zero rows in RREF. Always equals column rank.
Full Rank
rank = min(m,n). All rows/cols independent. Square matrix is invertible. System Ax=b has unique solution.
Rank Deficient
rank < min(m,n). Some rows are linear combinations. Matrix is singular. Null space is non-trivial.
Rank-Nullity
rank(A) + nullity(A) = n (columns). Nullity is the dimension of the null space.
Free online calculators and tools covering mathematics, unit conversion, text processing, and daily life. Accurate, fast, mobile-friendly, and completely free to use.