Let $A$ and $B$ be $m\times n$ matrices.
Prove that
\[\rk(A+B) \leq \rk(A)+\rk(B).\]
Add to solve later

Proof.

Let
\[A=[\mathbf{a}_1, \dots, \mathbf{a}_n] \text{ and } B=[\mathbf{b}_1, \dots, \mathbf{b}_n],\]
where $\mathbf{a}_i$ and $\mathbf{b}_i$ are column vectors of $A$ and $B$, respectively.

Then the rank of the matrix $A$ is the dimension of the column space of $A$.
That is, we have
\[\rk(A)=\dim\left(\,\Span(\mathbf{a}_1, \dots, \mathbf{a}_n) \,\right).\]
Similarly, we have
\[\rk(B)=\dim\left(\, \Span(\mathbf{b}_1, \dots, \mathbf{b}_n) \,\right)\]
and
\[\rk(A+B)=\dim\left(\,(\Span(\mathbf{a}_1+\mathbf{b}_1, \dots, \mathbf{a}_n+\mathbf{b}_n)\,\right)\]
since $A+B=[\mathbf{a}_1+\mathbf{b}_1, \dots, \mathbf{a}_n+\mathbf{b}_n]$.

We claim that
\[\Span(\mathbf{a}_1+\mathbf{b}_1, \dots, \mathbf{a}_n+\mathbf{b}_n) \subset \Span(\mathbf{a}_1, \dots, \mathbf{a}_n)+\Span(\mathbf{b}_1, \dots, \mathbf{b}_n).\]
Any vector $\mathbf{x}\in \Span(\mathbf{a}_1+\mathbf{b}_1, \dots, \mathbf{a}_n+\mathbf{b}_n)$ can be written as
\begin{align*}
\mathbf{x}=r_1(\mathbf{a}_1+\mathbf{b}_1)+\cdots +r_n(\mathbf{a}_n+\mathbf{b}_n)
\end{align*}
for some scalars $r_1, \dots, r_n$.

Thus we have
\begin{align*}
\mathbf{x}&=r_1(\mathbf{a}_1+\mathbf{b}_1)+\cdots +r_n(\mathbf{a}_n+\mathbf{b}_n)\\
&=(r_1\mathbf{a}_1+\cdots +r_n\mathbf{a}_n)+(r_1\mathbf{b}_1+\cdots +r_n\mathbf{b}_n)\\
&\in \Span(\mathbf{a}_1, \dots, \mathbf{a}_n)+\Span(\mathbf{b}_1, \dots, \mathbf{b}_n),
\end{align*}
and hence the claim is proved.

Then we have
\begin{align*}
&\rk(A+B)\\
&=\dim\left(\,(\Span(\mathbf{a}_1+\mathbf{b}_1, \dots, \mathbf{a}_n+\mathbf{b}_n)\,\right)\\
&\leq \dim \left(\,\Span(\mathbf{a}_1, \dots, \mathbf{a}_n)+\Span(\mathbf{b}_1, \dots, \mathbf{b}_n) \,\right)\\
&\leq \dim\left(\, \Span(\mathbf{a}_1, \dots, \mathbf{a}_n) \,\right)+\dim \left(\, \Span(\mathbf{b}_1, \dots, \mathbf{b}_n) \,\right) \\
&=\rk(A)+\rk(B).
\end{align*}

Here we used the fact that for two subspaces $U$ and $V$ of a vector space, we have
\[\dim(U+V)\leq \dim(U)+\dim(V).\]
For a proof of this fact, see the post “Dimension of the sum of two subspaces“.

Column Rank = Row Rank. (The Rank of a Matrix is the Same as the Rank of its Transpose)
Let $A$ be an $m\times n$ matrix. Prove that the rank of $A$ is the same as the rank of the transpose matrix $A^{\trans}$.
Hint.
Recall that the rank of a matrix $A$ is the dimension of the range of $A$.
The range of $A$ is spanned by the column vectors of the matrix […]

Rank and Nullity of a Matrix, Nullity of Transpose
Let $A$ be an $m\times n$ matrix. The nullspace of $A$ is denoted by $\calN(A)$.
The dimension of the nullspace of $A$ is called the nullity of $A$.
Prove the followings.
(a) $\calN(A)=\calN(A^{\trans}A)$.
(b) $\rk(A)=\rk(A^{\trans}A)$.
Hint.
For part (b), […]

Quiz 7. Find a Basis of the Range, Rank, and Nullity of a Matrix
(a) Let $A=\begin{bmatrix}
1 & 3 & 0 & 0 \\
1 &3 & 1 & 2 \\
1 & 3 & 1 & 2
\end{bmatrix}$.
Find a basis for the range $\calR(A)$ of $A$ that consists of columns of $A$.
(b) Find the rank and nullity of the matrix $A$ in part (a).
Solution.
(a) […]

Rank of the Product of Matrices $AB$ is Less than or Equal to the Rank of $A$
Let $A$ be an $m \times n$ matrix and $B$ be an $n \times l$ matrix. Then prove the followings.
(a) $\rk(AB) \leq \rk(A)$.
(b) If the matrix $B$ is nonsingular, then $\rk(AB)=\rk(A)$.
Hint.
The rank of an $m \times n$ matrix $M$ is the dimension of the range […]

Row Equivalent Matrix, Bases for the Null Space, Range, and Row Space of a Matrix
Let \[A=\begin{bmatrix}
1 & 1 & 2 \\
2 &2 &4 \\
2 & 3 & 5
\end{bmatrix}.\]
(a) Find a matrix $B$ in reduced row echelon form such that $B$ is row equivalent to the matrix $A$.
(b) Find a basis for the null space of $A$.
(c) Find a basis for the range of $A$ that […]

Find a Basis and the Dimension of the Subspace of the 4-Dimensional Vector Space
Let $V$ be the following subspace of the $4$-dimensional vector space $\R^4$.
\[V:=\left\{ \quad\begin{bmatrix}
x_1 \\
x_2 \\
x_3 \\
x_4
\end{bmatrix} \in \R^4
\quad \middle| \quad
x_1-x_2+x_3-x_4=0 \quad\right\}.\]
Find a basis of the subspace $V$ […]

Hyperplane in $n$-Dimensional Space Through Origin is a Subspace
A hyperplane in $n$-dimensional vector space $\R^n$ is defined to be the set of vectors
\[\begin{bmatrix}
x_1 \\
x_2 \\
\vdots \\
x_n
\end{bmatrix}\in \R^n\]
satisfying the linear equation of the form
\[a_1x_1+a_2x_2+\cdots+a_nx_n=b,\]
[…]

## 1 Response

[…] the post ↴ The rank of the sum of two matrices for a proof of this […]