\(\newcommand{\footnotename}{footnote}\)
\(\def \LWRfootnote {1}\)
\(\newcommand {\footnote }[2][\LWRfootnote ]{{}^{\mathrm {#1}}}\)
\(\newcommand {\footnotemark }[1][\LWRfootnote ]{{}^{\mathrm {#1}}}\)
\(\let \LWRorighspace \hspace \)
\(\renewcommand {\hspace }{\ifstar \LWRorighspace \LWRorighspace }\)
\(\newcommand {\mathnormal }[1]{{#1}}\)
\(\newcommand \ensuremath [1]{#1}\)
\(\newcommand {\LWRframebox }[2][]{\fbox {#2}} \newcommand {\framebox }[1][]{\LWRframebox } \)
\(\newcommand {\setlength }[2]{}\)
\(\newcommand {\addtolength }[2]{}\)
\(\newcommand {\setcounter }[2]{}\)
\(\newcommand {\addtocounter }[2]{}\)
\(\newcommand {\arabic }[1]{}\)
\(\newcommand {\number }[1]{}\)
\(\newcommand {\noalign }[1]{\text {#1}\notag \\}\)
\(\newcommand {\cline }[1]{}\)
\(\newcommand {\directlua }[1]{\text {(directlua)}}\)
\(\newcommand {\luatexdirectlua }[1]{\text {(directlua)}}\)
\(\newcommand {\protect }{}\)
\(\def \LWRabsorbnumber #1 {}\)
\(\def \LWRabsorbquotenumber "#1 {}\)
\(\newcommand {\LWRabsorboption }[1][]{}\)
\(\newcommand {\LWRabsorbtwooptions }[1][]{\LWRabsorboption }\)
\(\def \mathchar {\ifnextchar "\LWRabsorbquotenumber \LWRabsorbnumber }\)
\(\def \mathcode #1={\mathchar }\)
\(\let \delcode \mathcode \)
\(\let \delimiter \mathchar \)
\(\let \LWRref \ref \)
\(\renewcommand {\ref }{\ifstar \LWRref \LWRref }\)
\(\newcommand {\intertext }[1]{\text {#1}\notag \\}\)
\(\let \Hat \hat \)
\(\let \Check \check \)
\(\let \Tilde \tilde \)
\(\let \Acute \acute \)
\(\let \Grave \grave \)
\(\let \Dot \dot \)
\(\let \Ddot \ddot \)
\(\let \Breve \breve \)
\(\let \Bar \bar \)
\(\let \Vec \vec \)
\( \newcommand {\multicolumn }[3]{#3}\)
\(\newcommand {\mathllap }[2][]{{#1#2}}\)
\(\newcommand {\mathrlap }[2][]{{#1#2}}\)
\(\newcommand {\mathclap }[2][]{{#1#2}}\)
\(\newcommand {\mathmbox }[1]{#1}\)
\(\newcommand {\clap }[1]{#1}\)
\(\newcommand {\LWRmathmakebox }[2][]{#2}\)
\(\newcommand {\mathmakebox }[1][]{\LWRmathmakebox }\)
\(\newcommand {\cramped }[2][]{{#1#2}}\)
\(\newcommand {\crampedllap }[2][]{{#1#2}}\)
\(\newcommand {\crampedrlap }[2][]{{#1#2}}\)
\(\newcommand {\crampedclap }[2][]{{#1#2}}\)
\(\newenvironment {crampedsubarray}[1]{}{}\)
\(\newcommand {\crampedsubstack }{}\)
\(\newcommand {\smashoperator }[2][]{#2\limits }\)
\(\newcommand {\adjustlimits }{}\)
\(\newcommand {\SwapAboveDisplaySkip }{}\)
\(\require {extpfeil}\)
\(\Newextarrow \xleftrightarrow {10,10}{0x2194}\)
\(\Newextarrow \xLeftarrow {10,10}{0x21d0}\)
\(\Newextarrow \xhookleftarrow {10,10}{0x21a9}\)
\(\Newextarrow \xmapsto {10,10}{0x21a6}\)
\(\Newextarrow \xRightarrow {10,10}{0x21d2}\)
\(\Newextarrow \xLeftrightarrow {10,10}{0x21d4}\)
\(\Newextarrow \xhookrightarrow {10,10}{0x21aa}\)
\(\Newextarrow \xrightharpoondown {10,10}{0x21c1}\)
\(\Newextarrow \xleftharpoondown {10,10}{0x21bd}\)
\(\Newextarrow \xrightleftharpoons {10,10}{0x21cc}\)
\(\Newextarrow \xrightharpoonup {10,10}{0x21c0}\)
\(\Newextarrow \xleftharpoonup {10,10}{0x21bc}\)
\(\Newextarrow \xleftrightharpoons {10,10}{0x21cb}\)
\(\newcommand {\LWRdounderbracket }[3]{\mathinner {\underset {#3}{\underline {\llcorner {#1}\lrcorner }}}}\)
\(\newcommand {\LWRunderbracket }[2][]{\LWRdounderbracket {#2}}\)
\(\newcommand {\underbracket }[1][]{\LWRunderbracket }\)
\(\newcommand {\LWRdooverbracket }[3]{\mathinner {\overset {#3}{\overline {\ulcorner {#1}\urcorner }}}}\)
\(\newcommand {\LWRoverbracket }[2][]{\LWRdooverbracket {#2}}\)
\(\newcommand {\overbracket }[1][]{\LWRoverbracket }\)
\(\newcommand {\LaTeXunderbrace }[1]{\underbrace {#1}}\)
\(\newcommand {\LaTeXoverbrace }[1]{\overbrace {#1}}\)
\(\newenvironment {matrix*}[1][]{\begin {matrix}}{\end {matrix}}\)
\(\newenvironment {pmatrix*}[1][]{\begin {pmatrix}}{\end {pmatrix}}\)
\(\newenvironment {bmatrix*}[1][]{\begin {bmatrix}}{\end {bmatrix}}\)
\(\newenvironment {Bmatrix*}[1][]{\begin {Bmatrix}}{\end {Bmatrix}}\)
\(\newenvironment {vmatrix*}[1][]{\begin {vmatrix}}{\end {vmatrix}}\)
\(\newenvironment {Vmatrix*}[1][]{\begin {Vmatrix}}{\end {Vmatrix}}\)
\(\newenvironment {smallmatrix*}[1][]{\begin {matrix}}{\end {matrix}}\)
\(\newenvironment {psmallmatrix*}[1][]{\begin {pmatrix}}{\end {pmatrix}}\)
\(\newenvironment {bsmallmatrix*}[1][]{\begin {bmatrix}}{\end {bmatrix}}\)
\(\newenvironment {Bsmallmatrix*}[1][]{\begin {Bmatrix}}{\end {Bmatrix}}\)
\(\newenvironment {vsmallmatrix*}[1][]{\begin {vmatrix}}{\end {vmatrix}}\)
\(\newenvironment {Vsmallmatrix*}[1][]{\begin {Vmatrix}}{\end {Vmatrix}}\)
\(\newenvironment {psmallmatrix}[1][]{\begin {pmatrix}}{\end {pmatrix}}\)
\(\newenvironment {bsmallmatrix}[1][]{\begin {bmatrix}}{\end {bmatrix}}\)
\(\newenvironment {Bsmallmatrix}[1][]{\begin {Bmatrix}}{\end {Bmatrix}}\)
\(\newenvironment {vsmallmatrix}[1][]{\begin {vmatrix}}{\end {vmatrix}}\)
\(\newenvironment {Vsmallmatrix}[1][]{\begin {Vmatrix}}{\end {Vmatrix}}\)
\(\newcommand {\LWRmultlined }[1][]{\begin {multline*}}\)
\(\newenvironment {multlined}[1][]{\LWRmultlined }{\end {multline*}}\)
\(\let \LWRorigshoveleft \shoveleft \)
\(\renewcommand {\shoveleft }[1][]{\LWRorigshoveleft }\)
\(\let \LWRorigshoveright \shoveright \)
\(\renewcommand {\shoveright }[1][]{\LWRorigshoveright }\)
\(\newenvironment {dcases}{\begin {cases}}{\end {cases}}\)
\(\newenvironment {dcases*}{\begin {cases}}{\end {cases}}\)
\(\newenvironment {rcases}{\begin {cases}}{\end {cases}}\)
\(\newenvironment {rcases*}{\begin {cases}}{\end {cases}}\)
\(\newenvironment {drcases}{\begin {cases}}{\end {cases}}\)
\(\newenvironment {drcases*}{\begin {cases}}{\end {cases}}\)
\(\newenvironment {cases*}{\begin {cases}}{\end {cases}}\)
\(\newcommand {\MoveEqLeft }[1][]{}\)
\(\def \LWRAboxed #1!|!{\fbox {\(#1\)}&\fbox {\(#2\)}} \newcommand {\Aboxed }[1]{\LWRAboxed #1&&!|!} \)
\( \newcommand {\LWRABLines }[1][\Updownarrow ]{#1 \notag \\}\newcommand {\ArrowBetweenLines }{\ifstar \LWRABLines \LWRABLines } \)
\(\newcommand {\shortintertext }[1]{\text {#1}\notag \\}\)
\(\newcommand {\vdotswithin }[1]{\hspace {.5em}\vdots }\)
\(\newcommand {\LWRshortvdotswithinstar }[1]{\vdots \hspace {.5em} & \\}\)
\(\newcommand {\LWRshortvdotswithinnostar }[1]{& \hspace {.5em}\vdots \\}\)
\(\newcommand {\shortvdotswithin }{\ifstar \LWRshortvdotswithinstar \LWRshortvdotswithinnostar }\)
\(\newcommand {\MTFlushSpaceAbove }{}\)
\(\newcommand {\MTFlushSpaceBelow }{\\}\)
\(\newcommand \lparen {(}\)
\(\newcommand \rparen {)}\)
\(\newcommand {\ordinarycolon }{:}\)
\(\newcommand {\vcentcolon }{\mathrel {\unicode {x2236}}}\)
\(\newcommand \dblcolon {\mathrel {\unicode {x2237}}}\)
\(\newcommand \coloneqq {\mathrel {\unicode {x2236}\!=}}\)
\(\newcommand \Coloneqq {\mathrel {\unicode {x2237}\!=}}\)
\(\newcommand \coloneq {\mathrel {\unicode {x2236}-}}\)
\(\newcommand \Coloneq {\mathrel {\unicode {x2237}-}}\)
\(\newcommand \eqqcolon {\mathrel {=\!\unicode {x2236}}}\)
\(\newcommand \Eqqcolon {\mathrel {=\!\unicode {x2237}}}\)
\(\newcommand \eqcolon {\mathrel {-\unicode {x2236}}}\)
\(\newcommand \Eqcolon {\mathrel {-\unicode {x2237}}}\)
\(\newcommand \colonapprox {\mathrel {\unicode {x2236}\!\approx }}\)
\(\newcommand \Colonapprox {\mathrel {\unicode {x2237}\!\approx }}\)
\(\newcommand \colonsim {\mathrel {\unicode {x2236}\!\sim }}\)
\(\newcommand \Colonsim {\mathrel {\unicode {x2237}\!\sim }}\)
\(\newcommand {\nuparrow }{\mathrel {\cancel {\uparrow }}}\)
\(\newcommand {\ndownarrow }{\mathrel {\cancel {\downarrow }}}\)
\(\newcommand {\bigtimes }{\mathop {\Large \times }\limits }\)
\(\newcommand {\prescript }[3]{{}^{#1}_{#2}#3}\)
\(\newenvironment {lgathered}{\begin {gathered}}{\end {gathered}}\)
\(\newenvironment {rgathered}{\begin {gathered}}{\end {gathered}}\)
\(\newcommand {\splitfrac }[2]{{}^{#1}_{#2}}\)
\(\let \splitdfrac \splitfrac \)
\(\newcommand {\bigzero }{\smash {\text {\huge 0}}}\)
\(\newcommand {\am }{\mathrm {am}}\)
\(\newcommand {\gm }{\mathrm {gm}}\)
\(\newcommand {\id }{\operatorname {id}}\)
\(\newcommand {\GL }{\operatorname {GL}}\)
\(\newcommand {\im }{\operatorname {im}}\)
\(\newcommand {\rank }{\operatorname {rank}}\)
\(\newcommand {\sol }{\operatorname {sol}}\)
\(\newcommand {\ann }{\operatorname {ann}}\)
\(\newcommand {\rO }{\operatorname {O}}\)
\(\newcommand {\rU }{\operatorname {U}}\)
\(\newcommand {\rSU }{\operatorname {SU}}\)
\(\newcommand {\ev }{\operatorname {ev}}\)
\(\newcommand {\bil }{\operatorname {Bil}}\)
\(\newcommand {\rad }{\operatorname {rad}}\)
\(\newcommand {\Span }[1]{\operatorname {span}\{#1\}}\)
\(\newcommand {\R }{\mathbb {R}}\)
\(\newcommand {\C }{\mathbb {C}}\)
\(\newcommand {\Z }{\mathbb {Z}}\)
\(\newcommand {\F }{\mathbb {F}}\)
\(\newcommand {\Q }{\mathbb {Q}}\)
\(\newcommand {\N }{\mathbb {N}}\)
\(\renewcommand {\P }{\mathbb {P}}\)
\(\newcommand {\I }{\mathrm {I}}\)
\(\newcommand {\half }{\tfrac 12}\)
\(\newcommand {\rel }{\mathrel {\mathrm {rel}}}\)
\(\renewcommand {\vec }[3]{(#1_{#2},\dots ,#1_{#3})}\)
\(\newcommand {\lst }[3]{#1_{#2},\dots ,#1_{#3}}\)
\(\newcommand {\plst }[3]{#1_{#2}+\dots +#1_{#3}}\)
\(\newcommand {\oplst }[3]{#1_{#2}\oplus \dots \oplus #1_{#3}}\)
\(\newcommand {\pplst }[3]{#1_{#2}\times \dots \times #1_{#3}}\)
\(\newcommand {\dlst }[3]{\lst {#1^{*}}{#2}{#3}}\)
\(\newcommand {\dlc }[4]{\lc #1{#2^{*}}#3#4}\)
\(\newcommand {\hmg }[3]{[#1_{#2},\dots ,#1_{#3}]}\)
\(\newcommand {\rng }[2]{#1,\dots ,#2}\)
\(\newcommand {\lc }[4]{#1_{#3}#2_{#3}+\dots +#1_{#4}#2_{#4}}\)
\(\newcommand {\plus }[2]{#1+\dots +#2}\)
\(\newcommand {\set }[1]{\{#1\}}\)
\(\newcommand {\abs }[1]{\lvert #1\rvert }\)
\(\newcommand {\ip }[1]{\langle #1\rangle }\)
\(\newcommand {\norm }[1]{\|#1\|}\)
\(\newcommand {\bx }{\mathbf {x}}\)
\(\newcommand {\be }{\mathbf {e}}\)
\(\newcommand {\bq }{\mathbf {q}}\)
\(\newcommand {\bu }{\mathbf {u}}\)
\(\newcommand {\by }{\mathbf {y}}\)
\(\newcommand {\bv }{\mathbf {v}}\)
\(\newcommand {\E }{\mathbb {E}}\)
\(\newcommand {\cI }{\mathcal {I}}\)
\(\newcommand {\cB }{\mathcal {B}}\)
\(\newcommand {\sub }{\subseteq }\)
\(\newcommand {\st }{\mathrel {|}}\)
\(\newcommand {\bw }[3]{#1\leq #2\leq #3}\)
\(\newcommand {\col }[3]{(#1_{#2})_{#2\in #3}}\)
\(\newcommand {\supp }{\mathrm {supp}}\)
\(\newcommand {\restr }[1]{_{|#1}}\)
1.4 Linear maps
-
Definitions. A map \(\phi :V\to W\) of vector spaces over \(\F \) is a linear map (or, in older books, linear transformation) if
\(\seteqnumber{0}{1.}{1}\)
\begin{align*}
\phi (v+w)&=\phi (v)+\phi (w)\\ \phi (\lambda v)&=\lambda \phi (v),
\end{align*}
for all \(v,w\in V\), \(\lambda \in \F \).
The kernel of \(\phi \) is \(\ker \phi :=\set {v\in V\st \phi (v)=0}\leq V\).
The image of \(\phi \) is \(\im \phi :=\set {\phi (v)\st v\in V}\leq W\).
-
. \(\phi \) is linear if and only if
\(\seteqnumber{0}{1.}{1}\)
\begin{equation*}
\phi (v+\lambda w)=\phi (v)+\lambda \phi (w),
\end{equation*}
for all \(v,w\in V\), \(\lambda \in \F \), which has the virtue of being only one thing to prove.
-
Examples.
-
-
(1) \(A\in M_{m\times n}(\F )\) determines a linear map \(\phi _A:\F ^n\to \F ^m\) by \(\phi _A(x)=y\) where, for \(1\leq i\leq m\),
\(\seteqnumber{0}{1.}{1}\)
\begin{equation*}
y_i=\sum _{j=1}^nA_{ij}x_j.
\end{equation*}
Otherwise said, \(y\) is given by matrix multiplication: \(\mathbf {y}=A\bx \).
-
(2) For any vector space \(V\), the identity map \(\id _V:V\to V\) is linear.
-
(3) If \(\phi :V\to W\) and \(\psi :W\to U\) are linear then so is \(\psi \circ \phi :V\to U\).
-
(4) Recall that \(c\) is the vector space of convergent sequences.
The map \(\lim _{n\to \infty }:(a_n)_{n\in \N }\mapsto \lim _{n\to \infty }a_n:c\to \R \) is linear thanks to the Algebra of Limits Theorem in Analysis 1.
-
(5) \(\int _a^b:f\mapsto \int _a^bf:C^0[a,b]\to \R \) is also linear.
-
Definition. A linear map \(\phi :V\to W\) is a (linear) isomorphism if there is a linear map \(\psi :W\to V\) such that
\(\seteqnumber{0}{1.}{1}\)
\begin{equation*}
\psi \circ \phi =\id _V,\qquad \phi \circ \psi =\id _W.
\end{equation*}
If there is an isomorphism \(V\to W\), say that \(V\) and \(W\) are isomorphic and write \(V\cong W\).
In Algebra 1B, we saw:
1.4.1 Vector spaces of linear maps
-
Notation. For vector spaces \(V,W\) over \(\F \), denote by \(L_{\F }(V,W)\) (or simply \(L(V,W)\)) the set \(\set {\phi :V\to W\st \text {$\phi $ is linear}}\) of linear maps from \(V\) to \(W\).
-
Theorem 1.6 (Linearity is a linear condition). \(L(V,W)\) is a vector space under
pointwise addition and scalar multiplication. Otherwise said, \(L(V,W)\leq W^V\).
-
Proof. It is enough to show that \(L(V,W)\) is a vector subspace of \(W^V\), that is, is non-empty and closed under addition and scalar multiplication.
First observe that the zero map \(0:v\mapsto 0\in W\) is linear:
\(\seteqnumber{0}{1.}{1}\)
\begin{equation*}
0(v+\lambda w)=0=0+\lambda 0=0(v)+\lambda 0(w).
\end{equation*}
In particular, \(L(V,W)\) is non-empty.
Now let \(\phi ,\psi \in L(V,W)\) and show that \(\phi +\psi \) is linear:
\(\seteqnumber{0}{1.}{1}\)
\begin{align*}
(\phi +\psi )(v+\lambda w) &=\phi (v+\lambda w)+\psi (v+\lambda w)\\ &=\phi (v)+\lambda \phi (w)+\psi (v)+\lambda \psi (w)\\ &=(\phi (v)+\psi (v))+\lambda (\phi (w)+\psi (w))\\ &=(\phi +\psi )(v)+\lambda (\phi +\psi )(w),
\end{align*}
for all \(v,w\in V\), \(\lambda \in \F \). Here the first and last equalities are just the definition of pointwise addition while the middle equalities come from the linearity of \(\phi ,\psi \) and the vector space axioms of \(W\).
Similarly, it is a simple exercise to see that if \(\mu \in \F \) and \(\phi \in L(V,W)\) then \(\mu \phi \) is also linear. □
1.4.2 Linear maps and matrices
Recall from Algebra 1B §1.5:
-
Definition. Let \(V,W\) be finite-dimensional vector spaces over \(\F \) with bases \(\cB :\lst {v}1n\) and \(\cB ':\lst {w}1m\) respectively. Let \(\phi \in L(V,W)\). The matrix of \(\phi \) with respect to
\(\cB ,\cB '\) is the matrix \(A=(A_{ij})\in M_{m\times n}(\F )\) defined by:
\(\seteqnumber{0}{1.}{1}\)
\begin{equation}
\label {eq:27} \phi (v_j)=\sum _{i=1}^mA_{ij}w_{i},
\end{equation}
for all \(\bw 1jn\).
In the special case where \(V=W\) and \(\cB =\cB '\), we call \(A\) the matrix of \(\phi \) with respect to \(\cB \).
Thus the recipe for computing \(A\) is: expand \(\phi (v_j)\) in terms of \(\lst {w}1m\) to get the \(j\)-th column of \(A\).
Equivalently, \(\phi (\lc {x}v1n)=\lc {y}w1m\) where
\(\seteqnumber{0}{1.}{2}\)
\begin{equation*}
\by =A\bx .
\end{equation*}
There is a fancy way to say all this: recall that a basis \(\cB :\lst {v}1n\) of \(V\) gives rise to a linear isomorphism \(\phi _{\cB }:\F ^n\to V\) via
\(\seteqnumber{0}{1.}{2}\)
\begin{equation}
\label {eq:3} \phi _{\cB }\vec \lambda 1n=\sum _{i=1}^n\lambda _iv_i.
\end{equation}
Now the relation between \(\phi \) and \(A\) is that
\(\seteqnumber{0}{1.}{3}\)
\begin{equation*}
\phi =\phi _{\cB '}\circ \phi _A\circ \phi _{\cB }^{-1}
\end{equation*}
or, equivalently, \(\phi _{\cB '}\circ \phi _A=\phi \circ \phi _{\cB }\) so that the following diagram commutes:
(The assertion that such a diagram commutes is simply that the two maps one builds by following the arrows in two different ways coincide. However, the diagram also helps us keep track of where the various maps go!)
The map \(\phi \mapsto A\) is a linear isomorphism \(L(V,W)\cong M_{m\times n}(\F )\) which also plays well with composition and matrix multiplication: if \(U\) is a third vector space with basis \(\cB ''\) and \(\psi \in L(W,U)\) has matrix \(B\)
with respect to \(\cB ',\cB ''\) then \(\psi \circ \phi \) has matrix \(BA\) with respect to \(\cB ,\cB ''\). This gives us a compelling dictionary between linear maps and matrices.
1.4.3 Extension by linearity
A linear map of a finite-dimensional vector space is completely determined by its action on a basis. More precisely:
-
Proposition 1.7 (Extension by linearity). Let \(V,W\) be vector spaces over \(\F \). Let
\(\lst {v}1n\) be a basis of \(V\) and \(\lst {w}1n\) any vectors in \(W\).
Then there is a unique \(\phi \in L(V,W)\) such that
\(\seteqnumber{0}{1.}{3}\)
\begin{equation}
\label {eq:2} \phi (v_i)=w_i,\qquad 1\leq i\leq n.
\end{equation}
-
Proof. We need to prove that such a \(\phi \) exists and that there is only one. We prove existence first.
Let \(v\in V\). By Proposition 1.1, we know there are unique \(\lst \lambda 1n\in \F \) for which
\(\seteqnumber{0}{1.}{4}\)
\begin{equation*}
v=\lc {\lambda }{v}1n
\end{equation*}
and so we define \(\phi (v)\) to be the only thing it could be:
\(\seteqnumber{0}{1.}{4}\)
\begin{equation*}
\phi (v):=\lc \lambda {w}1n.
\end{equation*}
Let us show that this \(\phi \) does the job. First, with \(\lambda _i=1\) and \(\lambda _j=0\), for \(i\neq j\), we see that
\(\seteqnumber{0}{1.}{4}\)
\begin{equation*}
\phi (v_i)=\sum _{j\neq i}0w_j+1w_i=w_i
\end{equation*}
so that (1.4) holds. Now let us see that \(\phi \) is linear: let \(v,w\in V\) with
\(\seteqnumber{0}{1.}{4}\)
\begin{align*}
v&=\lc \lambda {v}1n\\ w&=\lc \mu {v}1n.
\end{align*}
Then, for \(\lambda \in \F \),
\(\seteqnumber{0}{1.}{4}\)
\begin{equation*}
v+\lambda w=(\lambda _1+\lambda \mu _1)v_1+\dots +(\lambda _n+\lambda \mu _n)v_n
\end{equation*}
whence
\(\seteqnumber{0}{1.}{4}\)
\begin{align*}
\phi (v+\lambda w) &=(\lambda _1+\lambda \mu _1)w_1+\dots +(\lambda _n+\lambda \mu _n)w_n\\ &=(\lc \lambda {w}1n)+\lambda (\lc \mu {w}1n)\\ &=\phi (v)+\lambda \phi (w).
\end{align*}
For uniqueness, suppose that \(\phi ,\phi '\in L(V,W)\) both satisfy (1.4). Let \(v\in V\) and write \(v=\lc \lambda {v}1n\). Then
\(\seteqnumber{0}{1.}{4}\)
\begin{align*}
\phi (v)&=\lambda _1\phi (v_1)+\dots +\lambda _n\phi (v_n)\\ &= \lc \lambda {w}1n\\ &=\lambda _1\phi '(v_1)+\dots +\lambda _n\phi '(v_n)\\ &=\phi '(v),
\end{align*}
where the first and last equalities come from the linearity of \(\phi ,\phi '\) and the middle two from (1.4) for first \(\phi \) and then \(\phi '\). We conclude that \(\phi =\phi '\)
and we are done. □
1.4.4 The rank-nullity theorem
Among the most important results in Algebra 1B is the famous rank-nullity theorem:
Using this, together with the observation that \(\phi \) is injective if and only if \(\ker \phi =\set {0}\), we have:
-
Proposition 1.9. Let \(\phi :V\to W\) be linear with \(V,W\) finite-dimensional vector spaces of the same dimension: \(\dim
V=\dim W\).
Then the following are equivalent:
-
(1) \(\phi \) is injective.
-
(2) \(\phi \) is surjective.
-
(3) \(\phi \) is an isomorphism.
-
. Proposition 1.9 is flat-out false for infinite-dimensional \(V,W\). For example: let \(S:\R ^{\N }\to \R ^{\N }\) be the shift operator:
\(\seteqnumber{0}{1.}{4}\)
\begin{equation*}
S((a_0,a_1,\dots )):=(a_1,\dots ).
\end{equation*}
We readily check that: