Linear-Algebra-Done-Right · Unit 11 · Video 3 · Interactive Practice

p(T) and Why Every Complex Operator Has an Eigenvalue

IKey Formulas

FormulaNameWhat it says
p(T)=a0I+a1T+a2T2+⋯+amTmp(T) = a_0 I + a_1 T + a_2 T^2 + \cdots + a_m T^mA polynomial applied to an operatorFor T∈L(V)T \in \mathcal{L}(V) and p(z)=a0+a1z+⋯+amzm∈P(F)p(z) = a_0 + a_1 z + \cdots + a_m z^m \in \mathcal{P}(\mathbf{F}), replace zz by TT; the constant term a0=a0z0a_0 = a_0 z^0 becomes a0T0=a0Ia_0 T^0 = a_0 I
(pq)(T)=p(T) q(T)=q(T) p(T)(pq)(T) = p(T)\,q(T) = q(T)\,p(T)Multiplicative propertyFor p,q∈P(F)p, q \in \mathcal{P}(\mathbf{F}) and T∈L(V)T \in \mathcal{L}(V): products of polynomials become products of operators, and two polynomials in the same TT commute
null p(T)\text{null}\, p(T) and range p(T)\text{range}\, p(T) are invariant under TTInvariant subspaces from polynomialsFor T∈L(V)T \in \mathcal{L}(V) and p∈P(F)p \in \mathcal{P}(\mathbf{F}); with p(z)=z−λp(z) = z - \lambda this says null (T−λI)\text{null}\,(T - \lambda I) is invariant
T(q(T)v)=λ q(T)vT\big(q(T)v\big) = \lambda\, q(T)v,  q(T)v≠0\ q(T)v \ne 0Existence of eigenvaluesIf F=C\mathbf{F} = \mathbf{C}, VV is finite-dimensional, V≠{0}V \ne \{0\} and T∈L(V)T \in \mathcal{L}(V), then TT has an eigenvalue: for v≠0v \ne 0, v,Tv,…,Tnvv, Tv, \dots, T^n v (n=dim⁡Vn = \dim V) is dependent, a nonconstant pp of smallest degree with p(T)v=0p(T)v = 0 factors as p(z)=(z−λ)q(z)p(z) = (z - \lambda)q(z), and q(T)vq(T)v is an eigenvector for λ\lambda

Key Insight: Both hypotheses are needed. The rotation T(w,z)=(−z,w)T(w, z) = (-z, w) on R2\mathbf{R}^2 gives p(z)=z2+1p(z) = z^2 + 1, which has no real zero; multiplication by zz on the infinite-dimensional P(C)\mathcal{P}(\mathbf{C}) never produces a dependent list 1,z,z2,…1, z, z^2, \dots, so no pp is found at all.

IITwo Routes to (pq)(T)v(pq)(T)v

Applying q(T)q(T) then p(T)p(T), or p(T)p(T) then q(T)q(T), reaches the same vector (pq)(T)v(pq)(T)v; an operator SS outside the polynomials in TT need not.

IIInull p(T)\text{null}\, p(T) and range p(T)\text{range}\, p(T) Are Invariant

For T(x,y)=(y,2x+y)T(x, y) = (y, 2x + y), TT maps null p(T)\text{null}\, p(T) into itself and range p(T)\text{range}\, p(T) into itself.

💡 In R2\mathbf{R}^2 a line invariant under TT is spanned by an eigenvector, so these lines are eigenvector lines: null (T−2I)\text{null}\,(T - 2I) for 22, and range (T−2I)=null (T+I)\text{range}\,(T - 2I) = \text{null}\,(T + I) for −1-1.

IVRunning the Existence Proof

From a nonzero vv, the dependent list v,Tv,T2vv, Tv, T^2 v yields pp, a zero λ\lambda of pp, and the eigenvector q(T)vq(T)v.

VQuiz Questions

Problem 1 · Compute p(T)p(T)

