Chapter 2: Q21Q (page 93)
If the equation \[Gx = y\] has more than one solution for some y in \[{\mathbb{R}^{\bf{n}}}\] , can the columns of G span \[{\mathbb{R}^{\bf{n}}}\]? Why or why not?
The columns of G do not span \[{\mathbb{R}^n}\] because G is not invertible.
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
Give a formula for \({\left( {ABx} \right)^T}\), where \({\bf{x}}\) is a vector and \(A\) and \(B\) are matrices of appropriate sizes.
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{1}}}&{\bf{2}}\\{\bf{5}}&{\bf{4}}\\{\bf{2}}&{ - {\bf{3}}}\end{aligned}} \right)\), \(B = \left( {\begin{aligned}{*{20}{c}}{\bf{3}}&{ - {\bf{2}}}\\{ - {\bf{2}}}&{\bf{1}}\end{aligned}} \right)\)
A useful way to test new ideas in matrix algebra, or to make conjectures, is to make calculations with matrices selected at random. Checking a property for a few matrices does not prove that the property holds in general, but it makes the property more believable. Also, if the property is actually false, you may discover this when you make a few calculations.
37. Construct a random \({\bf{4}} \times {\bf{4}}\) matrix Aand test whether \(\left( {A + I} \right)\left( {A - I} \right) = {A^2} - I\). The best way to do this is to compute \(\left( {A + I} \right)\left( {A - I} \right) - \left( {{A^2} - I} \right)\) and verify that this difference is the zero matrix. Do this for three random matrices. Then test \(\left( {A + B} \right)\left( {A - B} \right) = {A^2} - {B^{\bf{2}}}\) the same way for three pairs of random \({\bf{4}} \times {\bf{4}}\) matrices. Report your conclusions.
Prove Theorem 2(b) and 2(c). Use the row-column rule. The \(\left( {i,j} \right)\)- entry in \(A\left( {B + C} \right)\) can be written as \({a_{i1}}\left( {{b_{1j}} + {c_{1j}}} \right) + ... + {a_{in}}\left( {{b_{nj}} + {c_{nj}}} \right)\) or \(\sum\limits_{k = 1}^n {{a_{ik}}\left( {{b_{kj}} + {c_{kj}}} \right)} \).
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.
What do you think about this solution?
We value your feedback to improve our textbook solutions.
