Chapter 4: Q8SE (page 191)
Let H be an n-dimensional subspace of an n-dimensional vector space V. Explain why \(H = V\).
Short Answer
H is a subspace of V, and B is also in V. As B is a linearly independent set in V, B must also be a basis for V.
Chapter 4: Q8SE (page 191)
Let H be an n-dimensional subspace of an n-dimensional vector space V. Explain why \(H = V\).
H is a subspace of V, and B is also in V. As B is a linearly independent set in V, B must also be a basis for V.
All the tools & learning materials you need for study success - in one app.
Get started for free[M] Let \(A = \left[ {\begin{array}{*{20}{c}}7&{ - 9}&{ - 4}&5&3&{ - 3}&{ - 7}\\{ - 4}&6&7&{ - 2}&{ - 6}&{ - 5}&5\\5&{ - 7}&{ - 6}&5&{ - 6}&2&8\\{ - 3}&5&8&{ - 1}&{ - 7}&{ - 4}&8\\6&{ - 8}&{ - 5}&4&4&9&3\end{array}} \right]\).
Let \({M_{2 \times 2}}\) be the vector space of all \(2 \times 2\) matrices, and define \(T:{M_{2 \times 2}} \to {M_{2 \times 2}}\) by \(T\left( A \right) = A + {A^T}\), where \(A = \left( {\begin{array}{*{20}{c}}a&b\\c&d\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\).
17. A submatrix of a matrix A is any matrix that results from deleting some (or no) rows and/or columns of A. It can be shown that A has rank \(r\) if and only if A contains an invertible \(r \times r\) submatrix and no longer square submatrix is invertible. Demonstrate part of this statement by explaining (a) why an \(m \times n\) matrix A of rank \(r\) has an \(m \times r\) submatrix \({A_1}\) of rank \(r\), and (b) why \({A_1}\) has an invertible \(r \times r\) submatrix \({A_2}\).
The concept of rank plays an important role in the design of engineering control systems, such as the space shuttle system mentioned in this chapter’s introductory example. A state-space model of a control system includes a difference equation of the form
\({{\mathop{\rm x}\nolimits} _{k + 1}} = A{{\mathop{\rm x}\nolimits} _k} + B{{\mathop{\rm u}\nolimits} _k}\)for \(k = 0,1,....\) (1)
Where \(A\) is \(n \times n\), \(B\) is \(n \times m\), \(\left\{ {{{\mathop{\rm x}\nolimits} _k}} \right\}\) is a sequence of “state vectors” in \({\mathbb{R}^n}\) that describe the state of the system at discrete times, and \(\left\{ {{{\mathop{\rm u}\nolimits} _k}} \right\}\) is a control, or input, sequence. The pair \(\left( {A,B} \right)\) is said to be controllable if
\({\mathop{\rm rank}\nolimits} \left( {\begin{array}{*{20}{c}}B&{AB}&{{A^2}B}& \cdots &{{A^{n - 1}}B}\end{array}} \right) = n\) (2)
The matrix that appears in (2) is called the controllability matrix for the system. If \(\left( {A,B} \right)\) is controllable, then the system can be controlled, or driven from the state 0 to any specified state \({\mathop{\rm v}\nolimits} \) (in \({\mathbb{R}^n}\)) in at most \(n\) steps, simply by choosing an appropriate control sequence in \({\mathbb{R}^m}\). This fact is illustrated in Exercise 18 for \(n = 4\) and \(m = 2\). For a further discussion of controllability, see this text’s website (Case study for Chapter 4).
Question: 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)\).
Exercises 23-26 concern a vector space V, a basis \(B = \left\{ {{{\bf{b}}_{\bf{1}}},....,{{\bf{b}}_n}\,} \right\}\) and the coordinate mapping \({\bf{x}} \mapsto {\left( {\bf{x}} \right)_B}\).
Show the coordinate mapping is one to one. (Hint: Suppose \({\left( {\bf{u}} \right)_B} = {\left( {\bf{w}} \right)_B}\) for some u and w in V, and show that \({\bf{u}} = {\bf{w}}\)).
What do you think about this solution?
We value your feedback to improve our textbook solutions.