91Ó°ÊÓ

Eigenvalues are special numbers associated with a square matrix. They offer insights into many properties of the matrix, especially when it comes to transformations. In simple terms, when a matrix acts on a vector, the vector's direction may change unless it's parallel to one of these special vectors called eigenvectors. Each eigenvector is associated with an eigenvalue that indicates how much the vector gets stretched or shrunk.

To find an eigenvalue for a matrix, we look for solutions to the equation \( A \mathbf{v} = \lambda \mathbf{v} \), where \( A \) is the matrix, \( \mathbf{v} \) is the eigenvector, and \( \lambda \) is the eigenvalue. This is rearranged to \((A - \lambda I) \mathbf{v} = 0\).

• Eigenvectors are nonzero vectors whose direction remains unchanged by the matrix.
• Eigenvalues can tell us if a matrix can be diagonalized, depending on their distinctness.

The characteristic polynomial is a vital tool in determining the eigenvalues of a matrix. It is derived from the characteristic equation \( \det(A - \lambda I) = 0 \), where \( \det \) denotes the determinant and \( I \) is the identity matrix of the same size as \( A \). Solving this polynomial gives the eigenvalues of the matrix.

Here's why it's significant: By expanding and simplifying this polynomial, you build a function in terms of \( \lambda \) such that the roots of this function are the eigenvalues. In our case, the final polynomial was \( \lambda^3 - 7\lambda^2 + 12\lambda - 4\).

• The degree of the polynomial equals the size of the matrix.
• Solving it yields real or complex eigenvalues depending on the roots.

The determinant is a scalar value that gives important clues about a matrix. It's like checking a signal—if it's zero, the matrix doesn’t behave well (in certain ways), meaning it doesn't have an inverse. In the context of eigenvalues and diagonalization, calculating \( \det(A - \lambda I) \) is essential because it forms the characteristic polynomial.

Consider the determinant in broader terms:

• If it’s zero for a value of \( \lambda \), \( \lambda \) is an eigenvalue.
• Non-zero determinants mean that this matrix has full rank, indicating potentially distinct eigenvalues.

Always remember, without the determinant leading to zero, the characteristic equation wouldn't provide any meaningful roots—the eigenvalues.

A diagonalizable matrix is one that can be expressed in a diagonal form through a similarity transformation. This means there's a basis of eigenvectors which transforms the matrix into a diagonal matrix, simplifying many computations.

• Having distinct eigenvalues is a strong indicator that a matrix is diagonalizable.
• Why simplify? Because diagonal matrices are straightforward to compute with, making operations like finding powers easy.

When a matrix is diagonalizable, its complex operations reduce to simple algebraic calculations, rendering them not just computationally efficient but conceptually clear. In our example, matrix \( A \) was diagonalizable because it had distinct eigenvalues.