3.3-exam1-2014¶
Exam 1, 2014 · Section 3.3: The Complete Solution to Ax = b Source: exam1_2.pdf, pp. 61, 67
Problem¶
Problem 3. Let
\[
A = \begin{bmatrix} 1 & 2 & 1 & 0 & 0 \\ 1 & 2 & 2 & 2 & 3 \\ -1 & -2 & 0 & 2 & 3 \end{bmatrix}.
\]
(a) Find the complete solution of \(Ax = 0\). (b) Find the complete solution of \(Ax = (1, 2, 0)^T\). (c) Find the linear condition(s) on \(b_1, b_2, b_3\) that guarantee that the system \(Ax = (b_1, b_2, b_3)^T\) has a solution. (d) Find the rank of \(A\) and dimensions of the four fundamental subspaces of \(A\). (e) Find bases of the four fundamental subspaces of \(A\).
Solution
Let's put the augmented matrix \(\begin{bmatrix} 1 & 2 & 1 & 0 & 0 & b_1 \\ 1 & 2 & 2 & 2 & 3 & b_2 \\ -1 & -2 & 0 & 2 & 3 & b_3 \end{bmatrix}\) into RREF. We get \[ \begin{bmatrix} 1 & 2 & 1 & 0 & 0 & b_1 \\ 0 & 0 & 1 & 2 & 3 & b_2 - b_1 \\ 0 & 0 & 1 & 2 & 3 & b_1 + b_3 \end{bmatrix} \] followed by \[ \begin{bmatrix} 1 & 2 & 0 & -2 & -3 & 2b_1 - b_2 \\ 0 & 0 & 1 & 2 & 3 & b_2 - b_1 \\ 0 & 0 & 0 & 0 & 0 & 2b_1 - b_2 + b_3 \end{bmatrix}. \] (a) We read off the special vectors as \[ x_1 = (-2, 1, 0, 0, 0)^T, \quad x_2 = (2, 0, -2, 1, 0)^T \quad \text{and} \quad x_3 = (3, 0, -3, 0, 1)^T. \] The complete solution to \(Ax = 0\) is \(x = c_1x_1 + c_2x_2 + c_3x_3\) for \(c_1, c_2, c_3 \in R\). (b) Let \(x_p = (0, 0, 1, 0, 0)^T\). Then \(Ax_p = (1, 2, 0)^T\), so the complete solution to \(Ax = (1, 2, 0)^T\) is \(x = x_p + c_1x_1 + c_2x_2 + c_3x_3\) for \(c_1, c_2, c_3 \in R\). (c) We read off the linear combination of \(b_1, b_2\), and \(b_3\) in the zero row above: \(2b_1 - b_2 + b_3 = 0\) is the condition that guarantees \(Ax = (b_1, b_2, b_3)^T\) has a solution. (d) We see there are two pivot columns in \(\text{RREF}(A)\), and so the rank of \(A\) is 2. Thus \(\dim C(A) = \dim C(A^T) = 2\), \(\dim N(A) = 5 - 2 = 3\), and \(\dim N(A^T) = 3 - 2 = 1\). (e) To give a basis for \(C(A)\), we read off the columns corresponding to pivot columns in the RREF: \(\{(1, 1, -1)^T, (1, 2, 0)^T\}\). We already computed a basis for \(N(A)\) in (a): \(\{x_1, x_2, x_3\}\). To give a basis for \(C(A^T)\), we find two independent rows: \[ \{(1, 2, 1, 0, 0)^T, (1, 2, 2, 2, 3)^T\}. \] To give a basis for \(N(A^T)\), we read off the coefficients of the consistency relation in (c): \(\{(2, -1, 1)^T\}\).Keywords: complete solution, consistency, four fundamental subspaces, rank