Skip to content

3.2-exam1-2000

Quiz 1, 2000 · Section 3.2: Computing the Nullspace by Elimination: A = CR Source: exam1_1.pdf, pp. 31, 34

Problem

1 (30 pts.) Suppose the matrix \(A\) has reduced row echelon form \(R\):

\[ A = \begin{bmatrix} 1 & 2 & 1 & b \\ 2 & a & 1 & 8 \\ & \text{(row 3)} & \end{bmatrix}, \qquad R = \begin{bmatrix} 1 & 2 & 0 & 3 \\ 0 & 0 & 1 & 2 \\ 0 & 0 & 0 & 0 \end{bmatrix}. \]

(a) What can you say immediately about row 3 of \(A\)?

(b) What are the numbers \(a\) and \(b\)?

(c) Describe all solutions of \(Rx = 0\). Circle the spaces that are the same for \(A\) as for \(R\): (row space)(column space)(null space).

Solution (a) Because row 3 of \(R\) is all zeros, row 3 of \(A\) must be a linear combination of rows 1 and 2 of \(A\). The three rows of \(A\) are linearly dependent. (b) After one step of elimination we have \[ \left[ \begin{array}{cccc} 1 & 2 & 1 & b \\ 0 & a-4 & -1 & 8-2b \\ & \text{(row 3)} & \end{array} \right]. \] Looking at \(R\) we see that the second column of \(A\) is not a pivot column, so \(a = 4\). Continuing with elimination, we get to \[ \left[ \begin{array}{cccc} 1 & 2 & 0 & 8-b \\ 0 & 0 & 1 & 2b-8 \\ 0 & 0 & 0 & 0 \end{array} \right]. \] Comparing this to \(R\) we see that \(b = 5\). (c) Setting the free variables \(x_2\) and \(x_4\) to 1 and 0, and vice versa, and solving \(Rx = 0\), we get the nullspace solution \[ x = c \left[ \begin{array}{c} -2 \\ 1 \\ 0 \\ 0 \end{array} \right] + d \left[ \begin{array}{c} -3 \\ 0 \\ -2 \\ 1 \end{array} \right]. \] The row space and the nullspace are always the same for \(A\) and \(R\).

Keywords: reduced row echelon form, elimination, nullspace, row space