Matrix Rank Calculator
Find the rank of a 2×2 matrix instantly using row reduction. Use this when solving systems of equations, checking linear independence, or determining if a matrix is invertible.
Last updated: September 2026
Formula below · 2 sources (mathworld.wolfram.com, Wikipedia) · Updated Sep 2026
Compare with similar
About this calculator
The rank of a matrix is the number of linearly independent rows (or columns) it contains. For a 2×2 matrix with elements m11, m12, m21, m22, the calculator first computes the determinant m11·m22 − m12·m21: if it is non-zero (beyond a small tolerance), the two rows are linearly independent and the rank is 2. Otherwise the rank is 1 if any entry is non-zero (in either row). A rank of 0 means the matrix is the zero matrix. A full-rank 2×2 matrix (rank = 2) is invertible, while a rank-1 matrix is singular. This process mirrors Gaussian elimination, which systematically reduces a matrix to row echelon form and counts the pivot positions.
How to use
Suppose your matrix is [[3, 1], [6, 2]]. Enter m11=3, m12=1, m21=6, m22=2. Step 1 — compute the determinant m11·m22 − m12·m21 = 3·2 − 1·6 = 6 − 6 = 0, so the rank is below 2. Step 2 — the matrix has non-zero entries, so the rank is 1. This means row 2 is a scalar multiple of row 1 (row 2 = 2 × row 1), confirming the matrix is singular and not invertible.
Frequently asked questions
What does the rank of a matrix tell you about a system of linear equations?
The rank tells you how many independent constraints your system imposes. If the rank equals the number of unknowns, the system has a unique solution. If the rank is less than the number of unknowns, there are infinitely many solutions or none, depending on the right-hand side. A rank-deficient matrix signals that at least one equation is redundant.
How is matrix rank calculated using row reduction?
Row reduction (Gaussian elimination) applies elementary row operations — swapping rows, scaling rows, and adding multiples of one row to another — to bring the matrix to row echelon form. The rank is simply the number of non-zero rows remaining after reduction. For a 2×2 matrix, the determinant expression m21·m12 − m22·m11 being non-zero is equivalent to saying both rows survive reduction as pivots.
Why is a matrix with rank less than its size considered singular?
A square matrix is invertible (non-singular) only when all its rows are linearly independent, which means it must have full rank. If the rank is less than the matrix size, at least one row is a linear combination of the others, making the determinant zero. A zero determinant means no unique inverse exists, so systems using that matrix cannot be solved uniquely by standard methods.