Skip to content

3.2-exam1-2001

Quiz 1, 2001 · Section 3.2: Computing the Nullspace by Elimination: A = CR Source: exam1_1.pdf, p. 47

Problem

3 (32 pts.) Suppose after elimination on a matrix \(A\) we reach its row reduced echelon form

\[ R = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 0 & 1 \end{bmatrix}. \]

(a) Find the null space matrix of \(A\). (10)

(b) What is the null space of \(A^T\)? (6)

(c) What is the rank of 2-by-9 block matrix \([ A \ A \ A ]\)? (6)

(d) Find a complete solution to \(Rx = d\) with \(d = \begin{bmatrix} 1 \\ 1 \end{bmatrix}\). (10)

Solution (a) The pivot variables are \(x_1\) and \(x_3\); the free variable is \(x_2\). Setting \(x_2 = 1\) in \(Rx = 0\) gives \(x_1 = -2\), \(x_3 = 0\), so the null space matrix (the 3 by 1 matrix whose column is the special solution) is \[ N = \begin{bmatrix} -2 \\ 1 \\ 0 \end{bmatrix}. \] (b) \(A\) is 2 by 3 of rank 2, so \(A^T\) is 3 by 2 with independent columns (rank 2 = number of columns). Hence the null space of \(A^T\) contains only the zero vector: \(N(A^T) = \{0\}\). (c) Repeating the same columns three times cannot increase the rank, so \(\text{rank}[ A \ A \ A ] = \text{rank}(A) = 2\). (d) The equations are \(x_1 + 2x_2 = 1\) and \(x_3 = 1\), with \(x_2\) free. The complete solution is \[ x = \begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix} + a \begin{bmatrix} -2 \\ 1 \\ 0 \end{bmatrix}. \]

Keywords: nullspace, reduced row echelon form, rank, complete solution