Direct Sum of Eigenspaces
Suppose a linear operator has several different eigenvalues. Each has its own eigenspace of possibly high dimension. A natural question arises. Can these eigenspaces overlap in some hidden, nontrivial way? Or do they fit together as cleanly as possible inside the ambient vector space? This question is not merely aesthetic. It is the linchpin of diagonalization theory. The entire strategy for diagonalizing an operator rests on assembling a basis. That basis is built from eigenvectors drawn from different eigenspaces. The answer, remarkably, is that eigenspaces corresponding to distinct eigenvalues never interfere with one another at all. Their sum is always a direct sum. This means every vector in the total span decomposes uniquely. It decomposes as a sum of eigenvectors, one from each eigenspace involved. This is a stronger and more structural fact. It is more than merely saying eigenvectors for distinct eigenvalues are linearly independent. It says the entire eigenspaces, subspace by subspace, avoid every kind of mutual entanglement. This holds not just for individual vector collisions. The big picture is that this theorem converts a spectral fact into a geometric fact. The spectral fact is a list of eigenvalues. The geometric fact is a direct sum decomposition of a subspace of the vector space. It is the precise reason that a diagonalizable operator's eigenvectors can be gathered into a single basis. You diagonalize exactly when the direct sum of all eigenspaces fills up the whole space. Understanding why the sum is automatically direct matters greatly. No extra hypothesis is needed beyond distinctness of the eigenvalues. This removes the mystery from the Diagonalizability Criterion that follows. This article gives the precise definitions of eigenspace and direct sum. It states and proves the central theorem in full generality. This includes any finite number of distinct eigenvalues, any dimension of vector space, including infinite-dimensional spaces. It works through two concrete non-trivial matrix examples. It also shows via a counterexample exactly what breaks if the eigenvalues are allowed to coincide.
- For a linear operator , each eigenvalue has an eigenspace .
- If are distinct eigenvalues of , then is always a direct sum.
- Directness means every vector in the sum has a unique expression as with .
- This is proved by extending the classical independence-of-eigenvectors argument from vectors to whole subspaces.
- The result needs no extra hypotheses on dimension, field, or operator — only that the eigenvalues be pairwise distinct.
- Key idea: distinct eigenvalues force distinct "frequencies" of scaling, and no nonzero vector can simultaneously scale two different ways, so the eigenspaces cannot overlap or entangle.
Where this lives today
The direct sum of eigenspaces is the structural backbone of diagonalization: an operator on a finite-dimensional space is diagonalizable exactly when the direct sum of all its eigenspaces equals the whole space, a fact built entirely on this theorem plus a dimension count. In quantum mechanics, observables are modeled by self-adjoint (Hermitian) operators, and distinct eigenvalues correspond to distinct measurable outcomes; the direct sum decomposition of the Hilbert space into eigenspaces is the mathematical expression of the spectral theorem, guaranteeing that measurement outcomes correspond to genuinely independent, non-overlapping physical states. In numerical linear algebra and engineering, this theorem underlies why algorithms such as the power method and QR algorithm can isolate dominant eigenvectors without them "contaminating" one another — because eigenspaces for distinct eigenvalues never share nonzero vectors. In statistics, principal component analysis relies on the spectral decomposition of a covariance matrix, whose distinct eigenvalues yield orthogonal (hence certainly direct-summing) eigenspaces corresponding to independent directions of variance. In graph theory and network science, the eigenspaces of the adjacency or Laplacian matrix of a graph decompose the vertex space directly, and distinct eigenvalues (e.g., in strongly regular or distance-regular graphs) organize the combinatorial structure into cleanly separated components. In cryptography and coding theory, eigenspace decompositions of linear operators over finite fields (e.g., in the study of linear feedback shift registers) rely on exactly this non-overlap phenomenon to guarantee unique decompositions of states.
Ask the tutor: Why does the same induction argument fail the moment two of the chosen eigenvalues coincide, and what exactly goes wrong in the algebra?
Let be a vector space over a field and let be a linear operator.
Eigenspace. For a scalar , the eigenspace of corresponding to is
This is always a subspace of (it is the kernel of the linear map ). The scalar is an eigenvalue of precisely when , i.e., when there exists a nonzero with ; such a is called an eigenvector for .
Sum of subspaces. Given subspaces , their sum is
Direct sum. The sum is called a direct sum, written , if every element of the sum has a unique representation as with . Equivalently (a standard fact about subspaces), the sum is direct if and only if
Intuition
Picture each eigenspace as a "pure mode" of the operator : every nonzero vector inside gets stretched by the same factor when is applied, and nothing else happens to it. If two different eigenspaces and shared a nonzero vector , that single vector would have to be stretched by and by simultaneously — a contradiction unless . This is the seed of the whole theorem: distinct eigenvalues are like distinct musical frequencies, and no nonzero "sound" can vibrate at two different pure frequencies at once. The subtlety the theorem resolves is more than pairwise: could a vector in perhaps be expressed as some combination of vectors from and even though no individual clash occurs? The theorem says no — the whole collection of eigenspaces, taken together, remains independent in the direct-sum sense. Geometrically, in with three distinct eigenvalues, each 1-dimensional eigenspace is a distinct line through the origin, and the three lines (assuming they truly correspond to a diagonalizable operator) span three independent directions with no overlap beyond the origin — exactly like the , , axes.
Theorem
Let be a vector space over a field , and let be a linear operator. Let be distinct scalars (i.e., whenever ), and let be the corresponding eigenspaces of (some may be if is not actually an eigenvalue). Then the sum
is a direct sum:
No hypothesis on the dimension of , on the field , or on the number (beyond and finiteness) is required beyond the distinctness of the .
We use induction on , the number of eigenspaces, combined with the defining criterion for directness stated in the definition above. This is the same style of argument used to prove Independence of Eigenvectors for Distinct Eigenvalues, but applied to whole subspaces rather than single vectors; we do not assume that prior theorem as a black box, we re-derive the needed mechanism from scratch so the proof is self-contained.
Base case . A single subspace trivially satisfies the direct sum condition: if with , then certainly . There is nothing more to check.
Inductive step. Suppose the theorem holds for any distinct eigenvalues (inductive hypothesis): for any distinct , the sum is direct. We prove it for distinct eigenvalues . By the criterion for directness, it suffices to show: if
then for every . So assume this equation holds. Apply the linear operator to both sides:
Since is linear and for each (as ), this gives
Now multiply the original equation
by the scalar :
Subtract (3) from (1):
That is,
Here each coefficient for is nonzero, because the are pairwise distinct. Define
which lies in because is a subspace (closed under scalar multiplication) and . Equation (4) reads
By the inductive hypothesis applied to the distinct eigenvalues , the sum is direct, so this forces
That is, for each . Since , we may divide (multiply by the multiplicative inverse in the field ) to conclude
Finally, substitute back into the original equation (2): since , equation (2) reduces to . Hence , as required. This closes the inductive step. By induction, the theorem holds for every finite , completing the proof.
∎Worked examples
Example 1 — a matrix with three distinct eigenvalues of mixed multiplicity. Let
The matrix is block lower-triangular in a useful sense; let's find its eigenvalues directly from the structure. The characteristic polynomial can be computed by expanding along the last column, but it is faster to notice the matrix is triangular except for the entry and the entry. Compute :
Expanding along the first row: the only nonzero entry in row 1 is in position , so
This matrix is upper triangular, so its determinant is . Thus
The eigenvalues are (algebraic multiplicity 3) and (algebraic multiplicity 1). These are only two distinct eigenvalues, so the theorem tells us is direct — let's verify by computing both eigenspaces explicitly. Eigenspace : solve where
Row 2 forces . Row 4 gives , i.e. . Variables and are free. So
a 2-dimensional eigenspace (geometric multiplicity 2, strictly less than algebraic multiplicity 3 — the matrix is not diagonalizable, but that does not affect this theorem). Eigenspace : solve where
Row 1 gives ; row 4 then gives again (consistent). Row 3 gives . Row 2 then gives . Only is free:
Now check directness concretely. Suppose and with . Write ... more precisely and . Then
forces , , and then . Hence , confirming directness exactly as the theorem guarantees — and this matches the general proof: applying to gives , and eliminating using gives , so , hence , mirroring the induction step exactly.
Example 2 — a matrix with three distinct eigenvalues, verifying the full direct sum fills the space. Let
Compute the characteristic polynomial:
Expand along the first row:
Compute each bracket:
- .
- .
- .
So
Expand . Then
Test : . Good, is a root. Factor:
(Check: , and negating gives our polynomial — correct.) Solve : . So the three eigenvalues are
all distinct (since and , as ). By the theorem, is automatically a direct sum — no computation needed to confirm this. Since is with three distinct eigenvalues, each eigenspace is (at least, hence exactly) 1-dimensional, and
so this direct sum is all of — a preview of how directness of eigenspaces feeds directly into the Diagonalizability Criterion: is diagonalizable precisely because these eigenspaces, being automatically direct, exhaust the whole space.
The theorem's hypothesis that be pairwise distinct is essential; without it the "sum" of the (repeated) eigenspace with itself is not even well-formed as a direct sum in a meaningful sense, but more importantly, if we instead ask whether eigenspaces for equal eigenvalues combine with genuinely different eigenspaces for possibly-coincident labels, uniqueness of decomposition can fail once two of the eigenvalues are forced to coincide by a bad choice of indexing across a repeated root. The cleanest way to see what really breaks is to consider two different subspaces that are not eigenspaces for distinct eigenvalues, but for the same eigenvalue, and see the direct sum property vanish. Let be the identity operator, . Then every nonzero vector is an eigenvector with eigenvalue , so is the entire space. Now pick two distinct 2-dimensional subspaces of , say
Both and are subspaces of the same eigenspace (since acts as scalar on the whole space, every subspace of is "eigenvalue-1 respecting"). If one mistakenly tried to apply the theorem's conclusion to and as though they were eigenspaces for two different eigenvalues, directness would fail badly:
Indeed, the vector has two different representations as with : trivially , but also , and more seriously, can be split many ways, e.g. with both summands landing in . This non-uniqueness is precisely the failure of directness, and it happens because are not eigenspaces for two distinct eigenvalues — they are both sitting inside the single eigenspace of the single eigenvalue . The proof breaks down exactly at the step "": if we try to run the argument with , the coefficient , so we can no longer divide, and the inductive collapse to never occurs. This shows precisely where distinctness is used, and that no weaker hypothesis suffices.
Scope, edge cases & common traps
| Situation | What happens |
|---|---|
| Some is not actually an eigenvalue of | , and the theorem still holds trivially (a zero subspace contributes nothing and cannot create overlap). |
| is infinite-dimensional | The proof uses no finite-dimensionality; it works verbatim for any vector space over any field. |
| eigenvalues but geometric multiplicities sum to less than | Direct sum still holds; it just may not equal all of (as in Example 1). This is exactly the gap measured by the Diagonalizability Criterion. |
| Two of the are equal | Hypothesis violated; the theorem does not apply and, as the counterexample shows, directness can genuinely fail for a poorly chosen pair of subspaces confused with eigenspaces. |
| Field of characteristic | Proof only uses field axioms (subtraction, existence of inverses for nonzero scalars), so it holds over any field, including finite fields. |
The mathematician behind it
Origins · 1 minAugustin-Louis Cauchy and how this was discovered
Cauchy's work on the "principal axes" of quadratic forms and his study of what he called valeurs propres laid essential groundwork for the modern theory of eigenvalues and eigenvectors. Long before the abstract vector-space language of direct sums was formalized, Cauchy understood that distinct roots of the characteristic equation corresponded to geometrically independent directions of a quadratic form — the seed of the phenomenon formalized in this article.
Does this theorem require the vector space to be finite-dimensional?
No. The proof only uses linearity of , the subspace properties of each , and field arithmetic (existence of multiplicative inverses for nonzero scalars). None of these require finite dimension. The theorem holds verbatim for infinite-dimensional vector spaces, including function spaces where might be a differential or integral operator, provided the eigenvalues under consideration are still pairwise distinct scalars in the base field.
Is "direct sum" here the same as "orthogonal direct sum" from inner product spaces?
Not necessarily. This theorem produces an algebraic direct sum: unique decomposition of vectors, with no reference to any inner product or orthogonality. If happens to be self-adjoint (or more generally normal) with respect to some inner product, then eigenspaces for distinct eigenvalues turn out to be orthogonal as well, which is a stronger and separate fact (part of the spectral theorem). Without such extra structure, directness alone does not imply orthogonality.
Does the theorem tell us the operator is diagonalizable?
Not by itself. It only guarantees that the sum of all eigenspaces is direct, so their dimensions add up correctly inside . Diagonalizability additionally requires that this direct sum equal the entire space , i.e., that the eigenvectors span . Example 1 shows a case where the eigenspaces sum directly but do not exhaust (dimensions ), so that matrix is not diagonalizable, even though the direct sum theorem still holds perfectly.
What if two eigenvalues are complex conjugates of each other, is the theorem still valid?
Yes, as long as they are treated as distinct scalars in the field (e.g., working over , or over if you only ever consider real eigenvalues). If and are genuinely different complex numbers, the theorem applies to and exactly as to any other pair of distinct scalars; the proof makes no use of any real-versus-complex distinction, only of field arithmetic.
Can the theorem fail if is not linear?
The very definitions of eigenspace and eigenvector presuppose interacting correctly with vector space operations, and the proof crucially uses linearity when applying to a sum: . If is not linear, "eigenspace" is not even standardly defined, and the entire apparatus (eigenvalues, eigenspaces, and this theorem) does not apply. Linearity of is a standing hypothesis throughout, not an optional extra.
How does this theorem connect to the Diagonalizability Criterion?
It supplies exactly half of that criterion for free: whenever you have several distinct eigenvalues, you automatically know their eigenspaces combine directly, so
The remaining question for diagonalizability is purely a dimension count: does this total equal ? If yes, the operator is diagonalizable; if the sum of geometric multiplicities falls short (as in Example 1), it is not. This theorem removes any worry about hidden overlaps, reducing diagonalizability to counting dimensions.
Is the converse true — if a sum of subspaces is direct, must they be eigenspaces for distinct eigenvalues?
No, and this converse is not claimed anywhere in the theorem. Many direct sums of subspaces have nothing to do with eigenspaces at all — for instance, any complementary pair of subspaces with forms a direct sum regardless of any operator. The theorem is a one-directional implication: distinct eigenvalues direct sum of eigenspaces. It says nothing about direct sums arising from other sources.