Linear-Algebra-Done-Right · Unit 13 · Video 1 · Interactive Practice
Diagonalizable Operators and Direct Sums of Eigenspaces
IKey Formulas
Formula
Name
Hypotheses
M(T,(v1,…,vn))=λ10⋱0λn⟺Tvk=λkvk for each k
Diagonal matrix; T is diagonalizable if this happens for some basis, and then the eigenvalues of T are exactly λ1,…,λn
T∈L(V), v1,…,vn a basis of V
E(λ,T)=null(T−λI)={v∈V:Tv=λv}
Eigenspace: the eigenvectors for λ together with 0; λ is an eigenvalue ⟺E(λ,T)={0}
T∈L(V), λ∈F
E(λ1,T)+⋯+E(λm,T) is a direct sum
Eigenspaces for distinct eigenvalues form a direct sum
λ1,…,λm distinct eigenvalues of T
dimE(λ1,T)+⋯+dimE(λm,T)≤dimV
The eigenspace dimensions add to at most dimV
Same, with V finite-dimensional
Key Insight: Diagonalizable describes the operator, not one of its matrices: a diagonal matrix appears exactly when every basis vector vk satisfies Tvk=λkvk, so the search for one is a search inside the eigenspaces.
IIDiagonal in Some Basis
The standard matrix of T(x,y)=(41x+7y,−20x+74y) is not diagonal, yet T is diagonalizable.
IIIEigenspaces as Null Spaces
With M(T,(v1,v2,v3))=800050005, which vectors does T−λI send to 0?
IVEigenspace Dimensions Add to at Most dim V
For an upper-triangular M(T), a repeated diagonal entry need not give an eigenspace of that dimension.
💡 Challenge: with diagonal 8,5,5, find the entries above the diagonal that can be made nonzero while dimE(5,T) stays 2.
VQuiz Questions
Problem 1 · Reading an Eigenspace off a Diagonal Matrix
Given:T∈L(R4) and a basis v1,v2,v3,v4 of R4 with M(T,(v1,v2,v3,v4))=30000−20000300003 — findE(3,T).
✅ Correct!(T−3I)v=−5a2v2 vanishes exactly when a2=0, so E(3,T) is spanned by the three basis vectors with diagonal entry 3 and has dimension 3.
❌ Only the first 3 was used.Tv3=3v3 and Tv4=3v4 as well, so v3,v4∈E(3,T): the eigenspace is larger than a line.
❌ That is the coordinate that must vanish.Tv2=−2v2, so (T−3I)v2=−5v2=0; in fact span(v2)=E(−2,T).
❌ That would make T=3I.Tv2=−2v2=3v2, so v2∈/E(3,T).
❌ Not quite. Write v=a1v1+a2v2+a3v3+a4v4 and compute (T−3I)v column by column.
Show solution
Column k gives Tvk: Tv1=3v1, Tv2=−2v2, Tv3=3v3, Tv4=3v4. For v=a1v1+a2v2+a3v3+a4v4,
(T−3I)v=0a1v1−5a2v2+0a3v3+0a4v4=−5a2v2.
Since v2=0, this is 0 exactly when a2=0, while a1,a3,a4 are arbitrary. Hence
E(3,T)=span(v1,v3,v4),dimE(3,T)=3.
Likewise E(−2,T)=span(v2), and dimE(3,T)+dimE(−2,T)=3+1=4=dimR4.
Problem 2 · A Repeated Entry Above a Nonzero Entry
Given:T∈L(R3), T(x,y,z)=(4x+y,4y,7z), whose standard matrix 400140007 has 4 twice on the diagonal — findE(4,T).
✅ Correct!(T−4I)(x,y,z)=(y,0,3z) is 0 exactly when y=z=0: the entry 4 appears twice, but dimE(4,T)=1.
❌ The repeated diagonal entry misled you.(T−4I)(0,1,0)=(1,0,0)=0, so (0,1,0)∈/E(4,T); the entry 1 above the diagonal is what stops it.
❌ The roles of the coordinates are swapped. The equations y=0 and 3z=0 constrain y and z; x is the free coordinate, and (T−4I)(0,1,0)=(1,0,0)=0.
❌ (0,0,1) belongs to the other eigenvalue.T(0,0,1)=(0,0,7), so (0,0,1)∈E(7,T); eigenspaces for the distinct eigenvalues 4 and 7 meet only in 0.
❌ Not quite. Compute (T−4I)(x,y,z) and solve for the vectors it sends to 0.
Show solution
Subtract 4 times the identity:
(T−4I)(x,y,z)=(4x+y−4x,4y−4y,7z−4z)=(y,0,3z).
This is 0 exactly when y=0 and z=0, with x free, so
E(4,T)=span((1,0,0)),dimE(4,T)=1.
For the other eigenvalue, (T−7I)(x,y,z)=(−3x+y,−3y,0) vanishes exactly when y=0 and x=0, so E(7,T)=span((0,0,1)). The dimensions add to 1+1=2, strictly less than dimR3=3: the inequality in the theorem can be strict.
Problem 3 · Counting Eigenspace Dimensions in R4
Given:T∈L(R4), T(x1,x2,x3,x4)=(2x1+x3,2x2,2x3,5x4), whose standard matrix is upper triangular with diagonal entries 2,2,2,5, so its eigenvalues are 2 and 5 — finddimE(2,T) and compare the eigenspace dimensions with dimR4.
What is dimE(2,T)?
Which statement is true?
✅ Correct!E(2,T)=span(e1,e2) and E(5,T)=span(e4); their direct sum has dimension 3, one short of R4.
❌ Too small.(T−2I)x=(x3,0,0,3x4) leaves both x1 and x2 free: e1 and e2 are both in E(2,T).
❌ Three diagonal 2s do not give three dimensions.(T−2I)e3=e1=0, so e3∈/E(2,T).
❌ That would make T=2I.Te4=5e4=2e4.
❌ Not quite. Compute (T−2I)(x1,x2,x3,x4) and count the free coordinates.
❌ The number of diagonal entries is dimV, not the sum. Here dimE(2,T)=2 and dimE(5,T)=1, so the sum is 3.
❌ The theorem has no exception for repeats.2 and 5 are distinct eigenvalues, so E(2,T)+E(5,T) is always a direct sum.
❌ The theorem says ≤dimV. A sum of 3 in a space of dimension 4 is allowed; equality is not promised.
❌ Not quite. Compare dimE(2,T)+dimE(5,T) with 4, keeping in mind that the sum of the eigenspaces is direct.
Show solution
Eigenvalue 2:
(T−2I)(x1,x2,x3,x4)=(x3,0,0,3x4),
which is 0 exactly when x3=x4=0. So E(2,T)=span(e1,e2) and dimE(2,T)=2.
which is 0 exactly when x3=0, x2=0 and then x1=0. So E(5,T)=span(e4) and dimE(5,T)=1.
The sum E(2,T)⊕E(5,T) is direct, so joining the bases gives the linearly independent list e1,e2,e4, and
dimE(2,T)+dimE(5,T)=2+1=3<4=dimR4.
Three vectors cannot span R4, so this list is not a basis.
Problem 4 · What the Inequality Allows
Given:T∈L(R4) has an upper-triangular matrix with respect to some basis, with diagonal entries 7,7,7,−3 — find every value that dimE(7,T) can take, over all such T.
✅ Correct!dimE(7,T)≥1 because 7 is an eigenvalue, and dimE(7,T)≤4−dimE(−3,T)≤3; each of 1, 2, 3 occurs.
❌ Repetition on the diagonal does not fix the dimension. With entries 1 above the diagonal, as in Problem 2, dimE(7,T) can drop to 2 or 1.
❌ 0 is impossible. The diagonal entries of an upper-triangular matrix are eigenvalues (Unit 12), and λ is an eigenvalue exactly when E(λ,T)={0}.
❌ 4 is impossible.−3 is also an eigenvalue, so dimE(−3,T)≥1 and dimE(7,T)≤4−1=3.
❌ Not quite. Bound dimE(7,T) below using that 7 is an eigenvalue, and above using the theorem together with dimE(−3,T)≥1.
Show solution
Eigenvalues. The eigenvalues of an operator with an upper-triangular matrix are its diagonal entries (Unit 12), so 7 and −3 are the eigenvalues of T, and both eigenspaces are nonzero: dimE(7,T)≥1 and dimE(−3,T)≥1.