Skip to content

3.3-exam1-2003-dejong

Exam 1, 2003 (de-jong) · Section 3.3: The Complete Solution to Ax = b Source: exam1_1.pdf, pp. 90, 95

Problem

2 (35 pts.) (a) Let \(A\) and \(b\) be as below. For any real number \(t\), and any real number \(s\): Find the complete solution to the equation \(Ax = b\) using the algorithm described in class and in the book. (It depends on \(t\) and \(s\).)

\[ A = \begin{bmatrix} 1 & 0 & 0 & 4 \\ 1 & 0 & 1 & 0 \\ 1 & 1 & 0 & 0 \\ 1 & 2 & 3 & t \end{bmatrix}, \qquad b = \begin{bmatrix} 2 \\ 0 \\ 0 \\ s \end{bmatrix} \]

(b) First part: For which \(t\) are the columns of the matrix \(A\) linearly dependent? Second part: Consider \(b\) and the first three columns of \(A\). For which \(s\) are these linearly dependent?

Solution (a) Eliminate the augmented matrix: \[ (A \mid b) = \left[\begin{array}{cccc|c} 1 & 0 & 0 & 4 & 2 \\ 1 & 0 & 1 & 0 & 0 \\ 1 & 1 & 0 & 0 & 0 \\ 1 & 2 & 3 & t & s \end{array}\right] \to \left[\begin{array}{cccc|c} 1 & 0 & 0 & 4 & 2 \\ 0 & 0 & 1 & -4 & -2 \\ 0 & 1 & 0 & -4 & -2 \\ 0 & 2 & 3 & t-4 & s-2 \end{array}\right] \to \left[\begin{array}{cccc|c} 1 & 0 & 0 & 4 & 2 \\ 0 & 1 & 0 & -4 & -2 \\ 0 & 0 & 1 & -4 & -2 \\ 0 & 0 & 3 & t+4 & s+2 \end{array}\right] \to \left[\begin{array}{cccc|c} 1 & 0 & 0 & 4 & 2 \\ 0 & 1 & 0 & -4 & -2 \\ 0 & 0 & 1 & -4 & -2 \\ 0 & 0 & 0 & t+16 & s+8 \end{array}\right]. \] Therefore, when \(t = -16\) and \(s \neq -8\) there are no solutions. When \(t \neq -16\) there is a unique solution: \[ x = \begin{bmatrix} 2 - 4\frac{s+8}{t+16} \\ -2 + 4\frac{s+8}{t+16} \\ -2 + 4\frac{s+8}{t+16} \\ \frac{s+8}{t+16} \end{bmatrix}. \] When \(t = -16\) and \(s = -8\), there are infinitely many solutions: \[ x = \begin{bmatrix} 2 - 4a \\ -2 + 4a \\ -2 + 4a \\ a \end{bmatrix}, \qquad \text{for all } a \in \mathbb{R}. \] (b) First part: The columns of \(A\) are linearly independent when \(t \neq -16\) (all pivots are nonzero). When \(t = -16\) the columns are linearly dependent: \[ 4 \begin{bmatrix} 1 \\ 1 \\ 1 \\ 1 \end{bmatrix} - 4 \begin{bmatrix} 0 \\ 0 \\ 1 \\ 2 \end{bmatrix} - 4 \begin{bmatrix} 0 \\ 1 \\ 0 \\ 3 \end{bmatrix} - \begin{bmatrix} 4 \\ 0 \\ 0 \\ -16 \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \\ 0 \\ 0 \end{bmatrix}. \] Second part: When \(s \neq -8\) the vectors are linearly independent (after swapping the last column of \(A\) with \(b\), all pivots in the computation of (a) are nonzero). When \(s = -8\) they are linearly dependent: \[ 2 \begin{bmatrix} 1 \\ 1 \\ 1 \\ 1 \end{bmatrix} - 2 \begin{bmatrix} 0 \\ 0 \\ 1 \\ 2 \end{bmatrix} - 2 \begin{bmatrix} 0 \\ 1 \\ 0 \\ 3 \end{bmatrix} - \begin{bmatrix} 2 \\ 0 \\ 0 \\ -8 \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \\ 0 \\ 0 \end{bmatrix}. \]

Keywords: complete solution, elimination, linear dependence, pivot columns