Chapter 4: Q8E (page 191)
Suppose a \({\bf{5}} \times {\bf{6}}\) matrix A has four pivot columns. What is dim Nul A? Is \({\bf{Col}}\,A = {\mathbb{R}^{\bf{3}}}\)? Why or why not?
Short Answer
dim Nul A=2, \({\rm{Col}}\,A \ne {\mathbb{R}^4}\)
Chapter 4: Q8E (page 191)
Suppose a \({\bf{5}} \times {\bf{6}}\) matrix A has four pivot columns. What is dim Nul A? Is \({\bf{Col}}\,A = {\mathbb{R}^{\bf{3}}}\)? Why or why not?
dim Nul A=2, \({\rm{Col}}\,A \ne {\mathbb{R}^4}\)
All the tools & learning materials you need for study success - in one app.
Get started for freeQuestion: Determine if the matrix pairs in Exercises 19-22 are controllable.
19. \(A = \left( {\begin{array}{*{20}{c}}{.9}&1&0\\0&{ - .9}&0\\0&0&{.5}\end{array}} \right),B = \left( {\begin{array}{*{20}{c}}0\\1\\1\end{array}} \right)\).
Question: Exercises 12-17 develop properties of rank that are sometimes needed in applications. Assume the matrix \(A\) is \(m \times n\).
16. If \(A\) is an \(m \times n\) matrix of rank\(r\), then a rank factorization of \(A\) is an equation of the form \(A = CR\), where \(C\) is an \(m \times r\) matrix of rank\(r\) and \(R\) is an \(r \times n\) matrix of rank \(r\). Such a factorization always exists (Exercise 38 in Section 4.6). Given any two \(m \times n\) matrices \(A\) and \(B\), use rank factorizations of \(A\) and \(B\) to prove that rank\(\left( {A + B} \right) \le {\mathop{\rm rank}\nolimits} A + {\mathop{\rm rank}\nolimits} B\).
(Hint: Write \(A + B\) as the product of two partitioned matrices.)
Question: Exercises 12-17 develop properties of rank that are sometimes needed in applications. Assume the matrix \(A\) is \(m \times n\).
16. If \(A\) is an \(m \times n\) matrix of rank\(r\), then a rank factorization of \(A\) is an equation of the form \(A = CR\), where \(C\) is an \(m \times r\) matrix of rank\(r\) and \(R\) is an \(r \times n\) matrix of rank \(r\). Such a factorization always exists (Exercise 38 in Section 4.6). Given any two \(m \times n\) matrices \(A\) and \(B\), use rank factorizations of \(A\) and \(B\) to prove that rank\(\left( {A + B} \right) \le {\mathop{\rm rank}\nolimits} A + {\mathop{\rm rank}\nolimits} B\).
(Hint: Write \(A + B\) as the product of two partitioned matrices.)
(M) Determine whether w is in the column space of \(A\), the null space of \(A\), or both, where
\({\mathop{\rm w}\nolimits} = \left( {\begin{array}{*{20}{c}}1\\1\\{ - 1}\\{ - 3}\end{array}} \right),A = \left( {\begin{array}{*{20}{c}}7&6&{ - 4}&1\\{ - 5}&{ - 1}&0&{ - 2}\\9&{ - 11}&7&{ - 3}\\{19}&{ - 9}&7&1\end{array}} \right)\)
Suppose \(A\) is \(m \times n\)and \(b\) is in \({\mathbb{R}^m}\). What has to be true about the two numbers rank \(\left[ {A\,\,\,{\rm{b}}} \right]\) and \({\rm{rank}}\,A\) in order for the equation \(Ax = b\) to be consistent?
What do you think about this solution?
We value your feedback to improve our textbook solutions.