The Minimal Polynomial
[29/0%]Suppose . Prove that is an eigenvalue of if and only if or is an eigenvalue of .
Suppose is a complex vector space and has no eigenvalues. Prove that every subspace of invariant under is either or infinite-dimensional.
Suppose is a positive integer and is defined by
Find all eigenvalues and eigenvectors of .
Find the minimal polynomial of .
The matrix of with respect to the standard basis of consists of all 1 's.
Suppose , and . Prove that is an eigenvalue of if and only if for some eigenvalue of .
Give an example of an operator on that shows the result in Exercise 4 does not hold if is replaced with .
Exercise 4 (Exercise 5B.4): if , , , and , then is an eigenvalue of if and only if for some eigenvalue of .
Suppose is defined by . Find the minimal polynomial of .
Give an example of such that the minimal polynomial of does not equal the minimal polynomial of .
Suppose is finite-dimensional and . Prove that if at least one of is invertible, then the minimal polynomial of equals the minimal polynomial of .
Suppose is the operator of counterclockwise rotation by . Find the minimal polynomial of .
Because , the degree of the minimal polynomial of is at most 2. Thus the minimal polynomial of is not the tempting polynomial , even though .
Suppose is such that with respect to some basis of , all entries of the matrix of are rational numbers. Explain why all coefficients of the minimal polynomial of are rational numbers.
Suppose is finite-dimensional, , and . 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$.Suppose is a two-dimensional vector space, , and the matrix of with respect to some basis of is
Show that .
Show that the minimal polynomial of equals
Define by . Find the minimal polynomial of .
Suppose and . Prove that there exists a unique such that and is less than the degree of the minimal polynomial of .
Suppose is finite-dimensional and has minimal polynomial . Find the minimal polynomial of .
Suppose is a finite-dimensional complex vector space with and . Define by
Prove that is not a continuous function.
Suppose . Let be the operator on whose matrix (with respect to the standard basis) is
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 is the polynomial
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 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 is finite-dimensional and ; then the zeros of the minimal polynomial of are the eigenvalues of .
Suppose is finite-dimensional, , and is the minimal polynomial of . Suppose . Show that the minimal polynomial of is the polynomial defined by .
Suppose is finite-dimensional, , and is the minimal polynomial of . Suppose . Show that the minimal polynomial of is the polynomial defined by .
Suppose is finite-dimensional and . Let be the subspace of defined by
Prove that equals the degree of the minimal polynomial of .
Suppose is such that the eigenvalues of are 3,5,8. Prove that
Suppose is finite-dimensional and . Prove that the minimal polynomial of has degree at most .
If , then this exercise gives a better upper bound than 5.22 for the degree of the minimal polynomial of . Theorem 5.22 (existence, uniqueness, and degree of minimal polynomial): suppose is finite-dimensional and . Then there is a unique monic polynomial of smallest degree such that . Furthermore, .
Suppose is finite-dimensional and . Prove that is invertible if and only if .
Suppose is finite-dimensional and . Let . Prove that if , then is invariant under .
Suppose is a finite-dimensional complex vector space. Let . Suppose is such that 5 and 6 are eigenvalues of and that has no other eigenvalues. Prove that .
Suppose is finite-dimensional, , and is a subspace of that is invariant under .
Prove that the minimal polynomial of is a polynomial multiple of the minimal polynomial of the quotient operator .
Prove that
is a polynomial multiple of the minimal polynomial of .
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 .
Suppose is finite-dimensional, , and is a subspace of that is invariant under . Prove that the set of eigenvalues of equals the union of the set of eigenvalues of and the set of eigenvalues of .
Suppose is finite-dimensional, and . Prove that the minimal polynomial of equals the minimal polynomial of .
The complexification was defined in 3B.33: 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.
Suppose is finite-dimensional and . Prove that the minimal polynomial of equals the minimal polynomial of .
The dual map was defined in Section 3F. Definition 3.118 (dual map, ): suppose . The dual map of is the linear map defined for each by .
Show that every operator on a finite-dimensional vector space of dimension at least two has an invariant subspace of dimension two.
Exercise 6 in Section 5C will give an improvement of this result when .