Course contentsShow
← Mathematics
Lesson 2196 of 3,12145. Linear Algebra — Determinants and EigenvaluesFree lesson

Geometric and Algebraic Multiplicity

Understanding how eigenvalue multiplicities determine whether a matrix is diagonalizable.

Geometric and Algebraic Multiplicity

You'll learn how the relationship between geometric and algebraic multiplicity determines whether a matrix can be diagonalized.

The Two Types of Multiplicity

When working with eigenvalues, you've encountered two distinct measures:

  • Algebraic multiplicity: How many times an eigenvalue appears as a root of the characteristic polynomial
  • Geometric multiplicity: The dimension of the eigenspace for that eigenvalue (the number of linearly independent eigenvectors)

The Critical Relationship

Here's the key insight: For any eigenvalue, the geometric multiplicity is always less than or equal to the algebraic multiplicity.

Think of it this way: the characteristic polynomial "promises" a certain number of eigenvalues (algebraic multiplicity), but the matrix might not deliver enough independent eigenvectors (geometric multiplicity) to match.

The Diagonalization Connection

A matrix is diagonalizable if and only if for every eigenvalue, the geometric multiplicity equals the algebraic multiplicity.

Why This Matters

To diagonalize an n × n matrix, you need n linearly independent eigenvectors to form matrix P. If some eigenvalue has algebraic multiplicity 3 but only 2 independent eigenvectors (geometric multiplicity 2), you're short one eigenvector—and diagonalization fails.

Example Scenario

Suppose a 4×4 matrix has eigenvalue λ = 5 with algebraic multiplicity 3. If you can only find 2 linearly independent eigenvectors for λ = 5, the geometric multiplicity is 2. Since 2 ≠ 3, this matrix cannot be diagonalized.

Key Takeaway: A matrix is diagonalizable when geometric multiplicity equals algebraic multiplicity for all eigenvalues—ensuring you have enough independent eigenvectors to build the diagonalization.