Algebraic vs Geometric Multiplicity
students, imagine a matrix as a machine that stretches, squashes, or flips vectors in space ✨. Some special vectors, called eigenvectors, keep their direction after the matrix acts on them. The matching eigenvalues tell us how much those directions are stretched or flipped. In this lesson, you will learn two important ways to count eigenvalues and understand eigenvectors: algebraic multiplicity and geometric multiplicity.
What You Will Learn
By the end of this lesson, students, you should be able to:
- explain what algebraic multiplicity and geometric multiplicity mean,
- find both multiplicities from a matrix,
- connect these ideas to eigenvalues and eigenvectors,
- and use examples to decide whether a matrix has “enough” eigenvectors.
These ideas are important because they help us understand whether a matrix can be diagonalized, which is a major goal in Linear Algebra. Diagonalization makes many calculations easier, especially for repeated transformations, computer graphics, and systems of equations 💡.
Algebraic Multiplicity: Counting Eigenvalues from the Characteristic Polynomial
To find eigenvalues, we usually start with the characteristic polynomial of a matrix $A$:
$$\det(A-\lambda I)=0$$
The values of $\lambda$ that make this equation true are the eigenvalues. The algebraic multiplicity of an eigenvalue is the number of times it appears as a root of the characteristic polynomial.
For example, suppose the characteristic polynomial is
$$ (\lambda-3)^2(\lambda+1) $$
Then the eigenvalue $3$ has algebraic multiplicity $2$, and the eigenvalue $-1$ has algebraic multiplicity $1$.
This is a counting idea from algebra. If a factor is repeated, the multiplicity tells us how many times it is repeated. If students sees $(\lambda-5)^4,$ then the eigenvalue $5$ has algebraic multiplicity $4$.
A key fact is that the sum of the algebraic multiplicities of all eigenvalues of an $n\times n$ matrix is $n$, as long as the characteristic polynomial splits into linear factors over the field being used.
Geometric Multiplicity: Counting Independent Eigenvectors
While algebraic multiplicity comes from the characteristic polynomial, geometric multiplicity comes from eigenvectors.
For an eigenvalue $\lambda$, we look at the eigenspace:
$$\{\mathbf{x} : (A-\lambda I)\mathbf{x}=\mathbf{0}\}$$
This is the set of all eigenvectors for $\lambda$ together with the zero vector. The geometric multiplicity of $\lambda$ is the dimension of this eigenspace.
In simpler words, geometric multiplicity tells us how many linearly independent eigenvectors belong to that eigenvalue.
For example, if the eigenspace for $\lambda=2$ is a line through the origin, then its dimension is $1$, so the geometric multiplicity is $1$. If it is a plane through the origin, then the geometric multiplicity is 2`.
This is a geometric idea because it measures the size of the space of eigenvectors. It tells us how many different directions are preserved by the matrix for that eigenvalue.
The Relationship Between the Two Multiplicities
Here is the most important connection, students:
For every eigenvalue $\lambda$,
$$1 \leq \text{geometric multiplicity} \leq \text{algebraic multiplicity}$$
This means the number of independent eigenvectors for an eigenvalue can never be more than how many times that eigenvalue appears in the characteristic polynomial.
Why does this matter? Because if an eigenvalue appears many times algebraically but has too few independent eigenvectors, the matrix may not have enough eigenvectors to diagonalize it.
A matrix is diagonalizable when it has enough linearly independent eigenvectors to form a basis of the whole space. For an $n\times n$ matrix, that means $n$ independent eigenvectors total.
Example 1: Algebraic Multiplicity Greater Than Geometric Multiplicity
Consider the matrix
$$A=\begin{pmatrix}2 & 1\\0 & 2\end{pmatrix}$$
Its characteristic polynomial is
$$\det(A-\lambda I)=\det\begin{pmatrix}2-\lambda & 1\\0 & 2-\lambda\end{pmatrix}=(2-\lambda)^2$$
So the only eigenvalue is $\lambda=2$, with algebraic multiplicity $2$.
Now find the eigenspace:
$$A-2I=\begin{pmatrix}0 & 1\\0 & 0\end{pmatrix}$$
We solve
$$\begin{pmatrix}0 & 1\\0 & 0\end{pmatrix}\mathbf{x}=\mathbf{0}$$
If $\mathbf{x}=\begin{pmatrix}x_1\x_2\end{pmatrix}$, then the equation gives $x_2=0$. So the eigenvectors are all vectors of the form
$$\begin{pmatrix}x_1\\0\end{pmatrix}$$
This eigenspace is a line, so its dimension is $1$. Therefore, the geometric multiplicity of $2$ is $1$.
So for this matrix:
- algebraic multiplicity of $2$ is $2$,
- geometric multiplicity of $2$ is $1$.
This matrix is not diagonalizable because it has only one linearly independent eigenvector, not two.
Example 2: When the Multiplicities Match
Consider the diagonal matrix
$$B=\begin{pmatrix}4 & 0\\0 & 4\end{pmatrix}$$
The characteristic polynomial is
$$\det(B-\lambda I)=(4-\lambda)^2$$
So the eigenvalue $4$ has algebraic multiplicity $2$.
Now solve
$$B-4I=\begin{pmatrix}0 & 0\\0 & 0\end{pmatrix}$$
Every vector in $\mathbb{R}^2$ satisfies
$$ (B-4I)\mathbf{x}=\mathbf{0} $$
So the eigenspace is all of $\mathbb{R}^2$, which has dimension $2$. Therefore the geometric multiplicity is $2$.
Here the algebraic and geometric multiplicities are equal. The matrix is diagonalizable, which makes sense because it is already diagonal.
How to Find Each Multiplicity Step by Step
students, here is a reliable process:
Step 1: Find the characteristic polynomial
Compute
$$\det(A-\lambda I)$$
and factor it.
Step 2: Read algebraic multiplicity
Count how many times each factor appears. If the factor is $(\lambda-\lambda_0)^k,$ then the algebraic multiplicity of $\lambda_0$ is $k$.
Step 3: Find the eigenspace
For each eigenvalue $\lambda_0$, solve
$$ (A-\lambda_0 I)\mathbf{x}=\mathbf{0} $$
Step 4: Count independent eigenvectors
The number of free variables in the solution gives the dimension of the eigenspace. That dimension is the geometric multiplicity.
A common mistake is to count all eigenvectors instead of counting independent ones. For geometric multiplicity, only the number of linearly independent directions matters.
Why These Multiplicities Matter
Algebraic and geometric multiplicity are not just vocabulary words. They help answer deeper questions about a matrix.
If the geometric multiplicity of each eigenvalue adds up to $n$, then the matrix has enough eigenvectors to form a basis and is diagonalizable. If not, diagonalization fails.
This matters in real-world situations where repeated matrix actions occur. For example, in population models, engineering systems, and computer animations, diagonalization can make repeated calculations faster and easier. A matrix with too few eigenvectors may require more advanced tools.
These multiplicities also reveal structure. An eigenvalue that repeats algebraically but has low geometric multiplicity suggests the matrix has a “more tangled” behavior. It stretches in a direction but may also mix coordinates in a way that prevents enough independent eigenvectors from appearing.
Connection to Broader Eigenvalue Ideas
The topic of eigenvalues and eigenvectors is about finding directions that stay special under a transformation. Multiplicity tells us how rich that special behavior is.
- Algebraic multiplicity tells us how often an eigenvalue appears.
- Geometric multiplicity tells us how many independent eigenvector directions come with it.
- Together, they help determine whether a matrix is diagonalizable.
A good memory aid is this:
- algebraic multiplicity = “count from the polynomial,”
- geometric multiplicity = “count from the eigenspace.”
When students compares them, ask:
- How many times does the eigenvalue appear?
- How many independent eigenvectors does it actually have?
- Are there enough eigenvectors overall?
Conclusion
Algebraic multiplicity and geometric multiplicity are two different ways to measure the importance of an eigenvalue. Algebraic multiplicity comes from the characteristic polynomial, while geometric multiplicity comes from the dimension of the eigenspace. The geometric multiplicity is always at least $1$ and never greater than the algebraic multiplicity.
Understanding both helps students analyze whether a matrix is diagonalizable and how its eigenvectors behave. These ideas are central to Linear Algebra because they connect polynomial factoring, systems of equations, and geometric structure into one powerful framework 📘.
Study Notes
- Algebraic multiplicity of an eigenvalue is the number of times it appears as a root of $\det(A-\lambda I)=0$.
- Geometric multiplicity of an eigenvalue is the dimension of its eigenspace, found by solving $(A-\lambda I)\mathbf{x}=\mathbf{0}$.
- For every eigenvalue, $1 \leq$ geometric multiplicity $\leq$ algebraic multiplicity.
- If the algebraic and geometric multiplicities are equal for every eigenvalue and the total number of independent eigenvectors is $n$, then an $n\times n$ matrix is diagonalizable.
- Repeated eigenvalues do not automatically mean many eigenvectors; sometimes one repeated eigenvalue has only one independent eigenvector.
- A matrix like $\begin{pmatrix}2 & 1\\0 & 2\end{pmatrix}$ has eigenvalue $2$ with algebraic multiplicity $2$ but geometric multiplicity $1$.
- A diagonal matrix like $\begin{pmatrix}4 & 0\\0 & 4\end{pmatrix}$ has eigenvalue $4$ with algebraic multiplicity $2$ and geometric multiplicity $2$.
- Algebraic multiplicity comes from factoring a polynomial; geometric multiplicity comes from counting independent solutions to a linear system.
- These multiplicities help predict whether a matrix has enough eigenvectors to simplify calculations.