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

Eigenvalues Are the Zeros of the Minimal Polynomial

IKey Formulas

FormulaNameWhat it says
{zeros of p in F}={eigenvalues of T}\{\text{zeros of } p \text{ in } \mathbf{F}\} = \{\text{eigenvalues of } T\}Eigenvalues are the zeros of the minimal polynomialVV finite-dimensional, T∈L(V)T \in \mathcal{L}(V), pp = minimal polynomial of TT. If F=C\mathbf{F} = \mathbf{C} and V≠{0}V \neq \{0\}: p(z)=(z−λ1)⋯(z−λm)p(z) = (z - \lambda_1)\cdots(z - \lambda_m), where λ1,…,λm\lambda_1, \ldots, \lambda_m lists all eigenvalues of TT, repeats allowed
q(T)=0  ⟺  q=psq(T) = 0 \iff q = ps for some s∈P(F)s \in \mathcal{P}(\mathbf{F})Polynomials that send TT to 00For q∈P(F)q \in \mathcal{P}(\mathbf{F}): divide, q=ps+rq = ps + r with deg⁡r<deg⁡p\deg r < \deg p; then q(T)=r(T)q(T) = r(T), and r(T)=0r(T) = 0 forces r=0r = 0 by minimality of pp
p=(minimal polynomial of T∣U)⋅sp = (\text{minimal polynomial of } T|_U)\cdot sRestriction to an invariant subspaceUU a subspace with Tu∈UTu \in U for all u∈Uu \in U, so T∣U∈L(U)T|_U \in \mathcal{L}(U); every eigenvalue of T∣UT|_U is an eigenvalue of TT
TT not invertible   ⟺  p(0)=0\iff p(0) = 0Invertibility from the constant termTT not invertible   ⟺  0\iff 0 is an eigenvalue   ⟺  0\iff 0 is a zero of pp, and p(0)p(0) is the constant term of pp

Key Insight: If Tv=λvTv = \lambda v then Tkv=λkvT^k v = \lambda^k v for every kk, so p(T)v=p(λ)vp(T)v = p(\lambda)v: the operator equation p(T)=0p(T) = 0 becomes the scalar equation p(λ)=0p(\lambda) = 0 on each eigenvector.

IIWhich Zeros Are Eigenvalues?

The eigenvalues of TT are exactly the zeros of its minimal polynomial that lie in F\mathbf{F}.

IIIWhich Polynomials Send TT to 00?

Dividing qq by pp gives q=ps+rq = ps + r with q(T)=r(T)q(T) = r(T), so q(T)=0q(T) = 0 exactly when r=0r = 0.

IVThe Constant Term Decides Invertibility

TT is invertible exactly when p(0)≠0p(0) \neq 0, and then p(T)=0p(T) = 0 can be solved for T−1T^{-1}.

