8.3: Underdetermined Systems
- Page ID
- 64249
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
Sometimes we have systems of linear equations where we have more unknowns than equations, in this case we call the system “underdetermined.” These types of systems can have infinite solutions. i.e., we can not find an unique \(x\) such that \(Ax = b\). In this case, we can find a set of equations that represent all of the solutions that solve the problem by using Gauss Jordan and the Reduced Row Echelon form. Lets consider the following example:
\[ \begin{split}\begin{bmatrix}5 & -2 & 2 & 1 \\ 4 & -3 & 4 & 2 \\ 4 & -6 & 7 & 4 \end{bmatrix}\begin{bmatrix} x_1 \\ x_2 \\ x_3 \\ x_4 \end{bmatrix} = \begin{bmatrix} 1 \\ 2 \\ 3 \end{bmatrix}\end{split} \nonumber \]
Define an augmented matrix \(M\) that represents the above system of equations:
What is the Reduced Row Echelon form for A?
Notice how the above RREF form of matrix A is different from what we have seen in the past. In this case not all of our values for \(x\) are unique. When we write down a solution to this problem by defining the variables by one or more of the undefined variables. for example, here we can see that \(x_4\) is undefined. So we say \(x_4=x_4\), i.e. \(x_4\) can be any number we want. Then we can define \(x_3\) in terms of \(x_4\). In this case \(x_3 = \frac{11}{15} - \frac{4}{15}x_4\). The entire solution can be written out as follows:
\[\begin{split}
\begin{align*}
x_1 &= \frac{1}{15} + \frac{1}{15}x_4 \\
x_2 &= \frac{2}{5} + \frac{2}{5}x_4 \\
x_3 &= \frac{11}{15} - \frac{4}{15}x_4 \\
x_4 &= x_4
\end{align*}
\end{split} \nonumber \]
Review the above answer and make sure you understand how we get this answer from the Reduced Row Echelon form from above.
Sometimes, in an effort to make the solution more clear, we introduce new variables (typically, \(r\),\(s\),\(t\)) and substitute them in for our undefined variables so the solution would look like the following:
\[\begin{split}
\begin{align*}
x_1 &= \frac{1}{15} + \frac{1}{15}r \\
x_2 &= \frac{2}{5} + \frac{2}{5}r \\
x_3 &= \frac{11}{15} - \frac{4}{15}r \\
x_4 &= r
\end{align*}
\end{split} \nonumber \]
We can find a particular solution to the above problem by inputing any number for \(r\). For example, set \(r\) equal to zero and create a vector for all of the \(x\) values.
\[\begin{split}
\begin{align*}
x_1 &= \frac{1}{15}\\
x_2 &= \frac{2}{5}\\
x_3 &= \frac{11}{15} \\
x_4 &= 0
\end{align*}
\end{split} \nonumber \]
Define two more matrixes \(A\), \(b\) representing the above system of equations \(Ax=b\):
Now let us check our answer by multipying matrix \(A\) by our solution \(x\) and see if we get \(b\)
Now go back and pick a different value for \(r\) and see that it also produces a valid solution for \(Ax=b\).