Introduction to Eigenvalue Multiplicities
In linear algebra, eigenvalues of a square matrix capture fundamental scaling properties of linear transformations. When an eigenvalue appears more than once, two distinct concepts describe its repetition: algebraic multiplicity and geometric multiplicity. Understanding the difference between these multiplicities is essential for topics ranging from diagonalization and Jordan canonical forms to stability analysis in differential equations. This article explains the definitions, illustrates the relationship between the two, and provides step‑by‑step procedures for computing each multiplicity, supported by geometric intuition and practical examples No workaround needed..
Algebraic Multiplicity
Definition
The algebraic multiplicity of an eigenvalue ( \lambda ) is the number of times ( \lambda ) occurs as a root of the characteristic polynomial
[ p_A(\lambda)=\det(A-\lambda I), ]
where ( A ) is an ( n\times n ) matrix and ( I ) is the identity matrix of the same size. Formally, if
[ p_A(\lambda)= (\lambda-\lambda_1)^{m_1}(\lambda-\lambda_2)^{m_2}\cdots(\lambda-\lambda_k)^{m_k}, ]
then the algebraic multiplicity of ( \lambda_i ) is ( m_i ) And that's really what it comes down to..
Key Properties
-
Sum of algebraic multiplicities equals the matrix size:
[ \sum_{i=1}^{k} m_i = n. ]
-
The algebraic multiplicity is always a positive integer; it can be larger than 1 only when the characteristic polynomial has repeated roots.
-
It is invariant under similarity transformations: if ( B = P^{-1}AP ), then ( A ) and ( B ) share the same characteristic polynomial, and consequently the same algebraic multiplicities.
Computing Algebraic Multiplicity
- Form the characteristic matrix ( A-\lambda I ).
- Compute the determinant to obtain ( p_A(\lambda) ).
- Factor the polynomial (over (\mathbb{R}) or (\mathbb{C}) as appropriate).
- Count the exponent of each distinct root; that exponent is the algebraic multiplicity.
Example:
[ A=\begin{bmatrix} 4 & 1\ 0 & 4 \end{bmatrix}. ]
(p_A(\lambda)=\det!\begin{bmatrix}4-\lambda & 1\0 & 4-\lambda\end{bmatrix}= (4-\lambda)^2).
Thus, the eigenvalue ( \lambda=4 ) has algebraic multiplicity 2 Practical, not theoretical..
Geometric Multiplicity
Definition
The geometric multiplicity of an eigenvalue ( \lambda ) is the dimension of its eigenspace
[ E_\lambda = {,\mathbf{v}\in\mathbb{F}^n \mid (A-\lambda I)\mathbf{v}=0,}, ]
i.Because of that, e. , the number of linearly independent eigenvectors associated with ( \lambda ). Simply put, it counts how many independent directions are scaled by the factor ( \lambda ).
Key Properties
-
Always ≤ algebraic multiplicity:
[ 1\le \text{geom mult}(\lambda) \le \text{alg mult}(\lambda). ]
-
If the geometric multiplicity equals the algebraic multiplicity for every eigenvalue, the matrix is diagonalizable Nothing fancy..
-
Geometric multiplicity is also invariant under similarity, because eigenspaces are mapped bijectively by the similarity matrix Small thing, real impact..
Computing Geometric Multiplicity
-
Form the matrix ( A-\lambda I ) for the eigenvalue of interest.
-
Row‑reduce (or compute the rank) to find the null space Small thing, real impact..
-
Determine the dimension of the null space:
[ \text{geom mult}(\lambda)= n-\operatorname{rank}(A-\lambda I). ]
Example (continuing the previous matrix):
[ A-4I = \begin{bmatrix} 0 & 1\ 0 & 0 \end{bmatrix}. ]
The rank is 1, so the null space dimension is (2-1=1). Hence, the geometric multiplicity of ( \lambda=4 ) is 1.
Relationship Between Algebraic and Geometric Multiplicities
The inequality
[ 1 \le \text{geom mult}(\lambda) \le \text{alg mult}(\lambda) ]
captures the essential relationship. When the two multiplicities coincide, each repeated eigenvalue contributes a full set of linearly independent eigenvectors, allowing a basis of eigenvectors for the whole space. When the geometric multiplicity is strictly smaller than the algebraic multiplicity, the matrix cannot be diagonalized; instead, it admits a Jordan block structure.
Visual Interpretation
Algebraic multiplicity can be imagined as the thickness of a root on the characteristic polynomial curve—how many times the curve touches the horizontal axis at that eigenvalue Which is the point..
Geometric multiplicity represents the number of independent directions in the vector space that are invariant under the transformation. If the “thickness” exceeds the number of directions, some of the “extra copies” of the eigenvalue must be accommodated by generalized eigenvectors, leading to the Jordan chain.
Step‑by‑Step Example: A 4×4 Matrix
Consider
[ A=\begin{bmatrix} 5 & 1 & 0 & 0\ 0 & 5 & 1 & 0\ 0 & 0 & 5 & 1\ 0 & 0 & 0 & 5 \end{bmatrix}. ]
1. Algebraic Multiplicity
(p_A(\lambda)=\det(A-\lambda I) = (5-\lambda)^4).
Thus, eigenvalue ( \lambda=5 ) has algebraic multiplicity 4.
2. Geometric Multiplicity
[ A-5I = \begin{bmatrix} 0 & 1 & 0 & 0\ 0 & 0 & 1 & 0\ 0 & 0 & 0 & 1\ 0 & 0 & 0 & 0 \end{bmatrix}. ]
Row‑reducing yields a rank of 3, so
[ \text{geom mult}(5)=4-3=1. ]
Only one linearly independent eigenvector exists; the matrix is not diagonalizable. Its Jordan form contains a single (4\times4) Jordan block.
3. Constructing Generalized Eigenvectors
To form a Jordan chain, solve
[ (A-5I)\mathbf{v}_1 = 0,\quad (A-5I)\mathbf{v}_2 = \mathbf{v}_1,\quad (A-5I)\mathbf{v}_3 = \mathbf{v}_2,\quad (A-5I)\mathbf{v}_4 = \mathbf{v}_3. ]
The resulting chain ({\mathbf{v}_1,\mathbf{v}_2,\mathbf{v}_3,\mathbf{v}_4}) supplies a basis that puts (A) into its Jordan canonical form Simple, but easy to overlook. Less friction, more output..
Why Multiplicities Matter in Applications
Differential Equations
For a linear system (\dot{\mathbf{x}} = A\mathbf{x}), eigenvalues determine solution behavior. Repeated eigenvalues with full geometric multiplicity lead to simple exponential terms (e^{\lambda t}). Still, when geometric multiplicity is deficient, polynomial factors multiply the exponentials (e. So g. , ((t^k)e^{\lambda t})), altering stability and transient response The details matter here..
Vibrations and Modal Analysis
In mechanical systems, eigenvalues correspond to natural frequencies. An algebraic multiplicity greater than one indicates a degenerate frequency. Practically speaking, if the geometric multiplicity equals the algebraic multiplicity, the mode shapes are orthogonal and easy to decouple. Otherwise, mode coupling occurs, requiring generalized modes for accurate modeling.
Graph Theory
The Laplacian matrix of a graph always has eigenvalue (0). On the flip side, its algebraic multiplicity equals the number of connected components, while its geometric multiplicity equals the same number (because the Laplacian is symmetric). This coincidence illustrates a case where the two multiplicities match, guaranteeing diagonalizability.
Frequently Asked Questions
Q1: Can an eigenvalue have algebraic multiplicity zero?
A: No. By definition, an eigenvalue must be a root of the characteristic polynomial, so its algebraic multiplicity is at least 1.
Q2: If the geometric multiplicity equals 1, does that imply the matrix is defective?
A: Not necessarily. A matrix is defective when any eigenvalue has geometric multiplicity strictly less than its algebraic multiplicity. If all eigenvalues have algebraic multiplicity 1, geometric multiplicity will also be 1, and the matrix is diagonalizable.
Q3: How does symmetry affect multiplicities?
A: Real symmetric (or Hermitian) matrices are always diagonalizable. For such matrices, every eigenvalue’s geometric multiplicity equals its algebraic multiplicity. This stems from the spectral theorem, which guarantees an orthonormal eigenbasis.
Q4: Can geometric multiplicity exceed algebraic multiplicity?
A: No. The inequality ( \text{geom mult}(\lambda) \le \text{alg mult}(\lambda) ) holds for all matrices over any field.
Q5: What is the role of field choice (real vs. complex) in multiplicities?
A: The characteristic polynomial may factor completely over (\mathbb{C}) but not over (\mathbb{R}). Over (\mathbb{C}), every eigenvalue appears with its algebraic multiplicity as a complex root. Over (\mathbb{R}), complex conjugate pairs are often treated together, but the definitions of multiplicities remain the same; only the set of eigenvalues considered changes Easy to understand, harder to ignore..
Practical Tips for Students
- Always verify the characteristic polynomial before assuming multiplicities; a mis‑factored polynomial leads to incorrect conclusions.
- Use rank‑nullity: computing the null space of (A-\lambda I) is the quickest way to obtain geometric multiplicity.
- Check diagonalizability by comparing the two multiplicities for each eigenvalue; if they match for all, you can construct a matrix (P) of eigenvectors such that (P^{-1}AP) is diagonal.
- When stuck on factoring, consider numerical methods (e.g., QR algorithm) to approximate eigenvalues, then refine symbolic factors around those approximations.
- Remember the Jordan perspective: a deficiency in geometric multiplicity signals the presence of Jordan blocks, which are crucial for understanding powers of (A) and matrix exponentials.
Conclusion
Algebraic and geometric multiplicities provide complementary lenses through which to view eigenvalues. Now, their relationship—captured by the inequality (1 \le \text{geom mult} \le \text{alg mult})—determines whether a matrix can be diagonalized, influences the structure of its Jordan form, and shapes the behavior of systems modeled by the matrix. The algebraic multiplicity quantifies how many times an eigenvalue repeats as a root of the characteristic polynomial, while the geometric multiplicity measures the number of independent eigenvectors associated with that eigenvalue. Mastering the computation and interpretation of these multiplicities equips students and professionals alike with a deeper, more intuitive grasp of linear transformations across mathematics, physics, engineering, and beyond.
