3.2-exam1-2010¶
Quiz 1, 2010 · Section 3.2: Computing the Nullspace by Elimination: A = CR Source: exam1_2.pdf, pp. 1-2
Problem¶
1. Forward elimination changes \(Ax = b\) to a row reduced \(Rx = d\): the complete solution is
\[
x = \begin{bmatrix} 4 \\ 0 \\ 0 \end{bmatrix} + c_1 \begin{bmatrix} 2 \\ 1 \\ 0 \end{bmatrix} + c_2 \begin{bmatrix} 5 \\ 0 \\ 1 \end{bmatrix}.
\]
(a) (14 points) What is the 3 by 3 reduced row echelon matrix \(R\) and what is \(d\)?
(b) (10 points) If the process of elimination subtracted 3 times row 1 from row 2 and then 5 times row 1 from row 3, what matrix connects \(R\) and \(d\) to the original \(A\) and \(b\)? Use this matrix to find \(A\) and \(b\).
Solution
(a) First, since \(R\) is in reduced row echelon form, we must have \[ d = \begin{bmatrix} 4 & 0 & 0 \end{bmatrix}^T. \] The other two vectors provide special solutions for \(R\), showing that \(R\) has rank 1. Again, since it is in reduced row echelon form, the bottom two rows must be all 0, and the top row is \(\begin{bmatrix} 1 & -2 & -5 \end{bmatrix}\), i.e. \[ R = \begin{bmatrix} 1 & -2 & -5 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}. \] (b) The matrix connecting \(R\) and \(d\) to the original \(A\) and \(b\) is \[ E = E_{31}E_{21} = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ -5 & 0 & 1 \end{bmatrix} \cdot \begin{bmatrix} 1 & 0 & 0 \\ -3 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix} = \begin{bmatrix} 1 & 0 & 0 \\ -3 & 1 & 0 \\ -5 & 0 & 1 \end{bmatrix}. \] That is, \(R = EA\) and \(Eb = d\). Thus \(A = E^{-1}R\) and \(b = E^{-1}d\), giving \[ A = \begin{bmatrix} 1 & 0 & 0 \\ 3 & 1 & 0 \\ 5 & 0 & 1 \end{bmatrix} \cdot \begin{bmatrix} 1 & -2 & -5 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix} = \begin{bmatrix} 1 & -2 & -5 \\ 3 & -6 & -15 \\ 5 & -10 & -25 \end{bmatrix} \] and \[ b = \begin{bmatrix} 1 & 0 & 0 \\ 3 & 1 & 0 \\ 5 & 0 & 1 \end{bmatrix} \cdot \begin{bmatrix} 4 \\ 0 \\ 0 \end{bmatrix} = \begin{bmatrix} 4 \\ 12 \\ 20 \end{bmatrix}. \]Keywords: reduced row echelon form, special solutions, elimination matrix