2
$\begingroup$

Let $A$ be an $m \times n$ matrix and $B$ be an $n \times m$ matrix. Show that if $AB = I$, where $I$ is the identity matrix, then $\mathrm{rank}(B) = m$.

I'm not exactly sure how to start this problem. I know that rank is related to the RREF of a matrix but I'm unsure as to how I can relate that to this problem..

$\endgroup$
1
3
$\begingroup$

Rank(AB) <= min( Rank(A), Rank(B) ). If rank(B) were not $m$ then Rank(AB) would be less than m, but the rank of $I$ is m. So this would be a contradiction.

Note: here I'm assuming that $m<n$.

$\endgroup$
2
  • 1
    $\begingroup$ You don't need to assume $m \lt n$. Your argument is $m=$ Rank$(AB) \le $ Rank$(B)$, but also Rank$(B) \le m$ by counting the columns of $B$. $\endgroup$
    – hardmath
    Oct 11 '14 at 0:49
  • $\begingroup$ @hardmath , thank you. You're totally right. $\endgroup$
    – NicNic8
    Oct 11 '14 at 0:51
2
$\begingroup$

Let $L_A, L_B$ the associated linear transformation of each matrix. So $L_AL_B=\text{id}$, from here follows that $L_B$ is injective, i.e., $\ker( L_B)=\ker{B}=\{0\}$. So $m=\text{rank}{B}+\text{dim}(kerB)=\text{rank}{B}$.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.