# Block matrix composed of square matrices

Let $A$, $B$, $C$, and $D$, be $n\times n$ matrices.

a) Show that the block matrix $\begin{bmatrix}A & B\\ C & D \end{bmatrix}$ has rank at least as large as the rank of $A$.

b) Show that the matrices $\begin{bmatrix}A & 0\\ 0 & B \end{bmatrix}$ and $\begin{bmatrix}A+B & B\\ B & B \end{bmatrix}$ are equivalent.

c) Show that the $rank(A+B)\leq rank(A)+rank(B)$.

Does anybody have an idea to prove above statements?

• Do you know that rank of a matrix can be defined as the dimension of its row space (equiv. dimension of its column space)? – hardmath Oct 8 '13 at 1:35
• @hardmath yeah, how would you apply it to the statement? – Mark Oct 8 '13 at 1:38
• Seems like homework questions! – Ehsan M. Kermani Oct 8 '13 at 1:39
• @EhsanM.Kermani It is. I just need a way to start the proof – Mark Oct 8 '13 at 1:41
• Well then, start with the definition of rank for a) – Ehsan M. Kermani Oct 8 '13 at 1:45

3. I'm not sure of a rigorous way but you can prove that $(\mathbf{A}+\mathbf{B})\mathbf{x}=\mathbf{}\mathbf{Ax}+\mathbf{Bx}$ can span the space at most the space spanned by $\mathbf{A},\mathbf{B}$ together by considering tall matrices. For a wide matrix the equality can never be attained and for square matrix it's obvious.
• From $(A+B)x = Ax + Bx$ we see that the column space of $A+B$ is contained in the span of the column space of $A$ and the column space of $B$. – Robert Israel Oct 8 '13 at 2:03