Why the space is the direct sum of the generalized eigenspaces of an operator whose minimal polynomial splits, proved with polynomial projectors, with nilpotent restrictions and dimensions equal to algebraic multiplicities.
The matrix with rows (1,1,1), (0,1,1) and (0,0,2) has the eigenvalues 1 and 2 but only two independent eigenvectors, so it cannot be diagonalized. Its action still separates into a plane where only the eigenvalue 1 matters and a line spanned by (2,1,1) where it multiplies by 2, even though that line cannot be read off from the entries. This lesson proves that such a separation always exists when the minimal polynomial splits into linear factors, using projections that are polynomials in the operator, and shows that the pieces are generalized eigenspaces whose dimensions are the algebraic multiplicities. Throughout, F is R or C, V is a vector space over F of finite dimension n≥1, T:V→V is linear, a square matrix A stands for the operator x↦Ax, and a tuple such as (2,1,1) stands for a column vector.
Key terms
Split minimal polynomial
Definition A polynomial with coefficients in F splits over F if it is a constant times a product of linear factors t−c with every c∈F. The minimal polynomial of T splits over F when
μT(t)=(t−λ1)s1⋯(t−λr)sr
with distinct λ1,…,λr∈F and exponents sj≥1. The roots of μT in F are exactly the eigenvalues of T, so the λj are then all the eigenvalues of T. Over C every polynomial splits, by the fundamental theorem of algebra, so the hypothesis holds for every complex operator. Over R it holds exactly when every complex root of μT is real. The factors aj=(t−λj)sj are pairwise coprime, even when some exponents exceed 1, because no two of them have a common root.
In plain words Splitting means that the minimal polynomial factors completely with scalars from the field you are working in. It is the hypothesis that lets every vector be sorted by eigenvalue.
Example Let
A=100110112.
Its characteristic polynomial is (t−1)2(t−2), and μA divides it and has both 1 and 2 as roots. The product (A−I)(A−2I) is not zero, while (A−I)2(A−2I)=0, so μA(t)=(t−1)2(t−2), which splits over R. By contrast, the quarter turn with rows (0,−1) and (1,0) has minimal polynomial t2+1. It has no real root, so it does not split over R, but over C it splits as (t−i)(t+i).
Primary decomposition
Definition Let μT=a1a2⋯ar with monic polynomials aj of positive degree that are pairwise coprime, and let bj be the product of all the factors except aj. Each bj is coprime to aj, so Bézout’s identity gives polynomials uj,vj with ujaj+vjbj=1. Put hj=vjbj and Pj=hj(T), and let Kj=keraj(T). Then
P1+⋯+Pr=I,Pj2=Pj,PjPk=0 for j=k,
the image of Pj is Kj, each Kj is invariant under T, and
V=K1⊕K2⊕⋯⊕Kr,
with Pj the projection onto Kj along the sum of the other pieces. When the aj are the powers of the distinct monic irreducible factors of μT, this is the primary decomposition of V under T. When μT splits, those factors are aj=(t−λj)sj.
For the proof, note that hj=1−ujaj leaves remainder 1 on division by aj, while hk for k=j is a multiple of aj, because aj is a factor of bk. So every aj divides 1−(h1+⋯+hr). Pairwise coprime polynomials that each divide f have a product that divides f. For two of them, a and b with ua+vb=1, write f=ag. Then g=uag+vbg, and b divides both terms because ag=f, so b divides g and ab divides f. Induction handles more factors. Hence μT divides 1−∑hk, and evaluating at T gives ∑Pk=I. For j=k the product bjbk contains every ai, so μT divides hjhk and PjPk=0. Multiplying ∑Pk=I by Pj gives Pj2=Pj. Since ajbj=μT, we get aj(T)Pj=vj(T)μT(T)=0, so the image of Pj lies in Kj, and on Kj the operator Pj=I−uj(T)aj(T) is the identity. Every x∈V equals P1x+⋯+Prx with Pkx∈Kk, so the pieces span V. Finally, if w1+⋯+wr=0 with wk∈Kk, then Pi fixes wi and kills every other wk, since ak is a factor of bi. Applying Pi gives wi=0, so the sum is direct. Each Kj is invariant because aj(T) commutes with T.
In plain words Factor the minimal polynomial into pieces with no common complex root. Bézout’s identity turns that factorization into projections that are polynomials in T. They add up to the identity, and each one keeps exactly the vectors killed by its own factor. Over R an irreducible quadratic factor still produces an invariant piece, but that piece contains no real eigenvector.
Example For the matrix A above take a1=(t−1)2 and a2=t−2. The identity (t−1)2−t(t−2)=1 is a Bézout relation, so h2=(t−1)2 and h1=1−(t−1)2=−t(t−2). Then
The image of P2 is the line spanned by (2,1,1), and A(2,1,1)=(4,2,2), so that line consists of eigenvectors for 2. The image of P1 is the xy-plane, which is ker(A−I)2. For e3 the split is e3=(−2,−1,0)+(2,1,1). So P1 projects onto the xy-plane along the line spanned by (2,1,1), not along the z-axis.
Direct sum of generalized eigenspaces
Definition Suppose μT splits over F as above. Then for each j
ker(T−λjI)sj=Gλj(T),
where Gλ(T)=ker(T−λI)n is the generalized eigenspace, and
V=Gλ1(T)⊕⋯⊕Gλr(T).
Each Gλj(T) is invariant under T, and the projection onto it along the others is the polynomial projector Pj. The operator need not be diagonalizable. The splitting hypothesis cannot be dropped. If V is the sum of the generalized eigenspaces for some eigenvalues λ1,…,λr in F, then ∏j(t−λj)n annihilates T, so μT divides it and splits.
For the proof write Kj=ker(T−λjI)sj, so that V=K1⊕⋯⊕Kr by the primary decomposition. Since μT divides χT, which has degree n, we have sj≤n and Kj⊆Gλj(T). For k=j the operator T−λjI is injective on Kk. Indeed, if w∈Kk and Tw=λjw, then 0=(T−λkI)skw=(λj−λk)skw, so w=0. Now let x∈Gλj(T) and write x=x1+⋯+xr with xk=Pkx∈Kk. Then
0=(T−λjI)nx=k=1∑r(T−λjI)nxk,
and each term lies in Kk by invariance. The sum is direct, so every term is zero. For k=j the power (T−λjI)n is injective on Kk, so xk=0. Hence x=xj∈Kj.
In plain words When the minimal polynomial splits, every vector is a sum of one vector from each generalized eigenspace, and these pieces are unique. Some pieces may be zero. This works even when there are too few ordinary eigenvectors, because the pieces are generalized eigenspaces rather than eigenspaces.
Example For the matrix A above, the kernels of (A−I)k for k=1,2,3 have dimensions 1,2,2, and every kernel of a positive power of A−2I has dimension 1. So
G1(A)=span(e1,e2),G2(A)=span((2,1,1)),
while the eigenspace for 1 is only the line spanned by e1. The vectors e1, e2 and (2,1,1) form a basis, so R3=G1(A)⊕G2(A). For x=(3,2,1) the projectors give x=(1,1,0)+(2,1,1). The first piece is a generalized eigenvector of rank 2, since (A−I)(1,1,0)=(1,0,0)=0 and (A−I)2(1,1,0)=0.
Nilpotent operator
Definition A linear operator N on V is nilpotent if Nk=0 for some positive integer k, and the smallest such k is its index of nilpotency. On a space of dimension d≥1 a nilpotent operator satisfies Nd=0, because the kernels of its powers stabilize by step d and must eventually be the whole space. Its only eigenvalue is 0. Zero is an eigenvalue because an injective N would have injective powers, yet Nk=0 is not injective. No other scalar is an eigenvalue, since Nw=αw with w=0 gives 0=Nkw=αkw, so α=0. When μT splits as above, the restriction Nj of T−λjI to Gλj(T) is nilpotent with index exactly sj, so on that subspace
T=λjI+Nj.
The power Njsj is zero because Gλj(T)=ker(T−λjI)sj. If Njr=0 for some r<sj, let q be μT with the factor (t−λj)sj replaced by (t−λj)r. Then q(T) kills Gλj(T) by assumption and every other Gλk(T) through its own factor. These subspaces span V, so q(T)=0 with degq<degμT, which contradicts minimality. So the restriction of T has minimal polynomial (t−λj)sj, and sj is the largest rank of a generalized eigenvector for λj.
In plain words A nilpotent operator gives zero after finitely many applications. On each generalized eigenspace, T is the scalar λj plus such an operator, and the exponent of t−λj in the minimal polynomial says how many applications that takes.
Example For the matrix A above, A−I sends e1 to 0 and e2 to e1, so its restriction to G1(A) has the matrix
[0010]
in the basis (e1,e2). It is nilpotent of index 2=s1. On all of R3 the operator A−I is not nilpotent, because (A−I)(2,1,1)=(2,1,1). Strictly upper triangular matrices are the standard examples. The one with rows (0,1,1), (0,0,1) and (0,0,0) has a nonzero square and a zero cube, so its index is 3.
Dimension of a generalized eigenspace
Definition Suppose μT splits over F as above, and let mj be the algebraic multiplicity of λj, its multiplicity as a root of χT. Then dimGλj(T)=mj and
χT(t)=j=1∏r(t−λj)mj.
In particular χT splits too, the dimensions m1+⋯+mr add up to n, and the geometric multiplicity dimker(T−λjI) is at most mj, because the eigenspace lies inside Gλj(T).
For the proof, join bases of the generalized eigenspaces into a basis of V. The sum is direct and each piece is invariant, so the matrix of T is block diagonal, with a block Aj of size dj=dimGλj(T) for each restriction, and χT=∏jχAj. Each block has the form Aj=λjI+Mj with Mj nilpotent. Every complex root of χMj is an eigenvalue of Mj viewed as a complex matrix, which is still nilpotent, so that root is 0. A monic polynomial of degree dj whose only complex root is 0 equals tdj, hence
Multiplying over j and comparing the exponents of the distinct factors t−λj gives mj=dj. No Jordan basis is needed for this.
In plain words The algebraic multiplicity counts the whole generalized eigenspace, while the geometric multiplicity counts only its ordinary eigenvectors. The exponent in the minimal polynomial is a third number, the length of the longest chain.
Example For the matrix A above, χA(t)=(t−1)2(t−2). The eigenvalue 1 has algebraic multiplicity 2=dimG1(A), geometric multiplicity 1, and exponent s1=2 in μA. The three numbers can all differ. On F4 let T=5I+E12, where E12 has a single 1 in position (1,2). Then χT(t)=(t−5)4 and G5(T)=F4 has dimension 4. The eigenspace is the kernel of E12, the hyperplane x2=0 of dimension 3. Since E12=0 and E122=0, the minimal polynomial is (t−5)2.
Check yourself
Let A have rows (1,1,0), (0,1,0) and (0,0,2). Find μA, the projectors onto the generalized eigenspaces as polynomials in A, and the split of x=(2,3,4).
Show the answer
The characteristic polynomial is (t−1)2(t−2), and the minimal polynomial divides it and has both 1 and 2 as roots. The product (A−I)(A−2I) is not zero, because its first row is (0,−1,0), so μA(t)=(t−1)2(t−2). The Bézout relation (t−1)2−t(t−2)=1 for the coprime factors (t−1)2 and t−2 gives h2=(t−1)2, so
P2P1=(A−I)2=diag(0,0,1),=I−P2=diag(1,1,0).
The split is x=(2,3,0)+(0,0,4). The first piece is killed by (A−I)2 but not by A−I, since (A−I)(2,3,0)=(3,0,0), so it is a generalized eigenvector of rank 2 for 1. The second piece is an eigenvector for 2.
Let C have rows (0,−1,0), (1,0,0) and (0,0,3), acting on R3. Is R3 the direct sum of the real generalized eigenspaces of C? Which decomposition survives over R, and what happens over C?
Show the answer
No. The characteristic polynomial is (t2+1)(t−3). Neither C2+I nor C−3I is zero, so the minimal polynomial is the whole product, which does not split over R. The only real eigenvalue is 3, and every kernel of a positive power of C−3I is the line spanned by e3, so the real generalized eigenspaces fill only one dimension. The primary decomposition still works with the coprime factors t2+1 and t−3. From the Bézout relation
101(t2+1)−101(t+3)(t−3)=1,
the projector onto ker(C−3I) is 101(C2+I)=diag(0,0,1), and R3=ker(C2+I)⊕ker(C−3I), the xy-plane plus the z-axis. The plane is invariant but contains no real eigenvector. Over C the factor t2+1 splits as (t−i)(t+i), and C3 is the direct sum of three generalized eigenspaces of dimension 1, spanned by (1,−i,0), (1,i,0) and e3.
Let L have rows (2,0,0), (1,2,0) and (1,1,3). Find μL, describe G2(L) and G3(L), and split x=(1,0,0).
Show the answer
The matrix is lower triangular, so χL(t)=(t−2)2(t−3). The matrix L−2I has rows (0,0,0), (1,0,0) and (1,1,1), so it has rank 2 and the eigenvalue 2 has only a line of eigenvectors. The minimal polynomial divides χL and has both 2 and 3 as roots, and the product (L−2I)(L−3I) is not zero, since its second row is (−1,0,0), so μL(t)=(t−2)2(t−3). The Bézout relation (t−2)2−(t−1)(t−3)=1 gives h3=(t−2)2, so
So G2(L)=ker(L−2I)2 is the plane 2x1+x2+x3=0, spanned by (1,0,−2) and (0,1,−1), and G3(L) is the line spanned by e3, since Le3=3e3. The dimensions 2 and 1 match the algebraic multiplicities. The split is
(1,0,0)=(1,0,−2)+(0,0,2).
The first piece has rank 2, because (L−2I)(1,0,−2)=(0,1,−1), which is an eigenvector for 2.
May we count page visits to understand which courses and learning features are useful? Cloudflare collects visit and performance statistics, without your account details or answers. Your choice does not affect access. Details