Skip to content

3.2-exam1-1998-strang

Quiz 1, 1998 (strang) · Section 3.2: Computing the Nullspace by Elimination: A = CR Source: exam1_1.pdf, pp. 15, 17-18

Problem

3. (12) (a) Find the row-reduced echelon form \(R\) of \(A\) and also the inverse matrix \(E^{-1}\) that produces \(A = E^{-1}R\):

\[ A = \begin{bmatrix} 1 & 0 & 3 & 3 \\ 2 & 0 & 6 & 6 \\ 1 & 1 & 3 & 3 \end{bmatrix}. \quad \text{Find } R \text{ and } E^{-1}. \]

(9) (b) Separate that multiplication \(E^{-1}R\) into columns of \(E^{-1}\) times rows of \(R\). This allows you to write \(A\) as the sum of two rank-one matrices. What are those two matrices?

Solution (a) The row-reduced form is \[ R = \begin{bmatrix} 1 & 0 & 3 & 3 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 \end{bmatrix}. \] This form was reached by a product of elementary matrices, including a permutation: \[ E = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 0 & 1 \\ 0 & 1 & 0 \end{bmatrix} \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ -1 & 0 & 1 \end{bmatrix} \begin{bmatrix} 1 & 0 & 0 \\ -2 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix} = \begin{bmatrix} 1 & 0 & 0 \\ -1 & 0 & 1 \\ -2 & 1 & 0 \end{bmatrix}. \] The matrix \(E^{-1}\) that recovers \(A\) from \(R\) is \[ E^{-1} = \begin{bmatrix} 1 & 0 & 0 \\ 2 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix} \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 1 & 0 & 1 \end{bmatrix} \begin{bmatrix} 1 & 0 & 0 \\ 0 & 0 & 1 \\ 0 & 1 & 0 \end{bmatrix} = \begin{bmatrix} 1 & 0 & 0 \\ 2 & 0 & 1 \\ 1 & 1 & 0 \end{bmatrix}. \] (b) The third row of \(R\) is zero! So the two column-row multiplications are from columns 1 and 2 of \(E^{-1}\) and rows 1 and 2 of \(R\): \[ \begin{bmatrix} 1 \\ 2 \\ 1 \end{bmatrix} \begin{bmatrix} 1 & 0 & 3 & 3 \end{bmatrix} + \begin{bmatrix} 0 \\ 0 \\ 1 \end{bmatrix} \begin{bmatrix} 0 & 1 & 0 & 0 \end{bmatrix} = \begin{bmatrix} 1 & 0 & 3 & 3 \\ 2 & 0 & 6 & 6 \\ 1 & 0 & 3 & 3 \end{bmatrix} + \begin{bmatrix} 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \end{bmatrix} = A. \]

Keywords: row reduced echelon form, elimination matrix, permutation, rank-one matrices