Eigenspace — Definition, Formula & Examples
An eigenspace is the set of all eigenvectors associated with a particular eigenvalue of a matrix, together with the zero vector. It forms a subspace of the vector space on which the matrix acts.
Given a square matrix and an eigenvalue , the eigenspace is the null space of the matrix . That is, . This set always includes the zero vector and is closed under addition and scalar multiplication, making it a subspace.
Key Formula
Where:
- = An $n \times n$ square matrix
- = An eigenvalue of $A$
- = The $n \times n$ identity matrix
- = A vector in $\mathbb{R}^n$
How It Works
To find the eigenspace for a given eigenvalue , you form the matrix and then solve the homogeneous system . Row-reduce to find the free variables, then express the general solution as a linear combination of basis vectors. Those basis vectors span the eigenspace. The dimension of the eigenspace is called the geometric multiplicity of .
Worked Example
Problem: Find the eigenspace of the matrix corresponding to the eigenvalue .
Step 1: Compute by subtracting from each diagonal entry.
Step 2: Row-reduce to solve . Replace with .
Step 3: The system gives , so . Let .
Answer: The eigenspace is , a one-dimensional subspace of .
Why It Matters
Eigenspaces determine whether a matrix is diagonalizable: a matrix can be diagonalized exactly when the eigenspaces together span the full vector space. This arises directly in solving systems of differential equations, principal component analysis, and quantum mechanics, where the structure of eigenspaces dictates the behavior of the system.
Common Mistakes
Mistake: Forgetting that the eigenspace includes the zero vector and calling it just the set of eigenvectors.
Correction: The eigenspace is a subspace, so it must contain the zero vector by definition. The zero vector itself is not an eigenvector, but it is an element of every eigenspace.
