Skip to main content
Contents Index Dark Mode Prev Up Next \(\require{cancel}
\newcommand{\bigcdot}{\mathbin{\large\boldsymbol{\cdot}}}
\newcommand{\basisfont}[1]{\mathcal{#1}}
\newcommand{\iddots}{{\mkern3mu\raise1mu{.}\mkern3mu\raise6mu{.}\mkern3mu \raise12mu{.}}}
\DeclareMathOperator{\RREF}{RREF}
\DeclareMathOperator{\adj}{adj}
\DeclareMathOperator{\proj}{proj}
\DeclareMathOperator{\matrixring}{M}
\DeclareMathOperator{\poly}{P}
\DeclareMathOperator{\Span}{Span}
\DeclareMathOperator{\rank}{rank}
\DeclareMathOperator{\nullity}{nullity}
\DeclareMathOperator{\nullsp}{null}
\DeclareMathOperator{\uppermatring}{U}
\DeclareMathOperator{\trace}{trace}
\DeclareMathOperator{\dist}{dist}
\DeclareMathOperator{\negop}{neg}
\DeclareMathOperator{\Hom}{Hom}
\DeclareMathOperator{\im}{im}
\newcommand{\R}{\mathbb{R}}
\newcommand{\C}{\mathbb{C}}
\newcommand{\ci}{\mathrm{i}}
\newcommand{\cconj}[1]{\bar{#1}}
\newcommand{\lcconj}[1]{\overline{#1}}
\newcommand{\cmodulus}[1]{\left\lvert #1 \right\rvert}
\newcommand{\bbrac}[1]{\bigl(#1\bigr)}
\newcommand{\Bbrac}[1]{\Bigl(#1\Bigr)}
\newcommand{\irst}[1][1]{{#1}^{\mathrm{st}}}
\newcommand{\ond}[1][2]{{#1}^{\mathrm{nd}}}
\newcommand{\ird}[1][3]{{#1}^{\mathrm{rd}}}
\newcommand{\nth}[1][n]{{#1}^{\mathrm{th}}}
\newcommand{\leftrightlinesubstitute}{\scriptstyle \overline{\phantom{xxx}}}
\newcommand{\inv}[2][1]{{#2}^{-{#1}}}
\newcommand{\abs}[1]{\left\lvert #1 \right\rvert}
\newcommand{\degree}[1]{{#1}^\circ}
\newcommand{\blank}{-}
\newenvironment{sysofeqns}[1]
{\left\{\begin{array}{#1}}
{\end{array}\right.}
\newcommand{\iso}{\simeq}
\newcommand{\absegment}[1]{\overline{#1}}
\newcommand{\abray}[1]{\overrightarrow{#1}}
\newcommand{\abctriangle}[1]{\triangle #1}
\newcommand{\abcdquad}[1]{\square\, #1}
\newenvironment{abmatrix}[1]
{\left[\begin{array}{#1}}
{\end{array}\right]}
\newenvironment{avmatrix}[1]
{\left\lvert\begin{array}{#1}}
{\end{array}\right\rvert}
\newcommand{\mtrxvbar}{\mathord{|}}
\newcommand{\utrans}[1]{{#1}^{\mathrm{T}}}
\newcommand{\rowredarrow}{\xrightarrow[\text{reduce}]{\text{row}}}
\newcommand{\bidentmattwo}{\begin{bmatrix} 1 \amp 0 \\ 0 \amp 1 \end{bmatrix}}
\newcommand{\bidentmatthree}{\begin{bmatrix} 1 \amp 0 \amp 0 \\ 0 \amp 1 \amp 0 \\ 0 \amp 0 \amp 1 \end{bmatrix}}
\newcommand{\bidentmatfour}{\begin{bmatrix} 1 \amp 0 \amp 0 \amp 0 \\ 0 \amp 1 \amp 0 \amp 0 \\ 0 \amp 0 \amp 1 \amp 0
\\ 0 \amp 0 \amp 0 \amp 1 \end{bmatrix}}
\newcommand{\uvec}[1]{\mathbf{#1}}
\newcommand{\zerovec}{\uvec{0}}
\newcommand{\bvec}[2]{#1\,\uvec{#2}}
\newcommand{\ivec}[1]{\bvec{#1}{i}}
\newcommand{\jvec}[1]{\bvec{#1}{j}}
\newcommand{\kvec}[1]{\bvec{#1}{k}}
\newcommand{\injkvec}[3]{\ivec{#1} - \jvec{#2} + \kvec{#3}}
\newcommand{\norm}[1]{\left\lVert #1 \right\rVert}
\newcommand{\unorm}[1]{\norm{\uvec{#1}}}
\newcommand{\dotprod}[2]{#1 \bigcdot #2}
\newcommand{\udotprod}[2]{\dotprod{\uvec{#1}}{\uvec{#2}}}
\newcommand{\crossprod}[2]{#1 \times #2}
\newcommand{\ucrossprod}[2]{\crossprod{\uvec{#1}}{\uvec{#2}}}
\newcommand{\uproj}[2]{\proj_{\uvec{#2}} \uvec{#1}}
\newcommand{\adjoint}[1]{{#1}^\ast}
\newcommand{\matrixOfplain}[2]{{\left[#1\right]}_{#2}}
\newcommand{\rmatrixOfplain}[2]{{\left(#1\right)}_{#2}}
\newcommand{\rmatrixOf}[2]{\rmatrixOfplain{#1}{\basisfont{#2}}}
\newcommand{\matrixOf}[2]{\matrixOfplain{#1}{\basisfont{#2}}}
\newcommand{\invmatrixOfplain}[2]{\inv{\left[#1\right]}_{#2}}
\newcommand{\invrmatrixOfplain}[2]{\inv{\left(#1\right)}_{#2}}
\newcommand{\invmatrixOf}[2]{\invmatrixOfplain{#1}{\basisfont{#2}}}
\newcommand{\invrmatrixOf}[2]{\invrmatrixOfplain{#1}{\basisfont{#2}}}
\newcommand{\stdmatrixOf}[1]{\left[#1\right]}
\newcommand{\ucobmtrx}[2]{P_{\basisfont{#1} \to \basisfont{#2}}}
\newcommand{\uinvcobmtrx}[2]{\inv{P}_{\basisfont{#1} \to \basisfont{#2}}}
\newcommand{\uadjcobmtrx}[2]{\adjoint{P}_{\basisfont{#1} \to \basisfont{#2}}}
\newcommand{\coordmapplain}[1]{C_{#1}}
\newcommand{\coordmap}[1]{\coordmapplain{\basisfont{#1}}}
\newcommand{\invcoordmapplain}[1]{\inv{C}_{#1}}
\newcommand{\invcoordmap}[1]{\invcoordmapplain{\basisfont{#1}}}
\newcommand{\similar}{\sim}
\newcommand{\inprod}[2]{\left\langle\, #1,\, #2 \,\right\rangle}
\newcommand{\uvecinprod}[2]{\inprod{\uvec{#1}}{\uvec{#2}}}
\newcommand{\orthogcmp}[1]{{#1}^{\perp}}
\newcommand{\vecdual}[1]{{#1}^\ast}
\newcommand{\vecddual}[1]{{#1}^{\ast\ast}}
\newcommand{\change}[1]{\Delta #1}
\newcommand{\dd}[2]{\frac{d{#1}}{d#2}}
\newcommand{\ddx}[1][x]{\dd{}{#1}}
\newcommand{\ddt}[1][t]{\dd{}{#1}}
\newcommand{\dydx}{\dd{y}{x}}
\newcommand{\dxdt}{\dd{x}{t}}
\newcommand{\dydt}{\dd{y}{t}}
\newcommand{\intspace}{\;}
\newcommand{\integral}[4]{\int^{#2}_{#1} #3 \intspace d{#4}}
\newcommand{\funcdef}[3]{#1\colon #2\to #3}
\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\,}$}}}
\)
Discovery guide 6.1 Discovery guide
Discovery 6.1 .
Consider the matrices
\begin{align*}
I \amp = \bidentmatthree,
\amp
E \amp = \begin{bmatrix} 1 \amp 0 \amp 0 \\ 2 \amp 1 \amp 0 \\ 0 \amp 0 \amp 1 \end{bmatrix},
\amp
A \amp = \begin{bmatrix}
1 \amp 2 \amp 4 \amp 7 \\
1 \amp 1 \amp 1 \amp 1 \\
1 \amp 2 \amp 3 \amp 4
\end{bmatrix}.
\end{align*}
(a) Remind yourself using the
row-times-column pattern of matrix multiplication why the pattern of ones and zeros in the entries of
\(I \) cause the result of computing
\(I A \) to be just
\(A \text{.}\)
(b) Notice how
\(E \) is only one entry different from
\(I \text{.}\) How does this change the process of computing
\(E A \) compared to computing
\(I A \text{?}\)
Think of multiplication by
\(E \) as “transforming”
\(A \) into the result matrix
\(E A \text{.}\) How could you describe the transformation in this particular example?
Hint .
In the “transformation”
\(A \to E A \text{,}\) which rows of
\(A \) stay the same, and which rows change? For the rows that change, how exactly do they change? (Don’t just stare at the numbers of the result matrix
\(E A \text{,}\) think about
how the numbers in
\(A \) “transform” into the numbers in
\(E A \) because of the pattern of entries in
\(E \text{.}\) )
(c) Do you think the same thing will happen when computing
\(E \) times some other matrix?
(d)
Consider the following two perspectives of the product \(E I \text{.}\)
Because \(I \) is the identity matrix, the result of computing \(E I \) will just be \(E \text{.}\)
Based on the pattern identified in
Task b and
Task c , the result of
\(E I \) could be viewed as a “transformation” of
\(I \text{.}\)
By reconciling these two different perspectives, determine the relationship between \(E \) and \(I \) in terms of the “transformation” \(I \to E I \text{.}\)
Discovery 6.2 .
Create a
\(3 \times 3\) matrix
\(E'\) so that for every
\(3\times n\) matrix
\(A\text{,}\) the result of
\(E' A\) is the same as performing row operation “multiply row
\(3\) by
\(-4\) ” on
\(A\text{.}\)
Discovery 6.3 .
Create a
\(3\times 3\) matrix
\(E''\) so that for every
\(3 \times n\) matrix
\(A\text{,}\) the result of
\(E'' A\) is the same as performing row operation “swap rows
\(1\) and
\(2\) ” on
\(A\text{.}\)
Matrices
\(E,E',E''\) from the discovery activities so far are called
elementary matrices . As the preceding activities demonstrate, every elementary row operation has a corresponding elementary matrix.
Discovery 6.4 .
Suppose we were to take a \(3 \times \ell\) matrix \(A\) and compute
\begin{equation*}
E'' E' E A = E'' \bbrac{ E' (E A) } \text{,}
\end{equation*}
where
\(E, E', E''\) are as in
Activities 6.1–6.3 . How can we interpret this matrix multiplication result in terms of row operations? (Careful of the order of operations!)
Discovery 6.5 .
Consider
\(B = \begin{abmatrix}{rrr}
1 \amp 0 \amp -3 \\
0 \amp 0 \amp 2 \\
0 \amp 1 \amp 0
\end{abmatrix}
\text{.}\)
(a) Determine elementary matrices
\(E_1,E_2,E_3\) so that
\(E_3 E_2 E_1 B\) is the identity matrix.
(b) The matrix
\(B\) happens to be invertible. From
\(E_3 E_2 E_1 B = I\text{,}\) the inverse of
\(B\) must be
\(\inv{B} = \fillinmath{XXXXXX}\text{.}\)
(c) Tack an identity matrix
\(I\) onto the right end of your formula for
\(\inv{B}\) from
Task b . (Recall that multiplying by
\(I\) has no effect.)
Using this new, modified formula for
\(\inv{B}\) as inspiration, come up with a procedure to use
only row operations (and not elementary matrices) to compute the inverse of a square matrix.
Hint .
Where did your elementary matrices
\(E_1,E_2,E_3\) come from? And what are they now “doing” to the identity matrix, and in what order?
Discovery 6.6 .
Consider the general
\(2\times 2\) matrix
\(A = \left[\begin{smallmatrix}a \amp b\\c \amp d\end{smallmatrix}\right]\text{.}\)
(a) Assume that
\(a \neq 0\text{.}\) Use the method you developed in
Discovery 6.5 to determine the inverse of
\(A\text{.}\)
(b) Where there any other assumptions about the entries of
\(A\) (besides
\(a \neq 0\) ) that you needed to make for this to work? Why?
Hint .
Division by zero is undefined.
(c) Repeat for the other case: assume
\(a=0\text{.}\)
Discovery 6.7 .
Complete the following tasks for each of the three types of elementary row operations, one at a time:
swap two rows;
multiply a row by a nonzero constant;
add a multiple of one row to another.
(a)
Suppose someone has performed the row operation you are currently considering on a matrix:
\begin{equation*}
A \xrightarrow[\text{op}]{\text{row}} A' \text{.}
\end{equation*}
If you know only the operation and the result \(A'\text{,}\) how can you recover the original matrix \(A\text{?}\)
\begin{equation*}
A' \xrightarrow{\text{?}} A
\end{equation*}
(b)
Suppose we consider
Task a with
\(A = I\text{:}\)
\begin{equation*}
I \xrightarrow[\text{op}]{\text{row}} E I \xrightarrow{\text{(a)}} E' E I \text{,}
\end{equation*}
where
According to
Task a , what should the final result
\(E' E I\) be? What does this say in general about the inverse of an elementary matrix of the type you are currently considering?
