3.3-exam1-1997-strang¶
Quiz 1, 1997 (strang) · Section 3.3: The Complete Solution to Ax = b Source: exam1_1.pdf, pp. 8-9
Problem¶
1. (36 points = 4 times 9) \(A\) is a 3 by 4 matrix and \(b\) is a column vector in \(R^3\):
(a) Reduce \(Ax = b\) to echelon form \(Ux = c\) and find one solution \(x_p\) (if a solution exists).
(b) Find all solutions to this system \(Ax = b\) (if solutions exist). Describe this set of solutions geometrically. Is it a subspace?
(c) What is the column space of this matrix \(A\)? Change the entry 7 in the lower right corner to a different number that gives a smaller column space for the new matrix (call it \(M\)). The new entry is ____.
(d) Give a right side \(b\) so that your new \(Mx = b\) has a solution and a right side \(b\) so that \(Mx = b\) has no solution.
Solution
(a) Eliminate the augmented matrix: \[ [A\ b] = \left[ \begin{array}{cccc|c} 1 & 3 & 2 & 2 & 2 \\ 2 & 7 & 6 & 8 & 7 \\ 3 & 9 & 6 & 7 & 7 \end{array} \right] \to \left[ \begin{array}{cccc|c} 1 & 3 & 2 & 2 & 2 \\ 0 & 1 & 2 & 4 & 3 \\ 0 & 0 & 0 & 1 & 1 \end{array} \right] = [U\ c] \] (row 2 minus 2 times row 1; row 3 minus 3 times row 1). The system is consistent, so a solution exists. From \(Ux = c\): \(x_4 = 1\), \(x_2 + 2x_3 + 4x_4 = 3\), and \(x_1 + 3x_2 + 2x_3 + 2x_4 = 2\). Setting the free variable \(x_3 = 0\) gives the particular solution \[ x_p = \begin{bmatrix} 3 \\ -1 \\ 0 \\ 1 \end{bmatrix}. \] (b) Let \(x_3 = c\) be free. Then \(x_4 = 1\), \(x_2 = -1 - 2c\), and \(x_1 = 3 + 4c\), so all solutions are \[ x = x_p + c\,x_n = \begin{bmatrix} 3 \\ -1 \\ 0 \\ 1 \end{bmatrix} + c \begin{bmatrix} 4 \\ -2 \\ 1 \\ 0 \end{bmatrix}. \] Geometrically this is a line in \(R^4\): a 1-dimensional affine set through \(x_p\), parallel to the nullspace direction \((4,-2,1,0)\). It is NOT a subspace: the zero vector is not among the solutions (every solution has \(x_4 = 1\)), so the set fails the "contains 0" test. (c) There are three pivots (columns 1, 2, 4), so the column space of \(A\) is all of \(R^3\). To get a smaller column space, change the lower right entry 7 to 6 (any value making row 3 a multiple of row 1): then row 3 \(= 3 \times\) row 1, the rank drops to 2, and \(C(M)\) is the 2-dimensional plane spanned by \((1,2,3)\) and \((3,7,9)\). (d) For \(M\) with entry \(M_{34} = 6\), row 3 minus 3 times row 1 is the zero row, so \(Mx = b\) is solvable exactly when \(b_3 = 3b_1\). For example, \(b = (1, 0, 3)\) has a solution, while \(b = (1, 0, 0)\) has none.Keywords: echelon form, complete solution, column space, subspace, consistency