Chapter 2: Q17SE (page 93)
Let A be a \(6 \times 4\) matrix and B a \(4 \times 6\) matrix. Show that the \(6 \times 6\) matrix \(AB\) cannot be invertible.
Short Answer
It is proved that the \(6 \times 6\) matrix \(AB\) cannot be invertible.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 2: Q17SE (page 93)
Let A be a \(6 \times 4\) matrix and B a \(4 \times 6\) matrix. Show that the \(6 \times 6\) matrix \(AB\) cannot be invertible.
It is proved that the \(6 \times 6\) matrix \(AB\) cannot be invertible.
All the tools & learning materials you need for study success - in one app.
Get started for free
In 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)\)
\( - 2A\), \(B - 2A\), \(AC\), \(CD\).
Suppose Ais an \(n \times n\) matrix with the property that the equation \(Ax = 0\)has only the trivial solution. Without using the Invertible Matrix Theorem, explain directly why the equation \(Ax = b\) must have a solution for each b in \({\mathbb{R}^n}\).
In exercise 11 and 12, mark each statement True or False.Justify each answer.
a. If \(A = \left[ {\begin{array}{*{20}{c}}{{A_{\bf{1}}}}&{{A_{\bf{2}}}}\end{array}} \right]\) and \(B = \left[ {\begin{array}{*{20}{c}}{{B_{\bf{1}}}}&{{B_{\bf{2}}}}\end{array}} \right]\), with \({A_{\bf{1}}}\) and \({A_{\bf{2}}}\) the same sizes as \({B_{\bf{1}}}\) and \({B_{\bf{2}}}\), respectively then \(A + B = \left[ {\begin{array}{*{20}{c}}{{A_1} + {B_1}}&{{A_{\bf{2}}} + {B_{\bf{2}}}}\end{array}} \right]\).
b. If \(A = \left[ {\begin{array}{*{20}{c}}{{A_{{\bf{11}}}}}&{{A_{{\bf{12}}}}}\\{{A_{{\bf{21}}}}}&{{A_{{\bf{22}}}}}\end{array}} \right]\) and \(B = \left[ {\begin{array}{*{20}{c}}{{B_1}}\\{{B_{\bf{2}}}}\end{array}} \right]\), then the partitions of \(A\) and \(B\) are comfortable for block multiplication.
Solve the equation \(AB = BC\) for A, assuming that A, B, and C are square and Bis invertible.
Suppose the last column of ABis entirely zero but Bitself has no column of zeros. What can you sayaboutthe columns of A?
What do you think about this solution?
We value your feedback to improve our textbook solutions.