Skip to main content
Mathematics LibreTexts

2.2: Review Problems

  • Page ID
    1760
  • \( \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}}\)

    1. State whether the following augmented matrices are in RREF and compute their solution sets.

    \[\left(\begin{array}{rrrrr|r}1 &0 &0 &0 &3 &1 \\ 0 &1 &0 &0 &1 &2 \\ 0 &0 &1 &0 &1 &3 \\ 0 &0 &0 &1 &2 &0\end{array}\right),\]

    \[\left(\begin{array}{rrrrrr|r}1 &1 &0 &1 &0 &1 &0 \\ 0 &0 &1 &2 &0 &2 &0 \\ 0 &0 &0 &0 &1 &3 &0 \\ 0 &0 &0 &0 &0 &0 &0\end{array}\right),\]

    \[\left(\begin{array}{rrrrrrr|r}1 &1 &0 &1 &0 &1 &0 &1 \\ 0 &0 &1 &2 &0 &2 &0 &-1 \\ 0 &0 &0 &0 &1 &3 &0 &1 \\ 0 &0 &0 &0 &0 &2 &0 &-2 \\ 0 &0 &0 &0 &0 &0 &1 &1\end{array}\right).\]

    2. Solve the following linear system:

    \[\begin{matrix}
    2x_1 + 5x_2 - 8x_3 + 2x_4 + 2x_5 = 0\\
    6x_1 + 2x_2 - 10x_3 + 6x_4 + 8x_5 = 6\\
    3x_1 + 6x_2 + 2x_3 + 3x_4 + 5x_5 = 6\\
    3x_1 + 1x_2 - 5x_3 + 3x_4 + 4x_5 = 3\\
    6x_1 + 7x_2 - 3x_3 + 6x_4 + 9x_5 = 9
    \end{matrix}\]

    Be sure to set your work out carefully with equivalence signs \(\sim\) between each step, labeled by the row operations you performed.

    3. Check that the following two matrices are row-equivalent:

    \[\left(\begin{array}{rrr|r}1 &4 &7 &10 \\ 2 &9 &6 &0\end{array}\right)\]

    and

    \[\left(\begin{array}{rrr|r}0 &-1 &8 &20 \\ 4 &18 &12 &0\end{array}\right).\]

    Now remove the third column from each matrix, and show that the resulting two matrices (shown below) are row-equivalent:

    \[\left(\begin{array}{rr|r}1 &4 &10 \\ 2 &9 &0\end{array}\right)\]

    and

    \[\left(\begin{array}{rr|r}0 &-1 &20 \\ 4 &18 &0\end{array}\right).\]

    Now remove the fourth column from each of the original two matrices, and show that the resulting two matrices, viewed as augmented matrices (shown below) are row-equivalent:

    \[\left(\begin{array}{rr|r}1 &4 &7 \\ 2 &9 &6\end{array}\right)\]

    and

    \[\left(\begin{array}{rr|r}0 &-1 &8 \\ 4 &18 &12\end{array}\right).\]

    Explain why row-equivalence is never affected by removing columns.

    4. Check that the system of equations corresponding to the augmented matrix

    \[\left(\begin{array}{rr|r}1 &4 &10 \\ 3 &13 &9 \\ 4 &17 &20\end{array}\right)\]

    has no solutions. If you remove one of the rows of this matrix, does the new matrix have any solutions? In general, can row equivalence be affected by removing rows? Explain why or why not.

    5. Explain why the linear system has no solutions:

    \[\left(\begin{array}{rrr|r}1 &0 &3 &1 \\ 0 &1 &2 &4 \\ 0 &0 &0 &6\end{array}\right)\]

    For which of the values of \(k\) does the system below have a solution?

    \[\begin{matrix} x- 3y = 6 \\ x + 3z = -3 \\ 2x + ky + (3-k)z = 1 \end{matrix}\]

    6. Show that the RREF of a matrix is unique. (Hint: Consider what happens if the same augmented matrix had two different RREFs. Try to see what happens if you removed columns from these two RREF augmented matrices.)

    7. Another method for solving linear systems is to use row operations to bring the augmented matrix to Row Echelon Form (REF as opposed to RREF). In REF, the pivots are not necessarily set to one, and we only require that all entries left of the pivots are zero, not necessarily entries above a pivot. Provide a counterexample to show that row echelon form is not unique.

    Once a system is in row echelon form, it can be solved by "back substitution." Write the following row echelon matrix as a system of equations, then solve the system using back-substitution.

    \[\left(\begin{array}{rrr|r}2 &3 &1 &6 \\ 0 &1 &1 &2 \\ 0 &0 &3 &3\end{array}\right)\]

    8. Show that this pair of augmented matrices are row equivalent, assuming \(ad - bc \neq 0\):

    \[\left(\begin{array}{rr|r}a &b &e \\ c &d &f \end{array}\right)\sim\left(\begin{array}{rr|r} 1 &0 &\frac{de-bf}{ad-bc} \\ 0 &1 &\frac{af-ce}{ad-bc}\end{array}\right)\]

    9. Consider the augmented matrix:

    \[\left(\begin{array}{rr|r}2 &-1 &3 \\ -6 &3 &1\end{array}\right)\]

    Give a \(\textit{geometric}\) reason why the associated system of equations has no solution. (Hint, plot the three vectors given by the columns of this augmented matrix in the plane.) Given a general augmented matrix

    \[\left(\begin{array}{rr|r}a &b &e \\ c &d &f\end{array}\right),\]

    can you nd a condition on the numbers \(a, b, c\) and \(d\) that corresponds to the geometric condition you found?

    10. A relation \(\sim\) on a set of objects \(U\) is an \(\textit{equivalence relation}\) if the following three properties are satisfied:

    \[\bullet{~Reflexive:~For~any~x~\in~U,~we~have~x\sim x.}\]

    \[\bullet{~Symmetric:~For~any~x,~y~\in~U,~if~x\sim y~then~y\sim x.}\]

    \[\bullet{~Transitive:~For~any~x,~y~and~z~\in~U,~if~x\sim y~and~y\sim z~then~x\sim z.}\]

    Show that row equivalence of matrices is an example of an equivalence relation.

    11. Equivalence of augmented matrices does not come from equality of their solution sets. Rather, we de ne two matrices to be equivalent if one can be obtained from the other by elementary row operations. Find a pair of augmented matrices that are not row equivalent but do have the same solution set.

    Contributor


    This page titled 2.2: Review Problems is shared under a not declared license and was authored, remixed, and/or curated by David Cherney, Tom Denton, & Andrew Waldron.