5.1E: Subspaces and Spanning Exercises
- Page ID
- 132820
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\dsum}{\displaystyle\sum\limits} \)
\( \newcommand{\dint}{\displaystyle\int\limits} \)
\( \newcommand{\dlim}{\displaystyle\lim\limits} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\(\newcommand{\longvect}{\overrightarrow}\)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\ket}[1]{\left| #1 \right>}\)
\(\newcommand{\bra}[1]{\left< #1 \right|}\)
\(\newcommand{\braket}[2]{\left< #1 \vphantom{#2} \right| \left. #2 \vphantom{#1} \right>}\)
\(\newcommand{\braopket}[3]{\left< #1 \vphantom{#2}\vphantom{#3} \right| #2 \vphantom{#1}\vphantom{#3} \left| #3 \vphantom{#1}\vphantom{#2} \right>}\)
\(\newcommand{\qmvec}[1]{\mathbf{\vec{#1}}}\)
\(\newcommand{\op}[1]{\hat{\mathbf{#1}}}\)
\(\newcommand{\expect}[1]{\langle #1 \rangle}\)
\(\newcommand{\dfn}[1]{\emph{\textbf{#1}}}\)
We often write vectors in \(\mathbb{R}^n\) as rows.
In each case determine whether \(U\) is a subspace of \(\mathbb{R}^3\). Support your answer.
- \(U = \{(1, s, t) \mid s \mbox{ and }t \mbox{ in }\mathbb{R}\}\).
- \(U = \{(0, s, t) \mid s \mbox{ and } t \mbox{ in } \mathbb{R}\}\).
- \(U = \{(r, s, t) \mid r, s,\mbox{ and } t \mbox{ in } \mathbb{R}, -r + 3s + 2t = 0\}\).
- \(U = \{(r, 3s, r - 2) \mid r \mbox{ and } s \mbox{ in } \mathbb{R}\}\).
- \(U = \{(r, 0, s) \mid r^{2} + s^{2} = 0, r \mbox{ and } s \mbox{ in } \mathbb{R}\}\).
- \(U = \{(2r, -s^{2}, t) \mid r, s, \mbox{ and } t \mbox{ in } \mathbb{R}\}\).
- Answer
-
- Yes
- No
- No.
In each case determine if \(\mathbf{x}\) lies in \(U = span \;\{\mathbf{y}, \mathbf{z}\}\). If \(\mathbf{x}\) is in \(U\), write it as a linear combination of \(\mathbf{y}\) and \(\mathbf{z}\); if \(\mathbf{x}\) is not in \(U\), show why not.
- \(\mathbf{x} = (2, -1, 0, 1)\), \(\mathbf{y} = (1, 0, 0, 1)\), and \(\mathbf{z} = (0, 1, 0, 1)\).
- \(\mathbf{x} = (1, 2, 15, 11)\), \(\mathbf{y} = (2, -1, 0, 2)\), and \(\mathbf{z} = (1, -1, -3, 1)\).
- \(\mathbf{x} = (8, 3, -13, 20)\), \(\mathbf{y} = (2, 1, -3, 5)\), and \(\mathbf{z} = (-1, 0, 2, -3)\).
- \(\mathbf{x} = (2, 5, 8, 3)\), \(\mathbf{y} = (2, -1, 0, 5)\), and \(\mathbf{z} = (-1, 2, 2, -3)\).
- Answer
-
- No
- Yes, \(\mathbf{x} = 3\mathbf{y} + 4\mathbf{z}\).
In each case determine if the given vectors span \(\mathbb{R}^4\). Support your answer.
- \(\{(1, 1, 1, 1), (0, 1, 1, 1), (0, 0, 1, 1), (0, 0, 0, 1)\}\).
- \(\{(1, 3, -5, 0), (-2, 1, 0, 0), (0, 2, 1, -1),\\ (1, -4, 5, 0)\}\).
- Answer
-
- No
Is it possible that \(\{(1, 2, 0), (2, 0, 3)\}\) can span the subspace \(U = \{(r, s, 0) \mid r \mbox{ and } s \mbox{ in } \mathbb{R}\}\)? Defend your answer.
Give a spanning set for the zero subspace \(\{\mathbf{0}\}\) of \(\mathbb{R}^n\).
Is \(\mathbb{R}^2\) a subspace of \(\mathbb{R}^3\)? Defend your answer.
If \(U = span \;\{\mathbf{x}, \mathbf{y}, \mathbf{z}\}\) in \(\mathbb{R}^n\), show that \(U = span \;\{\mathbf{x} + t\mathbf{z}, \mathbf{y}, \mathbf{z}\}\) for every \(t\) in \(\mathbb{R}\).
If \(U = span \;\{\mathbf{x}, \mathbf{y}, \mathbf{z}\}\) in \(\mathbb{R}^n\), show that \(U = span \;\{\mathbf{x} + \mathbf{y}, \mathbf{y} + \mathbf{z}, \mathbf{z} + \mathbf{x}\}\).
If \(a \neq 0\) is a scalar, show that \(span \;\{a\mathbf{x}\} = span \;\{\mathbf{x}\}\) for every vector \(\mathbf{x}\) in \(\mathbb{R}^n\).
If \(a_{1}, a_{2}, \dots, a_{k}\) are nonzero scalars, show that \(span \;\{a_{1}\mathbf{x}_{1}, a_{2}\mathbf{x}_{2}, \dots, a_{k}\mathbf{x}_{k}\} = span \;\{\mathbf{x}_{1}, \mathbf{x}_{2}, \dots, \mathbf{x}_{k}\}\) for any vectors \(\mathbf{x}_{i}\) in \(\mathbb{R}^n\).
- Answer
-
\(span \;\{a_{1}\mathbf{x}_{1}, a_{2}\mathbf{x}_{2}, \dots, a_{k}\mathbf{x}_{k}\} \subseteq span \;\{\mathbf{x}_{1}, \mathbf{x}_{2}, \dots, \mathbf{x}_{k}\}\) by Theorem 5.1.1 because, for each \(i\), \(a_{i}\mathbf{x}_{i}\) is in \(span \;\{\mathbf{x}_{1}, \mathbf{x}_{2}, \dots, \mathbf{x}_{k}\}\). Similarly, the fact that \(\mathbf{x}_{i} = a_{i}^{-1}(a_{i}\mathbf{x}_{i})\) is in \(span \;\{a_{1}\mathbf{x}_{1}, a_{2}\mathbf{x}_{2}, \dots, a_{k}\mathbf{x}_{k}\}\) for each \(i\) shows that \(span \;\{\mathbf{x}_{1}, \mathbf{x}_{2}, \dots, \mathbf{x}_{k}\} \subseteq span \;\{a_{1}\mathbf{x}_{1}, a_{2}\mathbf{x}_{2}, \dots, a_{k}\mathbf{x}_{k}\}\), again by Theorem 5.1.1.
If \(\mathbf{x} \neq \mathbf{0}\) in \(\mathbb{R}^n\), determine all subspaces of \(span \;\{\mathbf{x}\}\).
Suppose that \(U = span \;\{\mathbf{x}_{1}, \mathbf{x}_{2}, \dots, \mathbf{x}_{k}\}\) where each \(\mathbf{x}_{i}\) is in \(\mathbb{R} ^n\). If \(A\) is an \(m \times n\) matrix and \(A\mathbf{x}_{i} = \mathbf{0}\) for each \(i\), show that \(A\mathbf{y} = \mathbf{0}\) for every vector \(\mathbf{y}\) in \(U\).
- Answer
-
If \(\mathbf{y} = r_{1}\mathbf{x}_{1} + \dots + r_{k}\mathbf{x}_{k}\) then \(A\mathbf{y} = r_{1}(A\mathbf{x}_{1}) + \dots + r_{k}(A\mathbf{x}_{k}) = 0\).
If \(A\) is an \(m \times n\) matrix, show that, for each invertible \(m \times m\) matrix \(U\), \(\text{null}(A) = \text{null}(UA)\).
If \(A\) is an \(m \times n\) matrix, show that, for each invertible \(n \times n\) matrix \(V\), \(im \;(A) = im \;(AV)\).
Let \(U\) be a subspace of \(\mathbb{R}^n\), and let \(\mathbf{x}\) be a vector in \(\mathbb{R}^n\).
- If \(a\mathbf{x}\) is in \(U\) where \(a \neq 0\) is a number, show that \(\mathbf{x}\) is in \(U\).
- If \(\mathbf{y}\) and \(\mathbf{x} + \mathbf{y}\) are in \(U\) where \(\mathbf{y}\) is a vector in \(\mathbb{R}^n\), show that \(\mathbf{x}\) is in \(U\).
- Answer
-
- \(\mathbf{x} = (\mathbf{x} + \mathbf{y}) - \mathbf{y} = (\mathbf{x} + \mathbf{y}) + (-\mathbf{y})\) is in \(U\) because \(U\) is a subspace and both \(\mathbf{x} + \mathbf{y}\) and \(-\mathbf{y} = (-1)\mathbf{y}\) are in \(U\).
In each case either show that the statement is true or give an example showing that it is false.
- If \(U \neq \mathbb{R}^n\) is a subspace of \(\mathbb{R}^n\) and \(\mathbf{x} + \mathbf{y}\) is in \(U\), then \(\mathbf{x}\) and \(\mathbf{y}\) are both in \(U\).
- If \(U\) is a subspace of \(\mathbb{R}^n\) and \(r\mathbf{x}\) is in \(U\) for all \(r\) in \(\mathbb{R}\), then \(\mathbf{x}\) is in \(U\).
- If \(U\) is a subspace of \(\mathbb{R}^n\) and \(\mathbf{x}\) is in \(U\), then \(-\mathbf{x}\) is also in \(U\).
- If \(\mathbf{x}\) is in \(U\) and \(U = span \;\{\mathbf{y}, \mathbf{z}\}\), then \(U = span \;\{\mathbf{x}, \mathbf{y}, \mathbf{z}\}\).
- The empty set of vectors in \(\mathbb{R}^n\) is a subspace of \(\mathbb{R}^n\).
- \(\left[ \begin{array}{r} 0 \\ 1 \end{array} \right]\) is in \(span \; \left\{ \left[ \begin{array}{r} 1 \\ 0 \end{array} \right],\ \left[ \begin{array}{r} 2 \\ 0 \end{array} \right] \right\}\).
- Answer
-
- True. \(\mathbf{x} = 1\mathbf{x}\) is in \(U\).
- True. Always \(span \;\{\mathbf{y}, \mathbf{z}\} \subseteq span \;\{\mathbf{x}, \mathbf{y}, \mathbf{z}\}\) by Theorem 5.1.1. Since \(\mathbf{x}\) is in \(span \;\{\mathbf{x}, \mathbf{y}\}\) we have \(span \;\{\mathbf{x}, \mathbf{y}, \mathbf{z}\} \subseteq span \;\{\mathbf{y}, \mathbf{z}\}\), again by Theorem 5.1.1.
- False. \(a \left[ \begin{array}{r} 1 \\ 0 \end{array} \right] + b \left[ \begin{array}{r} 2 \\ 0 \end{array} \right] = \left[ \begin{array}{c} a + 2b \\ 0 \end{array} \right]\) cannot equal \(\left[ \begin{array}{r} 0 \\ 1 \end{array} \right]\).
- If \(A\) and \(B\) are \(m \times n\) matrices, show that \(U = \{\mathbf{x}\) in \(\mathbb{R}^n\) | \(A\mathbf{x} = B\mathbf{x}\}\) is a subspace of \(\mathbb{R}^n\).
- What if \(A\) is \(m \times n\), \(B\) is \(k \times n\), and \(m \neq k\)?
Suppose that \(\mathbf{x}_{1}, \mathbf{x}_{2}, \dots, \mathbf{x}_{k}\) are vectors in \(\mathbb{R}^n\). If \(\mathbf{y} = a_{1}\mathbf{x}_{1} + a_{2}\mathbf{x}_{2} + \dots + a_{k}\mathbf{x}_{k}\) where \(a_{1} \neq 0\), show that \(span \;\{\mathbf{x}_{1}\, \mathbf{x}_{2}, \dots, \mathbf{x}_{k}\} = span \;\{\mathbf{y}_{1}, \mathbf{x}_{2}, \dots, \mathbf{x}_{k}\}\).
If \(U \neq \{\mathbf{0}\}\) is a subspace of \(\mathbb{R}\), show that \(U = \mathbb{R}\).
Let \(U\) be a nonempty subset of \(\mathbb{R}^n\). Show that \(U\) is a subspace if and only if S2 and S3 hold.
- Answer
-
If \(U\) is a subspace, then S2 and S3 certainly hold. Conversely, assume that S2 and S3 hold for \(U\). Since \(U\) is nonempty, choose \(\mathbf{x}\) in \(U\). Then \(\mathbf{0} = 0\mathbf{x}\) is in \(U\) by S3, so S1 also holds. This means that \(U\) is a subspace.
If \(S\) and \(T\) are nonempty sets of vectors in \(\mathbb{R}^n\), and if \(S \subseteq T\), show that \(span \;\{S\} \subseteq span \;\{T\}\).
Let \(U\) and \(W\) be subspaces of \(\mathbb{R}^n\). Define their intersection \(U \cap W\) and their sum \(U + W\) as follows:
- \(U \cap W = \{\mathbf{x} \in \mathbb{R}^n \mid \mathbf{x}\mbox{ belongs to both } U \mbox{ and } W\}\).
- \(U + W = \{\mathbf{x} \in \mathbb{R}^n \mid \mathbf{x}\mbox{ is a sum of a vector in } U \mbox{ and a vector in } W\}\).
- Show that \(U \cap W\) is a subspace of \(\mathbb{R}^n\).
- Show that \(U + W\) is a subspace of \(\mathbb{R}^n\).
- Answer
-
- The zero vector \(\mathbf{0}\) is in \(U + W\) because \(\mathbf{0} = \mathbf{0} + \mathbf{0}\). Let \(\mathbf{p}\) and \(\mathbf{q}\) be vectors in \(U + W\), say \(\mathbf{p} = \mathbf{x}_{1} + \mathbf{y}_{1}\) and \(\mathbf{q} = \mathbf{x}_{2} + \mathbf{y}_{2}\) where \(\mathbf{x}_{1}\) and \(\mathbf{x}_{2}\) are in \(U\), and \(\mathbf{y}_{1}\) and \(\mathbf{y}_{2}\) are in \(W\). Then \(\mathbf{p} + \mathbf{q} = (\mathbf{x}_{1} + \mathbf{x}_{2}) + (\mathbf{y}_{1} + \mathbf{y}_{2})\) is in \(U + W\) because \(\mathbf{x}_{1} + \mathbf{x}_{2}\) is in \(U\) and \(\mathbf{y}_{1} + \mathbf{y}_{2}\) is in \(W\). Similarly, \(a(\mathbf{p} + \mathbf{q}) = a\mathbf{p} + a\mathbf{q}\) is in \(U + W\) for any scalar \(a\) because \(a\mathbf{p}\) is in \(U\) and \(a\mathbf{q}\) is in \(W\). Hence \(U + W\) is indeed a subspace of \(\mathbb{R}^n\).
Let \(P\) denote an invertible \(n \times n\) matrix. If \(\lambda\) is a number, show that
\[E_{\lambda}(PAP^{-1}) = \{P\mathbf{x} \mid \mathbf{x} \mbox{ is in } E_{\lambda}(A)\} \nonumber \]
for each \(n \times n\) matrix \(A\).
Show that every proper subspace \(U\) of \(\mathbb{R}^2\) is a line through the origin. [Hint: If \(\mathbf{d}\) is a nonzero vector in \(U\), let \(L = \mathbb{R} \mathbf{d} = \{r\mathbf{d} \mid r \mbox{ in }\mathbb{R}\}\) denote the line with direction vector \(\mathbf{d}\). If \(\mathbf{u}\) is in \(U\) but not in \(L\), argue geometrically that every vector \(\mathbf{v}\) in \(\mathbb{R}^2\) is a linear combination of \(\mathbf{u}\) and \(\mathbf{d}\).]


