Skip to content

3.2-final-2007

Final Exam, 2007 · Section 3.2: Computing the Nullspace by Elimination: A = CR Source: finalexam_1.pdf, p. 171

Problem

Problem 2 (10 points) Consider the system of linear equations:

\[ \left\{ \begin{aligned} x + y + z &= 1 \\ 2x + z &= 2 \\ -x + y + az &= b \end{aligned} \right. \]

In parts (a)-(c) below circle correct answers. Explain your answers.

(a) For \(a = 1, b = -1\), the system has:

(1) exactly one solution

(2) infinitely many solutions

(3) no solutions

(b) For \(a = 0, b = 1\), the system has:

(1) exactly one solution

(2) infinitely many solutions

(3) no solutions

(c) For \(a = 0, b = -1\), the system has:

(1) exactly one solution

(2) infinitely many solutions

(3) no solutions

(d) Solve the system for \(a = b = 1\).

Solution If we eliminate the augmented matrix we get \[ \begin{bmatrix} 1 & 1 & 1 & 1 \\ 0 & -2 & -1 & 0 \\ 0 & 0 & a & b + 1 \end{bmatrix}. \] (a) Exactly one solution: The matrix is invertible (the last pivot is \(a = 1 \neq 0\)). (b) No solutions: Get a row of zeroes in the matrix with no zero in the augmented column. (c) Infinitely many solutions: Get a row of zeroes with a zero in the augmented column. (d) Using back substitution we get \(x = \begin{bmatrix} 0 & -1 & 2 \end{bmatrix}^T\).

Keywords: linear equations, consistency, rank, elimination