91Ó°ÊÓ

The characteristic polynomial is a critical concept when working with matrices and eigenvalues. It is a polynomial which is derived from the matrix itself. To find this polynomial for a matrix \(A\), you calculate \(\det(A - \lambda I)\), where \(\lambda\) is a scalar and \(I\) is the identity matrix of the same size as \(A\).
This polynomial helps in identifying the eigenvalues of a matrix as they are the roots of this polynomial. For example, if you have a matrix \(A\) and find \(A - \lambda I\), you subtract \(\lambda\) from each diagonal element of \(A\) to get the new matrix. Finding the determinant of this matrix yields a polynomial in \(\lambda\).

• The degree of the characteristic polynomial matches the dimension of the square matrix \(A\).
• Solutions to the polynomial, i.e., values of \(\lambda\) that make the polynomial zero, are the eigenvalues of \(A\).
• In our specific case, the polynomial is \(\lambda^4 - 9\lambda^3 + 28\lambda^2 - 36\lambda + 18\).

The eigenspace of a matrix corresponding to a particular eigenvalue is a set of all vectors that satisfy the eigen equation \(A\mathbf{v} = \lambda \mathbf{v}\). This essentially means that multiplying the matrix \(A\) with a vector \(\mathbf{v}\) does not change the direction of \(\mathbf{v}\); it only scales it by \(\lambda\).
To find the eigenspace, one must solve the equation \((A - \lambda I)\mathbf{v} = \mathbf{0}\).

• This equation is a homogeneous system of linear equations.
• The solutions to this system form a vector space, called the eigenspace.
• The eigenspace is spanned by the basis vectors that solve this equation.

For each eigenvalue, there exists a corresponding eigenspace. If an eigenvalue is \(\lambda = 4\) for matrix \(A\), you find the null space of \(A - 4I\). The dimensions of this null space give you the number of independent vectors needed to describe the eigenspace.

Algebraic multiplicity refers to the number of times an eigenvalue appears as a root in the characteristic polynomial of the matrix. It provides insight into how dominant an eigenvalue is within the context of the matrix. In simple terms, it's the degree of the root in the factorization of the characteristic polynomial.

• Each eigenvalue may have a different algebraic multiplicity.
• An eigenvalue that appears twice is said to have an algebraic multiplicity of 2.

This property is crucial because it influences the stability and behavior of systems modeled by matrices. For example, for our matrix \(A\), the eigenvalue \(\lambda = 4\) has an algebraic multiplicity of 2, indicating it contributes twice as strongly to the overarching characteristics of \(A\).

Geometric multiplicity is the dimension of the eigenspace associated with a given eigenvalue, reflecting the number of linearly independent eigenvectors corresponding to that eigenvalue. It must always be less than or equal to its algebraic multiplicity.

• A geometric multiplicity of 1 means there is only one independent direction in the eigenspace.
• If the geometric multiplicity is less than the algebraic multiplicity, the matrix does not have enough independent eigenvectors to diagonalize it.

Understanding geometric multiplicity helps in predicting the behavior of transformations associated with the matrix. For instance, if algebraic and geometric multiplicities are equal, the matrix is diagonalizable. In our case, \(\lambda = 4\) may have a geometric multiplicity of 1 or 2, depending on the specifics of the null space, thus requiring careful analysis of the basis vectors.