4.1 Calculate eigenvalues and eigenvectors of a matrix

Eigenvalues and eigenvectors are key concepts in linear algebra. They help us understand how matrices transform vectors and reveal important properties of linear transformations.

Calculating eigenvalues involves solving the characteristic equation, while eigenvectors are found by solving a system of equations. These tools are crucial for analyzing matrix behavior and solving problems in various fields.

Eigenvalues and Eigenvectors of Matrices

Definition and Properties

• An eigenvalue $\lambda$ of a square matrix $A$ is a scalar value that satisfies the equation $Ax = \lambda x$ for some non-zero vector $x$
• An eigenvector $x$ of a square matrix $A$ is a non-zero vector that, when multiplied by $A$, yields a scalar multiple of itself: $Ax = \lambda x$, where $\lambda$ is the corresponding eigenvalue
• Eigenvalues and eigenvectors are only defined for square matrices
• A matrix can have multiple eigenvalues and eigenvectors, or none at all
• The set of all eigenvectors corresponding to a particular eigenvalue, along with the zero vector, forms an eigenspace

Importance and Applications

• Eigenvalues and eigenvectors have numerous applications in various fields, such as:
  • Physics (quantum mechanics, vibration analysis)
  • Computer graphics (transformations, compression)
  • Data analysis (principal component analysis)
  • Differential equations (stability analysis)
• Understanding the eigenvalues and eigenvectors of a matrix provides insights into its properties and behavior when transformed or multiplied by other matrices

Characteristic Equation of a Matrix

Definition and Properties

• The characteristic equation of a square matrix $A$ is $\det(A - \lambda I) = 0$, where $I$ is the identity matrix of the same size as $A$, and $\det$ represents the determinant
• The characteristic equation is a polynomial equation in terms of $\lambda$, the degree of which is equal to the size of the matrix $A$
• The roots of the characteristic equation are the eigenvalues of the matrix $A$

Calculating the Characteristic Equation

• To find the characteristic equation, follow these steps:
  1. Subtract $\lambda I$ from the matrix $A$, where $I$ is the identity matrix of the same size as $A$
  2. Calculate the determinant of the resulting matrix $A - \lambda I$
  3. Set the determinant equal to zero and simplify the equation to obtain the characteristic equation
• The characteristic equation will be a polynomial in terms of $\lambda$, with the highest degree term being $\lambda^n$, where $n$ is the size of the matrix $A$

Finding Eigenvalues

Solving the Characteristic Equation

• To find the eigenvalues of a matrix $A$, solve the characteristic equation $\det(A - \lambda I) = 0$ for $\lambda$
• The solutions to the characteristic equation, i.e., the values of $\lambda$ that satisfy the equation, are the eigenvalues of the matrix $A$
• The number of distinct eigenvalues of a matrix is less than or equal to the size of the matrix

Repeated Eigenvalues and Algebraic Multiplicity

• A matrix may have repeated eigenvalues, which occur when the characteristic equation has multiple roots with the same value
• The algebraic multiplicity of an eigenvalue is the number of times it appears as a root of the characteristic equation
• If an eigenvalue has an algebraic multiplicity greater than 1, the matrix is said to have a repeated eigenvalue

Calculating Eigenvectors

Solving for Eigenvectors

• For each eigenvalue $\lambda$, solve the equation $(A - \lambda I)x = 0$ to find the corresponding eigenvectors $x$
• The solution to $(A - \lambda I)x = 0$ is a vector space, known as the eigenspace of $A$ corresponding to the eigenvalue $\lambda$
• To find an eigenvector, choose a non-zero vector from the eigenspace by setting one of the variables to a non-zero value (usually 1) and solving for the remaining variables

Linearly Independent Eigenvectors

• If an eigenvalue has an algebraic multiplicity greater than 1, there may be multiple linearly independent eigenvectors associated with that eigenvalue
• The number of linearly independent eigenvectors corresponding to an eigenvalue is called its geometric multiplicity
• The geometric multiplicity of an eigenvalue is always less than or equal to its algebraic multiplicity

Verifying Eigenvector Solutions

Checking the Eigenvalue-Eigenvector Equation

• To verify that a vector $x$ is indeed an eigenvector of a matrix $A$ corresponding to an eigenvalue $\lambda$, check if the equation $Ax = \lambda x$ holds true
• Multiply the matrix $A$ by the eigenvector $x$ and compare the result with the product of the eigenvalue $\lambda$ and the eigenvector $x$

Importance of Verification

• If $Ax = \lambda x$ is satisfied, then $x$ is confirmed to be an eigenvector of $A$ corresponding to the eigenvalue $\lambda$
• Verifying the solutions ensures that the calculated eigenvalues and eigenvectors are correct
• Verification is particularly important when dealing with complex matrices or when using computational methods to find eigenvectors