Skip to content

3.2-exam1-2008

Quiz 1, 2008 · Section 3.2: Computing the Nullspace by Elimination: A = CR Source: exam1_1.pdf, pp. 186, 192

Problem

2 (24 pts.) The matrix \(A\) has two special solutions:

\[ x_1 = \begin{bmatrix} c \\ 1 \\ 0 \end{bmatrix} \quad \text{and} \quad x_2 = \begin{bmatrix} d \\ 0 \\ 1 \end{bmatrix}. \]

(a) Describe all the possibilities for the number of columns of \(A\).

(b) Describe all the possibilities for the number of rows of \(A\).

(c) Describe all the possibilities for the rank of \(A\).

Briefly explain your answers.

Solution (a) Solutions to \(Ax = 0\) are length 3 column vectors, so \(A\) has three columns. (b) Any number. In fact, consider the row \((1, -c, -d)\). This kills both of the given vectors. Then feel free to add any number of rows of zeros below it. (c) We assume that the matrix is not zero, as we are given that these are the only special solutions. To find the rank, we note that each row of \(A\) must be in the subspace of \(\mathbb{R}^3\) which is orthogonal to \((c, 1, 0)\) and \((d, 0, 1)\); but since these guys span a plane, this subspace is a line. Thus the rows are all linearly dependent, and so the rank is one.

Keywords: special solutions, nullspace, rank, rows, columns