I'm studying for my exam of linear algebra.. I want to prove the following corollary:
Given $A \in{R^{m\times n}}$, there is always a solution $x$ to $Ax = y$ for the least-squares minimization problem, if and only if $A$ has rank $n$ (full column rank).