This sheet introduces the fundamental concepts of linear transformations, eigenvalues, eigenvectors, characteristic polynomials, and minimal polynomials—the essential machinery for understanding linear transformations and their canonical forms.
Commentary. A linear transformation is completely determined by its matrix representation. But a single matrix contains entries—far too many to understand at a glance. Eigenvalues and eigenvectors reduce this complexity: if is an eigenvector, then acts on by simple scalar multiplication. The minimal polynomial captures the essential algebraic behavior of with a polynomial of degree at most , distilling all the structural information into a concise form. These concepts are the foundation for the rational and Jordan canonical forms developed in Sheet 11.
Prerequisites. This sheet uses the following results from earlier sheets:
- Vector spaces, linear independence, basis, dimension (Sheet 12 — yes, we are jumping ahead slightly; Sheet 12 covers field extensions but also includes vector space fundamentals. Alternatively, this material is standard from linear algebra.)
- Determinants (standard linear algebra)
- Polynomial rings over a field (Sheet 9)
- PIDs and UFDs (Sheet 9)
Linear Transformations and Matrices#
Definition 10.1. Let and be vector spaces over a field . A function is a linear transformation (or linear map) if for all and :
Definition 10.2. Let be a finite-dimensional vector space over . The set of all linear transformations is denoted .
Theorem 10.3. Let be an -dimensional vector space over . For any basis of , the mapis a ring isomorphism. In particular, .
Corollary 10.4. Eigenvalues, characteristic polynomials, and minimal polynomials are well-defined for linear transformations (independent of the choice of basis).
Corollary 10.5. Two matrices are similar iff they represent the same linear transformation in different bases.
Exercise 10.6. Let be defined by . Find the matrix of with respect to the standard basis.
Exercise 10.7. Prove that composition of linear transformations corresponds to matrix multiplication.
Eigenvalues and Eigenvectors#
Definition 10.8. Let be a finite-dimensional vector space over a field , and let be a linear transformation. A scalar is an eigenvalue of if there exists a nonzero vector such that:Such a vector is an eigenvector of corresponding to .
Definition 10.9. For an matrix , a scalar is an eigenvalue of if there exists a nonzero vector such that:
Definition 10.10. The eigenspace of corresponding to is:
Theorem 10.11. is an eigenvalue of iff .
Theorem 10.12 (Distinct Eigenvectors are Independent). If are distinct eigenvalues of , and is an eigenvector for , then is linearly independent.
Example 10.13. For :Eigenvalues: . Eigenvector for : . Eigenvector for : .
Exercise 10.14. Find the eigenvalues and eigenvectors of .
Exercise 10.15. Show that is an eigenvalue of iff is singular.
Exercise 10.16. Prove Theorem 10.12.
The Characteristic Polynomial#
Definition 10.17. The characteristic polynomial of is:
Theorem 10.18. Similar matrices have the same characteristic polynomial. That is, if , then .
Theorem 10.19. The constant term of is .
Theorem 10.20. The coefficient of in is , where is the sum of the diagonal entries.
Example 10.21. For , .
Exercise 10.22. Compute the characteristic polynomial of .
Exercise 10.23. Show that similar matrices have the same trace and determinant.
The Cayley-Hamilton Theorem#
Theorem 10.24 (Cayley-Hamilton). Every square matrix satisfies its own characteristic polynomial:
Example 10.25. For , . Indeed:
Theorem 10.26. The Cayley-Hamilton theorem provides an algorithm for computing :provided .
Example 10.27. For , . Thus , so .
Exercise 10.28. Verify Cayley-Hamilton for .
Exercise 10.29. Use the Cayley-Hamilton theorem to find for .
The Minimal Polynomial#
Definition 10.30. The minimal polynomial of , denoted , is the monic polynomial of least degree such that:
Theorem 10.31. For any matrix , the minimal polynomial exists and is unique.
Theorem 10.32. The minimal polynomial divides every polynomial that annihilates . In particular, divides .
Theorem 10.33. If , then . (Similar matrices have the same minimal polynomial.)
Theorem 10.34. is an eigenvalue of iff is a root of .
Theorem 10.35. The roots of the minimal polynomial are exactly the eigenvalues of .
Example 10.36. For , . The minimal polynomial is .
Example 10.37. For , . The minimal polynomial is .
Exercise 10.38. Find the minimal polynomial of .
Exercise 10.39. Show that if is diagonalizable, then has no repeated roots.
Exercise 10.40. Prove Theorem 10.31.
Diagonalizability#
Definition 10.41. A matrix is diagonalizable over if there exists an invertible matrix such that:is a diagonal matrix.
Theorem 10.42. is diagonalizable over iff has a basis consisting of eigenvectors of .
Theorem 10.43. If has distinct eigenvalues in , then is diagonalizable over .
Theorem 10.44. is diagonalizable over iff the minimal polynomial factors into distinct linear factors over .
Theorem 10.45. The geometric multiplicity of an eigenvalue (dimension of its eigenspace ) is at most its algebraic multiplicity (multiplicity as a root of ):
Theorem 10.46. is diagonalizable iff equality holds in Theorem 10.45 for every eigenvalue.
Example 10.47. is not diagonalizable over . Its characteristic polynomial is , but .
Exercise 10.48. Determine whether is diagonalizable over . If so, find and .
Exercise 10.49. Show that if is diagonalizable, then every eigenvalue has algebraic multiplicity equal to geometric multiplicity.
Exercise 10.50. Prove Theorem 10.44.
Invariant Subspaces#
Definition 10.51. A subspace is -invariant if .
Theorem 10.52. If is -invariant, then the restriction is a linear transformation.
Theorem 10.53. Eigenspaces are invariant subspaces.
Theorem 10.54. If decomposes as a direct sum of -invariant subspaces , then the matrix of is block diagonal with respect to a basis adapted to this decomposition.
Exercise 10.55. Show that and are -invariant subspaces.
Exercise 10.56. Let , . Find all -invariant subspaces of .
Exercise 10.57. Prove that if is -invariant, then the characteristic polynomial of divides the characteristic polynomial of .
Schur's Triangularization Theorem#
Theorem 10.58 (Schur's Triangularization Theorem). If , then there exists a unitary matrix such that is upper triangular.
Corollary 10.59. Every complex matrix is triangularizable.
Corollary 10.60. The eigenvalues of appear on the diagonal of the triangular matrix.
Corollary 10.61. Every complex matrix has at least one eigenvector.
Exercise 10.62. Why does Schur's theorem imply that every complex matrix has at least one eigenvector?
Exercise 10.63. Show that the eigenvalues of a triangular matrix are exactly its diagonal entries.
The Characteristic Polynomial of a Block Triangular Matrix#
Theorem 10.64. If is a block upper triangular matrix, then:
Corollary 10.65. The eigenvalues of are the eigenvalues of together with the eigenvalues of .
Exercise 10.66. Let be a block diagonal matrix with blocks . Show that .
Exercise 10.67. Let be upper triangular. Show that the eigenvalues of are the diagonal entries.
Summary#
We have introduced:
- Linear transformations and their matrix representations
- Eigenvalues and eigenvectors
- Characteristic polynomials and their properties
- The Cayley-Hamilton Theorem
- Minimal polynomials
- Diagonalizability criteria
- Algebraic vs. geometric multiplicity
- Invariant subspaces
- Schur's Triangularization Theorem
- Characteristic polynomial of block triangular matrices