rank(AB)≥rank(A)+rank(B)−n
Where A:s×nB:n×m
[In−A0Is][InAB0][In0−BIm]=[In00−AB]
Therefore:
r(A)+r(B)≤r[InAB0]=r[In00−AB]=n+r(−AB)=n+r(AB)
A similar approach can be used to prove a stronger conclusion (Frobenius Rank Inequality): r(AB)+r(BC)≤r(ABC)+r(B)
Proof:
r(ABC)+r(BC)=r[0ABCB0]=r[−BCABCB0]=r[−BC0BAB]≥r(AB)+r(BC)
By setting BC=In, the original conclusion can be derived.
Suppose there exist invertible matrices P and Q such that:
PAQ=[Ir000]
Where r=r(A).
Let:
Q−1B=[B1B0]
Where B1 is a matrix with r(A) rows.
Thus:
r(AB)=r(PAQQ−1B)=r([Ir000][B1B0])=r[B10]
Since:
r[B10]+n−r(A)≥r[B1B0]=r(Q−1B)=r(B)
Therefore:
r(AB)+n−r(A)≥r(B)
Consider A:Rn→RsB:Rm→Rn
By the Rank-Nullity Theorem:
dimN(A)+dimR(A)=n,r(A)=dimR(A)
To prove the conclusion:
r(AB)≥r(A)+r(B)−n
Which is equivalent to:
r(AB)−n≥r(A)−n+r(B)−n
This is equivalent to:
dimN(AB)≤dimN(B)+dimN(A)
We know that:
N(AB)={x∈Rm∣Bx∈N(A)}
Thus:
dimN(AB)=dimN(B)+dim(R(B)∩N(A))≤dimN(B)+dimN(A)
Thus, the original proposition is proven.