Skip to content

3.5-exam1-2012-strang-b

Quiz 1, 2012 (strang) · Section 3.5: Dimensions of the Four Subspaces Source: exam1_2.pdf, p. 30

Problem

3 (a) (16 pts.) Suppose three matrices satisfy \(AB = C\). If the columns of \(B\) are dependent, show that the columns of \(C\) are dependent. (b) (12 pts.) If \(A\) is 5 by 3 and \(B\) is 3 by 5, show using part (a) or otherwise that \(AB = I\) is impossible.

Solution (a) The columns of \(B\) being dependent means by definition that there is a vector \(x \neq 0\) such that \(Bx = 0\). But then we also have \[ Cx = (AB)x = A(Bx) = A(0) = 0, \] which means that the same \(x \neq 0\) works to show that the columns of \(C\) are dependent. (b) The columns of \(B\) are dependent, since these are five vectors in \(R^3\), and \(5 > 3\). Thus, by part (a), the columns of \(AB\) must be dependent. However, the columns of \(I\) are independent, so \(AB\) can never equal \(I\). [Note: switching the order matters here. One can indeed find a \(3 \times 5\) matrix \(A\) and a \(5 \times 3\) matrix \(B\) such that \(AB = I\) is the \(3 \times 3\) identity — hence any proof that is insensitive to the order of \(A\) and \(B\) must be flawed.]

Keywords: linear dependence, matrix multiplication, rank, identity matrix