6.3: Ranges
- Page ID
- 273
\( \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}}}\)
Definition 6.3.1. Let \(T:V\to W \) be a linear map. The range of \(T \), denoted by \(\range(T) \), is the subset of vectors in \(W \) that are in the image of \(T \). I.e.,
\[ \range(T) = \{ Tv \mid v\in V\} = \{ w\in W \mid \rm{~ there~ exists~} v \in V \rm{~ such~ that~} Tv=w\}.\]
Example 6.3.2. The range of the differentiation map \(T:\mathbb{F}[z] \to \mathbb{F}[z] \) is \(\range(T) =\mathbb{F}[z]\) since, for every polynomial \(q\in \mathbb{F}[z] \), there is a \(p\in \mathbb{F}[z] \) such that \(p'=q \).
Example 6.3.3. The range of the linear map \(T(x,y)=(x-2y,3x+y) \) is \(\mathbb{R}^2 \) since, for any \((z_1,z_2)\in \mathbb{R}^2 \), we have \(T(x,y)=(z_1,z_2) \) if \((x,y)=\frac{1}{7}(z_1+2z_2,-3z_1+z_2) \).
Proposition 6.3.4. Let \(T:V\to W \) be a linear map. Then \(\range(T) \) is a subspace of \(W \).
Proof.
We need to show that \(0\in \range(T) \) and that \(\range(T) \) is closed under addition and scalar multiplication. We already showed that \(T0=0 \) so that \(0\in \range(T) \).
For closure under addition, let \(w_1,w_2\in \range(T) \). Then there exist \(v_1,v_2\in V\) such that \(Tv_1=w_1 \) and \(Tv_2=w_2 \). Hence
\begin{equation*}
T(v_1+v_2) = Tv_1 + Tv_2 = w_1 + w_2,
\end{equation*}
and so \(w_1+w_2\in \range(T) \).
For closure under scalar multiplication, let \(w\in \range(T) \) and \(a\in \mathbb{F} \). Then there exists a \(v\in V \) such that \(Tv=w \). Thus
\begin{equation*}
T(av)=aTv=aw,
\end{equation*}
and so \(aw \in \range(T) \).
Definition 6.3.5. A linear map \(T:V\to W \) is called surjective if \(\range(T)=W \). A linear map \(T:V\to W \) is called bijective if \(T \) is both injective and surjective.
Example 6.3.6.
- The differentiation map \(T:\mathbb{F}[z] \to \mathbb{F}[z] \) is surjective since \(\range(T) = \mathbb{F}[z] \). However, if we restrict ourselves to polynomials of degree at most \(m \), then the differentiation map \(T:\mathbb{F}_m[z] \to \mathbb{F}_m[z] \) is not surjective since polynomials of degree \(m \) are not in thecrange of \(T \).
- The identity map \(I:V\to V \) is surjective.
- The linear map \(T:\mathbb{F}[z] \to \mathbb{F}[z] \) given by \(T(p(z)) = z^2 p(z) \) is not surjective since, for example, there are no linear polynomials in the range of \(T \).
- The linear map \(T(x,y)=(x-2y,3x+y) \) is surjective since \(\range(T)=\mathbb{R}^{2} \), as we calculated in Example 6.3.3.
Contributors
- Isaiah Lankham, Mathematics Department at UC Davis
- Bruno Nachtergaele, Mathematics Department at UC Davis
- Anne Schilling, Mathematics Department at UC Davis
Both hardbound and softbound versions of this textbook are available online at WorldScientific.com.


