Section 5B

The Minimal Polynomial

[29/0%]
Show
LaTeX
Problem 5B.1

Suppose T∈L(V)T \in \mathcal{L}(V). Prove that 99 is an eigenvalue of T2T^{2} if and only if 33 or −3-3 is an eigenvalue of TT.

?
Problem 5B.2

Suppose VV is a complex vector space and T∈L(V)T \in \mathcal{L}(V) has no eigenvalues. Prove that every subspace of VV invariant under TT is either {0}\left\{ 0\right\} or infinite-dimensional.

?
Problem 5B.3

Suppose nn is a positive integer and T∈L(Fn)T \in \mathcal{L}\left(\mathbf{F}^{n}\right) is defined by

T(x1,…,xn)=(x1+⋯+xn,…,x1+⋯+xn). T\left(x_{1}, \ldots , x_{n}\right) = \left(x_{1}+\cdots +x_{n}, \ldots , x_{1}+\cdots +x_{n}\right).
?
(a)

Find all eigenvalues and eigenvectors of TT.

(b)

Find the minimal polynomial of TT.

Remark.
?

The matrix of TT with respect to the standard basis of Fn\mathbf{F}^{n} consists of all 1 's.

Problem 5B.4

Suppose F=C,T∈L(V),p∈P(C)\mathbf{F} = \mathbb {C}, T \in \mathcal{L}(V), p \in \mathcal{P}(\mathbb {C}), and α∈C\alpha \in \mathbb {C}. Prove that α\alpha is an eigenvalue of p(T)p(T) if and only if α=p(λ)\alpha = p(\lambda ) for some eigenvalue λ\lambda of TT.

?
Problem 5B.5

Give an example of an operator on R2\mathbb {R}^{2} that shows the result in Exercise 4 does not hold if C\mathbb {C} is replaced with R\mathbb {R}.

Exercise 4 (Exercise 5B.4): if F=C\mathbf{F} = \mathbb {C}, T∈L(V)T \in \mathcal{L}(V), p∈P(C)p \in \mathcal{P}(\mathbb {C}), and α∈C\alpha \in \mathbb {C}, then α\alpha is an eigenvalue of p(T)p(T) if and only if α=p(λ)\alpha = p(\lambda ) for some eigenvalue λ\lambda of TT.

?
Problem 5B.6

Suppose T∈L(F2)T \in \mathcal{L}\left(\mathbf{F}^{2}\right) is defined by T(w,z)=(−z,w)T(w, z) = (-z, w). Find the minimal polynomial of TT.

?
Problem 5B.7
?
(a)

Give an example of S,T∈L(F2)S, T \in \mathcal{L}\left(\mathbf{F}^{2}\right) such that the minimal polynomial of STS T does not equal the minimal polynomial of TST S.

(b)

Suppose VV is finite-dimensional and S,T∈L(V)S, T \in \mathcal{L}(V). Prove that if at least one of S,TS, T is invertible, then the minimal polynomial of STS T equals the minimal polynomial of TSTS.

Problem 5B.8

Suppose T∈L(R2)T \in \mathcal{L}\left(\mathbb {R}^{2}\right) is the operator of counterclockwise rotation by 1∘1^{\circ }. Find the minimal polynomial of TT.

?
Remark.
?

Because dim⁡R2=2\operatorname {dim} \mathbb {R}^{2} = 2, the degree of the minimal polynomial of TT is at most 2. Thus the minimal polynomial of TT is not the tempting polynomial x180+1x^{180}+1, even though T180=−IT^{180} = -I.

Problem 5B.9

Suppose T∈L(V)T \in \mathcal{L}(V) is such that with respect to some basis of VV, all entries of the matrix of TT are rational numbers. Explain why all coefficients of the minimal polynomial of TT are rational numbers.

?
Problem 5B.10

Suppose VV is finite-dimensional, T∈L(V)T \in \mathcal{L}(V), and v∈Vv \in V. Prove that