Given: T∈L(R2)T \in \mathcal{L}(\mathbf{R}^2), T(x,y)=(2x+y, 3y)T(x, y) = (2x + y,\ 3y), and p(z)=z2−4z+3p(z) = z^2 - 4z + 3 — find p(T)p(T).

✅ Correct! T2(x,y)=(4x+5y, 9y)T^2(x, y) = (4x + 5y,\ 9y), so T2−4T+3IT^2 - 4T + 3I sends (x,y)(x, y) to (−x+y, 0)(-x + y,\ 0).
❌ Not quite. The constant 33 was added to every entry of the matrix of T2−4TT^2 - 4T, which is (−410−3)\begin{pmatrix} -4 & 1 \\ 0 & -3 \end{pmatrix}. The constant term of pp becomes 3I3I, which adds 3x3x to the first coordinate and 3y3y to the second, nothing else.
❌ Not quite. T2T^2 is TT composed with itself, not the matrix with each entry squared: T2(x,y)=T(2x+y, 3y)=(4x+5y, 9y)T^2(x, y) = T(2x + y,\ 3y) = (4x + 5y,\ 9y).
❌ Not quite. Using only p(2)=−1p(2) = -1 and p(3)=0p(3) = 0 drops the yy-term in the first coordinate: T2T^2 contributes 5y5y and −4T-4T contributes −4y-4y, leaving +y+y.
Show solution

Compose TT with itself:

T2(x,y)=T(2x+y, 3y)=(2(2x+y)+3y, 9y)=(4x+5y, 9y).T^2(x, y) = T(2x + y,\ 3y) = \big(2(2x + y) + 3y,\ 9y\big) = (4x + 5y,\ 9y).

Replace zz by TT and the constant 33 by 3I3I:

p(T)(x,y)=(4x+5y, 9y)−4(2x+y, 3y)+3(x,y)=(−x+y, 0).p(T)(x, y) = (4x + 5y,\ 9y) - 4(2x + y,\ 3y) + 3(x, y) = (-x + y,\ 0).

In matrix form, p(T)=(−1100)p(T) = \begin{pmatrix} -1 & 1 \\ 0 & 0 \end{pmatrix}.

Problem 2 · Which Operators Commute?

Given: T,S∈L(R2)T, S \in \mathcal{L}(\mathbf{R}^2) with T(x,y)=(y, −4x)T(x, y) = (y,\ -4x) and S(x,y)=(x, 0)S(x, y) = (x,\ 0) — which statement is true?

✅ Correct! TT and T2+3IT^2 + 3I are both polynomials in TT (zz and z2+3z^2 + 3), so they commute; SS is not a polynomial in TT, and here it does not commute with TT.
❌ Not quite. Operators on the same space need not commute, just as DM≠MDDM \ne MD on P(R)\mathcal{P}(\mathbf{R}). Test (1,0)(1, 0): TS(1,0)=T(1,0)=(0,−4)TS(1, 0) = T(1, 0) = (0, -4), but ST(1,0)=S(0,−4)=(0,0)ST(1, 0) = S(0, -4) = (0, 0).
❌ Not quite. With p(z)=zp(z) = z and q(z)=z2+3q(z) = z^2 + 3, the multiplicative property gives p(T)q(T)=(pq)(T)=(qp)(T)=q(T)p(T)p(T)q(T) = (pq)(T) = (qp)(T) = q(T)p(T): polynomials in the same operator always commute.
❌ Not quite. The order of composition is reversed. TSTS applies SS first: TS(1,0)=T(S(1,0))=T(1,0)=(0,−4)TS(1, 0) = T\big(S(1, 0)\big) = T(1, 0) = (0, -4).
Show solution

Polynomials in TT. T=p(T)T = p(T) with p(z)=zp(z) = z, and T2+3I=q(T)T^2 + 3I = q(T) with q(z)=z2+3q(z) = z^2 + 3. By the multiplicative property, p(T)q(T)=(pq)(T)=(qp)(T)=q(T)p(T)p(T)q(T) = (pq)(T) = (qp)(T) = q(T)p(T); both sides equal T3+3TT^3 + 3T.

