Section 5D

Diagonalizable Operators

[23/0%]
Show
LaTeX
Problem 5D.1

Suppose VV is a finite-dimensional complex vector space and T∈L(V)T \in \mathcal{L}(V).

?
(a)

Prove that if T4=IT^{4} = I, then TT is diagonalizable.

(b)

Prove that if T4=TT^{4} = T, then TT is diagonalizable.

(c)

Give an example of an operator T∈L(C2)T \in \mathcal{L}\left(\mathbb {C}^{2}\right) such that T4=T2T^{4} = T^{2} and TT is not diagonalizable.

Problem 5D.2

Suppose T∈L(V)T \in \mathcal{L}(V) has a diagonal matrix AA with respect to some basis of VV. Prove that if λ∈F\lambda \in \mathbf{F}, then λ\lambda appears on the diagonal of AA precisely dim⁡E(λ,T)\operatorname {dim} E(\lambda , T) times.

?
Problem 5D.3

Suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V). Prove that if the operator TT is diagonalizable, then V=null⁡T⊕range⁡TV =\operatorname {null}T \oplus \operatorname {range}T.

?
Problem 5D.4

Suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V). Prove that the following are equivalent.

?
(a)

V=null⁡T⊕range⁡TV = \operatorname {null} T \oplus \operatorname {range} T.

(b)

V=null⁡T+range⁡TV =\operatorname {null}T+\operatorname {range} T.

(c)

null⁡T  ∩range⁡T={0}\operatorname {null}T \; \cap \operatorname {range} T = \left\{ 0\right\}.

Problem 5D.5

Suppose VV is a finite-dimensional complex vector space and T∈L(V)T \in \mathcal{L}(V). Prove that TT is diagonalizable if and only if

V=null⁡(T−λI)⊕range⁡(T−λI) V = \operatorname {null}(T-\lambda I) \oplus \operatorname {range}(T-\lambda I)

for every λ∈C\lambda \in \mathbb {C}.

?
Problem 5D.6

Suppose T∈L(F5)T \in \mathcal{L}\left(\mathbf{F}^{5}\right) and dim⁡E(8,T)=4\operatorname {dim} E(8, T) = 4. Prove that T−2IT-2 I or T−6IT-6 I is invertible.

?
Problem 5D.7

Suppose T∈L(V)T \in \mathcal{L}(V) is invertible. Prove that

E(λ,T)=E(1λ,T−1) E(\lambda , T) = E\left(\frac{1}{\lambda }, T^{-1}\right)

for every λ∈F\lambda \in \mathbf{F} with λ≠0\lambda \neq 0.

?
Problem 5D.8

Suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V). Let λ1,…,λm\lambda_{1}, \ldots , \lambda_{m} denote the distinct nonzero eigenvalues of TT. Prove that

dim⁡E(λ1,T)+⋯+dim⁡E(λm,T)≤dim⁡range⁡T. \operatorname {dim} E(\lambda _{1}, T)+\cdots +\operatorname {dim} E(\lambda _{m}, T) \leq \operatorname {dim} \operatorname {range} T.
?
Problem 5D.9

Suppose R,T∈L(F3)R, T \in \mathcal{L}\left(\mathbf{F}^{3}\right) each have 2, 6, 7 as eigenvalues. Prove that there exists an invertible operator S∈L(F3)S \in \mathcal{L}\left(\mathbf{F}^{3}\right) such that R=S−1TSR = S^{-1} T S.

?
Problem 5D.10

Find R,T∈L(F4)R, T \in \mathcal{L}\left(\mathbf{F}^{4}\right) such that RR and TT each have 2, 6, 7 as eigenvalues, RR and TT have no other eigenvalues, and there does not exist an invertible operator S∈L(F4)S \in \mathcal{L}\left(\mathbf{F}^{4}\right) such that R=S−1TSR = S^{-1} T S.

?
Problem 5D.11

