Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

How to prove $\text{Rank}(AB)\leq \min(\text{Rank}(A), \text{Rank}(B))$?

share|improve this question
13  
The rank of a matrix $A$ which maps $V$ to $W$ is the same as the dimension of the image of $V$, which will be some subspace $U$. $AB$ is the composite of two linear maps. Try tracking the image and its dimension through subspaces as you do one after the other. –  Mark Bennet Jul 2 '11 at 7:14
3  

4 Answers 4

up vote 6 down vote accepted

I used a way to prove this, which I thought may not be the most concise way but it feels very intuitive to me. The matrix $AB$ is actually a matrix that consist the linear combination of $A$ with $B$ the multipliers. So it looks like... $$\boldsymbol{AB}=\begin{bmatrix} & & & \\ a_1 & a_2 & ... & a_n\\ & & & \end{bmatrix} \begin{bmatrix} & & & \\ b_1 & b_2 & ... & b_n\\ & & & \end{bmatrix} = \begin{bmatrix} & & & \\ \boldsymbol{A}b_1 & \boldsymbol{A}b_2 & ... & \boldsymbol{A}b_n\\ & & & \end{bmatrix}$$ Suppose if $B$ is singular, then when $B$, being the multipliers of $A$, will naturally obtain another singular matrix of $AB$. Similarly, if $B$ is non-singular, then $AB$ will be non-singular. Therefore, the $rank(AB) \leq rank(B)$.

Then now if $A$ is singular, then clearly, no matter what $B$ is, the $rank(AB)\leq rank(A)$. The $rank(AB)$ is immediately capped by the rank of $A$ unless the the rank of $B$ is even smaller.

Put these two ideas together, the rank of $AB$ must have been capped the rank of $A$ or $B$, which ever is smaller. Therefore, $rank(AB) \leq min(rank(A), rank(B))$.

Hope this helps you!

share|improve this answer

Hint: Show that rows of $AB$ are linear combinations of rows of $B$. Transpose this hint.

share|improve this answer

Surely vectors that are in the kernel of $B$ are also in the kernel of $AB$. Vectors that are in the kernel of $A^t$ are also in the kernel of $(AB)^t=B^tA^t$ therefore with the fact that Rank(A)=Rank($A^t$) and the knowledge that the rank gives you the size of the kernel of a Matrix you are done.

share|improve this answer

You know that a linear transformation cannot increase the dimension of its domain; i.e. If $T: V\rightarrow W$ is a linear transformation, $$\dim(T(V))\le \dim(V).$$

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

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