Skip to content

3.3-exam1-2005-strang

Quiz 1, 2005 (strang) · Section 3.3: The Complete Solution to Ax = b Source: exam1_1.pdf, pp. 144, 149

Problem

1 (26 pts.) Suppose \(A\) is reduced by the usual row operations to

\[ R = \begin{bmatrix} 1 & 4 & 0 & 2 \\ 0 & 0 & 1 & 2 \\ 0 & 0 & 0 & 0 \end{bmatrix}. \]

Find the complete solution (if a solution exists) to this system involving the original \(A\):

\[ Ax = \text{sum of the columns of } A. \]
Solution The complete solution \(x = x_{\text{particular}} + x_{\text{nullspace}}\) has \[ x_{\text{particular}} = \begin{bmatrix} 1 \\ 1 \\ 1 \\ 1 \end{bmatrix}, \qquad x_{\text{nullspace}} = x_2 \begin{bmatrix} -4 \\ 1 \\ 0 \\ 0 \end{bmatrix} + x_4 \begin{bmatrix} -2 \\ 0 \\ -2 \\ 1 \end{bmatrix}. \] The free variables \(x_2\) and \(x_4\) can take any values. The two special solutions came from the nullspace of \(R\) = nullspace of \(A\). The particular solution of 1's gives \(Ax =\) sum of the columns of \(A\). *Note:* This also gives \(Rx =\) sum of columns of \(R\).

Keywords: complete solution, nullspace, special solutions, row echelon form