Find T∈L(C3)T \in \mathcal{L}\left(\mathbb {C}^{3}\right) such that 6 and 7 are eigenvalues of TT and such that TT does not have a diagonal matrix with respect to any basis of C3\mathbb {C}^{3}.

?
Problem 5D.12

Suppose T∈L(C3)T \in \mathcal{L}\left(\mathbb {C}^{3}\right) is such that 6 and 7 are eigenvalues of TT. Furthermore, suppose TT does not have a diagonal matrix with respect to any basis of C3\mathbb {C}^{3}. Prove that there exists (z1,z2,z3)∈C3\left(z_{1}, z_{2}, z_{3}\right) \in \mathbb {C}^{3} such that

T(z1,z2,z3)=(6+8z1,7+8z2,13+8z3). T\left(z_{1}, z_{2}, z_{3}\right) = \left(6+8 z_{1}, 7+8 z_{2}, 13+8 z_{3}\right).
?
Problem 5D.13

Suppose AA is a diagonal matrix with distinct entries on the diagonal and BB is a matrix of the same size as AA. Show that AB=BAA B = B A if and only if BB is a diagonal matrix.

?
Problem 5D.14
?
(a)

Give an example of a finite-dimensional complex vector space and an operator TT on that vector space such that T2T^{2} is diagonalizable but TT is not diagonalizable.

(b)

Suppose F=C,k\mathbf{F} = \mathbb {C}, k is a positive integer, and T∈L(V)T \in \mathcal{L}(V) is invertible. Prove that TT is diagonalizable if and only if TkT^{k} is diagonalizable.

Problem 5D.15

Suppose VV is a finite-dimensional complex vector space, T∈L(V)T \in \mathcal{L}(V), and pp is the minimal polynomial of TT. Prove that the following are equivalent.

?
(a)

TT is diagonalizable.

(b)

There does not exist λ∈C\lambda \in \mathbb {C} such that pp is a polynomial multiple of (z−λ)2(z-\lambda )^{2}.

(c)

pp and its derivative p′p^{\prime } have no zeros in common.

(d)

The greatest common divisor of pp and p′p^{\prime } is the constant polynomial 1.

Remark.
?

The greatest common divisor of pp and p′p^{\prime } is the monic polynomial qq of largest degree such that pp and p′p^{\prime } are both polynomial multiples of qq. The Euclidean algorithm for polynomials (look it up) can quickly determine the greatest common divisor of two polynomials, without requiring any information about the zeros of the polynomials. Thus the equivalence of (a) and (d) above shows that we can determine whether TT is diagonalizable without knowing anything about the zeros of pp.

Problem 5D.16

Suppose that T∈L(V)T \in \mathcal{L}(V) is diagonalizable. Let λ1,…,λm\lambda_{1}, \ldots , \lambda_{m} denote the distinct eigenvalues of TT. Prove that a subspace UU of VV is invariant under TT if and only if there exist subspaces U1,…,UmU_{1}, \ldots , U_{m} of VV such that Uk⊆E(λk,T)U_{k} \subseteq E(\lambda_{k}, T) for each kk and U=U1⊕⋯⊕UmU = U_{1} \oplus \cdots \oplus U_{m}.

?
Problem 5D.17

Suppose VV is finite-dimensional. Prove that L(V)\mathcal{L}(V) has a basis consisting of diagonalizable operators.

?
Problem 5D.18

Suppose that T∈L(V)T \in \mathcal{L}(V) is diagonalizable and UU is a subspace of VV that is invariant under TT. Prove that the quotient operator T/UT / U is a diagonalizable operator on V/UV / U.

?
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 5D.19

Prove or give a counterexample: If T∈L(V)T \in \mathcal{L}(V) and there exists a subspace UU of VV that is invariant under TT such that T∣U\left.T\right|_{U} and T/UT / U are both diagonalizable, then TT is diagonalizable.

?
Remark.
?

See Exercise 13 in Section 5C for an analogous statement about upper-triangular matrices.

Problem 5D.20

