3.E: Supplementary Exercises for Chapter 3
- Page ID
- 59011
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\dsum}{\displaystyle\sum\limits} \)
\( \newcommand{\dint}{\displaystyle\int\limits} \)
\( \newcommand{\dlim}{\displaystyle\lim\limits} \)
\( \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{\longvect}{\overrightarrow}\)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\ket}[1]{\left| #1 \right>}\)
\(\newcommand{\bra}[1]{\left< #1 \right|}\)
\(\newcommand{\braket}[2]{\left< #1 \vphantom{#2} \right| \left. #2 \vphantom{#1} \right>}\)
\(\newcommand{\braopket}[3]{\left< #1 \vphantom{#2}\vphantom{#3} \right| #2 \vphantom{#1}\vphantom{#3} \left| #3 \vphantom{#1}\vphantom{#2} \right>}\)
\(\newcommand{\qmvec}[1]{\mathbf{\vec{#1}}}\)
\(\newcommand{\op}[1]{\hat{\mathbf{#1}}}\)
\(\newcommand{\expect}[1]{\langle #1 \rangle}\)
\(\newcommand{\dfn}[1]{\emph{\textbf{#1}}}\)
Show that
\[\det \left[ \begin{array}{ccc} a+px & b+qx & c+rx \\ p+ux & q+vx & r+wx \\ u+ax & v+bx & w+cx \\ \end{array} \right] = (1+x^3) \det \left[ \begin{array}{ccc} a & b & c \\ p & q & r \\ u & v & w \end{array}\right] \nonumber \]
- Show that \((A_{ij})^{T} = (A^{T})_{ji}\) for all \(i\), \(j\), and all square matrices \(A\).
- Use (a) to prove that \(\det A^{T} = \det A\). [Hint: Induction on \(n\) where \(A\) is \(n \times n\).]
- Answer
-
- If \(A\) is \(1 \times 1\), then \(A^{T} = A\). In general, \(\det \left[ A_{ij} \right] = \det \left[ (A_{ij})^{T}\right] = \det \left[(A^{T})_{ji} \right]\) by (a) and induction. Write \(A^{T} = \left[ a^\prime_{ij}\right]\) where \(a^\prime_{ij} = a_{ji}\), and expand \(\det A^{T}\) along column 1. \[\begin{aligned} \det A^T &= \sum_{j=1}^{n} a^{\prime}_{j1}(-1)^{j+1} \det [(A^T)_{j1}] \\ &= \sum_{j=1}^{n} a_{1j}(-1)^{1+j} \det [A_{1j}] = \det A\end{aligned} \nonumber \] where the last equality is the expansion of \(\det A\) along row 1.
Show that \(\det \left[ \begin{array}{cc} 0 & I_n \\ I_m & 0 \end{array}\right] = (-1)^{nm}\) for all \(n \geq 1\) and \(m \geq 1\).
Show that \[\det \left[ \begin{array}{rrr} 1 & a & a^3 \\ 1 & b & b^3 \\ 1 & c & c^3 \end{array}\right] = (b-a)(c-a)(c-b)(a+b+c) \nonumber \]
Let \(A = \left[ \begin{array}{c} R_1 \\ R_2 \end{array}\right]\) be a 2 \(\times\) 2 matrix with rows \(R_{1}\) and \(R_{2}\). If \(\det A = 5\), find \(\det B\) where \[B = \left[ \begin{array}{c} 3R_1 + 2R_3 \\ 2R_1 + 5R_2 \end{array}\right] \nonumber \]
Let \(A = \left[ \begin{array}{rr} 3 & -4 \\ 2 & -3 \end{array}\right]\) and let \(\mathbf{v}_{k} = A^{k}\mathbf{v}_{0}\) for each \(k \geq 0\).
- Show that \(A\) has no dominant eigenvalue.
- Find \(\mathbf{v}_{k}\) if \(\mathbf{v}_{0}\) equals:
- \(\left[ \begin{array}{r} 1 \\ 1 \end{array}\right]\)
- \(\left[ \begin{array}{r} 2 \\ 1 \end{array}\right]\)
- \(\left[ \begin{array}{r} x \\ y \end{array}\right] \neq \left[ \begin{array}{r} 1 \\ 1 \end{array}\right]\) or \(\left[ \begin{array}{r} 2 \\ 1 \end{array}\right]\)