91Ó°ÊÓ

A characteristic polynomial is a tool we use in linear algebra to assess the properties of a square matrix. It serves as a bridge between the matrix and its eigenvalues—a key feature of matrices. Given a matrix, the characteristic polynomial can be derived by first framing the characteristic equation, which is typically set as the determinant of the matrix subtracted by a scalar multiple of the identity matrix, represented often by \( \lambda I \). Then, compute this determinant and obtain a polynomial in terms of \( \lambda \).
For example, if you have a matrix \( C(p) \) and the identity matrix \( I \), the characteristic polynomial can be expressed as \( \det(C(p) - \lambda I) \). This results in a polynomial where the coefficients give insights into important properties like eigenvalues. For the companion matrix \( C(p) = \begin{bmatrix} 0 & -b \ 1 & -a \end{bmatrix} \) derived from a polynomial \( p(x) = x^2 + ax + b \), its characteristic polynomial becomes \( \lambda^2 + a\lambda + b \).

• This characteristic polynomial directly ties to the original polynomial \( p(x) \).
• It's essential to understand that the roots of this polynomial are the eigenvalues of the matrix.

Eigenvalues are distinctive scalars associated with a particular linear transformation or matrix. They symbolize the value by which an eigenvector is stretched during a transformation.
For any matrix \( A \), an eigenvalue \( \lambda \) satisfies the equation \( Av = \lambda v \), where \( v \) is an eigenvector.
In context with a companion matrix \( C(p) \), the eigenvalues can be understood by solving the characteristic polynomial. For example,

• The characteristic polynomial \( \lambda^2 + a\lambda + b \) equates to zero to find eigenvalues.
• The roots \( \lambda \) of the equation \( \lambda^2 + a\lambda + b = 0 \) are the eigenvalues of the matrix.

Understanding eigenvalues is critical for unraveling the behavior of the matrix concerning its transformations, stability, and other properties.

An eigenvector is a non-zero vector that remains in its span (line of action) before and after applying a linear transformation, except it may be stretched or compressed by its eigenvalue. In mathematical terms, this is expressed as the equation \( Av = \lambda v \), where \( \lambda \) is an eigenvalue, \( A \) is the matrix, and \( v \) is the eigenvector.
For the companion matrix \( C(p) \) in the exercise, it's shown that for an eigenvalue \( \lambda \), the vector \( \begin{bmatrix} \lambda \ 1 \end{bmatrix} \) is an eigenvector. This means:

• The vector maintains its direction, only scaling by the factor \( \lambda \).
• The eigenvector provides a significant insight into the geometric transformation represented by matrix \( C(p) \).

To verify an eigenvector, plug it into \( (C(p) - \lambda I)v = 0 \), confirming the zero vector is attained, which aligns with the exercise's solution.

A polynomial is an expression consisting of variables and coefficients, constructed using only sums, products, and non-negative integer exponents of variables. Polynomials span various degrees, the highest of which determines the polynomial's degree.
In the exercise, the polynomial \( p(x) = x^2 + ax + b \) plays a central role in constructing the companion matrix \( C(p) \) and examining its properties. It consists of:

• The degree of this polynomial, which is 2, corresponding to the highest power of \( x^2 \).
• The coefficients \( a \) and \( b \), dictating the linear and constant terms respectively.
• This quadratic polynomial determines the characteristic polynomial and inherently, the eigenvalues via its solutions.

Understanding the structure and degree of a polynomial is crucial, as it influences the nature of the matrix and the complexity of solutions—key when exploring linear transformations and systems of equations.