Chapter 2: Q21Q (page 93)
Suppose the last column of ABis entirely zero but Bitself has no column of zeros. What can you sayaboutthe columns of A?
Short Answer
The columns of Aare linearly dependent.
Chapter 2: Q21Q (page 93)
Suppose the last column of ABis entirely zero but Bitself has no column of zeros. What can you sayaboutthe columns of A?
The columns of Aare linearly dependent.
All the tools & learning materials you need for study success - in one app.
Get started for freeIn Exercises 1 and 2, compute each matrix sum or product if it is defined. If an expression is undefined, explain why. Let
\(A = \left( {\begin{aligned}{*{20}{c}}2&0&{ - 1}\\4&{ - 5}&2\end{aligned}} \right)\), \(B = \left( {\begin{aligned}{*{20}{c}}7&{ - 5}&1\\1&{ - 4}&{ - 3}\end{aligned}} \right)\), \(C = \left( {\begin{aligned}{*{20}{c}}1&2\\{ - 2}&1\end{aligned}} \right)\), \(D = \left( {\begin{aligned}{*{20}{c}}3&5\\{ - 1}&4\end{aligned}} \right)\) and \(E = \left( {\begin{aligned}{*{20}{c}}{ - 5}\\3\end{aligned}} \right)\)
\(A + 2B\), \(3C - E\), \(CB\), \(EB\).
Describe in words what happens when you compute \({A^{\bf{5}}}\), \({A^{{\bf{10}}}}\), \({A^{{\bf{20}}}}\), and \({A^{{\bf{30}}}}\) for \(A = \left( {\begin{aligned}{*{20}{c}}{1/6}&{1/2}&{1/3}\\{1/2}&{1/4}&{1/4}\\{1/3}&{1/4}&{5/12}\end{aligned}} \right)\).
Show that block upper triangular matrix \(A\) in Example 5is invertible if and only if both \({A_{{\bf{11}}}}\) and \({A_{{\bf{12}}}}\) are invertible. [Hint: If \({A_{{\bf{11}}}}\) and \({A_{{\bf{12}}}}\) are invertible, the formula for \({A^{ - {\bf{1}}}}\) given in Example 5 actually works as the inverse of \(A\).] This fact about \(A\) is an important part of several computer algorithims that estimates eigenvalues of matrices. Eigenvalues are discussed in chapter 5.
If a matrix \(A\) is \({\bf{5}} \times {\bf{3}}\) and the product \(AB\)is \({\bf{5}} \times {\bf{7}}\), what is the size of \(B\)?
Suppose \({A_{{\bf{11}}}}\) is invertible. Find \(X\) and \(Y\) such that
\[\left[ {\begin{array}{*{20}{c}}{{A_{{\bf{11}}}}}&{{A_{{\bf{12}}}}}\\{{A_{{\bf{21}}}}}&{{A_{{\bf{22}}}}}\end{array}} \right] = \left[ {\begin{array}{*{20}{c}}I&{\bf{0}}\\X&I\end{array}} \right]\left[ {\begin{array}{*{20}{c}}{{A_{{\bf{11}}}}}&{\bf{0}}\\{\bf{0}}&S\end{array}} \right]\left[ {\begin{array}{*{20}{c}}I&Y\\{\bf{0}}&I\end{array}} \right]\]
Where \(S = {A_{{\bf{22}}}} - {A_{21}}A_{{\bf{11}}}^{ - {\bf{1}}}{A_{{\bf{12}}}}\). The matrix \(S\) is called the Schur complement of \({A_{{\bf{11}}}}\). Likewise, if \({A_{{\bf{22}}}}\) is invertible, the matrix \({A_{{\bf{11}}}} - {A_{{\bf{12}}}}A_{{\bf{22}}}^{ - {\bf{1}}}{A_{{\bf{21}}}}\) is called the Schur complement of \({A_{{\bf{22}}}}\). Such expressions occur frequently in the theory of systems engineering, and elsewhere.
What do you think about this solution?
We value your feedback to improve our textbook solutions.