Skip to content

3.3-exam1-2009-fall

Quiz 1, 2009 (fall) · Section 3.3: The Complete Solution to Ax = b Source: exam1_1.pdf, pp. 216-218

Problem

Problem 3. Consider the matrix

\[ A = \begin{bmatrix} 1 & 2 & 1 & 2 & 2 \\ -1 & -2 & 0 & 0 & -1 \\ 1 & 2 & 0 & 0 & 1 \end{bmatrix} \]

(a) Find the complete solution of the equation \(Ax = 0\).

(b) Find the complete solution of the equation \(Ax = \begin{bmatrix} 2 \\ 1 \\ -1 \end{bmatrix}\).

(c) Find all vectors \(b\) such that the equation \(Ax = b\) has a solution.

(d) Find a matrix \(B\) such that \(N(A) = C(B)\).

(e) Find bases of the four fundamental subspaces for the matrix \(A\).

Solution In preparation for the next problems, let's first row reduce this matrix with an arbitrary vector augmented. \[ \begin{bmatrix} 1 & 2 & 1 & 2 & 2 & b_1 \\ -1 & -2 & 0 & 0 & -1 & b_2 \\ 1 & 2 & 0 & 0 & 1 & b_3 \end{bmatrix} \to \begin{bmatrix} 1 & 2 & 1 & 2 & 2 & b_1 \\ 0 & 0 & 1 & 2 & 1 & b_1 + b_2 \\ 0 & 0 & -1 & -2 & -1 & b_3 - b_1 \end{bmatrix} \] \[ \to \begin{bmatrix} 1 & 2 & 1 & 2 & 2 & b_1 \\ 0 & 0 & 1 & 2 & 1 & b_1 + b_2 \\ 0 & 0 & 0 & 0 & 0 & b_2 + b_3 \end{bmatrix} \] (a) We are finding the nullspace, or the solution when \(b_1 = b_2 = b_3 = 0\). Since this matrix has 2 pivots and 3 free columns, a general solution is just any linear combination of the nullspace basis vectors: \[ c_1 \begin{bmatrix} -2 \\ 1 \\ 0 \\ 0 \\ 0 \end{bmatrix} + c_2 \begin{bmatrix} 0 \\ 0 \\ -2 \\ 1 \\ 0 \end{bmatrix} + c_3 \begin{bmatrix} -1 \\ 0 \\ -1 \\ 0 \\ 1 \end{bmatrix}. \] (b) To find a general solution, we set \(b_1 = 2\), \(b_2 = 1\) and \(b_3 = -1\) in our augmented matrix row reduction performed above. We find a particular solution to \[ \begin{bmatrix} 1 & 2 & 1 & 2 & 2 \\ 0 & 0 & 1 & 2 & 1 \\ 0 & 0 & 0 & 0 & 0 \end{bmatrix} x = \begin{bmatrix} 2 \\ 3 \\ 0 \end{bmatrix}, \] which is a vector with zeros in the free variables, so we solve directly and find our particular solution: \[ x_p = \begin{bmatrix} -1 \\ 0 \\ 3 \\ 0 \\ 0 \end{bmatrix}. \] Thus a general solution is just this particular solution plus the general solution for a nullspace vector given in part (a): \[ \begin{bmatrix} -1 \\ 0 \\ 3 \\ 0 \\ 0 \end{bmatrix} + c_1 \begin{bmatrix} -2 \\ 1 \\ 0 \\ 0 \\ 0 \end{bmatrix} + c_2 \begin{bmatrix} 0 \\ 0 \\ -2 \\ 1 \\ 0 \end{bmatrix} + c_3 \begin{bmatrix} -1 \\ 0 \\ -1 \\ 0 \\ 1 \end{bmatrix}. \] (c) Finding all vectors \(b\) such that \(Ax = b\) has a solution is asking for the condition on \(b\) so that it is in the column space. From our original computation, we see that we must have \(b_2 + b_3 = 0\), so an arbitrary vector in the column space looks like \(\begin{bmatrix} b_1 \\ b_2 \\ -b_2 \end{bmatrix}\), where \(b_1\) and \(b_2\) are any real numbers. In other words, the column space is spanned by vectors of the form: \[ b_1 \begin{bmatrix} 1 \\ 0 \\ 0 \end{bmatrix} + b_2 \begin{bmatrix} 0 \\ 1 \\ -1 \end{bmatrix}. \] (d) To find a matrix \(B\) such that \(N(A) = C(B)\), we can simply take a matrix whose column vectors are a basis for the nullspace of \(A\). In other words, the matrix: \[ B = \begin{bmatrix} -2 & 0 & -1 \\ 1 & 0 & 0 \\ 0 & -2 & -1 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}. \] (e) Observe that the three vectors in part (a) form a basis for the nullspace of \(A\), and the two vectors in part (c) form a basis for the column space of \(A\). Thus all that is left is to find basis vectors for the row space, which we can take to be the two independent row vectors corresponding to the pivot rows of \(A\): \((1 \ 2 \ 1 \ 2 \ 2)^T\) and \((0 \ 0 \ 1 \ 2 \ 1)^T\). A basis for the left nullspace is given by the vector that is in the nullspace of the matrix whose rows are the basis vectors for the column space of \(A\): \[ \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & -1 \end{bmatrix}. \] Thus a basis for the left nullspace is given by the vector \(\begin{bmatrix} 0 \\ 1 \\ 1 \end{bmatrix}\).

Keywords: complete solution, nullspace, column space, row space, left nullspace