Eigenvalues and Eigenvectors
[119/0%]Suppose and is a subspace of .
Prove that if , then is invariant under .
Prove that if range , then is invariant under .
Suppose that and are subspaces of invariant under . Prove that is invariant under .
Suppose . Prove that the intersection of every collection of subspaces of invariant under is invariant under .
Prove or give a counterexample: If is finite-dimensional and is a subspace of that is invariant under every operator on , then or .
Suppose is defined by . Find the eigenvalues of .
Define by . Find all eigenvalues and eigenvectors of .
Define by . Find all eigenvalues and eigenvectors of .
Suppose is such that . Prove that if is an eigenvalue of , then or .
Define by . Find all eigenvalues and eigenvectors of .
Define by for all . Find all eigenvalues and eigenvectors of .
Suppose is finite-dimensional, , and . Prove that there exists such that is invertible for all such that .
Suppose , where and are nonzero subspaces of . Define by for each and each . Find all eigenvalues and eigenvectors of .
Suppose . Suppose is invertible.
Prove that and have the same eigenvalues.
What is the relationship between the eigenvectors of and the eigenvectors of ?
Give an example of an operator on that has no (real) eigenvalues.
Suppose is finite-dimensional, , and . Show that is an eigenvalue of if and only if is an eigenvalue of the dual operator .
Suppose is a basis of and . Prove that if is an eigenvalue of , then
where denotes the entry in row , column of the matrix of with respect to the basis .
See Exercise 19 in Section 6A for a different bound on .
Suppose , and . Prove that 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.
Suppose , and . Prove that is an eigenvalue of the complexification if and only if is an eigenvalue of .
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.
Show that the forward shift operator defined by
has no eigenvalues.
Define the backward shift operator by
Show that every element of is an eigenvalue of .
Find all eigenvectors of .
Suppose is invertible.
Suppose with . Prove that is an eigenvalue of if and only if is an eigenvalue of .
Prove that and have the same eigenvectors.
Suppose and there exist nonzero vectors and in such that
Prove that 3 or -3 is an eigenvalue of .
Suppose is finite-dimensional and . Prove that and have the same eigenvalues.
Suppose is an -by- matrix with entries in . Define by , where elements of are thought of as -by- 1 column vectors.
Suppose the sum of the entries in each row of equals 1. Prove that 1 is an eigenvalue of .
Suppose the sum of the entries in each column of equals 1. Prove that 1 is an eigenvalue of .
Suppose and are eigenvectors of such that is also an eigenvector of . Prove that and are eigenvectors of corresponding to the same eigenvalue.
Suppose is such that every nonzero vector in is an eigenvector of . Prove that is a scalar multiple of the identity operator.
Suppose that is finite-dimensional and . Suppose is such that every subspace of of dimension is invariant under . Prove that is a scalar multiple of the identity operator.
Suppose is finite-dimensional and . Prove that has at most range distinct eigenvalues.
Suppose and , and are eigenvalues of . Prove that there exists such that .
Suppose and . Suppose is an eigenvalue of . Prove that or or .
Give an example of such that .
Suppose has no eigenvalues and . Prove that .
Suppose and is a positive integer.
Prove that is injective if and only if is injective.
Prove that is surjective if and only if is surjective.
Suppose is finite-dimensional and . Prove that the list is linearly independent if and only if there exists such that are eigenvectors of corresponding to distinct eigenvalues.
Suppose that is a list of distinct real numbers. Prove that the list is linearly independent in the vector space of real-valued functions on .
Suppose that is a list of distinct positive numbers. Prove that the list is linearly independent in the vector space of real-valued functions on .
Suppose is finite-dimensional and . Define by
for each . Prove that the set of eigenvalues of equals the set of eigenvalues of .
Suppose is finite-dimensional, , and is a subspace of invariant under . The quotient operator is defined by
for each .
Show that the definition of makes sense (which requires using the condition that is invariant under ) and show that is an operator on .
Show that each eigenvalue of is an eigenvalue of .
Suppose is finite-dimensional and . Prove that has an eigenvalue if and only if there exists a subspace of of dimension that is invariant under .
Suppose and is invertible. Suppose is a polynomial. Prove that
Suppose and is a subspace of invariant under . Prove that is invariant under for every polynomial .
Define by .
Find all eigenvalues and eigenvectors of .
Find all subspaces of that are invariant under .
Suppose that is finite-dimensional, , and . Prove that .
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 .
Prove or give a counterexample: If and has an upper-triangular matrix with respect to some basis of , then has an upper-triangular matrix with respect to some basis of .
Suppose and are upper-triangular matrices of the same size, with on the diagonal of and on the diagonal of .
Show that is an upper-triangular matrix with on the diagonal.
Show that is an upper-triangular matrix with on the diagonal.
The results in this exercise are used in the proof of 5.81. Theorem 5.81 (eigenvalues of sum and product of commuting operators): suppose is a finite-dimensional complex vector space and are commuting operators on . Then every eigenvalue of is an eigenvalue of plus an eigenvalue of , and every eigenvalue of is an eigenvalue of times an eigenvalue of .
Suppose is invertible and is a basis of with respect to which the matrix of is upper triangular, with on the diagonal. Show that the matrix of is also upper triangular with respect to the basis , with
on the diagonal.
Give an example of an operator whose matrix with respect to some basis contains only 0 's on the diagonal, but the operator is invertible.
This exercise and the exercise below show that 5.41 fails without the hypothesis that an upper-triangular matrix is under consideration. Theorem 5.41 (determination of eigenvalues from upper-triangular matrix): suppose has an upper-triangular matrix with respect to some basis of . Then the eigenvalues of are precisely the entries on the diagonal of that upper-triangular matrix.
Give an example of an operator whose matrix with respect to some basis contains only nonzero numbers on the diagonal, but the operator is not invertible.
Suppose is finite-dimensional, and . Prove that if , then has a -dimensional subspace invariant under .
Suppose is finite-dimensional, , and .
Prove that there exists a unique monic polynomial of smallest degree such that .
Prove that the minimal polynomial of is a polynomial multiple of .
Suppose is finite-dimensional, , and there exists a nonzero vector such that .
Prove that if , then there does not exist a basis of with respect to which has an upper-triangular matrix.
Prove that if and is an upper-triangular matrix that equals the matrix of with respect to some basis of , then or appears on the diagonal of .
Suppose is a square matrix with complex entries. Prove that there exists an invertible square matrix with complex entries such that is an upper-triangular matrix.
Suppose and is a basis of . Show that the following are equivalent.
The matrix of with respect to is lower triangular.
is invariant under for each .
for each .
A square matrix is called lower triangular if all entries above the diagonal are .
Suppose and is finite-dimensional. Prove that if , then there exists a basis of with respect to which has a lower-triangular matrix.
Suppose is finite-dimensional, has an upper-triangular matrix with respect to some basis of , and is a subspace of that is invariant under .
Prove that has an upper-triangular matrix with respect to some basis of .
Prove that the quotient operator has an upper-triangular matrix with respect to some basis 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 . Suppose there exists a subspace of that is invariant under such that has an uppertriangular matrix with respect to some basis of and also has an upper-triangular matrix with respect to some basis of . Prove that has an upper-triangular matrix with respect to some basis of .
Suppose is finite-dimensional and . Prove that has an uppertriangular matrix with respect to some basis of if and only if the dual operator has an upper-triangular matrix with respect to some basis of the dual space .
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 .
Give an example of two commuting operators on such that there is a subspace of that is invariant under but not under and there is a subspace of that is invariant under but not under .
Suppose is a subset of and every element of is diagonalizable. Prove that there exists a basis of with respect to which every element of has a diagonal matrix if and only if every pair of elements of commutes.
This exercise extends 5.76, which considers the case in which contains only two elements. For this exercise, may contain any number of elements, and may even be an infinite set. Theorem 5.76 (simultaneous diagonalizability is equivalent to commutativity): two diagonalizable operators on the same vector space have diagonal matrices with respect to the same basis if and only if the two operators commute.
Suppose are such that . Suppose .
Prove that is invariant under .
Prove that is invariant under .
See 5.18 for the special case . Theorem 5.18 (null space and range of are invariant under ): suppose and . Then and are invariant under .
Prove or give a counterexample: If is a diagonal matrix and is an upper-triangular matrix of the same size as , then and commute.
Prove that a pair of operators on a finite-dimensional vector space commute if and only if their dual operators commute.
See 3.118 for the definition of the dual of an operator. Definition 3.118 (dual map, ): suppose . The dual map of is the linear map defined for each by .
Suppose is a finite-dimensional complex vector space and commute. Prove that there exist such that
Suppose is a complex vector space, is diagonalizable, and commutes with . Prove that there is a basis of such that has a diagonal matrix with respect to this basis and has an upper-triangular matrix with respect to this basis.
Suppose in Example 5.72 and are the commuting partial differentiation operators on from that example. Find a basis of with respect to which and each have an upper-triangular matrix.
Example 5.72: for a nonnegative integer , let denote the real vector space of polynomials (with real coefficients) in two variables and of degree at most . Writing , define by and . These partial differentiation operators commute: .
Suppose is a finite-dimensional nonzero complex vector space. Suppose that is such that and commute for all .
Prove that there is a vector in that is an eigenvector for every element of .
Prove that there is a basis of with respect to which every element of has an upper-triangular matrix.
This exercise extends 5.78 and 5.80, which consider the case in which contains only two elements. For this exercise, may contain any number of elements, and may even be an infinite set. Theorem 5.78 (common eigenvector for commuting operators): every pair of commuting operators on a finite-dimensional nonzero complex vector space has a common eigenvector. Theorem 5.80 (commuting operators are simultaneously upper triangularizable): suppose is a finite-dimensional complex vector space and are commuting operators on . Then there is a basis of with respect to which both and have upper-triangular matrices.
Give an example of two commuting operators on a finite-dimensional real vector space such that has a eigenvalue that does not equal an eigenvalue of plus an eigenvalue of and has a eigenvalue that does not equal an eigenvalue of times an eigenvalue of .
This exercise shows that 5.81 does not hold on real vector spaces. Theorem 5.81 (eigenvalues of sum and product of commuting operators): suppose is a finite-dimensional complex vector space and are commuting operators on . Then every eigenvalue of is an eigenvalue of plus an eigenvalue of , and every eigenvalue of is an eigenvalue of times an eigenvalue of .