3.4-final-2012-strang¶
Final Exam, 2012 (strang) · Section 3.4: Independence, Basis, and Dimension Source: finalexam_2.pdf, pp. 75-76
Problem¶
2 (12 pts.) Suppose \(A\) has rank 1, and \(B\) has rank 2 (\(A\) and \(B\) are both \(3 \times 3\) matrices).
(a) What are the possible ranks of \(A + B\)?
(b) Give an example of each possibility you had in (a).
(c) What are the possible ranks of \(AB\)? Give an example of each possibility.
Solution
(a) Of course \(0 \le \mathrm{rank}(A + B) \le 3\). But the only ranks that are possible are \[ \mathrm{rank}(A + B) = 1, 2, 3. \] The reason 0 is not an option: it would imply \(A + B = 0\), i.e. \(A = -B\). But \(\mathrm{rank}(-B) = \mathrm{rank}(B)\), so for that to happen \(A\) and \(B\) would need the same rank. (b) Examples: - Rank \(A + B = 1\): \(A = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}\), \(B = \begin{bmatrix} -1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 0 \end{bmatrix}\) (sum has rank 1). - Rank \(A + B = 2\): \(A = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}\), \(B = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 0 \end{bmatrix}\) (sum has rank 2). - Rank \(A + B = 3\): \(A = \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 1 \end{bmatrix}\), \(B = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 0 \end{bmatrix}\) (sum is the identity, rank 3). (c) As a general rule, \(0 \le \mathrm{rank}(AB) \le \min(\mathrm{rank}(A), \mathrm{rank}(B)) = 1\). In this case both possibilities happen: \[ \mathrm{rank}(AB) = 0, 1. \] Diagonal examples suffice: - Rank \(AB = 0\): \(A = \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 1 \end{bmatrix}\), \(B = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 0 \end{bmatrix}\) (product is the zero matrix). - Rank \(AB = 1\): \(A = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}\), \(B = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 0 \end{bmatrix}\) (product has rank 1).Keywords: rank of A+B, rank of AB, rank bounds, examples