# the rank of idempotent matrices

Let $B_i, i=1,2,\cdots,k$ be idempotent matrices, i.e. $B_i^2=B_i$. Can we prove that $\mathrm{rank}(I-B_1\cdots B_k)\leq \sum\limits_{i=1}^k \mathrm{rank}(I-B_i)$, where $I$ is the identity matrix?

-

Edit: The inequality is true for general $B_i$s. Idempotence is not needed (thanks to robinson for his/her comment.) \begin{align*} \mathrm{rank}(I-AB) &= \mathrm{rank}(I-A+A-AB)\\ &\le \mathrm{rank}(I-A)+\mathrm{rank}(A-AB)\tag{1}\\ &= \mathrm{rank}(I-A)+\mathrm{rank}(A(I-B))\\ &\le \mathrm{rank}(I-A)+\mathrm{rank}(I-B)\tag{2}, \end{align*} where $(1)$ is due to the fact that $\mathrm{rank}(X+Y)\le\mathrm{rank}(X)+\mathrm{rank}(Y)$ and $(2)$ is due to the inequality $\mathrm{rank}(XY)\le\min\left(\mathrm{rank}(X), \mathrm{rank}(Y)\right)$. Apply the displayed inequality recursively, we get the result.
@user1551 Year, as robinson said, the idempotence is not used in (2). since we have $rank(AB)\leq \min(rank(A),rank(B))$. –  XLDD Jun 1 '13 at 8:40