\(\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 {\bz }{\mathbf {0}}\)
\(\newcommand {\bo }{\mathbf {1}}\)
\(\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}}\)
\(\newcommand {\re }{\operatorname {Re}}\)
\(\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 \)
M216: Exercise sheet 6
Warmup questions
-
1. Let \(f:X\to X\) be a map of sets. Show that if \(f\) is injective then \(f^k\) is injective for each \(k\in \N \).
-
2. Let \(U_1\leq U_2\leq \dots \leq V\) be an increasing sequence of subspaces of \(V\), so that \(U_m\leq U_n\) whenever \(m\leq n\).
Show that \(\bigcup _{n\in \N }U_n\leq V\).
Homework
-
3. Let \(\phi =\phi _A\in L(\C ^3)\) where \(A\) is given by
\(\seteqnumber{0}{}{0}\)
\begin{equation*}
\begin{pmatrix*}[r] 0&1&-1\\-10&-2&5\\-6&2&1 \end {pmatrix*}.
\end{equation*}
-
4. Let \(\phi =\phi _A\in L(\C ^3)\) where \(A\) is given by
\(\seteqnumber{0}{}{0}\)
\begin{equation*}
\begin{pmatrix*} 0&0&0\\4&0&0\\0&0&5 \end {pmatrix*}.
\end{equation*}
Extra questions
-
5. Let \(\phi \in L(V)\) be an invertible linear operator on a finite-dimensional vector space and \(\lambda \) an eigenvalue of \(\phi \). Show that \(G_{\phi }(\lambda )=G_{\phi ^{-1}}(\lambda ^{-1})\).
-
6. Let \(\lambda \in \F \) and define \(J(\lambda ,n)\in M_n(\F )\) by
\(\seteqnumber{0}{}{0}\)
\begin{equation*}
J(\lambda ,n)= \begin{pmatrix} \lambda &1&0&\dots &0\\ &\ddots &\ddots &\ddots &\vdots \\ &&\ddots &\ddots &0\\ &&&\ddots &1\\
0&&&&\lambda \end {pmatrix}.
\end{equation*}
Set \(J_n:=J(0,n)\).
Prove:
-
(a) \(\ker J_n^k=\Span {\lst {e}1k}\).
-
(b) \(\im J_n^k=\Span {\lst {e}1{n-k}}\).
-
(c) \(m_{J(\lambda ,n)}=\pm \Delta _{J(\lambda ,n)}=(x-\lambda )^n\).
-
(d) \(\lambda \) is the only eigenvalue of \(J(\lambda ,n)\) and \(E_{J(\lambda ,n)}(\lambda )=\Span {e_1}\), \(G_{J(\lambda ,n)}(\lambda )=\F ^{n}\).
Please hand in at 4W level 1 by NOON on Friday 17th November
M216: Exercise sheet 6—Solutions
-
1. Let \(x,y\in X\) be such that \(f^k(x)=f^k(y)\). Thus \(f(f^{k-1}(x))=f(f^{k-1}(y))\) whence, since \(f\) is injective, \(f^{k-1}(x)=f^{k-1}(y)\). Repeat the argument to eventually conclude that \(x=y\) so that \(f^k\) is injective. For
a more formal argument, induct on \(k\).
-
2. Let \(U=\bigcup _{n\in \N }U_n\) and let \(v,w\in U\). Then there are \(n,m\in \N \) with \(v\in U_n\) and \(w\in U_m\). Without loss of generality, assume that \(m\leq n\) so that \(U_m\leq U_n\) whence \(v,w\in U_n\). Since
\(U_n\) is a subspace, \(v+\lambda w\in U_n\subseteq U\), for any \(\lambda \in \F \), so that \(U\) is indeed a subspace.
-
3.
-
(a) We compute the characteristic polynomial: \(\Delta _{\phi }=\Delta _A=-x^{3}-x^{2}+8x+12=(3-x)(x+2)^{2}\). Consequently, \(m_{\phi }\) is either \((x-3)(x+2)^{2}\) or \((x-3)(x+2)\). We try the latter:
\(\seteqnumber{0}{}{0}\)
\begin{align*}
A-3I_3&= \begin{pmatrix*}[r] -3&1&-1\\-10&-5&5\\-6&2&-2 \end {pmatrix*}& A+2I_{3}&= \begin{pmatrix*}[r] 2&1&-1\\-10&0&5\\-6&2&3 \end {pmatrix*}
\end{align*}
so that
\(\seteqnumber{0}{}{0}\)
\begin{equation*}
(A-3I_3)(A+2I_3)= \begin{pmatrix*}[r] -10&-5&5\\0&0&0\\-20&-10&10 \end {pmatrix*}\neq 0.
\end{equation*}
Thus \(m_{\phi }=m_A=(x-3)(x+2)^2\).
-
(b) We deduce that \(G_{\phi }(3)=E_{\phi }(3)=\ker (A-3I_3)\) while \(E_{\phi }(-2)=\ker (A+2I_3)\) and \(G_{\phi }(-2)=\ker (A+2I_3)^2\). We compute these: an eigenvector \(x\) with eigenvalue 3 solves
\(\seteqnumber{0}{}{0}\)
\begin{align*}
-3x_1+x_3-x_3&=0\\ -2x_1-x_2+x_3&=0
\end{align*}
which rapidly yields \(x_1=0\) and \(x_2=x_3\). Thus the \(3\)-eigenspace is spanned by \((0,1,1)\).
An eigenvector \(x\) with eigenvalue \(2\) solves
\(\seteqnumber{0}{}{0}\)
\begin{align*}
2x_1+x_2-x_3&=0\\ -2x_1+0x_2+x_3&=0
\end{align*}
giving \(x_2=0\) and \(2x_1=x_3\) so the eigenspace is spanned by \((1,0,2)\).
Finally,
\(\seteqnumber{0}{}{0}\)
\begin{equation*}
(A+2I_3)^{2}= \begin{pmatrix*}[r] 0&0&0\\-50&0&25\\-50&0&25 \end {pmatrix*}
\end{equation*}
with kernel spanned by \((1,0,2)\) and \((0,1,0)\).
To summarise:
\(\seteqnumber{0}{}{0}\)
\begin{align*}
E_{\phi }(3)=G_{\phi }(3)&=\Span {(0,1,1)}\\ E_{\phi }(-2)&=\Span {(1,0,2)}\\ G_{\phi }(-2)&=\Span {(1,0,2),(0,1,0)}.
\end{align*}
-
4.
-
(a) Since \(A\) is lower triangular, we immediately see that \(\Delta _{\phi }=\Delta _A=x^{2}(x-5)\). So the only possibilities for \(m_{\phi }=x(x-5)\) and \(x^2(x-5)\). However
\(\seteqnumber{0}{}{0}\)
\begin{equation*}
A-5I_3= \begin{pmatrix*}[r] -5&0&0\\4&-5&0\\0&0&0 \end {pmatrix*}
\end{equation*}
so that
\(\seteqnumber{0}{}{0}\)
\begin{equation*}
A(A-5I_3)= \begin{pmatrix*}[r] 0&0&0\\-20&0&0\\0&0&0 \end {pmatrix*}\neq 0.
\end{equation*}
We conclude that \(m_{\phi }=x^2(x-5)\).
Alternatively, \(A\) is block diagonal:
\(\seteqnumber{0}{}{0}\)
\begin{equation*}
A= \begin{pmatrix} 0&0\\4&0 \end {pmatrix}\oplus \begin{pmatrix} 5 \end {pmatrix}
\end{equation*}
and the summands clearly have minimum polynomials \(x^2\) and \(x-5\) respectively. It follows from a previous sheet that \(m_{\phi }=x^2(x-5)\).
-
(b) We have \(E_{\phi }(5)=G_{\phi }(5)=\Span {(0,0,1)}\), \(E_{\phi }(0)=\ker A=\Span {(0,1,0)}\) and finally \(G_{\phi }(0)=\ker A^2=\Span {(1,0,0),(0,1,0)}\) since
\(\seteqnumber{0}{}{0}\)
\begin{equation*}
A^{2}= \begin{pmatrix} 0&0&0\\ 0&0&0\\ 0&0&25 \end {pmatrix}.
\end{equation*}
-
5. Note that \((\phi -\lambda \id _V)^{n}(v)=0\) if and only if \(\lambda ^{-n}\phi ^{-n}(\phi -\lambda ^n\id _V)^n(v)=0\), that is \((\lambda ^{-1}\id _V-\phi )^n(v)=0\). Thus \(G_{\phi }(\lambda )=G_{\phi ^{-1}}(\lambda
^{-1})\).
Here, of course, we need \(\lambda \neq 0\) but, since \(\phi \) is invertible, zero is not an eigenvalue.
-
6. Note that \(\phi _{J_n}(x)=(x_2,\dots ,x_n,0)\) so that \(\phi _{J_n}^k(x)=(x_{k+1},\dots ,x_{n},0,\dots ,0)\), \(k<n\) and \(\phi _{J_n}^{n}=0\).
-
(a) It is clear from the above that \(\ker J_n^k=\set {x\in \F ^{n}\st x_{k+1}=\dots =x_n=0}=\Span {\lst {e}1k}\).
-
(b) Similarly, \(\im J_n^k=\set {y\in \F ^n\st y_{n-k+1}=\dots =y_n=0}=\Span {\lst {e}1{n-k}}\).
-
(c) \(J(\lambda ,n)\) is upper triangular so that \(\Delta _{J(\lambda ,n)}=(\lambda -x)^n\). Therefore \(m_{J(\lambda ,n)}=(x-\lambda )^{s}\), for some \(s\leq n\). However \((J(\lambda ,n)-\lambda I_n)^{k}=J_n^k\neq 0\), for
\(k<n\), so that \(m_{J(\lambda ,n)}=(x-\lambda )^{n}\).
-
(d) Finally, it is clear that \(\lambda \) is the only eigenvalue and the eigenspace is \(\ker (J(\lambda ,n)-\lambda I_{n})=\ker J_n=\Span {e_1}\) by part (a). Similarly, \(G_{J(\lambda ,n)}(\lambda )=\ker J_n^n=\F ^n\).