Linear Independent Rows vs. Columns

Question

$A$ is an $M\times N$ matrix with linearly independent rows and linearly independent columns. Prove that $A$ must be square matrix.

Answer 1

Hint: The matrix must have full row and column rank, but $\mathrm{rank} (A) \le \min(m,\ n)$

Answer 2

Assume $M\leq N$ (otherwise we can work with $A^T$). So we have $N$ columns, each a vector in $\mathbb{R}^M$; the maximum number of linearly independent vectors in $\mathbb{R}^M$ is $M$, so we have $N\leq M$. Then $N=M$.

Answer 3

If $V$ is a vector space with $\dim V=k$, and you pick $v_1,\, v_2,\ldots,\, v_p$ in $V$ with $p\gt k$ then those vectors must be l.d. because otherwise we would have a subspace $W$ of $V$ with $\dim W\gt \dim V$, namely $W=\langle v_1,\ldots,v_p\rangle$.

If $A$ is a matrix with real entries and $M\lt N$, the columns of $A$ are $N$ vectors of $\Bbb R^M$ therefore they are l.d. Since this is contradicts that $A$ have linearly independent columns, it must be $M\geq N$.

Now, $A^\text{T}$ is a $N\times M$ matrix with linearly independent rows and linearly independent columns. By what we already have, it follows that $N\geq M$.

Therefore $M=N$.