TT and SS. Apply each composition to (1,0)(1, 0), rightmost operator first:

TS(1,0)=T(1,0)=(0,−4),ST(1,0)=S(0,−4)=(0,0).TS(1, 0) = T(1, 0) = (0, -4), \qquad ST(1, 0) = S(0, -4) = (0, 0).

The outputs differ, so TS≠STTS \ne ST.

Problem 3 · Null Space and Range of p(T)p(T)

Given: T∈L(R2)T \in \mathcal{L}(\mathbf{R}^2), T(x,y)=(2x+y, 3y)T(x, y) = (2x + y,\ 3y), and p(z)=z−3p(z) = z - 3 — find null p(T)\text{null}\, p(T) and range p(T)\text{range}\, p(T), both of which are invariant under TT.

What is null p(T)\text{null}\, p(T)?

What is range p(T)\text{range}\, p(T)?

✅ Correct! p(T)(x,y)=(−x+y, 0)p(T)(x, y) = (-x + y,\ 0). Invariance checks out: T(1,1)=(3,3)T(1, 1) = (3, 3) stays in null p(T)\text{null}\, p(T), and T(1,0)=(2,0)T(1, 0) = (2, 0) stays in range p(T)\text{range}\, p(T).
❌ Check the null space. Solve p(T)(x,y)=(−x+y, 0)=(0,0)p(T)(x, y) = (-x + y,\ 0) = (0, 0): the only condition is y=xy = x.
❌ Check the range. Every output (−x+y, 0)(-x + y,\ 0) has second coordinate 00, and every first coordinate occurs.
❌ Not quite. The null space and the range have been swapped. null p(T)\text{null}\, p(T) is where p(T)p(T) gives 00; range p(T)\text{range}\, p(T) is the set of outputs of p(T)p(T).
❌ Not quite. (−1,1)(-1, 1) is the first row of the matrix of p(T)p(T). The range is spanned by the columns, (−1,0)(-1, 0) and (1,0)(1, 0).
Show solution
p(T)(x,y)=T(x,y)−3(x,y)=(2x+y−3x, 3y−3y)=(−x+y, 0).p(T)(x, y) = T(x, y) - 3(x, y) = (2x + y - 3x,\ 3y - 3y) = (-x + y,\ 0).

Null space. (−x+y, 0)=(0,0)(-x + y,\ 0) = (0, 0) exactly when y=xy = x, so null p(T)=span{(1,1)}\text{null}\, p(T) = \text{span}\{(1, 1)\}.

Range. The outputs are (t,0)(t, 0) with t=−x+yt = -x + y arbitrary, so range p(T)=span{(1,0)}\text{range}\, p(T) = \text{span}\{(1, 0)\}.

Invariance. T(1,1)=(3,3)=3(1,1)T(1, 1) = (3, 3) = 3(1, 1) and T(1,0)=(2,0)=2(1,0)T(1, 0) = (2, 0) = 2(1, 0), so TT maps each line into itself, as the theorem guarantees. Each line is spanned by an eigenvector, with eigenvalues 33 and 22.

Problem 4 · The Proof on P2(C)\mathcal{P}_2(\mathbf{C}), and Where It Fails

Given: D∈L(P2(C))D \in \mathcal{L}\big(\mathcal{P}_2(\mathbf{C})\big), Df=f′Df = f', and the starting vector v=z2v = z^2. Run the existence proof: find the nonconstant pp of smallest degree with p(D)v=0p(D)v = 0 and the eigenvector q(D)vq(D)v it produces. Then let M∈L(P(C))M \in \mathcal{L}\big(\mathcal{P}(\mathbf{C})\big), (Mf)(z)=zf(z)(Mf)(z) = z f(z), with v=1v = 1.

Which pp does the proof find for DD?

Which eigenvector q(D)vq(D)v results?

Why does the proof fail for MM on P(C)\mathcal{P}(\mathbf{C})?

