Generalized Eigenspace Decomposition
[23/0%]Define by . Find the generalized eigenspaces corresponding to the distinct eigenvalues of .
Suppose is invertible. Prove that for every with .
Suppose . Suppose is invertible. Prove that and have the same eigenvalues with the same multiplicities.
Suppose and is such that . Prove that has at most two distinct eigenvalues.
Suppose and 3 and 8 are eigenvalues of . Let . Prove that .
Suppose and is an eigenvalue of . Explain why the exponent of in the factorization of the minimal polynomial of is the smallest positive integer such that .
Suppose and is an eigenvalue of with multiplicity . Prove that .
If , then this exercise improves 8.20. Theorem 8.20 (description of generalized eigenspaces): suppose and . Then .
Suppose and are the distinct eigenvalues of . Prove that
if and only if the minimal polynomial of equals for some positive integers .
The case follows immediately from and the generalized eigenspace decomposition (8.22); thus this exercise is interesting only when . Theorem 5.27(b): if is a finite-dimensional complex vector space and , then the minimal polynomial of has the form , where is a list of all eigenvalues of , possibly with repetitions. Theorem 8.22 (generalized eigenspace decomposition): suppose and , and let be the distinct eigenvalues of . Then is invariant under and is nilpotent for each , and .
Suppose and . Prove that there exist such that , the operator is diagonalizable, is nilpotent, and .
Suppose is a complex inner product space, is an orthonormal basis of , and . Let be the eigenvalues of , each included as many times as its multiplicity. Prove that
See the comment after Exercise 5 in Section 7A. Exercise 7A.5: suppose ; suppose is an orthonormal basis of and is an orthonormal basis of . Prove that . The comment after that exercise notes: the numbers in that equation depend on the orthonormal basis , but the right side does not depend on ; thus the equation shows that the sum on the left side does not depend on which orthonormal basis is used.
Give an example of an operator on whose characteristic polynomial equals .
Give an example of an operator on whose characteristic polynomial equals and whose minimal polynomial equals .
Give an example of an operator on whose characteristic and minimal polynomials both equal .
Give an example of an operator on whose characteristic polynomial equals and whose minimal polynomial equals .
Let be the operator on defined by . Find the characteristic polynomial and the minimal polynomial of .
Let be the operator on defined by
Find the characteristic polynomial and the minimal polynomial of .
Suppose and is such that . Prove that the characteristic polynomial of is , where and range .
Suppose and is an eigenvalue of . Explain why the following four numbers equal each other.
The exponent of in the factorization of the minimal polynomial of .
The smallest positive integer such that .
The smallest positive integer such that
The smallest positive integer such that
Suppose and is a unitary operator. Prove that the constant term in the characteristic polynomial of has absolute value 1.
Suppose that and are nonzero subspaces of such that
Suppose and each is invariant under . For each , let denote the characteristic polynomial of . Prove that the characteristic polynomial of equals .
Suppose are monic polynomials with the same zeros and is a polynomial multiple of . Prove that there exists such that the characteristic polynomial of is and the minimal polynomial of is .
This exercise implies that every monic polynomial is the characteristic polynomial of some operator.
Suppose and are block diagonal matrices of the form
where and are square matrices of the same size for each . Show that is a block diagonal matrix of the form
Suppose , and .
Show that if and only if .
Show that the multiplicity of as an eigenvalue of equals the multiplicity of as an eigenvalue of .
Use (b) and the result about the sum of the multiplicities (8.25) to show that if is an odd number, then has a real eigenvalue.
Theorem 8.25 (sum of the multiplicities equals ): suppose and . Then the sum of the multiplicities of all eigenvalues of equals .
Use (c) and the result about real eigenvalues of (Exercise 17 in Section 5A) to show that if is an odd number, then has an eigenvalue (thus giving an alternative proof of 5.34).
Exercise 17 in Section 5A (Exercise 5A.17): if , , and , then is an eigenvalue of if and only if is an eigenvalue of the complexification .
The complexification was defined in Exercise 33 in Section 3B: suppose is a real vector space and ; the complexification is defined by for all , where is the complexification of from Exercise 8 in Section 1B.