Let's assume that $A$ is a $m \times n$ matrix with linearly independent columns. Why are the columns of $A(A^T)$ also linearly independent? Is this new matrix invertible? What about $(A^T)A$?
Asked
Active
Viewed 8,501 times
4
-
4What have you done? Where are you stuck? Are you asking, requesting or demanding? – Pragabhava Oct 24 '12 at 23:40
-
1Does it help, if you know that $\operatorname{rank}(AA^{T})=\operatorname{rank}(A)=\operatorname{rank}(A^T)$? See this question: Null space for $AA^{T}$ is the same as Null space for $A^{T}$ – Martin Sleziak Oct 26 '12 at 04:22
1 Answers
2
The columns of $AA^T$ cannot be linearly independent unless $m=n$. If the columns of $A$ are linearly independent, then necessarily $m\ge n$.
If $m>n$, then $AA^T$ has $m$ columns, each of which is a linear combination of the columns of $A$, and there are only $n$ of those, so you have more than $n$ vectors in a space of dimension $n$, so they're not linearly independent.
Maybe I'll post the other cases here tomorrow . . . . . . .
(Bottom line: the columns in those other cases are linearly independent.)
