Definition of the Characteristic Polynomial
You'll learn how the characteristic polynomial packages all eigenvalue information into one algebraic expression.
What Is the Characteristic Polynomial?
The characteristic polynomial of an n×n matrix A is defined as:
p(λ) = det(A - λI)
where λ (lambda) is a variable, I is the n×n identity matrix, and det denotes the determinant.
This polynomial is the bridge between matrix algebra and eigenvalue computation. When you subtract λI from A, you're shifting the diagonal entries by λ, creating a new matrix whose determinant depends on λ.
Why Does This Matter?
Remember from the previous lesson that eigenvalues satisfy (A - λI)v = 0 for some nonzero vector v. This equation has nontrivial solutions only when A - λI is singular (non-invertible). A matrix is singular precisely when its determinant equals zero.
Therefore, the eigenvalues of A are exactly the roots of the characteristic polynomial.
Example Walkthrough
For a 2×2 matrix:
A = [3 1]
[1 3]
The characteristic polynomial is:
det(A - λI) = det([3-λ 1 ])
[1 3-λ ])
= (3-λ)(3-λ) - (1)(1)
= λ² - 6λ + 8
Setting this equal to zero gives eigenvalues λ = 2 and λ = 4.
The degree of the polynomial equals the matrix size, so an n×n matrix has (counting multiplicities) exactly n eigenvalues.
Key Takeaway: The characteristic polynomial p(λ) = det(A - λI) encodes all eigenvalue information, with eigenvalues appearing as its roots—giving us a systematic algebraic method to find them.