Characteristic Polynomials: Unlocking Eigenvalues, Eigenvectors, and Matrix Diagonalization
Compute characteristic polynomials and eigenvalues step by step. Understand det(A - λI), spectral decomposition, and how eigenvalues reveal matrix behavior.
The characteristic polynomial is one of the most powerful tools in linear algebra, serving as the gateway to eigenvalues, eigenvectors, and matrix diagonalization. For any square matrix A, the characteristic polynomial is defined as p(λ) = det(A - λI), where λ is a scalar variable and I is the identity matrix of the same dimension. The roots of this polynomial are the eigenvalues of A, which encode essential information about the matrix's behavior under linear transformation.
Eigenvalues reveal how a matrix scales vectors along specific directions. A positive eigenvalue indicates stretching, a negative eigenvalue indicates reversal, and a complex eigenvalue indicates rotation. These properties make the characteristic polynomial indispensable in physics (vibration analysis), engineering (stability testing), computer science (PageRank), and data science (principal component analysis).
Core Formula
p(λ) = det(A - λI) = 0
For 2×2: λ² - tr(A)λ + det(A) = 0
For 3×3: -λ³ + tr(A)λ² - (sum of cofactors)λ + det(A) = 0
The 2×2 Case: A Quadratic Equation
For a 2×2 matrix [[a,b],[c,d]], the characteristic polynomial simplifies to λ² - (a+d)λ + (ad - bc) = 0. This is a quadratic equation where the coefficient of λ is the negative trace (sum of diagonal elements) and the constant term is the determinant. The quadratic formula immediately yields the two eigenvalues, which may be real and distinct, real and repeated, or complex conjugates.
The 3×3 Case: A Cubic Equation
For a 3×3 matrix, the characteristic polynomial is a cubic: -λ³ + (trace)λ² - (sum of principal 2×2 minors)λ + det(A) = 0. Solving cubic equations analytically requires Cardano's formula, though numerical methods (Newton-Raphson, QR algorithm) are used in practice. The sum of principal 2×2 minors equals the sum of the diagonal cofactors, providing a direct connection between cofactor expansion and spectral analysis.
Geometric Interpretation
The characteristic polynomial encodes how a linear transformation distorts space. Its roots (eigenvalues) tell you the scaling factors along eigenvector directions. If all eigenvalues are real and distinct, the matrix is diagonalizable, meaning it can be decomposed as A = PDP⁻¹ where D is diagonal. This decomposition dramatically simplifies matrix powers, exponentials, and system solving.
- Trace-Determinant Relationship: The sum of eigenvalues equals the trace; the product equals the determinant.
- Stability Analysis: A matrix is stable if all eigenvalues have negative real parts, critical in control systems.
- PCA: Principal Component Analysis uses eigenvalues of the covariance matrix to identify data dimensions of maximum variance.
- Quantum Mechanics: Observable quantities are eigenvalues of Hermitian operators.
Key Takeaway
The characteristic polynomial det(A - λI) = 0 is the fundamental equation for finding eigenvalues. Its coefficients relate to the trace, cofactor sums, and determinant. Solving it reveals the spectral properties of the matrix, enabling diagonalization, stability analysis, and dimensionality reduction.