Skip to main content
Contents
Dark Mode Prev Up Next
\(\newcommand{\markedPivot}[1]{\boxed{#1}}
\newcommand{\IR}{\mathbb{R}}
\newcommand{\IC}{\mathbb{C}}
\renewcommand{\P}{\mathcal{P}}
\renewcommand{\Im}{\operatorname{Im}}
\newcommand{\RREF}{\operatorname{RREF}}
\newcommand{\vspan}{\operatorname{span}}
\newcommand{\setList}[1]{\left\{#1\right\}}
\newcommand{\setBuilder}[2]{\left\{#1\,\middle|\,#2\right\}}
\newcommand{\unknown}{\,{\color{gray}?}\,}
\newcommand{\drawtruss}[2][1]{
\begin{tikzpicture}[scale=#1, every node/.style={scale=#1}]
\draw (0,0) node[left,magenta]{C} --
(1,1.71) node[left,magenta]{A} --
(2,0) node[above,magenta]{D} -- cycle;
\draw (2,0) --
(3,1.71) node[right,magenta]{B} --
(1,1.71) -- cycle;
\draw (3,1.71) -- (4,0) node[right,magenta]{E} -- (2,0) -- cycle;
\draw[blue] (0,0) -- (0.25,-0.425) -- (-0.25,-0.425) -- cycle;
\draw[blue] (4,0) -- (4.25,-0.425) -- (3.75,-0.425) -- cycle;
\draw[thick,red,->] (2,0) -- (2,-0.75);
#2
\end{tikzpicture}
}
\newcommand{\trussNormalForces}{
\draw [thick, blue,->] (0,0) -- (0.5,0.5);
\draw [thick, blue,->] (4,0) -- (3.5,0.5);
}
\newcommand{\trussCompletion}{
\trussNormalForces
\draw [thick, magenta,<->] (0.4,0.684) -- (0.6,1.026);
\draw [thick, magenta,<->] (3.4,1.026) -- (3.6,0.684);
\draw [thick, magenta,<->] (1.8,1.71) -- (2.2,1.71);
\draw [thick, magenta,->] (1.6,0.684) -- (1.5,0.855);
\draw [thick, magenta,<-] (1.5,0.855) -- (1.4,1.026);
\draw [thick, magenta,->] (2.4,0.684) -- (2.5,0.855);
\draw [thick, magenta,<-] (2.5,0.855) -- (2.6,1.026);
}
\newcommand{\trussCForces}{
\draw [thick, blue,->] (0,0) -- (0.5,0.5);
\draw [thick, magenta,->] (0,0) -- (0.4,0.684);
\draw [thick, magenta,->] (0,0) -- (0.5,0);
}
\newcommand{\trussStrutVariables}{
\node[above] at (2,1.71) {\(x_1\)};
\node[left] at (0.5,0.866) {\(x_2\)};
\node[left] at (1.5,0.866) {\(x_3\)};
\node[right] at (2.5,0.866) {\(x_4\)};
\node[right] at (3.5,0.866) {\(x_5\)};
\node[below] at (1,0) {\(x_6\)};
\node[below] at (3,0) {\(x_7\)};
}
\newcommand{\N}{\mathbb N}
\newcommand{\Z}{\mathbb Z}
\newcommand{\Q}{\mathbb Q}
\newcommand{\R}{\mathbb R}
\DeclareMathOperator{\arcsec}{arcsec}
\DeclareMathOperator{\arccot}{arccot}
\DeclareMathOperator{\arccsc}{arccsc}
\newcommand{\tuple}[1]{\left\langle#1\right\rangle}
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Section 18.3 Counting Solutions for Linear Systems (LE3)
Learning Outcomes
Subsection 18.3.1 Warm Up
Activity 18.44 .
(a)
Without referring to your Activity Book, which of the four criteria for a matrix to be in Reduced Row Echelon Form (RREF) can you recall?
(b)
Which, if any, of the following matrices are in RREF? You may refer to the Activity Book now for criteria that you may have forgotten.
\begin{equation*}
P=\left[\begin{array}{ccc|c} 1 & 0 & \frac{2}{3} & -3 \\ 0 & 3 & 3 & -\frac{3}{5} \\ 0 & 0 & 0 & 0 \end{array}\right]
\end{equation*}
\begin{equation*}
Q=\left[\begin{array}{ccc|c} 0 & 1 & 0 & 7 \\ 1 & 0 & 0 & 4 \\ 0 & 0 & 0 & 0 \end{array}\right]
\end{equation*}
\begin{equation*}
R=\left[\begin{array}{ccc|c} 1 & 0 & \frac{1}{2} & 4 \\ 0 & 1 & 0 & 7 \\ 0 & 0 & 1 & 0 \end{array}\right]
\end{equation*}
Subsection 18.3.2 Class Activities
Activity 18.46 .
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\\
4x_1 &\,+\,& x_2 &\,+\,& x_3 &\,=\,& 1\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\\
\unknown&\unknown&\unknown&\unknown\\
\end{array}\right]
=
\left[\begin{array}{ccc|c}
\unknown&\unknown&\unknown&\unknown\\
\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?
Zero
Only one
Infinitely-many
Activity 18.47 .
Consider the vector equation
\begin{equation*}
x_1 \left[\begin{array}{c} 3 \\ 2\\ -1 \\ 3 \end{array}\right]
+x_2 \left[\begin{array}{c}-2 \\ -2 \\ 0 \\ 7 \end{array}\right]
+x_3\left[\begin{array}{c} 13 \\ 10 \\ -3 \\ 0 \end{array}\right]
=\left[\begin{array}{c} 6 \\ 2 \\ 1 \\ -2 \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\\
\unknown&\unknown&\unknown&\unknown\\
\end{array}\right]
=
\left[\begin{array}{ccc|c}
\unknown&\unknown&\unknown&\unknown\\
\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?
Zero
Only one
Infinitely-many
Activity 18.48 .
What contradictory equations besides \(0=1\) may be obtained from the RREF of an augmented matrix?
\(x=0\) is an obtainable contradiction
\(x=y\) is an obtainable contradiction
\(0=17\) is an obtainable contradiction
\(0=1\) is the only obtainable contradiction
Activity 18.49 .
Consider the following linear system.
\begin{alignat*}{4}
x_1 &+ 2x_2 &+ 3x_3 &= 1\\
2x_1 &+ 4x_2 &+ 8x_3 &= 0\\
3x_1 &+ 6x_2 &+ 11x_3 &= 1\\
x_1 &+ 2x_2 &+ 5x_3 &= -1
\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?
Zero
One
Infinitely-many
Fact 18.50 .
By finding \(\RREF(A)\) from a linear system’s corresponding augmented matrix \(A\text{,}\) we can immediately tell how many solutions the system has.
If the linear system given by \(\RREF(A)\) includes the contradiction
\begin{equation*}
0=1\text{,}
\end{equation*}
that is, the \(\RREF\) matrix includes the row
\begin{equation*}
\left[\begin{array}{ccc|c}0&\cdots&0&1\end{array}\right]\text{,}
\end{equation*}
then the system is inconsistent , which means it has zero solutions and we may write
\begin{equation*}
\text{Solution set }=\{\}
\hspace{2em}\text{or}\hspace{2em}
\text{Solution set }=\emptyset.
\end{equation*}
If the linear system given by \(\RREF(A)\) sets every variable of the system to a specific value; that is we have:
\begin{alignat*}{2}
x_1 &= s_1\\
x_2 &= s_2\\
&\vdots\\
x_n &= s_n
\end{alignat*}
(with some possible extra \(0=0\) equations), then the system is consistent with exactly one solution, and we may write
\begin{equation*}
\text{Solution }=\left[\begin{array}{c}s_1\\s_2\\\vdots\\s_n\end{array}\right]
\hspace{2em}\text{but}\hspace{2em}
\text{Solution set }=
\left\{\left[\begin{array}{c}s_1\\s_2\\\vdots\\s_n\end{array}\right]\right\}.
\end{equation*}
Otherwise, the system given by the
\(\RREF\) matrix must
not include a \(0=1\) contradiction while
at least one variable is not required to equal a specific value . This means it is
consistent with
infinitely-many different solutions. We’ll learn how to find such solution sets in
Section 18.4 .
Activity 18.51 .
Consider each of the following systems of linear equations or vector equations.
(a)
\begin{equation*}
\begin{matrix} x_{1} & - & x_{2} & - & 3 \, x_{3} & = & 8 \\ 3 \, x_{1} & - & 2 \, x_{2} & - & 5 \, x_{3} & = & 17 \\ x_{1} & - & x_{2} & - & 2 \, x_{3} & = & 7 \\ 10 \, x_{1} & - & 8 \, x_{2} & - & 21 \, x_{3} & = & 65 \\ \end{matrix}
\end{equation*}
(i)
Explain and demonstrate how to find a simpler linear system that has the same solution set.
Answer .
\begin{equation*}
\begin{matrix} x_{1} & & & & & = & 2 \\ & & x_{2} & & & = & -3 \\ & & & & x_{3} & = & -1 \\ & & & & 0 & = & 0 \\ \end{matrix}
\end{equation*}
(ii)
Explain whether this solution set has no solutions, one solution, or infinitely-many solutions. If the set is finite, describe it using set notation.
Answer . The solution set has one solution. The solution set is \(\left\{ \left[\begin{array}{c} 2 \\ -3 \\ -1 \end{array}\right] \right\}\text{.}\)
(b)
\begin{equation*}
\begin{matrix} x_{1} & - & 5 \, x_{2} & - & 15 \, x_{3} & = & -8 \\ & & x_{2} & + & 3 \, x_{3} & = & 1 \\ x_{1} & & & & & = & 2 \\ 5 \, x_{1} & - & 7 \, x_{2} & - & 21 \, x_{3} & = & -10 \\ \end{matrix}
\end{equation*}
(i)
Explain and demonstrate how to find a simpler linear system that has the same solution set.
Answer .
\begin{equation*}
\begin{matrix} x_{1} & & & & & = & 0 \\ & & x_{2} & + & 3 \, x_{3} & = & 0 \\ & & & & 0 & = & 1 \\ & & & & 0 & = & 0 \\ \end{matrix}
\end{equation*}
(ii)
Explain whether this solution set has no solutions, one solution, or infinitely-many solutions. If the set is finite, describe it using set notation.
Answer . The solution set has no solutions. The solution set is \(\emptyset\text{.}\)
(c)
\begin{equation*}
\begin{matrix} -2 \, x_{1} & + & 2 \, x_{2} & + & 5 \, x_{3} & = & 1 \\ -x_{1} & + & x_{2} & + & 2 \, x_{3} & = & 1 \\ 2 \, x_{1} & - & 2 \, x_{2} & + & x_{3} & = & -7 \\ -2 \, x_{1} & + & 2 \, x_{2} & + & 16 \, x_{3} & = & -10 \\ \end{matrix}
\end{equation*}
(i)
Explain and demonstrate how to find a simpler linear system that has the same solution set.
Answer .
\begin{equation*}
\begin{matrix} x_{1} & - & x_{2} & & & = & -3 \\ & & & & x_{3} & = & -1 \\ & & & & 0 & = & 0 \\ & & & & 0 & = & 0 \\ \end{matrix}
\end{equation*}
(ii)
Explain whether this solution set has no solutions, one solution, or infinitely-many solutions. If the set is finite, describe it using set notation.
Answer . The solution set has infinitely-many solutions.
Subsection 18.3.3 Individual Practice
Activity 18.52 .
(a)
In
Fact 18.11 , we stated, but did not prove the assertion that all linear systems are one of the following:
Consistent with one solution: its solution set contains a single vector, e.g. \(\setList{\left[\begin{array}{c}1\\2\\3\end{array}\right]}\)
Consistent with infinitely-many solutions : its solution set contains infinitely many vectors, e.g. \(\setBuilder
{
\left[\begin{array}{c}1\\2-3a\\a\end{array}\right]
}{
a\in\IR
}\)
Inconsistent : its solution set is the empty set, denoted by either \(\{\}\) or \(\emptyset\text{.}\)
(b)
Explain why this fact is a consequence of
Fact 18.50 above.
Subsection 18.3.4 Videos
Figure 248. Video: Finding the number of solutions for a system
Subsection 18.3.5 Exercises
Subsection 18.3.6 Mathematical Writing Explorations
Exploration 18.53 .
A system of equations with all constants equal to 0 is called
homogeneous . These are addressed in detail in section
Section 19.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 18.3.7 Sample Problem and Solution