Skip to main content

Section 1.3 Counting Solutions for Linear Systems (LE3)

Subsection 1.3.1 Class Activities

Remark 1.3.1.

We will frequently need to know the reduced row echelon form of matrices during the remainder of this course, so unless you’re told otherwise, feel free to use technology (see Activity 1.2.17) to compute RREFs efficiently.

Activity 1.3.2.

Consider the following system of equations.
\begin{alignat*}{4} 3x_1 &\,-\,& 2x_2 &\,+\,& 13x_3 &\,=\,& 6\\ 2x_1 &\,-\,& 2x_2 &\,+\,& 10x_3 &\,=\,& 2\\ -x_1 &\,+\,& 3x_2 &\,-\,& 6x_3 &\,=\,& 11\text{.} \end{alignat*}
(a)
Convert this to an augmented matrix and use technology to compute its reduced row echelon form:
\begin{equation*} \RREF \left[\begin{array}{ccc|c} \unknown&\unknown&\unknown&\unknown\\ \unknown&\unknown&\unknown&\unknown\\ \unknown&\unknown&\unknown&\unknown\\ \end{array}\right] = \left[\begin{array}{ccc|c} \unknown&\unknown&\unknown&\unknown\\ \unknown&\unknown&\unknown&\unknown\\ \unknown&\unknown&\unknown&\unknown\\ \end{array}\right] \end{equation*}
(b)
Use the \(\RREF\) matrix to write a linear system equivalent to the original system.
(c)
How many solutions must this system have?
  1. Zero
  2. Only one
  3. Infinitely-many

Activity 1.3.3.

Consider the vector equation
\begin{equation*} x_1 \left[\begin{array}{c} 3 \\ 2\\ -1 \end{array}\right] +x_2 \left[\begin{array}{c}-2 \\ -2 \\ 0 \end{array}\right] +x_3\left[\begin{array}{c} 13 \\ 10 \\ -3 \end{array}\right] =\left[\begin{array}{c} 6 \\ 2 \\ 1 \end{array}\right] \end{equation*}
(a)
Convert this to an augmented matrix and use technology to compute its reduced row echelon form:
\begin{equation*} \RREF \left[\begin{array}{ccc|c} \unknown&\unknown&\unknown&\unknown\\ \unknown&\unknown&\unknown&\unknown\\ \unknown&\unknown&\unknown&\unknown\\ \end{array}\right] = \left[\begin{array}{ccc|c} \unknown&\unknown&\unknown&\unknown\\ \unknown&\unknown&\unknown&\unknown\\ \unknown&\unknown&\unknown&\unknown\\ \end{array}\right] \end{equation*}
(b)
Use the \(\RREF\) matrix to write a linear system equivalent to the original system.
(c)
How many solutions must this system have?
  1. Zero
  2. Only one
  3. Infinitely-many

Activity 1.3.4.

What contradictory equations besides \(0=1\) may be obtained from the RREF of an augmented matrix?
  1. \(x=0\) is an obtainable contradiction
  2. \(x=y\) is an obtainable contradiction
  3. \(0=17\) is an obtainable contradiction
  4. \(0=1\) is the only obtainable contradiction

Activity 1.3.5.

Consider the following linear system.
\begin{alignat*}{4} x_1 &+ 2x_2 &+ 3x_3 &= 1\\ 2x_1 &+ 4x_2 &+ 8x_3 &= 0 \end{alignat*}
(a)
Find its corresponding augmented matrix \(A\) and find \(\RREF(A)\text{.}\)
(b)
Use the \(\RREF\) matrix to write a linear system equivalent to the original system.
(c)
How many solutions must this system have?
  1. Zero
  2. One
  3. Infinitely-many

Activity 1.3.8.

For each vector equation, write an explanation for whether each solution set has no solutions, one solution, or infinitely-many solutions. If the set is finite, describe it using set notation.
(a)
\begin{equation*} x_{1} \left[\begin{array}{c} 1 \\ -1 \\ 1 \end{array}\right] + x_{2} \left[\begin{array}{c} 4 \\ -3 \\ 1 \end{array}\right] + x_{3} \left[\begin{array}{c} 7 \\ -6 \\ 4 \end{array}\right] = \left[\begin{array}{c} 10 \\ -6 \\ 4 \end{array}\right] \end{equation*}
(b)
\begin{equation*} x_{1} \left[\begin{array}{c} -2 \\ -1 \\ -2 \end{array}\right] + x_{2} \left[\begin{array}{c} 3 \\ 1 \\ 1 \end{array}\right] + x_{3} \left[\begin{array}{c} -2 \\ -2 \\ -5 \end{array}\right] = \left[\begin{array}{c} 1 \\ 4 \\ 13 \end{array}\right] \end{equation*}
(c)
\begin{equation*} x_{1} \left[\begin{array}{c} -1 \\ -2 \\ 1 \end{array}\right] + x_{2} \left[\begin{array}{c} -5 \\ -5 \\ 4 \end{array}\right] + x_{3} \left[\begin{array}{c} -7 \\ -9 \\ 6 \end{array}\right] = \left[\begin{array}{c} 3 \\ 1 \\ -2 \end{array}\right] \end{equation*}

Subsection 1.3.2 Videos

Figure 3. Video: Finding the number of solutions for a system

Exercises 1.3.3 Exercises

Subsection 1.3.4 Mathematical Writing Explorations

Exploration 1.3.9.

A system of equations with all constants equal to 0 is called homogeneous. These are addressed in detail in section Section 2.7
  • Choose three systems of equations from this chapter that you have already solved. Replace the constants with 0 to make the systems homogeneous. Solve the homogeneous systems and make a conjecture about the relationship between the earlier solutions you found and the associated homogeneous systems.
  • Prove or disprove. A system of linear equations is homogeneous if an only if it has the the zero vector as a solution.

Subsection 1.3.5 Sample Problem and Solution

Sample problem Example B.1.3.