Diagonalizable Operators
[23/0%]Suppose is a finite-dimensional complex vector space and .
Prove that if , then is diagonalizable.
Prove that if , then is diagonalizable.
Give an example of an operator such that and is not diagonalizable.
Suppose has a diagonal matrix with respect to some basis of . Prove that if , then appears on the diagonal of precisely times.
Suppose is finite-dimensional and . Prove that if the operator is diagonalizable, then .
Suppose is finite-dimensional and . Prove that the following are equivalent.
.
.
.
Suppose is a finite-dimensional complex vector space and . Prove that is diagonalizable if and only if
for every .
Suppose and . Prove that or is invertible.
Suppose is invertible. Prove that
for every with .
Suppose is finite-dimensional and . Let denote the distinct nonzero eigenvalues of . Prove that
Suppose each have 2, 6, 7 as eigenvalues. Prove that there exists an invertible operator such that .
Find such that and each have 2, 6, 7 as eigenvalues, and have no other eigenvalues, and there does not exist an invertible operator such that .
Find such that 6 and 7 are eigenvalues of and such that does not have a diagonal matrix with respect to any basis of .
Suppose is such that 6 and 7 are eigenvalues of . Furthermore, suppose does not have a diagonal matrix with respect to any basis of . Prove that there exists such that
Suppose is a diagonal matrix with distinct entries on the diagonal and is a matrix of the same size as . Show that if and only if is a diagonal matrix.
Give an example of a finite-dimensional complex vector space and an operator on that vector space such that is diagonalizable but is not diagonalizable.
Suppose is a positive integer, and is invertible. Prove that is diagonalizable if and only if is diagonalizable.
Suppose is a finite-dimensional complex vector space, , and is the minimal polynomial of . Prove that the following are equivalent.
is diagonalizable.
There does not exist such that is a polynomial multiple of .
and its derivative have no zeros in common.
The greatest common divisor of and is the constant polynomial 1.
The greatest common divisor of and is the monic polynomial of largest degree such that and are both polynomial multiples of . 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 is diagonalizable without knowing anything about the zeros of .
Suppose that is diagonalizable. Let denote the distinct eigenvalues of . Prove that a subspace of is invariant under if and only if there exist subspaces of such that for each and .
Suppose is finite-dimensional. Prove that has a basis consisting of diagonalizable operators.
Suppose that is diagonalizable and is a subspace of that is invariant under . Prove that the quotient operator is a diagonalizable operator on .
The quotient operator was defined in Exercise 38 in Section 5A: suppose is finite-dimensional, , and is a subspace of invariant under ; the quotient operator is defined by for each .
Prove or give a counterexample: If and there exists a subspace of that is invariant under such that and are both diagonalizable, then is diagonalizable.
See Exercise 13 in Section 5C for an analogous statement about upper-triangular matrices.
Suppose is finite-dimensional and . Prove that is diagonalizable if and only if the dual operator is diagonalizable.
The Fibonacci sequence is defined by
Define by .
Show that for each nonnegative integer .
Find the eigenvalues of .
Find a basis of consisting of eigenvectors of .
Use the solution to (c) to compute . Conclude that
for each nonnegative integer .
Use (d) to conclude that if is a nonnegative integer, then the Fibonacci number is the integer that is closest to
Each is a nonnegative integer, even though the right side of the formula in (d) does not look like an integer. The number
is called the golden ratio.
Suppose and is an -by- matrix that is the matrix of with respect to some basis of . Prove that if
for each , then is invertible.
This exercise states that if the diagonal entries of the matrix of are large compared to the nondiagonal entries, then is invertible.
Suppose the definition of the Gershgorin disks is changed so that the radius of the disk is the sum of the absolute values of the entries in column (instead of row) of , excluding the diagonal entry. Show that the Gershgorin disk theorem (5.67) still holds with this changed definition.
Definition 5.66 (Gershgorin disks): suppose and is a basis of . Let denote the matrix of with respect to this basis. A Gershgorin disk of with respect to the basis is a set of the form , where .
Theorem 5.67 (Gershgorin disk theorem): suppose and is a basis of . Then each eigenvalue of is contained in some Gershgorin disk of with respect to the basis .