91Ó°ÊÓ

The characteristic polynomial is a crucial concept when working with eigenvalues and eigenvectors. It helps identify the values of lambda (eigenvalues) that satisfy the equation \( A \mathbf{x} = \lambda \mathbf{x} \), where \( A \) is a square matrix. In simple terms, the characteristic polynomial is derived by finding the determinant of \( A - \lambda I \), where \( I \) is the identity matrix with the same dimensions as \( A \).

For the given matrix \( A \), subtracting \( \lambda I \) results in an upper triangular matrix, allowing us to compute the determinant easily as the product of its diagonal elements:

• \( (2-\lambda)(1-\lambda)(3-\lambda)(2-\lambda) \)

This gives us the characteristic polynomial \( (2-\lambda)^2(1-\lambda)(3-\lambda) \). The roots of this polynomial are the eigenvalues of the matrix, revealing the intrinsic characteristics of \( A \). Always remember, the characteristic polynomial forms the basis for further exploration of a matrix's behavior through its eigenvalues.

Eigenspace is directly linked to the eigenvectors of a matrix. When you plug an eigenvalue back into the equation \( A\mathbf{x} = \lambda \mathbf{x} \), the solutions form a subspace known as the eigenspace for that particular eigenvalue. Essentially, the eigenspace consists of all possible vectors (eigenvectors) that satisfy this equation.

Finding a basis for each eigenspace involves solving the homogeneous system \( (A - \lambda I)\mathbf{x} = \mathbf{0} \). For each eigenvalue, reduce \( A - \lambda I \) to row echelon form and observe where free variables appear:

• For \( \lambda = 2 \): The eigenspace is represented by vectors like \((0, 0, 1, 0)^T\) and \((0, -1, 0, 1)^T\).
• For \( \lambda = 1 \): The basis can be \((1, -1, 0, 0)^T\).
• For \( \lambda = 3 \): The basis vector is \((0, 0, 0, 1)^T\).

Understanding eigenspaces aids in describing vector transformations through the matrix \( A \). Each eigenspace characterizes directions in which such transformations are straightforward developments, following a stretching or compressing pattern.

Algebraic multiplicity tells you how many times a particular eigenvalue appears as a root of the characteristic polynomial. This is especially important because it gives insight into the structure of a matrix. In essence, algebraic multiplicity is defined by the exponent of the corresponding factor in the characteristic polynomial.

In the context of the given exercise:

• Eigenvalue \( \lambda = 2 \) appears with an algebraic multiplicity of 2, meaning it is counted twice in the polynomial \( (2-\lambda)^2(1-\lambda)(3-\lambda) \).
• Eigenvalues \( \lambda = 1 \) and \( \lambda = 3 \) each have an algebraic multiplicity of 1.

Recognizing algebraic multiplicity is crucial for confirming whether the matrix is diagonalizable, as it closely interacts with geometric multiplicity, another key concept.

Geometric multiplicity highlights the dimension of the eigenspace for a particular eigenvalue. In simpler terms, it's the number of linearly independent eigenvectors corresponding to that eigenvalue. To calculate it, count the number of basis vectors found in the eigenspace.

In our exercise, for the eigenvalues, we have:

• \( \lambda = 2 \) has a geometric multiplicity of 2 with two independent eigenvectors, \((0, 0, 1, 0)^T\) and \((0, -1, 0, 1)^T\).
• \( \lambda = 1 \) and \( \lambda = 3 \) both exhibit a geometric multiplicity of 1.

Understanding geometric multiplicity aids in analyzing the matrix's potential diagonalization, comparing if it equals the algebraic multiplicity. If so, it suggests the matrix is fully diagonalizable. It helps to illustrate how vectors can span within an eigenspace along distinct directions.