Skip to content

3.3-exam1-2005

Quiz 1, 2005 · Section 3.3: The Complete Solution to Ax = b Source: exam1_1.pdf, pp. 118, 124

Problem

2 (40 pts.) Suppose \(A\) is this 3 by 4 matrix:

\[ A = \begin{bmatrix} 1 & 2 & 3 & 4 \\ 2 & 3 & 4 & 5 \\ 3 & 4 & 5 & 6 \end{bmatrix} \]

(a) A specific basis for the column space of \(A\) is ____.

(b) For which vectors \(b = \begin{bmatrix} b_1 \\ b_2 \\ b_3 \end{bmatrix}\) does \(Ax = b\) have a solution? Give conditions on \(b_1, b_2, b_3\).

(c) There is no 4 by 3 matrix \(B\) for which \(AB = I\) (3 by 3). Give a good reason (is this because \(A\) is rectangular?).

(d) Find the complete solution to \(Ax = \begin{bmatrix} 1 \\ 0 \\ -1 \end{bmatrix}\).

Solution (a) \(\begin{bmatrix} 1 \\ 2 \\ 3 \end{bmatrix}, \begin{bmatrix} 2 \\ 3 \\ 4 \end{bmatrix}\) is a basis for the column space of \(A\). So is \(\begin{bmatrix} 1 \\ 2 \\ 3 \end{bmatrix}, \begin{bmatrix} 1 \\ 1 \\ 1 \end{bmatrix}\). (b) Row reducing the augmented matrix \([A \ b]\), we get \[ \left[ \begin{array}{cccc|c} 1 & 2 & 3 & 4 & b_1 \\ 0 & -1 & -2 & -3 & b_2 - 2b_1 \\ 0 & 0 & 0 & 0 & b_3 - 2b_2 + b_1 \end{array} \right]. \] The linear equations corresponding to the top two rows can be satisfied regardless of the values of \(b_1\) and \(b_2\), and the bottom row of all zeroes imposes the condition \(b_3 - 2b_2 + b_1 = 0\). Hence \(Ax = b\) has a solution if and only if \(b_3 - 2b_2 + b_1 = 0\). (c) This is because \(A\) is not full row-rank, as shown in part (b). If \(AB = I\) then we could solve \(Ab_1 =\) row 1 of \(I\), \(Ab_2 =\) row 2 of \(I\), \(Ab_3 =\) row 3 of \(I\), and every equation \(Ax = b\). Actually the solution would be \(x = Bb\). But in part (b) we saw that \(Ax = b\) has no solution for some \(b\). (d) We perform the row reduction \[ \left[ \begin{array}{cccc|c} 1 & 2 & 3 & 4 & 1 \\ 2 & 3 & 4 & 5 & 0 \\ 3 & 4 & 5 & 6 & -1 \end{array} \right] \to \left[ \begin{array}{cccc|c} 1 & 2 & 3 & 4 & 1 \\ 0 & -1 & -2 & -3 & -2 \\ 0 & 0 & 0 & 0 & 0 \end{array} \right] \to \left[ \begin{array}{cccc|c} 1 & 0 & -1 & -2 & -3 \\ 0 & 1 & 2 & 3 & 2 \\ 0 & 0 & 0 & 0 & 0 \end{array} \right]. \] Then \(x_p = \left[ \begin{array}{c} -3 \\ 2 \\ 0 \\ 0 \end{array} \right]\) is a particular solution, and \[ s_3 = \left[ \begin{array}{c} 1 \\ -2 \\ 1 \\ 0 \end{array} \right] \quad \text{and} \quad s_4 = \left[ \begin{array}{c} 2 \\ -3 \\ 0 \\ 1 \end{array} \right] \] are special solutions forming a basis of the nullspace of \(A\). Hence the general solution is \[ x = x_p + x_n = x_p + cs_3 + ds_4. \]

Keywords: column space, basis, complete solution, consistency, nullspace