Skip to main content
Contents Index
Search Book
Search Results:
No results.
Readability settings Prev Up Next Scratch ActiveCode Profile
title here
\(\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{\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 4.3 Solving Systems with Matrix Inverses (MX3)
Learning Outcomes
Invert an appropriate matrix to solve a system of linear equations.
Subsection 4.3.1 Warm Up
Activity 4.3.1 .
Which of the following matrices is invertible? Find the inverse for the one that is invertible.
\(\displaystyle \left[\begin{matrix}1 & -1 & 0\\
-1 & 1 & 0\\
1 & 0 & 1\end{matrix}\right]\)
\(\displaystyle \left[\begin{matrix}1 & -1 & 3\\
-1 & 1 & -1\\
1 & 0 & -2\end{matrix}\right]\)
Subsection 4.3.2 Class Activities
Activity 4.3.2 .
Consider the following linear system with a unique solution:
\begin{equation*}
\begin{matrix}
3x_{1} & - & 2x_{2} & - & 2x_{3} & - & 4x_{4} & = & -7 \\
2x_{1} & - & x_{2} & - & x_{3} & - & x_{4} & = & -1 \\
-x_{1} & & & + & x_{3} & & & = & -1 \\
& - & x_{2} & & & - & 2x_{4} & = & -5 \\
\end{matrix}
\end{equation*}
(a)
Suppose we let
\begin{equation*}
T\left(\left[\begin{matrix}x_1\\x_2\\x_3\\x_4\end{matrix}\right]\right)=
\left[\begin{matrix}
3x_{1} & - & 2x_{2} & - & 2x_{3} & - & 4x_{4} \\
2x_{1} & - & x_{2} & - & x_{3} & - & x_{4} \\
-x_{1} & & & + & x_{3} & & \\
& - & x_{2} & & & - & 2x_{4} \\
\end{matrix}\right]\text{.}
\end{equation*}
Which of these choices would help us solve the given system?
Compute \(T\left(
\left[\begin{matrix}
-7 \\
-1 \\
-1 \\
-5 \\
\end{matrix}\right]\right)\)
Find \(\left[\begin{matrix}x_1\\x_2\\x_3\\x_4\end{matrix}\right]\) where \(T\left(\left[\begin{matrix}x_1\\x_2\\x_3\\x_4\end{matrix}\right]\right)=
\left[\begin{matrix}
-7 \\
-1 \\
-1 \\
-5 \\
\end{matrix}\right]\)
(b)
How can we express this in terms of matrix multiplication?
\(\displaystyle \left[\begin{matrix}
3 & -2 & -2 & - 4 \\
2 & -1 & -1 & -1 \\
-1 & 0 & 1 & 0 \\
0 & -1 & 0 & -2 \\
\end{matrix}\right]
\left[\begin{matrix}x_1\\x_2\\x_3\\x_4\end{matrix}\right]
=
\left[\begin{matrix}
-7 \\
-1 \\
-1 \\
-5 \\
\end{matrix}\right]\)
\(\displaystyle \left[\begin{matrix}x_1\\x_2\\x_3\\x_4\end{matrix}\right]
=
\left[\begin{matrix}
3 & -2 & -2 & - 4 \\
2 & -1 & -1 & -1 \\
-1 & 0 & 1 & 0 \\
0 & -1 & 0 & -2 \\
\end{matrix}\right]
\left[\begin{matrix}
-7 \\
-1 \\
-1 \\
-5 \\
\end{matrix}\right]\)
\(\displaystyle \left[\begin{matrix}x_1\\x_2\\x_3\\x_4\end{matrix}\right]
\left[\begin{matrix}
3 & -2 & -2 & - 4 \\
2 & -1 & -1 & -1 \\
-1 & 0 & 1 & 0 \\
0 & -1 & 0 & -2 \\
\end{matrix}\right]
=
\left[\begin{matrix}
-7 \\
-1 \\
-1 \\
-5 \\
\end{matrix}\right]\)
\(\displaystyle \left[\begin{matrix}x_1\\x_2\\x_3\\x_4\end{matrix}\right]
=
\left[\begin{matrix}
-7 \\
-1 \\
-1 \\
-5 \\
\end{matrix}\right]
\left[\begin{matrix}
3 & -2 & -2 & - 4 \\
2 & -1 & -1 & -1 \\
-1 & 0 & 1 & 0 \\
0 & -1 & 0 & -2 \\
\end{matrix}\right]\)
(c)
How could a matrix equation of the form \(A\vec x=\vec b\) be solved for \(\vec x\text{?}\)
Multiply: \((\RREF A)(A\vec x)=(\RREF A)\vec b\)
Add: \((\RREF A) + A\vec x=(\RREF A)+\vec b\)
Multiply: \((A^{-1})(A\vec x)=(A^{-1})\vec b\)
Add: \((A^{-1}) + A\vec x=(A^{-1})+\vec b\)
(d)
Find
\(\left[\begin{matrix}x_1\\x_2\\x_3\\x_4\end{matrix}\right]\) using the method you chose in (c).
Activity 4.3.4 .
Consider the vector equation
\begin{equation*}
x_{1} \left[\begin{array}{c} 1 \\ 2 \\ -2 \end{array}\right] + x_{2} \left[\begin{array}{c} -2 \\ -3 \\ 3 \end{array}\right] + x_{3} \left[\begin{array}{c} 1 \\ 4 \\ -3 \end{array}\right] = \left[\begin{array}{c} -3 \\ 5 \\ -1 \end{array}\right]
\end{equation*}
with a unique solution.
(a)
Explain and demonstrate how this problem can be restated using matrix multiplication.
(b)
Use the properties of matrix multiplication to find the unique solution.
Subsection 4.3.3 Cool Down
Activity 4.3.5 .
Solving linear systems using matrix multiplication is most useful when we are working with one common coefficient matrix, and varying the right-hand side. That is, when we have
\(A\vec{x}=\vec{b}\) for several different values of
\(\vec{b}\text{.}\)
In the following, let
\(A=\left[\begin{matrix}2 & -1 & -6\\ 2 & 1 & 3\\ 1 & 1 & 4\end{matrix}\right]\) and consider the following questions about various equations of the form
\(A\vec{x}=\vec{b}\text{?}\)
(a)
Suppose that \(\vec{b}=\left[\begin{matrix} 1\\1\\1\end{matrix}\right]\text{.}\) If asked to solve the equation \(A\vec{x}=\vec{b}\text{,}\) which of the following approaches do you prefer?
Calculate
\(\RREF[A|\vec{b}]\text{.}\)
Calculate
\(A^{-1}\) and then compute
\(\vec{x}=A^{-1}\vec{b}\)
(b)
Suppose that \(\vec{b}_1,\vec{b}_2,\vec{b}_3=\left[\begin{matrix} 1\\1\\1\end{matrix}\right],\left[\begin{matrix} 2\\1\\3\end{matrix}\right],\left[\begin{matrix} -1\\3\\5\end{matrix}\right]\text{.}\) If asked to solve each of the equations \(A\vec{x}=\vec{b}_1, A\vec{x}=\vec{b}_2, A\vec{x}=\vec{b}_3\text{,}\) which of the following approaches do you prefer?
Calculate
\(\RREF[A|\vec{b}_1]\text{,}\) \(\RREF[A|\vec{b}_2]\text{,}\) and
\(\RREF[A|\vec{b}_3]\)
Calculate
\(A^{-1}\) and then compute
\(\vec{x}=A^{-1}\vec{b}_1\text{,}\) \(\vec{x}=A^{-1}\vec{b}_2\text{,}\) and
\(\vec{x}=A^{-1}\vec{b}_3\)
(c)
Suppose that \(\vec{b}_1,\dots, \vec{b}_{10}\) are 10 distinct vectors. If asked to solve each of the equations \(A\vec{x}=\vec{b}_1, \dots, A\vec{x}=\vec{b}_{10}\text{,}\) which of the following approaches do you prefer?
Calculate
\(\RREF[A|\vec{b}_1]\text{,}\) ...
\(\RREF[A|\vec{b}_{10}]\text{.}\)
Calculate
\(A^{-1}\) and then compute
\(\vec{x}=A^{-1}\vec{b}_1\text{,}\) ...
\(\vec{x}=A^{-1}\vec{b}_{10}\text{.}\)
Exercises 4.3.5 Exercises
Subsection 4.3.6 Mathematical Writing Explorations
Exploration 4.3.6 .
Use row reduction to find the inverse of the following general matrix. Give conditions on which this inverse exists.
\begin{equation*}
\left[\begin{array}{ccc}1 & b & c \\ d & e & f \\ g & h & i \end{array}\right]
\end{equation*}
Exploration 4.3.7 .
Assume that \(H\) is invertible, and that \(HG\) is the zero matrix. Prove that \(G\) must be the zero matrix. Would this still be true if \(H\) were not invertible?
Exploration 4.3.8 .
If \(H\) is invertible and \(r \in \mathbb{R}\text{,}\) what is the inverse of \(rH\text{?}\)
Exploration 4.3.9 .
If \(H\) and \(G\) are invertible, is \(H^{-1} + G^{-1} = (H+G)^{-1}\text{?}\)
Exploration 4.3.10 .
Prove that if \(A\text{,}\) \(P\text{,}\) and \(Q\) are invertible with \(PAQ = I\text{,}\) then \(A^{-1} = QP\text{.}\)
Subsection 4.3.7 Sample Problem and Solution
You have attempted
of
activities on this page.