Back to Finding solutions to linear systems

Exercise 4

Avg difficulty 2.5

For any given matrix, this theorem tells us that there is a reduced row echelon matrix that is row equivalent to it. This exercise demonstrates why this is the case. Each of the following matrices satisfies three of the four conditions required of a reduced row echelon matrix as prescribed by this definition. For each, indicate how a sequence of row operations can be applied to form a row equivalent reduced row echelon matrix.

  1. [1023000001−21]\begin{bmatrix} 1 & 0 & 2 & 3 \\ 0 & 0 & 0 & 0 \\ 0 & 1 & -2 & 1 \\ \end{bmatrix}

  2. [10020−20−40011]\begin{bmatrix} 1 & 0 & 0 & 2 \\ 0 & -2 & 0 & -4 \\ 0 & 0 & 1 & 1 \\ \end{bmatrix}

  3. [010−20014100300000000]\begin{bmatrix} 0 & 1 & 0 & -2 \\ 0 & 0 & 1 & 4 \\ 1 & 0 & 0 & 3 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ \end{bmatrix}

  4. [10230130001−10000]\begin{bmatrix} 1 & 0 & 2 & 3 \\ 0 & 1 & 3 & 0 \\ 0 & 0 & 1 & -1 \\ 0 & 0 & 0 & 0 \\ \end{bmatrix}

Austin, Understanding Linear Algebra, §1.2 Finding solutions to linear systems, Exercise 4

AI Tutor

Adapted from Understanding Linear Algebra © 2023 David Austin. Licensed under CC BY 4.0. Source: Understanding Linear Algebra. Imported at revision 3e6dced.