💡 Every monic polynomial is the minimal polynomial of some operator (the video's construction with ones below the diagonal and the negated lower coefficients in the last column), so each cubic here describes an actual operator on F3\mathbf{F}^3.

VQuiz Questions

Problem 1 · Read Off the Eigenvalues

Given: T∈L(C4)T \in \mathcal{L}(\mathbf{C}^4) has minimal polynomial p(z)=(z−1)(z+2)2p(z) = (z - 1)(z + 2)^2. Find the eigenvalues of TT.

✅ Correct! The zeros of pp are 11 and −2-2, and the zeros of the minimal polynomial are exactly the eigenvalues.
❌ Not quite. The factor z+2z + 2 vanishes at z=−2z = -2, not at z=2z = 2.
❌ Not quite. Both signs are flipped: z−1z - 1 vanishes at 11 and z+2z + 2 vanishes at −2-2.
❌ Not quite. The repeated factor does not crowd out the other one: p(1)=0⋅9=0p(1) = 0 \cdot 9 = 0, so 11 is an eigenvalue too.
Show solution

Here V=C4V = \mathbf{C}^4 is finite-dimensional, so the zeros of the minimal polynomial are exactly the eigenvalues of TT.

p(z)=(z−1)(z+2)2=0  ⟺  z=1 or z=−2.p(z) = (z - 1)(z + 2)^2 = 0 \iff z = 1 \ \text{or}\ z = -2.

So the eigenvalues are 11 and −2-2. The square on z+2z + 2 only means that −2-2 appears twice in the list λ1,λ2,λ3\lambda_1, \lambda_2, \lambda_3 of the factorization p(z)=(z−1)(z+2)(z+2)p(z) = (z - 1)(z + 2)(z + 2); it adds no new eigenvalue. Two distinct eigenvalues is consistent with the bound #{eigenvalues}≤deg⁡p=3≤dim⁡V=4\#\{\text{eigenvalues}\} \leq \deg p = 3 \leq \dim V = 4.

Problem 2 · Over the Real Numbers

Given: T∈L(R3)T \in \mathcal{L}(\mathbf{R}^3) has minimal polynomial p(z)=z3−2z+4p(z) = z^3 - 2z + 4. Find the true statement.

✅ Correct! p(0)=4≠0p(0) = 4 \neq 0 gives invertibility, and −2-2 is the only zero of pp in R\mathbf{R}.
❌ Not quite. Invertibility fails only when 00 is a zero of pp. Here p(0)=4≠0p(0) = 4 \neq 0; the zero −2-2 means T+2IT + 2I is not invertible, not TT.
❌ Not quite. An eigenvalue of an operator on a real vector space must be a real number. The zeros 1±i1 \pm i are not in F=R\mathbf{F} = \mathbf{R}.
❌ Not quite. Test small integers: p(−2)=−8+4+4=0p(-2) = -8 + 4 + 4 = 0, so −2∈R-2 \in \mathbf{R} is a zero and hence an eigenvalue.
Show solution

Zeros. p(−2)=−8+4+4=0p(-2) = -8 + 4 + 4 = 0, so z+2z + 2 is a factor:

z3−2z+4=(z+2)(z2−2z+2).z^3 - 2z + 4 = (z + 2)(z^2 - 2z + 2).

The quadratic has b2−4c=4−8=−4<0b^2 - 4c = 4 - 8 = -4 < 0, so its zeros 1±i1 \pm i are not real. The only zero of pp in R\mathbf{R} is −2-2.

Eigenvalues. With F=R\mathbf{F} = \mathbf{R} the eigenvalues of TT are the zeros of pp in R\mathbf{R}: only −2-2.

Invertibility. The constant term is p(0)=4≠0p(0) = 4 \neq 0, so 00 is not a zero of pp, 00 is not an eigenvalue, and TT is invertible.

Problem 3 · The Inverse as a Polynomial in TT

Given: VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V) has minimal polynomial p(z)=z3+2z2−5z+2p(z) = z^3 + 2z^2 - 5z + 2. Decide whether TT is invertible, then find T−1T^{-1} as a polynomial in TT.

Is TT invertible?

Which formula gives T−1T^{-1}?

✅ Correct! T⋅(−12)(T2+2T−5I)=−12(p(T)−2I)=IT \cdot \left(-\tfrac{1}{2}\right)(T^2 + 2T - 5I) = -\tfrac{1}{2}\left(p(T) - 2I\right) = I.
❌ Not quite. p(1)=0p(1) = 0 is true, so 11 is an eigenvalue — that makes T−IT - I non-invertible. Invertibility of TT itself depends on whether 00 is a zero of pp.
❌ Not quite. The minimal polynomial alone decides it: TT is not invertible exactly when the constant term of pp is 00.
❌ Not quite. Look at the constant term of pp.
❌ Check the sign. From T3+2T2−5T=−2IT^3 + 2T^2 - 5T = -2I you divide by −2-2, not 22; this choice gives T⋅12(T2+2T−5I)=−IT \cdot \tfrac{1}{2}(T^2 + 2T - 5I) = -I.
❌ Not quite. Since T3+2T2−5T=−2IT^3 + 2T^2 - 5T = -2I, this expression equals II, not T−1T^{-1}. Factor one TT out first: T(T2+2T−5I)=−2IT(T^2 + 2T - 5I) = -2I.
❌ Not quite. The coefficient to divide by is the constant term 22, and the factor left after pulling out TT is T2+2T−5IT^2 + 2T - 5I.
❌ Not quite. Move the constant term to the other side of p(T)=0p(T) = 0 and factor out TT.
Show solution

Invertibility. The constant term of pp is p(0)=2≠0p(0) = 2 \neq 0, so 00 is not a zero of pp, hence not an eigenvalue of TT, and TT is invertible. (That p(1)=1+2−5+2=0p(1) = 1 + 2 - 5 + 2 = 0 only says 11 is an eigenvalue.)

Inverse. Since p(T)=0p(T) = 0,

T3+2T2−5T+2I=0  ⟹  T(T2+2T−5I)=−2I.T^3 + 2T^2 - 5T + 2I = 0 \implies T\left(T^2 + 2T - 5I\right) = -2I.

Divide by −2-2:

T⋅(−12)(T2+2T−5I)=I.T \cdot \left(-\tfrac{1}{2}\right)\left(T^2 + 2T - 5I\right) = I.

Polynomials in TT commute with TT, so the same product in the other order is also II, and

