3.5-exam1-2005-strang-b¶
Quiz 1, 2005 (strang) · Section 3.5: Dimensions of the Four Subspaces Source: exam1_1.pdf, pp. 148, 152
Problem¶
4 (16 pts.) Suppose the columns of a 7 by 4 matrix \(A\) are linearly independent.
(a) After row operations reduce \(A\) to \(U\) or \(R\), how many rows will be all zero (or is it impossible to tell)?
(b) What is the row space of \(A\)? Explain why this equation will surely be solvable:
\[
A^T y = \begin{bmatrix} 1 \\ 0 \\ 0 \\ 0 \end{bmatrix}.
\]
Solution
(a) The rank is 4, so there will be \(7 - 4 = 3\) rows of zeros in \(U\) and \(R\). (b) The row space of \(A\) will be all of \(\mathbb{R}^4\) (since the rank is 4). Then every vector \(c\) in \(\mathbb{R}^4\) is a combination of the rows of \(A\), which means that \(A^T y = c\) is solvable for every right side \(c\).Keywords: rank, row space, column space, linearly independent columns