✅ Correct! For DD: p(z)=z3=(z−0)z2p(z) = z^3 = (z - 0)z^2, so λ=0\lambda = 0 and q(D)v=D2z2=2q(D)v = D^2 z^2 = 2, a nonzero constant with D(2)=0D(2) = 0. For MM the list 1,z,z2,…1, z, z^2, \dots never becomes dependent, which is possible only because P(C)\mathcal{P}(\mathbf{C}) is infinite-dimensional.
❌ Check pp. For pp of degree at most 22, p(D)z2=a0z2+2a1z+2a2p(D)z^2 = a_0 z^2 + 2a_1 z + 2a_2, which is 00 only when p=0p = 0.
❌ Not quite. D2z2=2≠0D^2 z^2 = 2 \ne 0. Two derivatives leave a constant; a third is needed to reach 00.
❌ Not quite. Dz2=2zDz^2 = 2z is not 2z22z^2, so (D−2I)z2=2z−2z2≠0(D - 2I)z^2 = 2z - 2z^2 \ne 0; z2z^2 is not an eigenvector.
❌ Check qq. p(z)=z3p(z) = z^3 has the zero λ=0\lambda = 0 and splits as (z−0) q(z)(z - 0)\,q(z) with q(z)=z2q(z) = z^2; compute q(D)z2=D2z2q(D)z^2 = D^2 z^2.
❌ Not quite. An eigenvector is nonzero by definition, and the proof shows q(D)v≠0q(D)v \ne 0 because deg⁡q<deg⁡p\deg q < \deg p.
❌ Check the failure for MM. The proof's first step needs the list v,Mv,M2v,…v, Mv, M^2 v, \dots to become linearly dependent.
❌ Not quite. M1=zM1 = z, which is not 0⋅1=00 \cdot 1 = 0. In fact deg⁡(Mf)=deg⁡f+1\deg(Mf) = \deg f + 1 for f≠0f \ne 0, so MfMf is never a scalar multiple of ff: MM has no eigenvalues.
❌ Not quite. Over C\mathbf{C} every nonconstant polynomial has a zero. Here no pp is found at all: p(M)1=pp(M)1 = p, which is 00 only when p=0p = 0.
❌ Not quite. MM is linear: z(f+g)=zf+zgz(f + g) = zf + zg and z(cf)=c(zf)z(cf) = c(zf). The obstacle is dimension, not linearity.
Show solution

The list. dim⁡P2(C)=3\dim \mathcal{P}_2(\mathbf{C}) = 3, so take v,Dv,D2v,D3vv, Dv, D^2 v, D^3 v:

z2,2z,2,0.z^2,\quad 2z,\quad 2,\quad 0.

Smallest degree. If p(z)=a0+a1z+a2z2p(z) = a_0 + a_1 z + a_2 z^2, then p(D)z2=a0z2+2a1z+2a2p(D)z^2 = a_0 z^2 + 2a_1 z + 2a_2, which is 00 only if a0=a1=a2=0a_0 = a_1 = a_2 = 0. Degree 33 works: D3z2=0D^3 z^2 = 0. So p(z)=z3p(z) = z^3 (any nonzero multiple gives the same result).

Factor. The zero is λ=0\lambda = 0, and p(z)=(z−0) q(z)p(z) = (z - 0)\,q(z) with q(z)=z2q(z) = z^2. Then q(D)v=D2z2=2≠0q(D)v = D^2 z^2 = 2 \ne 0 and D(2)=0=0⋅2D(2) = 0 = 0 \cdot 2, so 22 is an eigenvector of DD with eigenvalue 00.

Multiplication by zz. Starting from v=1v = 1: Mk1=zkM^k 1 = z^k, and 1,z,…,zn1, z, \dots, z^n is linearly independent for every nn. For any nonzero polynomial pp, p(M)1=p≠0p(M)1 = p \ne 0, so the first step never produces a polynomial. This does not contradict the theorem, because P(C)\mathcal{P}(\mathbf{C}) is infinite-dimensional — and MM indeed has no eigenvalues.

Solved: 0 / 4