\operatorname {span}\left(v, T v, \ldots , T^{m} v\right) = \operatorname {span}\left(v, T v, \ldots , T^{\operatorname {dim} V-1} v\right) $$ {#eq-5B.10:Eq} for all integers $m \geq \operatorname {dim} V-1$.
?
Problem 5B.11

Suppose VV is a two-dimensional vector space, T∈L(V)T \in \mathcal{L}(V), and the matrix of TT with respect to some basis of VV is

(acbd) \begin{pmatrix} a & c \\ b & d \end{pmatrix}
?
(a)

Show that T2−(a+d)T+(ad−bc)I=0T^{2}-(a+d) T+(a d-b c) I = 0.

(b)

Show that the minimal polynomial of TT equals

{z−a if b=c=0 and a=d,z2−(a+d)z+(ad−bc) otherwise  \begin{cases} z-a & \text{ if } b = c = 0 \text{ and } a = d, \\ z^{2}-(a+d) z+(a d-b c) & \text{ otherwise } \end{cases}
Problem 5B.12

Define T∈L(Fn)T \in \mathcal{L}\left(\mathbf{F}^{n}\right) by T(x1,x2,x3,…,xn)=(x1,2x2,3x3,…,nxn)T\left(x_{1}, x_{2}, x_{3}, \ldots , x_{n}\right) = \left(x_{1}, 2 x_{2}, 3 x_{3}, \ldots , n x_{n}\right). Find the minimal polynomial of TT.

?
Problem 5B.13

Suppose T∈L(V)T \in \mathcal{L}(V) and p∈P(F)p \in \mathcal{P}(\mathbf{F}). Prove that there exists a unique r∈P(F)r \in \mathcal{P}(\mathbf{F}) such that p(T)=r(T)p(T) = r(T) and deg⁡r\operatorname {deg} r is less than the degree of the minimal polynomial of TT.

?
Problem 5B.14

Suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V) has minimal polynomial μT(z)=4+5z−6z2−7z3+2z4+z5\mu_T(z) = 4+5 z-6 z^{2}-7 z^{3}+2 z^{4}+z^{5}. Find the minimal polynomial of T−1T^{-1}.

?
Problem 5B.15

Suppose VV is a finite-dimensional complex vector space with dim⁡V>0\operatorname {dim} V > 0 and T∈L(V)T \in \mathcal{L}(V). Define f:C→Rf: \mathbb {C} \rightarrow \mathbb {R} by

f(λ)=dim⁡range⁡(T−λI). f(\lambda ) = \operatorname {dim} \operatorname {range}(T-\lambda I).

Prove that ff is not a continuous function.

?
Problem 5B.16

Suppose a0,…,an−1∈Fa_{0}, \ldots , a_{n-1} \in \mathbf{F}. Let TT be the operator on Fn\mathbf{F}^{n} whose matrix (with respect to the standard basis) is

(0−a010−a11⋱−a2⋱⋮0−an−21−an−1) \begin{pmatrix} 0 & & & & & -a_{0} \\ 1 & 0 & & & & -a_{1} \\ & 1 & \ddots & & & -a_{2} \\ & & \ddots & & & \vdots \\ & & & & 0 & -a_{n-2} \\ & & & & 1 & -a_{n-1} \end{pmatrix}

Here all entries of the matrix are 0 except for all 1's on the line under the diagonal and the entries in the last column (some of which might also be 0). Show that the minimal polynomial of TT is the polynomial

a0+a1z+⋯+an−1zn−1+zn. a_{0}+a_{1} z+\cdots +a_{n-1} z^{n-1}+z^{n}.
?
Remark.
?

The matrix above is called the companion matrix of the polynomial above. This exercise shows that every monic polynomial is the minimal polynomial of some operator. Hence a formula or an algorithm that could produce exact eigenvalues for each operator on each Fn\mathbf{F}^{n} could then produce exact zeros for each polynomial [by 5.27(a)]. Thus there is no such formula or algorithm. However, efficient numeric methods exist for obtaining very good approximations for the eigenvalues of an operator.

Theorem 5.27(a): suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V); then the zeros of the minimal polynomial of TT are the eigenvalues of TT.

Problem 5B.17

Suppose VV is finite-dimensional, T∈L(V)T \in \mathcal{L}(V), and μT\mu_T is the minimal polynomial of TT. Suppose λ∈F\lambda \in \mathbf{F}. Show that the minimal polynomial of T−λIT-\lambda I is the polynomial qq defined by q(z)=μT(z+λ)q(z) = \mu_{T}(z+\lambda ).

?
Problem 5B.18

Suppose VV is finite-dimensional, T∈L(V)T \in \mathcal{L}(V), and pp is the minimal polynomial of TT. Suppose λ∈F\{0}\lambda \in \mathbf{F} \backslash \left\{ 0\right\}. Show that the minimal polynomial of λT\lambda T is the polynomial qq defined by q(z)=λdeg⁡pp(zλ)q(z) = \lambda^{\operatorname {deg} p} p\left(\frac{z}{\lambda }\right).

?
Problem 5B.19

Suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V). Let E\mathcal{E} be the subspace of L(V)\mathcal{L}(V) defined by

E={q(T):q∈P(F)}. \mathcal{E} = \left\{ q(T): q \in \mathcal{P}(\mathbf{F})\right\} .

Prove that dim⁡E\operatorname {dim} \mathcal{E} equals the degree of the minimal polynomial of TT.

?
Problem 5B.20

Suppose T∈L(F4)T \in \mathcal{L}\left(\mathbf{F}^{4}\right) is such that the eigenvalues of TT are 3,5,8. Prove that

(T−3I)2(T−5I)2(T−8I)2=0 (T-3 I)^{2}(T-5 I)^{2}(T-8 I)^{2} = 0
?
Problem 5B.21

Suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V). Prove that the minimal polynomial of TT has degree at most 1+dim⁡range⁡T1+\operatorname {dim}\operatorname {range}T.

?
Remark.
?

If dim⁡range⁡T+1<dim⁡V\operatorname {dim}\operatorname {range}T + 1<\operatorname {dim} V, then this exercise gives a better upper bound than 5.22 for the degree of the minimal polynomial of TT. Theorem 5.22 (existence, uniqueness, and degree of minimal polynomial): suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V). Then there is a unique monic polynomial p∈P(F)p \in \mathcal{P}(\mathbf{F}) of smallest degree such that p(T)=0p(T) = 0. Furthermore, deg⁡p≤dim⁡V\operatorname {deg} p \leq \operatorname {dim} V.

Problem 5B.22

Suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V). Prove that TT is invertible if and only if I∈span⁡(T,T2,…,Tdim⁡V)I \in \operatorname {span}\left(T, T^{2}, \ldots , T^{\operatorname {dim} V}\right).

?
Problem 5B.23

Suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V). Let n=dim⁡Vn = \operatorname {dim} V. Prove that if v∈Vv \in V, then span⁡(v,Tv,…,Tn−1v)\operatorname {span}\left(v, T v, \ldots , T^{n-1} v\right) is invariant under TT.

?
Problem 5B.24

Suppose VV is a finite-dimensional complex vector space. Let n=dim⁡Vn = \operatorname {dim} V. Suppose T∈L(V)T \in \mathcal{L}(V) is such that 5 and 6 are eigenvalues of TT and that TT has no other eigenvalues. Prove that (T−5I)n−1(T−6I)n−1=0(T-5 I)^{n-1}(T-6 I)^{n-1} = 0.

?
Problem 5B.25

Suppose VV is finite-dimensional, T∈L(V)T \in \mathcal{L}(V), and UU is a subspace of VV that is invariant under TT.

?
(a)

Prove that the minimal polynomial of TT is a polynomial multiple of the minimal polynomial of the quotient operator T/UT / U.

(b)

Prove that

(minimal polynomial of T∣U)×(minimal polynomial of T/U) \left(\text{minimal polynomial of } T|_{U}\right) \times \left(\text{minimal polynomial of } T / U\right)

is a polynomial multiple of the minimal polynomial of TT.

Remark.
?

The quotient operator T/UT/U was defined in Exercise 38 in Section 5A: suppose VV is finite-dimensional, T∈L(V)T \in \mathcal{L}(V), and UU is a subspace of VV invariant under TT; the quotient operator T/U∈L(V/U)T/U \in \mathcal{L}(V/U) is defined by (T/U)(v+U)=Tv+U(T/U)(v+U) = Tv+U for each v∈Vv \in V.

Problem 5B.26

Suppose VV is finite-dimensional, T∈L(V)T \in \mathcal{L}(V), and UU is a subspace of VV that is invariant under TT. Prove that the set of eigenvalues of TT equals the union of the set of eigenvalues of T∣U\left.T\right|_{U} and the set of eigenvalues of T/UT / U.

?
Problem 5B.27

Suppose F=R,V\mathbf{F} = \mathbb {R}, V is finite-dimensional, and T∈L(V)T \in \mathcal{L}(V). Prove that the minimal polynomial of TCT_{\mathrm{C}} equals the minimal polynomial of TT.

?
Remark.
?

The complexification TCT_{\mathrm{C}} was defined in 3B.33: suppose VV is a real vector space and T∈L(V)T \in \mathcal{L}(V); the complexification TC:VC→VCT_{\mathrm{C}}: V_{\mathrm{C}} \rightarrow V_{\mathrm{C}} is defined by TC(u+iv)=Tu+iTvT_{\mathrm{C}}(u+iv) = Tu+iTv for all u,v∈Vu, v \in V, where VCV_{\mathrm{C}} is the complexification of VV from Exercise 8 in Section 1B.

Problem 5B.28

Suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V). Prove that the minimal polynomial of T′∈L(V′)T^{\prime } \in \mathcal{L}\left(V^{\prime }\right) equals the minimal polynomial of TT.

?
Remark.
?

The dual map T′T^{\prime } was defined in Section 3F. Definition 3.118 (dual map, T′T'): suppose T∈L(V,W)T \in \mathcal{L}(V, W). The dual map of TT is the linear map T′∈L(W′,V′)T' \in \mathcal{L}(W', V') defined for each φ∈W′\varphi \in W' by T′(φ)=φ∘TT'(\varphi ) = \varphi \circ T.

Problem 5B.29

Show that every operator on a finite-dimensional vector space of dimension at least two has an invariant subspace of dimension two.

?
Remark.
?

Exercise 6 in Section 5C will give an improvement of this result when F=C\mathbf{F} = \mathbb {C}.