Mathematics Foundations/6.5 Eigenvalues and Eigenvectors

6.5 Eigenvalues and Eigenvectors Introduction Eigenvalues and eigenvectors are fundamental concepts in linear algebra with wide-ranging applications across mathematics, physics, engineering, and computer science. They provide insight into the behavior of linear transformations and are essential for understanding dynamic systems. Basic Definitions Let be an square matrix. A non-zero vector is called an eigenvector of if there exists a scalar such that: The scalar is called the eigenvalue corresponding to the eigenvector . In other words, when acts on , it produces a vector that is a scalar multiple of . The transformation stretches or shrinks by a factor of , without changing its direction (or possibly reversing it if ). Finding Eigenvalues and Eigenvectors The Characteristic Equation To find the eigenvalues of matrix , we solve the characteristic equation: where is the identity matrix. The resulting polynomial in is called the characteristic polynomial of . The roots of this polynomial are the eigenvalues of . Finding Eigenvectors Once we have found an eigenvalue , we can find the corresponding eigenvectors by solving the homogeneous system: The non-trivial solutions to this system form the eigenspace associated with . Example Consider the matrix The characteristic equation is: Solving this quadratic equation gives and . For , we solve: This gives us the eigenvector (or any scalar multiple). For , we solve: This gives us the eigenvector (or any scalar multiple). Properties of Eigenvalues and Eigenvectors Algebraic Multiplicity The algebraic multiplicity of an eigenvalue is its multiplicity as a root of the characteristic polynomial. Geometric Multiplicity The geometric multiplicity of an eigenvalue is the dimension of the corresponding eigenspace (i.e., the number of linearly independent eigenvectors associated with that eigenvalue). Important Relationships The geometric multiplicity of an eigenvalue is always less than or equal to its algebraic multiplicity. A matrix is diagonalizable if and only if the geometric multiplicity equals the algebraic multiplicity for each eigenvalue. The sum of the eigenvalues of a matrix equals its trace (sum of diagonal elements). The product of the eigenvalues equals the determinant of the matrix. If is invertible, then is an eigenvalue of corresponding to the same eigenvector. If is an eigenvalue of , then is an eigenvalue of with the same eigenvector. Diagonalization A square matrix is diagonalizable if it can be written as: where is a diagonal matrix containing the eigenvalues of , and is a matrix whose columns are the corresponding eigenvectors. Conditions for Diagonalization A matrix is diagonalizable if and only if it has linearly independent eigenvectors (where is the dimension of the matrix). Benefits of Diagonalization Computing powers of becomes simple: Solving systems of linear differential equations Analyzing the stability of dynamic systems Simplifying matrix computations Symmetric Matrices and Orthogonal Diagonalization If is a symmetric matrix (i.e., ), then: All eigenvalues of are real. Eigenvectors corresponding to distinct eigenvalues are orthogonal. is always diagonalizable. can be orthogonally diagonalized: where is an orthogonal matrix (). Applications of Eigenvalues and Eigenvectors Principal Component Analysis (PCA) PCA uses eigenvectors of the covariance matrix to identify the principal directions of variation in a dataset, allowing for dimensionality reduction while preserving maximum variance. Vibration Analysis In mechanical engineering, eigenvalues represent natural frequencies of vibration, while eigenvectors represent the corresponding mode shapes. Quantum Mechanics In quantum mechanics, eigenvalues of operators represent observable quantities, while eigenvectors (or eigenfunctions) represent the corresponding states of the system. Stability Analysis The stability of a dynamic system can be determined by examining the eigenvalues of its state transition matrix: If all eigenvalues have negative real parts, the system is stable. If any eigenvalue has a positive real part, the system is unstable. Google's PageRank Algorithm PageRank uses the principal eigenvector of a modified adjacency matrix of the web to rank web pages by importance. Special Types of Matrices and Their Eigenvalues Triangular Matrices The eigenvalues of a triangular matrix (upper or lower) are precisely its diagonal entries. Projection Matrices A projection matrix (where ) has eigenvalues that are either 0 or 1. Hermitian Matrices A Hermitian matrix (complex analog of symmetric matrices) has all real eigenvalues. Unitary Matrices A unitary matrix (where ) has eigenvalues with absolute value 1. The Spectral Theorem The Spectral Theorem states that any normal matrix (a matrix that commutes with its conjugate transpose) can be unitarily diagonalized. This includes symmetric, Hermitian, and unitary matrices. Generalized Eigenvalues and Eigenvectors For a pair of matrices and , a generalized eigenvalue and corresponding eigenvector satisfy: This concept appears in applications such as vibration analysis and differential equations. Exercises Find the eigenvalues and eigenvectors of Determine whether the following matrix is diagonalizable: If is a matrix with eigenvalues 2, 2, and 5, what is ? Prove that similar matrices have the same eigenvalues. Find a matrix with eigenvalues 3 and -2, and corresponding eigenvectors and . Category:Linear Algebra Category:Matrices Category:Eigenvalues and Eigenvectors