Historical Context & Motivation
Imagine you push a shopping cart. Usually it rolls in the direction you push, but sometimes a wobbly wheel makes it drift sideways. In mathematics, when you apply a matrix transformation (a set of rules that moves every point in a plane), most arrows change both length and direction. However, a few special arrows only get stretched or shrunk — they keep pointing the same way. Those special arrows are called eigenvectors, and finding them turns out to be one of the most powerful ideas in all of mathematics.
The word "eigen" comes from the German word meaning "own" or "characteristic." Over several centuries, mathematicians discovered that these special directions reveal deep truths about systems — from vibrating bridges to search engines.
The central question this lesson answers is: given a square matrix, how do we actually compute its eigenvectors and organize them into eigenspaces? Let's find out step by step.
Core Principles & Definitions
Before we compute anything, let's nail down the key vocabulary. Every definition below builds on the one before it, so take them in order.
Eigenvector
Eigenvalue (λ)
Characteristic Equation
Null Space
Eigenspace
Visual Explanation
The diagram below shows what a 2×2 matrix does to several vectors. Most arrows get both rotated and stretched. The two colored arrows along the eigenvector directions only change in length — they stay on the same line through the origin.
Notice that the eigenvectors in the "after" panel lie on exactly the same line as in the "before" panel. They may be longer, shorter, or even flipped backward, but the line through the origin doesn't change. Every scalar multiple of an eigenvector is also an eigenvector (for the same eigenvalue), and together they form the eigenspace — a whole line (or plane) of vectors that the matrix can only scale, never rotate.
Mathematical Framework
Here is the step-by-step recipe for computing eigenvectors and eigenspaces of a square matrix A. We will use a 2×2 matrix, but the same process works for 3×3 and beyond.
Step 1 — Set Up the Eigenvalue Equation
Step 2 — Rearrange to (A − λI)v = 0
Step 3 — Find Eigenvalues with the Characteristic Equation
Step 4 — Find Eigenvectors by Solving (A − λI)v = 0
Eigenspace Structure & Dimension
An eigenspace can be a line (1-dimensional), a plane (2-dimensional), or even higher. The dimension of the eigenspace is called the geometric multiplicity of the eigenvalue. Meanwhile, how many times the eigenvalue appears as a root of the characteristic equation is called the algebraic multiplicity. The geometric multiplicity is always less than or equal to the algebraic multiplicity.
| Property | Algebraic Multiplicity | Geometric Multiplicity |
|---|---|---|
| What it counts | Times λ appears as a root of det(A − λI) = 0 | Number of independent eigenvectors for λ |
| Also equals | Exponent of (λ − λᵢ) in the characteristic polynomial | Dimension of the eigenspace E_λ |
| Rule | Always ≥ 1 | 1 ≤ geometric ≤ algebraic |
Worked Example
Let's walk through a complete example. We will find the eigenvalues, eigenvectors, and eigenspaces of the matrix A = [[4, 1], [2, 3]].
Common Tips & Pitfalls
Computing eigenvectors is a straightforward process, but there are a few places where students commonly trip up. The table below highlights the most important do's and don'ts.
| Common Mistake | Why It's Wrong | What to Do Instead |
|---|---|---|
| Calling the zero vector an eigenvector | By definition, eigenvectors must be nonzero. A × 0 = λ × 0 is always true, so it gives no useful information. | State that the zero vector is in the eigenspace but is not itself an eigenvector. |
| Forgetting to subtract λI (subtracting λ only from one entry) | λI subtracts λ from every diagonal entry, not just one. | Write out the identity matrix I first, multiply by λ, then subtract from A. |
| Stopping after finding eigenvalues | Eigenvalues alone don't tell you the direction — eigenvectors do. | For each eigenvalue, solve (A − λI)v = 0 to find the eigenvectors. |
| Giving only one eigenvector when the eigenspace is 2-D | If the null space has dimension 2, there are two independent eigenvectors forming a basis. | Row-reduce (A − λI) fully and identify all free variables to get a complete basis. |
Connection to Advanced Topics
Once you can compute eigenvectors and eigenspaces, a whole world of powerful techniques opens up. The table below shows how the ideas in this lesson connect to more advanced topics you might study later.
| This Lesson | Advanced Extension |
|---|---|
| Finding eigenvectors of a 2×2 matrix | Diagonalization — rewriting A as PDP⁻¹ where D is a diagonal matrix of eigenvalues and P is a matrix of eigenvectors |
| Eigenspace as null space of (A − λI) | Generalized eigenspaces and Jordan normal form for matrices that can't be fully diagonalized |
| Eigenvalues from det(A − λI) = 0 | Spectral theorem: symmetric matrices always have real eigenvalues and orthogonal eigenvectors |
| Two eigenspaces for a 2×2 matrix | Principal Component Analysis (PCA) in data science — finding the most important directions in high-dimensional data |
One especially exciting application is in physics. The Schrödinger equation in quantum mechanics is an eigenvalue problem: the eigenvalues represent energy levels of atoms, and the eigenvectors describe the shapes of electron clouds. So the technique you just learned — solving (A − λI)v = 0 — is literally the same mathematics that explains how atoms work!
Practice Problems
Lesson Summary
An eigenvector of a matrix A is a nonzero vector v that satisfies Av = λv, where λ is the eigenvalue. To find eigenvalues, solve the characteristic equation det(A − λI) = 0. Then, for each eigenvalue, compute the null space of (A − λI) to find the eigenvectors. The collection of all eigenvectors for a given eigenvalue (along with the zero vector) forms the eigenspace, which is always a subspace of Rⁿ.
The dimension of an eigenspace is called its geometric multiplicity, and it is always between 1 and the algebraic multiplicity (how many times λ appears as a root). These ideas connect to powerful applications like diagonalization, population models, search engines, and quantum mechanics. The key steps are: (1) find eigenvalues from the characteristic equation, (2) for each eigenvalue, solve (A − λI)v = 0, and (3) describe the eigenspace using a basis of independent eigenvectors.