I have to prove this lemma without using the concept of rank neither the concept of determinant:
$A$ is a singular matrix iff $A^T$ is singular
Unfortunately i've only found proofs that contains rank and determinant. Can you help me ?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this communityI have to prove this lemma without using the concept of rank neither the concept of determinant:
$A$ is a singular matrix iff $A^T$ is singular
Unfortunately i've only found proofs that contains rank and determinant. Can you help me ?
Assume for contradiction that $A^T$ was invertible, then there would be a matrix $B$ with $BA^T=I$. But that means $I=I^T=(BA^T)^T=AB^T$, so $B^T$ would be an inverse for $A$, which is impossible.
Formally, a singular matrix $A$ is one for which there does not exist another matrix $B$ with $AB=BA=I$.
The statement here can be proven through the contrapositive: if $A$ is not singular, there exists some $B$ with $AB=I$. Transposing this gives $B^TA^T=I$, so $A^T$ is not singular. Thus if $A^T$ is singular, $A$ is singular. Replacing $A$ with $A^T$ in the last sentence gives the other direction, so the original statement is established.
If $A$ were singular, then the kernel (null space) of $A$ has nonzero vectors in it. That is, $Ax = 0$ admits nontrivial (nonzero) solutions. Now take the transpose on each side. Then if $x$ is nonzero, so is $x^T$ (clearly), and so $x^T A^T = 0^T$ also admits nonzero solutions, so $A^T$ is singular.