Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $Ax=b$ be a system of $r$ nonzero equations in $n$ unknowns.
Suppose that $rank(A)=rank(A|b)$ and that $(A|b)$ is in RRE.
Then $rank(A)=r$.

We want to prove that.
The book says since $(A|b)$ is in reduced row echelon form, $(A|b)$ must have $r$ nonzero rows.

I can't follow the logic.
RRE form can have zero rows in the last position, then why it must have $r$ nonzero rows in here?

share|cite|improve this question
The rows of $(A\mid b)$ just reflect the equations, and it was given that $r$ of them were nonzero. – Marc van Leeuwen Apr 9 '13 at 7:59
But if we transform that matrix into reduced row echelon form then it can have zero rows, I think. – noname Apr 9 '13 at 8:01
Your question is unclear. Just after stating the equations you say "Since $(A\mid b)$ is in RRE", so one must assume that somehow they were already so. If you have changed the equations, then you should not call them by an unchanged name. – Marc van Leeuwen Apr 9 '13 at 8:03
I stated the whole sentence. Please check that. – noname Apr 9 '13 at 8:11

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.