Definitions:
- Let $A$ be an $n\times n$ matrix. The $n\times n$ matrix $B(=A^{-1})$ is an inverse for $A$ if $AB=BA=I$.
- Let $A$ be a $k\times n$ matrix.The $n\times k$ matrix $B$ is a right inverse for $A$ if $AB=I$.The $n\times k$ matrix $C$ is a right inverse for $A$ if $CA=I$.
- Here $I$ is identity matrix of appropriate order.
Now,
Theorem 2: For any square matrix $A$, the following statements are equivalent:
$A$ has inverse.
$A$ has a right inverse.
$A$ has a left inverse.
I know that
Theorem 1: If $A$ has a right inverse $B$ and a left inverse $C$, then $A$ is invertible and $B=C=A^{-1}$.
Proof: $C=CI=C(AB)=(CA)B=IB=B.$
But I can't prove Theorem 2 .