The nullity of a square matrix with linearly dependent rows is at least one.

The nullity of a square matrix with linearly dependent rows is at least one. True or False?

Here is the answer my textbook gives:

True; if the rows are linearly dependent, then the rank is at least $1$ less than the number of rows, so since the matrix is square, its nullity is at least $1$.

I wonder: Why does the author ask this question specifically for square matrices? Is it different for other matrices.

More details: If your matrix is $m$ x $n$, and say $m>n$. We know that the rank of a matrix is equal to the row rank, which is equal to the column rank. So, rank of the matrix is at most $n$- the number of columns, which is less than $m$, and hence the nullity is at least $1$. Similar arguments apply for $m<n$.
• @yolo123: for a square matrix, the nullity need not be $1$. You are given an additional condition, namely that the rows are linearly dependent. For non square matrices you do not need that condition- they would automatically have nullity at least one. – voldemort Aug 30 '14 at 2:44
• @yolo123: yes: But for any matrix, rank $\leq$ max {number of rows, number of columns}, and thus it can never be full rank. The nullity has to be at least $1$. A non square matrix can never be invertible for similar reasons. – voldemort Aug 30 '14 at 2:56