Suppose VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V). Prove that TT is diagonalizable if and only if the dual operator T′T^{\prime } is diagonalizable.

?
Problem 5D.21

The Fibonacci sequence F0,F1,F2,…F_{0}, F_{1}, F_{2}, \ldots is defined by

F0=0,F1=1, and Fn=Fn−2+Fn−1 for n≥2 F_{0} = 0, F_{1} = 1, \text{ and } F_{n} = F_{n-2}+F_{n-1} \text{ for } n \geq 2

Define T∈L(R2)T \in \mathcal{L}\left(\mathbb {R}^{2}\right) by T(x,y)=(y,x+y)T(x, y) = (y, x+y).

?
(a)

Show that Tn(0,1)=(Fn,Fn+1)T^{n}(0,1) = \left(F_{n}, F_{n+1}\right) for each nonnegative integer nn.

(b)

Find the eigenvalues of TT.

(c)

Find a basis of R2\mathbb {R}^{2} consisting of eigenvectors of TT.

(d)

Use the solution to (c) to compute Tn(0,1)T^{n}(0,1). Conclude that

Fn=15[(1+52)n−(1−52)n] F_{n} = \frac{1}{\sqrt{5}}\left[\left(\frac{1+\sqrt{5}}{2}\right)^{n}-\left(\frac{1-\sqrt{5}}{2}\right)^{n}\right]

for each nonnegative integer nn.

(e)

Use (d) to conclude that if nn is a nonnegative integer, then the Fibonacci number FnF_{n} is the integer that is closest to

15(1+52)n \frac{1}{\sqrt{5}}\left(\frac{1+\sqrt{5}}{2}\right)^{n}
Remark.
?

Each FnF_{n} is a nonnegative integer, even though the right side of the formula in (d) does not look like an integer. The number

φ:=1+52 \varphi := \frac{1+\sqrt{5}}{2}

is called the golden ratio.

Problem 5D.22

Suppose T∈L(V)T \in \mathcal{L}(V) and AA is an nn-by-nn matrix that is the matrix of TT with respect to some basis of VV. Prove that if

∣Aj,j∣>∑k=1k≠jn∣Aj,k∣ \left|A_{j, j}\right| > \sum _{\substack {k = 1 \\ k \neq j}}^{n}\left|A_{j, k}\right|

for each j∈{1,…,n}j \in \left\{ 1, \ldots , n\right\}, then TT is invertible.

?
Remark.
?

This exercise states that if the diagonal entries of the matrix of TT are large compared to the nondiagonal entries, then TT is invertible.

Problem 5D.23

Suppose the definition of the Gershgorin disks is changed so that the radius of the kth k^{\text{th }} disk is the sum of the absolute values of the entries in column (instead of row) kk of AA, excluding the diagonal entry. Show that the Gershgorin disk theorem (5.67) still holds with this changed definition.

Definition 5.66 (Gershgorin disks): suppose T∈L(V)T \in \mathcal{L}(V) and v1,…,vnv_{1}, \ldots , v_{n} is a basis of VV. Let AA denote the matrix of TT with respect to this basis. A Gershgorin disk of TT with respect to the basis v1,…,vnv_{1}, \ldots , v_{n} is a set of the form {z∈F:∣z−Aj,j∣≤∑k=1,k≠jn∣Aj,k∣}\left\{ z \in \mathbf{F}: \left|z-A_{j, j}\right| \leq \sum_{k = 1, k \neq j}^{n}\left|A_{j, k}\right|\right\}, where j∈{1,…,n}j \in \left\{ 1, \ldots , n\right\}.

Theorem 5.67 (Gershgorin disk theorem): suppose T∈L(V)T \in \mathcal{L}(V) and v1,…,vnv_{1}, \ldots , v_{n} is a basis of VV. Then each eigenvalue of TT is contained in some Gershgorin disk of TT with respect to the basis v1,…,vnv_{1}, \ldots , v_{n}.

?