MethodMath
Ask
Join
HomeTopicsAskAlerts
Profile

© 2026 MethodMath. Built for mathematical knowledge sharing.

AboutContactGuidelinesPrivacyTermsCookies
Chloe Villeneuve
Chloe Villeneuve
Apr 30, 2026

How to find the rank of a matrix using row echelon form?

I'm studying linear algebra and I need to understand how to compute the rank of a matrix. I know the definition:

The rank of a matrix is the dimension of its column space (or row space).

But practically, I've been told to convert the matrix to row echelon form and count the number of non-zero rows. However, I'm confused about:

  1. Does the rank depend on whether I use row echelon form or reduced row echelon form?
  2. What is the rank of a zero matrix? An identity matrix?
  3. How do I find the rank of:
A=(123246369)A = \begin{pmatrix} 1 & 2 & 3 \\2 & 4 & 6 \\3 & 6 & 9 \end{pmatrix}A=​123​246​369​​
  1. What does it mean for a matrix to have full rank?
1 answers513 views

1 Answer

3
Ethan Caldwell
Ethan Caldwell
Apr 30, 2026
Accepted
**Practical Definition:** The rank of a matrix is the **number of pivots** in its row echelon form. It equals the number of linearly independent rows (or columns). **Answering your questions:** 1. Row echelon form and RREF give the **same** rank, because the number of non-zero rows is invariant under further row operations. Either form works for computing rank. 2. The zero matrix has rank $0$. An $n \times n$ identity matrix has rank $n$. **3. Computing rank of your matrix:** $$A = \begin{pmatrix} 1 & 2 & 3 \\ 2 & 4 & 6 \\ 3 & 6 & 9 \end{pmatrix}$$ Row reduce: $R_2 \rightarrow R_2 - 2R_1$: $$\begin{pmatrix} 1 & 2 & 3 \\ 0 & 0 & 0 \\ 3 & 6 & 9 \end{pmatrix}$$ $R_3 \rightarrow R_3 - 3R_1$: $$\begin{pmatrix} 1 & 2 & 3 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}$$ There is only **one** non-zero row, so $\text{rank}(A) = 1$. Notice that all rows are multiples of $(1, 2, 3)$, so the row space is one-dimensional. **4. Full rank:** An $m \times n$ matrix has **full rank** if $\text{rank}(A) = \min(m, n)$. - A square $n \times n$ matrix has full rank iff it is invertible ($\det(A) \ eq 0$) - For a rectangular matrix, full row rank means $\text{rank} = m$, full column rank means $\text{rank} = n$ **Rank-Nullity Theorem:** For an $m \times n$ matrix $A$: $$\text{rank}(A) + \text{nullity}(A) = n$$ where nullity is the dimension of the null space (solutions to $A\mathbf{x} = \mathbf{0}$).
1 comment
Emma WhitfieldApr 30, 2026

The rank-nullity theorem connecting rank and nullity is so elegant. Four fundamental subspaces all tied together.

Still unsure? Join to comment or ask a follow-up.
Login or Register to post your answer

Suggested questions

How to solve a linear programming problem using the simplex method?

2959

How to prove that √2 is irrational by contradiction?

2584

What is the geometric interpretation of the determinant of a matrix?

1887

Why does 0 factorial equal 1 instead of 0? Simple proof

31.4k

Does the Banach-Steinhaus theorem hold for non-complete normed spaces?

31.1k