Matrix Rank Calculator

The rank of a matrix is the maximum number of linearly independent rows (or columns) in the matrix. It equals the number of pivot positions in the row echelon form and represents the dimension of the column space (or row space).

The most common method is Gaussian elimination: reduce the matrix to row echelon form and count the number of nonzero rows (pivots). Each pivot corresponds to a linearly independent row.

The maximum rank of an m × n matrix is min(m, n). A matrix achieves full rank when its rank equals this maximum, meaning all rows (or columns) are linearly independent.

Rank tells you the "information content" of a matrix. Full rank means no redundancy. Rank deficient (rank < min(m,n)) means some rows/columns are linear combinations of others, indicating redundancy.

For a square n × n matrix, the matrix has full rank (rank = n) if and only if its determinant is nonzero. If det(A) = 0, the rank is less than n and the matrix is singular.

The rank of a zero matrix (all elements are 0) is 0, because there are no nonzero rows and thus no linearly independent rows.

The rank-nullity theorem states that for an m × n matrix A: rank(A) + nullity(A) = n, where nullity(A) is the dimension of the null space (kernel). This is a fundamental theorem in linear algebra.

Row echelon form (REF) is a triangular form where: (1) all nonzero rows are above any zero rows, (2) the leading entry (pivot) of each row is to the right of the pivot in the row above, and (3) all entries below a pivot are zero.

Reduced row echelon form (RREF) is a stricter form of REF where: (1) each pivot is 1, (2) each pivot is the only nonzero entry in its column. RREF is unique for each matrix, while REF is not.

Yes, infinitely many matrices can share the same rank. For example, all 3×3 matrices with rank 2 form a large set. Rank is a property that groups matrices by their "dimensionality."

Elementary row operations (swapping rows, scaling a row, adding a multiple of one row to another) do not change the rank of a matrix. This is why Gaussian elimination preserves rank.

rank(AᵀA) = rank(A) = rank(Aᵀ). The product AᵀA has the same rank as A. This property is useful in proving that row rank equals column rank.

rank(AB) ≤ min(rank(A), rank(B)). The rank of a product cannot exceed the rank of either factor. Equality holds under certain conditions (e.g., when both matrices have full column/row rank.

A set of vectors is linearly independent if and only if the rank of the matrix formed by those vectors equals the number of vectors. If rank < number of vectors, they are linearly dependent.

The rank of a diagonal matrix equals the number of nonzero diagonal entries. Zero diagonal entries do not contribute to the rank.

The rank of the n × n identity matrix is n (full rank), because all n rows are linearly independent.

For Ax = b, the system has a solution if and only if rank(A) = rank([A|b]). If rank(A) < rank([A|b]), the system is inconsistent. If rank(A) = rank([A|b]) < n, there are infinitely many solutions.

Gaussian elimination to find rank requires O(m × n × min(m,n)) operations, which is O(n³) for square matrices. This is the standard algorithm for rank computation.

Yes, alternative methods include computing determinants of submatrices, using the SVD (rank = number of nonzero singular values), or computing the eigenvalues of AᵀA. However, Gaussian elimination is the most efficient.

A random m × n matrix with entries drawn from a continuous distribution has rank min(m, n) with probability 1. Rank deficiency is a measure-zero event for random matrices.

The Matrix Rank Calculator uses standard mathematical formulas validated against authoritative references. The specific formula is displayed in the calculator interface with a detailed explanation of each variable.

Each calculator includes a step-by-step worked example showing exactly how the formula is applied. You can follow these steps with pen and paper to verify any result.

The Matrix Rank Calculator accepts numeric inputs including integers and decimals. Invalid inputs (letters, special characters) are rejected with clear error messages.