Skip to content

3.3-final-2009

Final Exam, 2009 · Section 3.3: The Complete Solution to Ax = b Source: finalexam_1.pdf, p. 231

Problem

Problem 5: The complete solution to \(Ax = b\) is

\[ x = \begin{bmatrix} 1 \\ 0 \\ -1 \end{bmatrix} + c \begin{bmatrix} 1 \\ 1 \\ 0 \end{bmatrix} + d \begin{bmatrix} -2 \\ 0 \\ 1 \end{bmatrix} \]

for any arbitrary constants \(c\) and \(d\).

(i) If \(A\) is an \(m \times n\) matrix with rank \(r\), give as much true information as possible about the integers \(m\), \(n\), and \(r\).

(ii) Construct an explicit example of a possible matrix \(A\) and a possible right-hand side \(b\) with the solution \(x\) above. (There are many acceptable answers; you only have to provide one.)

Solution (16 points = 8 + 8) (i) Since we can multiply \(A\) with \(x\), \(n = 3\). Also, since the nullspace of \(A\) is 2-dimensional, \(r = n - 2 = 1\). There is no restriction on \(m\) except that \(m \ge r = 1\). (ii) We construct a minimal one, namely, \(A = (a_1 \ a_2 \ a_3)\) is \(1 \times 3\). For this, we need \(A \begin{bmatrix} 1 \\ 1 \\ 0 \end{bmatrix} = 0\) and \(A \begin{bmatrix} -2 \\ 0 \\ 1 \end{bmatrix} = 0\). That is \[ \begin{bmatrix} 1 & 1 & 0 \\ -2 & 0 & 1 \end{bmatrix} \begin{bmatrix} a_1 \\ a_2 \\ a_3 \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix}. \] A special solution is \(A = (1 \ -1 \ 2)\). In this case, \(b = Ax = (1 \ -1 \ 2) \begin{bmatrix} 1 \\ 0 \\ -1 \end{bmatrix} = (-1)\). So, an example is \[ (1 \ -1 \ 2)x = (-1). \]

Keywords: complete solution, nullspace, rank, linear equations