Prove Sylvester rank inequality: $\text{rank}(AB)\ge\text{rank}(A)+\text{rank}(B)-n$

14.3k Views Asked by At

If $A$ is a $m \times n$ matrix and $B$ a $n \times k$ matrix, prove that

$$\text{rank}(AB)\ge\text{rank}(A)+\text{rank}(B)-n.$$

Also show when equality occurs.

3

There are 3 best solutions below

1
On

Recall Linear Transformations Isomorphic to Matrix Space.

Using Rank–nullity theorem, $\operatorname{rank}(A)+\operatorname{nullity}(A)=n,\operatorname{rank}(B)+\operatorname{nullity}(B)=k$ and $\operatorname{rank}(AB)+\operatorname{nullity}(AB)=k.$

So, $\operatorname{rank}(A)+\operatorname{rank}(B)+\operatorname{nullity}(A)+\operatorname{nullity}(B)=n+\operatorname{rank}(AB)+\operatorname{nullity}(AB)$

$\implies \operatorname{rank}(AB)-\operatorname{rank}(A)-\operatorname{rank}(B)+n=\operatorname{nullity}(A)+\operatorname{nullity}(B)-\operatorname{nullity}(AB)$

$\geq \operatorname{nullity}(A)$[Since $Bv_2=0$ for $v_2\in Mat_{k\times 1}(F)\implies ABv_2=0$] $\geq 0.$

7
On

We claim $\dim \ker\,A+\dim\ker B \geq \dim\ker (AB)$. By using the rank-nullity theorem, we can then deduce that $\text{rank}(AB) ≥ \text{rank}(A) + \text{rank}(B) − n.$

Let $\beta=\{\alpha_1,\dots,\alpha_r \}$ be a basis for $\ker B$. It is not hard to see that $\ker B\subseteq \ker (AB)$ so we can extend $\beta $ to a basis for $\ker (AB)$. Suppose $\{\alpha_1,\dots,\alpha_r,\alpha_{r+1},\dots,\alpha_n \ \}$ be basis for $\ker (AB)$. So $B(\alpha_{i})\neq 0$ for $i \in \{r<i<n+1\}$.

We show that $\{B(\alpha_{r+1}),\dots,B(\alpha_{n})\}$ is linear independent. If we can show that, then we would have $\dim\ker A\geq n-r$. Thus, assume that $\displaystyle\sum_{i=r+1}^n\gamma_iB(\alpha_i)=0$. Since $B$ is linear, we have $B(\displaystyle\sum_{i=r+1}^n\gamma_i\alpha_i)=0$, so that $\displaystyle\sum_{i=r+1}^n\gamma_i\alpha_i$ belongs to the kernel of $B$. On other hand, we already know that $\beta=\{\alpha_1,\dots,\alpha_r \}$ is a basis for the kernel B. Next since the set $\{\alpha_1,\dots,\alpha_r,\alpha_{r+1},\dots,\alpha_n \ \}$ is an independent set, we infer that $\gamma_i$ must be zero for all $i = r+1,...,n$.

Now one can see that $$\dim\ker A+\dim\ker B \geqslant n-r+r =n \Longrightarrow\dim\ker A+\dim\ker B \geqslant \dim\ker (AB).$$

0
On

As noted in the other answer, it suffices to show $\dim\ \operatorname{Ker}(A)+\dim\ \operatorname{Ker}(B) \geq \dim\ \operatorname{Ker}(AB)$. This is equivalent to showing that $\dim\ \operatorname{Ker}(AB)/\operatorname{Ker}(B) \leq \dim\ \operatorname{Ker}(A)$. To do this, use the first isomorphism theorem for vector spaces on the linear map $\operatorname{Ker}(AB) \rightarrow \operatorname{Ker}(A)$ defined by $x \mapsto Bx$. This shows that $\operatorname{Ker}(AB)/\operatorname{Ker}(B)$ is isomorphic to a subspace of $\operatorname{Ker}(A)$, which proves the inequality.