Yes, the rank is zero only for the zero matrix (all entries are 0). Every non-zero matrix has at least rank 1.

Is rank the same as determinant?

No. Rank counts pivot columns (always between 0 and \min(m,n)), while determinant is a single number (only defined for square matrices) measuring whether the matrix is invertible. They are related: a square matrix is invertible if and only if its rank equals its size.

How is rank used in solving systems of equations?

Rank determines consistency and uniqueness. If rank(A) = rank([A|b]) = n (number of columns), the system has a unique solution. If the ranks are equal but less than n, there are infinitely many solutions. If rank(A) < rank([A|b]), the system has no solution.

Why do we care about the number of non-zero rows?

In row echelon form, the number of non-zero rows always equals the number of pivot columns, so counting non-zero rows is a quick way to find rank without identifying each pivot explicitly. However, be careful: this is only true after row reduction, not in the original matrix.

Rank of a Matrix

Q: Why do we care about the number of non-zero rows?

In row echelon form, the number of non-zero rows always equals the number of pivot columns, so counting non-zero rows is a quick way to find rank without identifying each pivot explicitly. However, be careful: this is only true after row reduction, not in the original matrix.

The rank of a matrix counts its pivot columns, telling you the dimension of its column space and whether a system has a solution.

\operatorname{rank}(A) = \text{number of pivot columns}

Solve a problem with Rank of a Matrix

Type the problem. The solver will use Rank of a Matrix where Rank of a Matrix is the right tool, and tell you when it is not.

What each symbol means

What Rank of a Matrix takes

Symbol	Meaning
$A$	The matrix is the rectangular array of numbers for which you are computing the rank; it must be fully specified before you can count pivot columns.

When to use it

Use rank when you need to determine how many independent equations you have or whether a system of linear equations has a solution.

Level

Usually taught in: Linear Algebra

Worked examples

1. Find the rank of a matrix requiring row reduction

Problem

Find the rank of

A = \begin{pmatrix} 1 & 2 & 3 \\ 2 & 4 & 6 \\ 0 & 1 & 2 \end{pmatrix}

$A = \begin{pmatrix} 1 & 2 & 3 \\ 2 & 4 & 6 \\ 0 & 1 & 2 \end{pmatrix}$
Start with the given matrix and perform row reduction to identify pivot columns.
$\begin{pmatrix} 1 & 2 & 3 \\ 0 & 0 & 0 \\ 0 & 1 & 2 \end{pmatrix}$
Eliminate below the first pivot using $R_2 \to R_2 - 2R_1$ .
$\begin{pmatrix} 1 & 2 & 3 \\ 0 & 1 & 2 \\ 0 & 0 & 0 \end{pmatrix}$
Swap rows to put a non-zero entry in position (2,2) using $R_2 \leftrightarrow R_3$ .
$\text{Pivots in columns } 1 \text{ and } 2$
The matrix is now in row echelon form with pivot entries in positions (1,1) and (2,2).
$\operatorname{rank}(A) = 2$
Count the pivots: 2 pivot columns.

Answer: $\operatorname{rank}(A) = 2$

Row reduction reveals that only two columns have pivot positions, corresponding to two linearly independent rows. The third row becomes zero, indicating linear dependence. Thus the rank is 2.

2. Find the rank of a matrix with negative entries and dependent rows

Problem

Find the rank of

B = \begin{pmatrix} -2 & 4 & -6 \\ 1 & -2 & 3 \\ 3 & -6 & 9 \end{pmatrix}

$B = \begin{pmatrix} -2 & 4 & -6 \\ 1 & -2 & 3 \\ 3 & -6 & 9 \end{pmatrix}$
Begin with the given matrix containing negative entries.
$\begin{pmatrix} 1 & -2 & 3 \\ 1 & -2 & 3 \\ 3 & -6 & 9 \end{pmatrix}$
Scale row 1 to create a leading 1 using $R_1 \to -\frac{1}{2}R_1$ .
$\begin{pmatrix} 1 & -2 & 3 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}$
Eliminate below the first pivot using $R_2 \to R_2 - R_1$ and $R_3 \to R_3 - 3R_1$ .
$\text{Pivot in column } 1$
Row echelon form is complete with only one pivot position in column 1.
$\operatorname{rank}(B) = 1$
Count the pivot columns.

Answer: $\operatorname{rank}(B) = 1$

All three rows are multiples of each other (rows 2 and 3 are multiples of row 1). After row reduction, only the first row survives as non-zero, giving rank 1. This indicates the three vectors are linearly dependent.

3. Find the rank of a coefficient matrix in a construction scheduling problem

Problem

A construction company assigns two crews to paint different sections of a building. Let

h_1

be the hours crew A works and

h_2

be the hours crew B works. The painting requirements give two constraints: Crew A working 4 hours and Crew B working 6 hours completes section 1 (

4h_1 + 6h_2 = 30

), and the same crews complete section 2 by working 2 hours and 3 hours respectively (

2h_1 + 3h_2 = 15

). Find the rank of the coefficient matrix of this system.

