Chapter 2: Q8Q (page 93)
Use matrix algebra to show that if A is invertible and D satisfies \(AD = I\) then \(D = {A^{ - {\bf{1}}}}\).
The equation \(D = {A^{ - 1}}\) is proved.
Over 30 million students worldwide already upgrade their learning with Vaia!
All the tools & learning materials you need for study success - in one app.
Get started for free
In exercise 5 and 6, compute the product \(AB\) in two ways: (a) by the definition, where \(A{b_{\bf{1}}}\) and \(A{b_{\bf{2}}}\) are computed separately, and (b) by the row-column rule for computing \(AB\).
\(A = \left( {\begin{aligned}{*{20}{c}}{\bf{4}}&{ - {\bf{2}}}\\{ - {\bf{3}}}&{\bf{0}}\\{\bf{3}}&{\bf{5}}\end{aligned}} \right)\), \(B = \left( {\begin{aligned}{*{20}{c}}{\bf{1}}&{\bf{3}}\\{\bf{2}}&{ - {\bf{1}}}\end{aligned}} \right)\)
In Exercises 1–9, assume that the matrices are partitioned conformably for block multiplication. In Exercises 5–8, find formulas for X, Y, and Zin terms of A, B, and C, and justify your calculations. In some cases, you may need to make assumptions about the size of a matrix in order to produce a formula. [Hint:Compute the product on the left, and set it equal to the right side.]
7. \[\left[ {\begin{array}{*{20}{c}}X&{\bf{0}}&{\bf{0}}\\Y&{\bf{0}}&I\end{array}} \right]\left[ {\begin{array}{*{20}{c}}A&Z\\{\bf{0}}&{\bf{0}}\\B&I\end{array}} \right] = \left[ {\begin{array}{*{20}{c}}I&{\bf{0}}\\{\bf{0}}&I\end{array}} \right]\]
Use partitioned matrices to prove by induction that for \(n = 2,3,...\), the \(n \times n\) matrices \(A\) shown below is invertible and \(B\) is its inverse.
\[A = \left[ {\begin{array}{*{20}{c}}1&0&0& \cdots &0\\1&1&0&{}&0\\1&1&1&{}&0\\ \vdots &{}&{}& \ddots &{}\\1&1&1& \ldots &1\end{array}} \right]\]
\[B = \left[ {\begin{array}{*{20}{c}}1&0&0& \cdots &0\\{ - 1}&1&0&{}&0\\0&{ - 1}&1&{}&0\\ \vdots &{}& \ddots & \ddots &{}\\0&{}& \ldots &{ - 1}&1\end{array}} \right]\]
For the induction step, assume A and Bare \(\left( {k + 1} \right) \times \left( {k + 1} \right)\) matrices, and partition Aand B in a form similar to that displayed in Exercises 23.
Suppose Ais an \(n \times n\) matrix with the property that the equation \[A{\mathop{\rm x}\nolimits} = 0\] has at least one solution for each b in \({\mathbb{R}^n}\). Without using Theorem 5 or 8, explain why each equation Ax = b has in fact exactly one solution.
Let \(A = \left( {\begin{aligned}{*{20}{c}}3&{ - 6}\\{ - 1}&2\end{aligned}} \right)\). Construct a \({\bf{2}} \times {\bf{2}}\) matrix Bsuch that ABis the zero matrix. Use two different nonzero columns for B.
What do you think about this solution?
We value your feedback to improve our textbook solutions.
