For all matrix $\mathbf{M} \in \mathbb{R}^{m,n}$ and $\mathbf{N} \in \mathbb{R}^{n,p}$, the inequality $\operatorname{rank}\mathbf{M} + \operatorname{rank}\mathbf{N} - n \leq \operatorname{rank}(\mathbf{M}\mathbf{N}) \leq \min(\operatorname{rank}\mathbf{M},\operatorname{rank}\mathbf{N})$ holds. What would be a proof of this theorem?
Asked
Active
Viewed 45 times
1
-
Possible duplicate and for the other part – May 06 '15 at 02:23
-
Here's another proof of Sylvester's inequality (page 3) and the other part (problem 15). – May 06 '15 at 02:24