T−1=−12(T2+2T−5I)=−12T2−T+52I.T^{-1} = -\tfrac{1}{2}\left(T^2 + 2T - 5I\right) = -\tfrac{1}{2}T^2 - T + \tfrac{5}{2}I.

Problem 4 · Multiples and Divisors

Given: VV is finite-dimensional and T∈L(V)T \in \mathcal{L}(V) has minimal polynomial p(z)=z2(z−3)p(z) = z^2(z - 3). Find which polynomial cannot be the minimal polynomial of T∣UT|_U for an invariant subspace U≠{0}U \neq \{0\}, and which polynomial qq satisfies q(T)=0q(T) = 0.

Which cannot be the minimal polynomial of T∣UT|_U?

Which qq satisfies q(T)=0q(T) = 0?

✅ Correct! (z−3)2(z - 3)^2 does not divide pp, while z4−6z3+9z2=z2(z−3)2=p(z) (z−3)z^4 - 6z^3 + 9z^2 = z^2(z - 3)^2 = p(z)\,(z - 3) is a multiple of pp.
❌ Not quite. 33 is a zero of pp, so it is an eigenvalue; for an eigenvector vv, U=span⁡(v)U = \operatorname{span}(v) is invariant and T∣U=3IT|_U = 3I has minimal polynomial z−3z - 3.
❌ Not quite. 00 is a zero of pp, so it is an eigenvalue; on the span of an eigenvector for 00, T∣U=0T|_U = 0 has minimal polynomial zz.
❌ Not quite. Take eigenvectors uu for 00 and ww for 33 and U=span⁡(u,w)U = \operatorname{span}(u, w): T∣UT|_U is not a scalar multiple of the identity, and T∣U(T∣U−3I)=0T|_U(T|_U - 3I) = 0, so its minimal polynomial is z(z−3)z(z - 3).
❌ Not quite. The minimal polynomial of T∣UT|_U must divide pp.
❌ Not quite. z2−3z=z(z−3)z^2 - 3z = z(z - 3) divides pp but is not a multiple of it: it is nonzero of degree 2<3=deg⁡p2 < 3 = \deg p, so q(T)≠0q(T) \neq 0 by minimality.
❌ Not quite. Having the zeros 00 and 33 is not enough: z4−3z3+z2−3z=z(z−3)(z2+1)z^4 - 3z^3 + z^2 - 3z = z(z - 3)(z^2 + 1) contains only one factor zz, so z2(z−3)z^2(z - 3) does not divide it.
❌ Not quite. z3−3z2+1=p(z)+1z^3 - 3z^2 + 1 = p(z) + 1, so q(T)=p(T)+I=I≠0q(T) = p(T) + I = I \neq 0.
❌ Not quite. q(T)=0q(T) = 0 exactly when qq is a polynomial multiple of pp.
Show solution

Restriction. For an invariant UU, pp is a polynomial multiple of the minimal polynomial of T∣UT|_U, so that minimal polynomial divides z2(z−3)z^2(z - 3). The polynomial (z−3)2(z - 3)^2 does not divide z2(z−3)z^2(z - 3): the quotient would have to be a polynomial ss with z2(z−3)=(z−3)2s(z)z^2(z - 3) = (z - 3)^2 s(z), and dividing by z−3z - 3 gives z2=(z−3)s(z)z^2 = (z - 3)s(z), which fails at z=3z = 3 (9≠09 \neq 0). So (z−3)2(z - 3)^2 is impossible.

The other three all occur. The zeros 00 and 33 of pp are eigenvalues of TT; pick eigenvectors uu (for 00) and ww (for 33). Then span⁡(u)\operatorname{span}(u), span⁡(w)\operatorname{span}(w) and span⁡(u,w)\operatorname{span}(u, w) are invariant, with restrictions having minimal polynomials zz, z−3z - 3 and z(z−3)z(z - 3).

Polynomials sending TT to 00. q(T)=0  ⟺  q=psq(T) = 0 \iff q = ps for some ss.

z4−6z3+9z2=z2(z−3)2=z2(z−3)⏟p(z) (z−3)✓z^4 - 6z^3 + 9z^2 = z^2(z - 3)^2 = \underbrace{z^2(z - 3)}_{p(z)}\,(z - 3) \quad\checkmark z2−3z=z(z−3),z4−3z3+z2−3z=z(z−3)(z2+1),z3−3z2+1=p(z)+1.z^2 - 3z = z(z - 3), \qquad z^4 - 3z^3 + z^2 - 3z = z(z - 3)(z^2 + 1), \qquad z^3 - 3z^2 + 1 = p(z) + 1.

None of the last three is a multiple of pp: the first two contain only one factor zz, and the third leaves remainder 11, giving q(T)=Iq(T) = I.

Solved: 0 / 4