Finding the basis of an eigenspace is one of those linear algebra skills that looks intimidating in a textbook but becomes almost mechanical once you see the pattern underneath. The whole procedure reduces to solving a homogeneous system of linear equations and reading off the free variables. This guide walks through the definition, the exact step-by-step method, three fully worked examples (including the tricky cases where eigenvalues repeat), and the conceptual reasons why the method works.
What Is an Eigenspace, Exactly?
Given a square matrix A of size n × n, a nonzero vector v is an eigenvector of A if
Av = λv
for some scalar λ, called the eigenvalue associated with v. Geometrically, A stretches, shrinks, or flips v without rotating it off its own line.
The eigenspace corresponding to λ, written E_λ, is the collection of all vectors satisfying that equation, together with the zero vector:
E_λ = { v : Av = λv } = { v : (A − λI)v = 0 }
Two facts matter here:
- An eigenspace is a subspace of ℝⁿ (or ℂⁿ), so it always contains 0 and is closed under addition and scalar multiplication
Because an eigenspace is a subspace, we can fully describe it by giving a basis—a set of linearly independent vectors that span the space. The dimension of that eigenspace is called the geometric multiplicity of the eigenvalue λ. The algorithm below shows how to extract that basis from the matrix A itself.
Step‑by‑Step: Finding a Basis for the Eigenspace
-
Form the shifted matrix
For the eigenvalue λ, construct (A - \lambda I), where (I) is the identity matrix of the same size as A Easy to understand, harder to ignore. Turns out it matters.. -
Set up the homogeneous system
Write ((A - \lambda I)\mathbf{x} = \mathbf{0}). Every solution (\mathbf{x}) is an eigenvector (or the zero vector) associated with λ. -
Solve the system
Use Gaussian elimination (row reduction) to bring (A - \lambda I) to reduced row‑ech