Generalized Eigenspace Decomposition
Not every operator on a complex vector space can be diagonalized. So a natural question arises. If eigenvectors alone cannot span the space, what is the correct substitute? The answer is to enlarge each eigenspace to a generalized eigenspace. This consists of vectors that eigenvectors annihilate only after repeated application of a shifted operator. This single adjustment repairs the theory completely. Over the complex numbers, every operator splits the whole space into a direct sum of these generalized eigenspaces. This result is the structural heart of eigentheory for operators that fail to be diagonalizable. It explains precisely why diagonalization can fail. Nontrivial nilpotent parts get trapped inside generalized eigenspaces. Yet it still delivers a clean, canonical decomposition of the ambient space. The theorem converts an arbitrary operator into a block-diagonal object. Each block is "an eigenvalue plus something nilpotent." Nilpotent operators are themselves completely classified by their Jordan block structure. The big picture is that complex linear algebra has two layers of structure. These are the semisimple layer (eigenvalues) and the nilpotent layer. The nilpotent layer measures how far generalized eigenvectors are from being honest eigenvectors. The Generalized Eigenspace Decomposition Theorem is the bridge connecting these layers. It is the direct predecessor to the Jordan Canonical Form. This refines each generalized eigenspace into an explicit basis of Jordan chains. This article gives the precise definitions. It states and proves the decomposition theorem in full, using the Cayley-Hamilton Theorem and properties of Generalized Eigenvectors. It works through two genuinely non-diagonalizable examples in detail. It also shows exactly which hypothesis cannot be dropped: algebraic closedness of the field.
- A generalized eigenvector for eigenvalue λ is killed by for some , not necessarily .
- The generalized eigenspace is the union (equivalently, for large enough , the single subspace) of these kernels.
- Over , every operator's generalized eigenspaces span the whole space and intersect trivially: .
- The dimension of each generalized eigenspace equals the algebraic multiplicity of λ in the characteristic polynomial.
- Each is -invariant, and restricted there equals plus a nilpotent operator.
- Key idea: enlarging eigenspaces to generalized eigenspaces repairs the failure of diagonalizability, and does so completely over an algebraically closed field.
Let be a finite-dimensional vector space over a field , and let be a linear operator. Let . A nonzero vector is a generalized eigenvector of corresponding to if
for some positive integer . (If works, is an ordinary eigenvector.) The generalized eigenspace of corresponding to is
Since for every (if then ), and , this increasing chain of subspaces stabilizes. In fact it stabilizes by , so
In particular is a subspace of , and it is nonzero precisely when is an eigenvalue of .
Intuition
Think of an eigenvalue as a "resonant frequency" of : ordinary eigenvectors are directions along which acts by pure scaling. When is not diagonalizable, some directions are almost eigenvectors — moves them to times themselves plus a small correction, and that correction itself gets killed by a further application of . A generalized eigenvector of "rank " is a vector requiring exactly applications of to reach zero; feeding it through repeatedly produces a chain
where each is a genuine eigenvector once . This chain is precisely the seed of a Jordan block. The generalized eigenspace collects all vectors belonging to some such chain for the given ; it is a whole tower built on top of the ordinary eigenspace. The decomposition theorem says these towers, one for each distinct eigenvalue, use up the entire space with no overlap and no leftover, provided the field is algebraically closed (so that the characteristic polynomial factors completely and every root is "found").
Let be a finite-dimensional vector space over with , and let be a linear operator. Let be the distinct eigenvalues of . Then: 1. (Invariance) Each is a -invariant subspace of . 2. (Direct sum decomposition)
3. (Dimension formula) If is the multiplicity of as a root of the characteristic polynomial , then
and consequently . 4. (Structure of the pieces) For each , the restriction equals where is a nilpotent operator on .
We use the following named lemmas, each proved from scratch, and the technique of primary decomposition via coprime polynomial factors of the characteristic (equivalently minimal) polynomial, combined with Cayley–Hamilton.
Step 0: Setup via Cayley–Hamilton. By the Cayley-Hamilton Theorem, the characteristic polynomial satisfies . Since is algebraically closed, factors completely:
where are the distinct roots (eigenvalues) and their multiplicities. Since , we have
Lemma A (kernels of coprime polynomials in split the space). Suppose are polynomials, pairwise coprime (no common root, since we work over this means no shared linear factor), such that . Let . Then . *Proof of Lemma A. Apply this with ; these are pairwise coprime since the are distinct. We prove the general lemma by induction on . Base case : trivial, forces . Case :* Since are coprime, by Bézout's identity for polynomials over the field , there exist polynomials with
Substituting (all these are polynomials in the single operator , so they commute):
For , write
Since (as divides the given product, or directly from when ), we get , so . Similarly because . This shows . For the sum to be direct, suppose with . Applying to : . But ; using , we get since . Meanwhile because . Hence the equation becomes , i.e. , and then too. So , and . Inductive step: Suppose the lemma holds for pairwise coprime polynomials. Given pairwise coprime with , set . Since is coprime to each (), and coprimality of with each factor of implies coprimality of with (a standard property of coprime polynomials: if for all , then , provable by Bézout multiplicatively), and are coprime. Also . By the case, . Now restrict attention to . We claim inside , using the inductive hypothesis applied to (note is -invariant since commutes with , so for ). We have by definition of , matching the hypothesis of the inductive claim for pairwise coprime. Hence . Since for , — the last equality because automatically (if then too, since ) — we conclude
Combining, . This completes the induction and proves Lemma A.
Applying Lemma A. Take in . These are pairwise coprime (distinct linear factors, over coprimality of powers of distinct linear polynomials is immediate: any common root would have to be a root of both and , impossible for ). Lemma A gives
Step 1: Identify with . By definition , and this chain stabilizes at at the latest (shown in the definition above). We must show it in fact stabilizes by , matching the exponent from Cayley–Hamilton, and that no more room is needed. First, trivially, by definition of as a union including the term. Conversely, we show , i.e. the chain of kernels for has already stabilized by step . Suppose for some ; we show . Write with using the direct sum decomposition just established (this uses the decomposition as a set-theoretic fact, not yet assuming the dimension count, so there is no circularity). Apply :
For : since and , certainly as well (apply extra copies of to the already-zero vector ). For : we claim restricted to is invertible on that subspace. Indeed, on , the operator is nilpotent (its -th power is zero there by definition of the kernel), so is (nilpotent) (nonzero scalar times identity, since ), which is invertible: if is nilpotent with and , then is invertible with inverse , as one checks by direct multiplication (a telescoping geometric-series identity, valid since and commute). Hence is invertible on , so any power is also invertible there (composition of invertible maps). So from , and the first term is already , we get . Since is injective on each for (invertibility just shown), and these subspaces intersect trivially by directness of the sum, injectivity on each summand plus the vanishing of the total sum forces each term , , to vanish individually: more precisely, apply the same argument used for uniqueness of direct-sum decompositions — the vectors for lie in the respective (since these are -invariant, being kernels of a polynomial in , hence invariant under the commuting operator ), so their sum being with the subspaces in direct sum forces each to be . By injectivity of on , this gives for all . Therefore , as required. This proves , establishing part 3's claim that the generalized eigenspace equals this specific kernel, and combined with Step 0's decomposition proves part 2.
Step 2: Dimension count. From we get
We must show exactly (not merely that the dimensions sum correctly). Fix and let . Since is -invariant (kernel of a polynomial in commutes with : if then ), we may consider . On , is nilpotent by construction (its -th power is zero). Choose a basis of adapted to the direct sum by concatenating bases of each ; in this basis is block diagonal with blocks . The characteristic polynomial multiplies over a block-diagonal matrix:
Since is nilpotent on (dimension ), its only eigenvalue is (a nilpotent operator's characteristic polynomial is , since all eigenvalues of a nilpotent operator are — if with then , and forces hence , and since we're over the char. poly of splits and can only have root ). Hence , and shifting back,
Substituting into the product formula:
But we already know from Step 0 that , with the distinct. Unique factorization of polynomials over (or over any field) into irreducible (here linear) factors forces the exponents to match termwise:
This proves part 3.
Step 3: Invariance and structure of the restriction. We already noted is -invariant, proving part 1. Define , an operator on . By construction on (since ), so is nilpotent. And by rearranging the definition of . This proves part 4, and completes the proof of the theorem.
∎Worked examples
Example 1 (a operator with a repeated eigenvalue and a genuinely mixed structure). Let be given, in the standard basis, by the matrix
Characteristic polynomial. Since is upper triangular, . So the distinct eigenvalues are with multiplicity , and with multiplicity . Note , consistent with the theorem. Computing . We have
Compute :
Solving for : the only nonzero row is the last, giving , so and free. Thus
a 3-dimensional space, matching exactly as the theorem predicts — and one checks that already equals this same 3-dimensional span too (the third power was not even needed here, since restricted to the first three coordinates is already the whole nilpotent block's top power), while is only 1-dimensional (span of ), confirming that ordinary eigenvectors for form a proper subspace of : diagonalization fails on this block, but the generalized eigenspace repairs it. Computing . Here has entry and the top-left block is , invertible (determinant ). So , already -dimensional , so and no higher power is needed. Verifying the decomposition. Indeed , dimensions check out, and both pieces are visibly -invariant since is block upper-triangular with these exact blocks.
Example 2 (a genuinely non-triangular matrix, forcing real computation of the kernels). Let be given by
Characteristic polynomial. Compute . Trace . Sum of principal minors: for pairs : ; for : ; for : . Sum . Determinant of : expand along first row,
So . Finding roots. Try : . So is a root. Divide: . So
Eigenvalues: with , with . Ordinary eigenspace at . Solve :
Rows 1 and 3 are identical, so rank ; row-reduce: , . Substitute into : . So the ordinary eigenspace is , only 1-dimensional — strictly smaller than . This already shows is not diagonalizable, and we must pass to . Generalized eigenspace at . Compute :
Row 1 of product: . Row 2: . Row 3 equals Row 1 since original rows 1,3 agreed: . So
Solve : only independent equation is , i.e. , with free. This is a 2-dimensional solution space:
matching exactly, as guaranteed by the theorem. Eigenspace at . Solve with . Rows 1,2 are negatives of each other; use row 1: . Row 3: . Subtract row1 from row3: ; then row1 gives . So eigenspace is , dimension , so , no higher power needed. Verification of the decomposition. Basis has determinant
(columns as the three vectors) , so these three vectors are linearly independent and hence form a basis of , confirming
with dimensions as required.
Consider and given by the rotation-type matrix
This polynomial has no real roots ( has no solution in ), so has no eigenvalues at all over : there is no with . Consequently there is not even a single nonzero generalized eigenspace to speak of (each would require to be a real eigenvalue, and none exists), so the purported decomposition
is the empty direct sum , which is certainly not equal to . The theorem's proof breaks down exactly at Step 0: over the characteristic polynomial does not factor into linear factors, so Cayley–Hamilton only gives , an irreducible quadratic relation, and Lemma A (which needs the modulus polynomials to be linear-power factors summing in degree to ) has no valid application — there are no real linear factors to extract. The fix, working over , is immediate: viewing the same matrix as an operator on , factors completely, are honest eigenvalues, and holds exactly as the theorem asserts. This shows algebraic closedness of the scalar field is not a cosmetic hypothesis but essential to the existence of any eigenvalues to decompose along.
Scope, edge cases & common traps
| Situation | What happens |
|---|---|
| diagonalizable | Each equals the ordinary eigenspace ; nilpotent part |
| has a repeated eigenvalue but is still diagonalizable | still holds, and equals the geometric multiplicity too, since |
| Field not algebraically closed (e.g. ) | Characteristic polynomial may not split; theorem as stated fails (see counterexample) |
| Infinite-dimensional | Stabilization of the kernel chain at finite is not automatic; theorem requires finite dimension |
| Computing in practice | Always safe to use ; often stabilizes much earlier, as in Example 1 |
A very common mistake is to assume automatically equals for the algebraic multiplicity, without checking that the chain has actually stabilized, or conversely to stop the chain too early — e.g. only computing and mistaking the geometric multiplicity for the correct dimension of . The theorem guarantees (algebraic multiplicity), but this can require iterating up to times, and the ordinary eigenspace can be strictly smaller, exactly as seen in Example 2 where the geometric multiplicity at was only while .
The mathematician behind it
Camille Jordan worked in Paris across analysis, group theory, and linear algebra, and is remembered above all for the canonical form that bears his name — the ultimate refinement of the generalized eigenspace decomposition into an explicit basis of chains. His 1870 treatise Traité des substitutions et des équations algébriques built the theory of permutation groups and matrix canonical forms together, reflecting his conviction that structural classification (of groups, of curves, of operators) was the right unifying language for algebra and analysis. The decomposition described in this article is the essential intermediate step his form requires: first split the space by eigenvalue into generalized eigenspaces, then classify the nilpotent piece within each block via chains, producing the full Jordan structure.
Where this lives today
The generalized eigenspace decomposition underlies the computation of matrix exponentials in systems of linear ODEs: writing on each block lets one compute explicitly as , which is exactly how engineers analyze stability of linear control systems. In quantum mechanics and more broadly operator theory, the decomposition is the finite-dimensional prototype of spectral theory, generalized later to the Jordan Canonical Form for a fully explicit block structure, and further to the spectral theorem for normal operators when extra structure (self-adjointness, unitarity) is present. In numerical linear algebra, the sensitivity of eigenvalues under repeated roots — a delicate issue in floating-point computation — is precisely governed by the size of the Jordan blocks inside each generalized eigenspace. In algebraic combinatorics and representation theory, decomposing a representation's underlying operator into generalized eigenspaces is a first step toward understanding module structure over polynomial rings, tying directly into the structure theorem for finitely generated modules over a PID.
Ask the tutor: How do I find an explicit basis of Jordan chains inside a generalized eigenspace once I know its dimension?
Is always equal to , or can a smaller power suffice?
The union always stabilizes by at the very latest, since the increasing chain of subspaces cannot keep strictly growing past dimension many steps. However, in practice it very often stabilizes earlier — specifically by , the algebraic multiplicity of , which is generally much smaller than when there are several distinct eigenvalues. Both examples above stabilized before reaching . Using is always a safe, if sometimes wasteful, upper bound for hand computation.
What exactly goes wrong if the field is not algebraically closed?
The proof relies on Cayley–Hamilton producing a complete factorization of into linear factors ; only then can Lemma A be applied to split along these factors. Over a non-algebraically-closed field like , may have irreducible quadratic (or higher-degree) factors with no real roots, so there may be too few (or zero) real eigenvalues to exhaust . The rotation matrix counterexample shows this explicitly: cannot be written as a sum of real generalized eigenspaces at all, since no real eigenvalues exist, while the same matrix over decomposes perfectly.
How does this theorem relate to the Jordan Canonical Form?
This theorem is the first of two stages in producing the Jordan Canonical Form. Stage one (this article) splits into generalized eigenspaces , on each of which acts as plus a nilpotent operator . Stage two applies the classification of nilpotent operators (every nilpotent operator has a basis of Jordan chains) to each separately, producing an explicit basis in which the whole matrix of is block diagonal with Jordan blocks. Without the decomposition theorem, there would be no valid way to isolate each eigenvalue's "own" nilpotent structure in the first place.
Does the theorem say anything about uniqueness of the decomposition?
Yes: the decomposition is completely canonical, with no choices involved, because each is intrinsically defined as , depending only on and , not on any basis. This is stronger than the eventual Jordan form itself, whose basis (the specific Jordan chains chosen) is not unique, although the resulting block sizes are. The generalized eigenspaces themselves, as subspaces, are uniquely determined by .
Can two different eigenvalues share vectors in their generalized eigenspaces?
No. Part 2 of the theorem asserts the sum is direct, meaning for . This was proved via the invertibility argument in the proof: on , the operator is invertible whenever (nilpotent plus nonzero scalar), so no nonzero vector of can also lie in for any , which is precisely what membership in would require.
What is the geometric meaning of versus the geometric multiplicity ?
The algebraic multiplicity counts how many times divides the characteristic polynomial, while the geometric multiplicity counts actual linearly independent eigenvectors. Always , with equality exactly when restricted to has zero nilpotent part, i.e. when is diagonalizable on that block. The gap between the two multiplicities measures precisely how far is from being diagonalizable at .