$C = \begin{pmatrix} 4 & 6 \\ 2 & 3 \end{pmatrix}$
Write the coefficient matrix from the system of equations.
$\begin{pmatrix} 1 & \frac{3}{2} \\ 2 & 3 \end{pmatrix}$
Create a leading 1 in position (1,1) using $R_1 \to \frac{1}{4}R_1$ .
$\begin{pmatrix} 1 & \frac{3}{2} \\ 0 & 0 \end{pmatrix}$
Eliminate below the first pivot using $R_2 \to R_2 - 2R_1$ .
$\text{Number of non-zero rows: } 1$
The second row becomes all zeros, indicating the equations are dependent.
$\operatorname{rank}(C) = 1$
Count pivot columns: only column 1 has a pivot.

Answer: $\operatorname{rank}(C) = 1$

The rank is 1, meaning the two equations are not independent. The second equation is exactly half of the first, so there is only one independent constraint on the two variables. This suggests the crews have infinitely many valid schedules that satisfy both painting requirements.

Common mistakes

Where Rank of a Matrix usually goes wrong

The mistake	Why it is wrong	The fix
A student says the rank of $\begin{pmatrix} 1 & 2 \\ 0 & 0 \end{pmatrix}$ is the total number of non-zero entries (three ones), not the number of pivot columns.	Rank counts columns with pivots, not individual non-zero elements. A column can have many non-zero entries but be non-pivot if its leading entry is not in the correct row.	Count only the columns containing a leading entry in row echelon form. This matrix has one pivot in column 1, so rank = 1.
Confusing rank with the number of rows. A student sees a $3 \times 5$ matrix and incorrectly concludes rank = 3 because there are 3 rows.	The rank cannot exceed the minimum of the number of rows and columns. A $3 \times 5$ matrix can have rank at most 3, but the actual rank depends on how many columns contain pivots, which requires row reduction.	Always row reduce the matrix first to find pivot columns. The rank is the count of those pivots, which could be 0, 1, 2, or 3 for a $3 \times 5$ matrix.
A student solves the system $Ax = 0$ and finds 2 free variables, then concludes rank = 2.	The number of free variables is $n - \operatorname{rank}(A)$ , not the rank itself. Free variables come from non-pivot columns, not pivot columns.	If there are 2 free variables and the matrix has 5 columns, then rank = 5 - 2 = 3. Count pivot columns, not free variables.

Tips and when to use something else

Always row reduce to row echelon form before counting pivots—the rank is not visible from the original matrix without this step.
The rank of an $m \times n$ matrix satisfies $0 \leq \operatorname{rank}(A) \leq \min(m, n)$ . If you get a rank larger than this, you've made an error.
For systems of equations, if $\operatorname{rank}(A) = \operatorname{rank}([A | b])$ (the coefficient matrix and augmented matrix have the same rank), the system is consistent.
If you're counting the non-pivot columns (free variables), use rank to find the number: (number of free variables) = $n - \operatorname{rank}(A)$ , not the rank itself.

Related formulas

Gaussian EliminationGaussian Elimination transforms a system of linear equations into row echelon form to solve for unknown variables systematically.Linear IndependenceLinear Independence tells you when a set of vectors has no redundancy: none can be written as a combination of the others.Determinant of a 3x3 MatrixThe determinant of a 3x3 matrix reveals whether it is invertible and how the transformation scales volume in three-dimensional space.Inverse of a 2x2 MatrixCompute the unique 2×2 matrix that reverses multiplication by another 2×2 matrix, essential for solving systems of linear equations.Matrix MultiplicationMatrix multiplication combines rows from the first matrix with columns of the second to produce a new matrix, useful for solving systems and transformations.

Frequently asked questions

Can rank be zero?: Yes, the rank is zero only for the zero matrix (all entries are 0). Every non-zero matrix has at least rank 1.
Is rank the same as determinant?: No. Rank counts pivot columns (always between 0 and $\min(m,n)$ ), while determinant is a single number (only defined for square matrices) measuring whether the matrix is invertible. They are related: a square matrix is invertible if and only if its rank equals its size.
How is rank used in solving systems of equations?: Rank determines consistency and uniqueness. If rank $(A) =$ rank $([A|b]) = n$ (number of columns), the system has a unique solution. If the ranks are equal but less than $n$ , there are infinitely many solutions. If rank $(A) <$ rank $([A|b])$ , the system has no solution.
Why do we care about the number of non-zero rows?: In row echelon form, the number of non-zero rows always equals the number of pivot columns, so counting non-zero rows is a quick way to find rank without identifying each pivot explicitly. However, be careful: this is only true after row reduction, not in the original matrix.

Need a different method?

The full solver is not scoped to one formula — type any problem and it will pick the method.

Open the math solver

Reviewed 2026-09-18