Matrix Spectrum — Definition, Formula & Examples
The matrix spectrum is the set of all eigenvalues of a square matrix. It is often denoted and captures essential information about the matrix's behavior.
For a square matrix (or ), the spectrum of , written , is the set of all scalars satisfying , where is the identity matrix. Equivalently, .
Key Formula
Where:
- = A square matrix
- = An eigenvalue of A
- = The identity matrix of the same size as A
- = The spectrum (set of all eigenvalues) of A
How It Works
To find the spectrum of a matrix, you solve the characteristic equation for . The resulting roots — counted with or without multiplicity depending on context — form the spectrum. The spectral radius, , measures the largest magnitude among eigenvalues and governs matrix power convergence and stability.
Worked Example
Problem: Find the spectrum of the matrix A = [[4, 1], [0, 3]].
Step 1: Set up the characteristic equation by computing det(A − λI) = 0.
Step 2: Since the matrix is upper triangular, the determinant is the product of the diagonal entries.
Step 3: Solve for λ to get the eigenvalues.
Answer: The spectrum is .
Why It Matters
The spectrum determines whether a system of differential equations is stable, whether an iterative numerical method converges, and how a matrix transforms space. In control theory and data science, spectral analysis of matrices is a routine and essential tool.
Common Mistakes
Mistake: Confusing the spectrum with just the list of eigenvalues including repeated entries.
Correction: The spectrum is a set, so each distinct eigenvalue appears once. Algebraic multiplicity is tracked separately when needed.
