Why a vector in both the null space and row space has to be $0$? In this video https://www.youtube.com/watch?v=Go2aLo7ZOlU&index=34&list=PLE7DDD91010BC51F8, at about 26:00, the professor claims that a vector in both the null space and row space has to be $0$, and the following is his proof.

in which he says $x-y$ is in both the null space of $A$ and the row space of $A$, then $x-y=0$, but I don't know why this is true.
Thanks!
 A: As dls points out, it must be that "if the transpose of a vector in the row space is in the right null space, it must be $0$".
Suppose that $x$ is in the row space of $A$: $x=uA$, and that $x^T$ is in the right null space of $A$: $Ax^T=0$, then
$$
AA^Tu^T=Ax^T=0\implies |uA|^2=uAA^Tu^T=0\implies x=uA=0
$$
A: By the so-called fundamental theorem of linear algebra, the (right) nullspace is the orthogonal complement of the row space.
A: Let $V$ be a finite-dimensional vector space, $\:A\:$ a matrix (or linear transformation) from $V$ to $W$ (which sends a vector $v \in V$ to $Av \in W$) , $x,y \in Rowspace(A),\: x \neq y$. 
$$If Ax = Ay \:\text{then}\: Ax-Ay=A(x-y)=0, \text{then}\: x-y \in Nullspace(A)$$ Since $Rowspace(A)$ is a linear subspace of $V$, every linear combination of $x,y$ is in $Rowspace(A)$, in particular $x-y$, so $x-y \in Rowspace(A)$ and $x-y \in Rowspace(A) \cap Nullspace(A)$.
The last step is a consequence of the "Rank-Nullity theorem" (you can look for it in any linear Algebra book, for example, Friedberg's "Linear Algebra"). In terms of matrices it says that:
$$ dimension(Rowspace(A)) \oplus dimension (Nullspace(A)) = dimension (V)$$
Now, $\oplus$ means direct sum of 2 linear subspaces of $V$, which means that $Rowspace(A) \cap Nullspace(A) = {0}$. By this last statement, $x-y=0$, so $x=y$, a contradiction of the hypothesis $x\neq y$.
If you want to really learn Linear Algebra I suggest you expand your learning experience from a book.
