Verify that for each of the following matrices, the given vector is an eigenvector, and find the corresponding eigenvalue.
.
Find the characteristic equation and eigenvalues for each of the following linear transformations or matrices:
.
is the matrix of reflection about the line .
In each of the cases from Exercise 7.5.2, and for each of the eigenvalues found, determine the corresponding eigenspaces, and state their dimensions.
Is the subset a subspace? If so, verify all the axioms. If not, explain which axiom it doesn’t satisfy.
Is the subset a subspace? If so, verify all the axioms. If not, explain which axiom it doesn’t satisfy.
If is a linear transformation, and is a subspace, then prove that is also a subspace of .
Let be the linear transformation corresponding to the matrix . Is there a 1-dimensional subspace such that is not a 1-dimensional subspace? Justify your answer.
Let be the matrix of an invertible linear transformation. Proceeding as in the proof of Theorem 7.3.3, show that has:
two distinct real eigenvalues if and only if ,
exactly one real eigenvalue if and only if , and
no real eigenvalue if and only if .
A rotation matrix is of the above form. Use the above to find all values of for which has real eigenvalues. Compare your answer to Example 7.1.
This exercise consists of diagonalizing a symmetric matrix, which will be covered more fully in MATH220. Let with . By Theorem 7.3.3 we have two distinct real eigenvalues ; let be an eigenvector for for . Assume and are each of length 1.
By Theorem 7.3.3 we know that and are perpendicular to each other. Write this conclusion as an equation in terms of and .
Let . Prove that .
Prove that
Use the above to prove that
In this sense, we have used the matrix to diagonalize . From the diagonal form it is easy to see what the eigenvalues are.