Linear-Algebra-Done-Right · Unit 19 · Video 1 · Interactive Practice

Real Spectral Theorem: Self-Adjoint ⇔ Orthonormal Eigenbasis

IKey Formulas

FormulaNameWhat it says
x2+bx+c=(x+b2)2+(c−b24)>0x^2 + bx + c = \left(x + \tfrac{b}{2}\right)^2 + \left(c - \tfrac{b^2}{4}\right) > 0Completing the squareFor real bb, cc with b2<4cb^2 < 4c and every real xx: the quadratic has no real zero
⟨(T2+bT+cI)v,v⟩≥(∥Tv∥−∣b∣ ∥v∥2)2+(c−b24)∥v∥2>0\langle (T^2 + bT + cI)v, v \rangle \ge \left(\|Tv\| - \tfrac{|b|\,\|v\|}{2}\right)^2 + \left(c - \tfrac{b^2}{4}\right)\|v\|^2 > 0Invertible quadratic expressionsFor T=T∗T = T^*, b2<4cb^2 < 4c and v≠0v \neq 0: so T2+bT+cIT^2 + bT + cI is injective, hence invertible
minimal polynomial of TT =(z−λ1)⋯(z−λm)= (z - \lambda_1)\cdots(z - \lambda_m), λk∈R\lambda_k \in \mathbf{R}Minimal polynomial of a self-adjoint operatorEvery quadratic factor z2+bz+cz^2 + bz + c with b2<4cb^2 < 4c would be invertible at TT and could be cancelled; so TT has an eigenvalue even when F=R\mathbf{F} = \mathbf{R}
F=R\mathbf{F} = \mathbf{R}: T=T∗  ⟺  M(T)T = T^* \iff \mathcal{M}(T) diagonal w.r.t. some orthonormal basis   ⟺  \iff VV has an orthonormal basis of eigenvectors of TTReal spectral theoremDiagonalizable alone is weaker: the eigenvectors must also be orthonormal

Key Insight: The minimal polynomial gives an upper-triangular matrix with respect to an orthonormal basis; T=T∗T = T^* makes that matrix equal its transpose, and only the diagonal survives.

IIWhy T2+bT+cIT^2 + bT + cI Cannot Send v≠0v \neq 0 to 00

With Q=T2+bT+cIQ = T^2 + bT + cI, T=T∗T = T^* and b2<4cb^2 < 4c, completing the square forces ⟨Qv,v⟩>0\langle Qv, v \rangle > 0 for every unit vector vv.

💡 Challenge: find bb, cc with b2≥4cb^2 \ge 4c that make Qv=0Qv = 0 for every vv when TT is self-adjoint. Then z2+bz+cz^2 + bz + c is the minimal polynomial of TT — and its zeros are real, as the theorem demands.

IIISymmetric Matrix, Perpendicular Eigenvectors

A real 2×22 \times 2 matrix with Mt=M\mathcal{M}^{t} = \mathcal{M} always has perpendicular eigenvector lines; without symmetry they tilt, merge or vanish.

IV(1) ⇒ (2): Upper-Triangular and Self-Adjoint Leaves Only the Diagonal

With respect to an orthonormal basis M(T∗)=M(T)t\mathcal{M}(T^*) = \mathcal{M}(T)^{t}, so an upper-triangular matrix of a self-adjoint TT is diagonal.

VQuiz Questions

Problem 1 · An Orthonormal Eigenbasis in the Plane

Given: T∈L(R2)T \in \mathcal{L}(\mathbf{R}^2) has matrix A=(2225)A = \begin{pmatrix} 2 & 2 \\ 2 & 5 \end{pmatrix} with respect to the standard basis, and R2\mathbf{R}^2 has the Euclidean inner product. Find an orthonormal basis of R2\mathbf{R}^2 consisting of eigenvectors of TT.

✅ Correct! T(2,−1)=(2,−1)T(2, -1) = (2, -1) and T(1,2)=(6,12)=6(1,2)T(1, 2) = (6, 12) = 6(1, 2); the two vectors are orthogonal and each has length 5\sqrt{5}, so in this basis M(T)=diag⁡(1,6)\mathcal{M}(T) = \operatorname{diag}(1, 6).
❌ Not quite. The standard basis is orthonormal, but T(1,0)=(2,2)T(1, 0) = (2, 2) is not a multiple of (1,0)(1, 0): AA is not diagonal, so these are not eigenvectors. The theorem promises some orthonormal eigenbasis, usually not the one you started with.
❌ Not quite. T(1,−2)=(2−4, 2−10)=(−2,−8)T(1, -2) = (2 - 4,\ 2 - 10) = (-2, -8) is not a multiple of (1,−2)(1, -2), and (1,2)⋅(1,−2)=−3≠0(1, 2) \cdot (1, -2) = -3 \neq 0, so the pair is not even orthogonal. The eigenvalue-11 eigenvector solves v1+2v2=0v_1 + 2v_2 = 0, giving (2,−1)(2, -1).
❌ Not quite. These are orthogonal eigenvectors (eigenvalues 11 and 66), but each has length 5\sqrt{5}, not 11. An orthonormal basis needs unit vectors: divide each by 5\sqrt{5}.
Show solution

A=AtA = A^{t} and the standard basis is orthonormal, so T=T∗T = T^*, and the real spectral theorem guarantees an orthonormal eigenbasis.

Eigenvalues. A2=(8141429)=7A−6IA^2 = \begin{pmatrix} 8 & 14 \\ 14 & 29 \end{pmatrix} = 7A - 6I, and AA is not a multiple of II, so the minimal polynomial is z2−7z+6=(z−1)(z−6)z^2 - 7z + 6 = (z - 1)(z - 6) — real linear factors, as the theorem on self-adjoint operators predicts. The eigenvalues are 11 and 66.

Eigenvectors. (A−I)v=0(A - I)v = 0 reads v1+2v2=0v_1 + 2v_2 = 0, so (2,−1)(2, -1); (A−6I)v=0(A - 6I)v = 0 reads 2v1−v2=02v_1 - v_2 = 0, so (1,2)(1, 2). Check: (2,−1)⋅(1,2)=2−2=0(2, -1) \cdot (1, 2) = 2 - 2 = 0.

Normalize. ∥(2,−1)∥=∥(1,2)∥=5\|(2, -1)\| = \|(1, 2)\| = \sqrt{5}, so

e1=15(2,−1),e2=15(1,2),M(T,(e1,e2))=(1006).e_1 = \tfrac{1}{\sqrt{5}}(2, -1), \qquad e_2 = \tfrac{1}{\sqrt{5}}(1, 2), \qquad \mathcal{M}\big(T, (e_1, e_2)\big) = \begin{pmatrix} 1 & 0 \\ 0 & 6 \end{pmatrix}.

Problem 2 · Diagonalizable Is Not Enough

Given: each matrix is M(T)\mathcal{M}(T) for an operator TT on R2\mathbf{R}^2 with respect to the standard basis (Euclidean inner product). For which TT does R2\mathbf{R}^2 have an orthonormal basis of eigenvectors of TT?

✅ Correct! The matrix equals its transpose and the standard basis is orthonormal, so T=T∗T = T^*; indeed 12(1,1)\tfrac{1}{\sqrt{2}}(1, 1) (eigenvalue 33) and 12(1,−1)\tfrac{1}{\sqrt{2}}(1, -1) (eigenvalue −1-1) form an orthonormal eigenbasis.
❌ Not quite. This TT is diagonalizable — T(1,0)=(2,0)T(1, 0) = (2, 0) and T(1,2)=(4,8)T(1, 2) = (4, 8) give a basis of eigenvectors, for the distinct eigenvalues 22 and 44 — but (1,0)⋅(1,2)=1≠0(1, 0) \cdot (1, 2) = 1 \neq 0, and each eigenspace is a single line, so no other choice of eigenvectors is orthogonal. The matrix is not equal to its transpose, so T≠T∗T \neq T^*, and the real spectral theorem rules out every orthonormal eigenbasis.
❌ Not quite. Here M(T)2=4M(T)−5I\mathcal{M}(T)^2 = 4\mathcal{M}(T) - 5I, so the minimal polynomial is z2−4z+5z^2 - 4z + 5, a quadratic with b2=16<20=4cb^2 = 16 < 20 = 4c. It has no real zero, so TT has no eigenvalue at all — it is 2I2I plus a quarter turn (a rotation scaled by 5\sqrt{5}), not self-adjoint.
❌ Not quite. The only eigenvalue is 11, and T(x,y)=(x+y,y)=(x,y)T(x, y) = (x + y, y) = (x, y) forces y=0y = 0: every eigenvector lies on the line through (1,0)(1, 0), so there is not even a basis of eigenvectors, orthonormal or not.
Show solution

Over R\mathbf{R}, an orthonormal eigenbasis exists exactly when T=T∗T = T^*, and with respect to the (orthonormal) standard basis that means M(T)t=M(T)\mathcal{M}(T)^{t} = \mathcal{M}(T). Only (d) is symmetric.

(d): T(1,1)=(3,3)T(1, 1) = (3, 3) and T(1,−1)=(−1,1)T(1, -1) = (-1, 1), with (1,1)⋅(1,−1)=0(1, 1) \cdot (1, -1) = 0; dividing by 2\sqrt{2} gives the orthonormal eigenbasis.

(a) has a basis of eigenvectors (1,0)(1, 0), (1,2)(1, 2) (eigenvalues 22, 44) with (1,0)⋅(1,2)=1≠0(1, 0) \cdot (1, 2) = 1 \neq 0 — diagonalizable but not self-adjoint. (b) has minimal polynomial z2−4z+5z^2 - 4z + 5 with (−4)2<4⋅5(-4)^2 < 4 \cdot 5, so no eigenvalue. (c) has eigenvectors only along (1,0)(1, 0).

Problem 3 · A Repeated Eigenvalue in R3\mathbf{R}^3

Given: T∈L(R3)T \in \mathcal{L}(\mathbf{R}^3) has matrix B=(301020103)B = \begin{pmatrix} 3 & 0 & 1 \\ 0 & 2 & 0 \\ 1 & 0 & 3 \end{pmatrix} with respect to the standard basis (Euclidean inner product). Find an orthonormal eigenbasis and the diagonal matrix of TT in it.

Which list is an orthonormal basis of eigenvectors of TT?

With respect to the basis in (a), in that order, M(T)\mathcal{M}(T) is

✅ Correct! T(1,0,1)=(4,0,4)T(1, 0, 1) = (4, 0, 4), T(0,1,0)=(0,2,0)T(0, 1, 0) = (0, 2, 0) and T(1,0,−1)=(2,0,−2)T(1, 0, -1) = (2, 0, -2); the three vectors are pairwise orthogonal, so the normalized list is an orthonormal eigenbasis with M(T)=diag⁡(4,2,2)\mathcal{M}(T) = \operatorname{diag}(4, 2, 2).
❌ Not quite. All three are eigenvectors — T(1,1,−1)=(2,2,−2)T(1, 1, -1) = (2, 2, -2) — but (0,1,0)⋅(1,1,−1)=1≠0(0, 1, 0) \cdot (1, 1, -1) = 1 \neq 0. Eigenvectors for distinct eigenvalues are automatically orthogonal; two from the same eigenspace (eigenvalue 22 here) are not, so they must be chosen orthogonal.
❌ Not quite. T(1,0,0)=(3,0,1)T(1, 0, 0) = (3, 0, 1) is not a multiple of (1,0,0)(1, 0, 0), and likewise for (0,0,1)(0, 0, 1): BB is not diagonal, so only (0,1,0)(0, 1, 0) in this list is an eigenvector.
❌ Not quite. T(0,0,1)=(1,0,3)T(0, 0, 1) = (1, 0, 3) is not a multiple of (0,0,1)(0, 0, 1), and (0,0,1)(0, 0, 1) is not orthogonal to (1,0,−1)(1, 0, -1) either; the missing eigenvector is (1,0,1)(1, 0, 1), for eigenvalue 44.
❌ Not quite. Check each vector: BvBv must be a multiple of vv, and every pair must have dot product 00.
❌ Not quite. These are the right eigenvalues in the wrong order. The kk-th diagonal entry is the eigenvalue of the kk-th basis vector, and the first vector 12(1,0,1)\tfrac{1}{\sqrt{2}}(1, 0, 1) has T(1,0,1)=(4,0,4)T(1, 0, 1) = (4, 0, 4): eigenvalue 44 comes first.
❌ Not quite. These are the diagonal entries of BB itself, the matrix with respect to the standard basis. Changing the basis changes the diagonal: T(1,0,1)=(4,0,4)T(1, 0, 1) = (4, 0, 4), so the first entry is 44, not 33.
❌ Not quite. T(1,0,−1)=(2,0,−2)=2(1,0,−1)T(1, 0, -1) = (2, 0, -2) = 2(1, 0, -1): the minus sign in the third coordinate belongs to the vector, so the eigenvalue is 22, not −2-2.
❌ Not quite. Apply BB to each basis vector in order and read off the multiple.
Show solution

B=BtB = B^{t}, so T=T∗T = T^* and an orthonormal eigenbasis exists.

Minimal polynomial. (B−2I)(B−4I)=(101000101)(−1010−2010−1)=0(B - 2I)(B - 4I) = \begin{pmatrix} 1 & 0 & 1 \\ 0 & 0 & 0 \\ 1 & 0 & 1 \end{pmatrix}\begin{pmatrix} -1 & 0 & 1 \\ 0 & -2 & 0 \\ 1 & 0 & -1 \end{pmatrix} = 0, and BB is not a multiple of II, so the minimal polynomial is (z−2)(z−4)(z - 2)(z - 4): eigenvalues 22 and 44.

Eigenvalue 4: (B−4I)v=0(B - 4I)v = 0 gives v2=0v_2 = 0, v1=v3v_1 = v_3, so (1,0,1)(1, 0, 1).

Eigenvalue 2: (B−2I)v=0(B - 2I)v = 0 gives only v1+v3=0v_1 + v_3 = 0 — a plane. Choose an orthogonal pair in it: (0,1,0)(0, 1, 0) and (1,0,−1)(1, 0, -1).

Pairwise dot products are 00; the lengths are 2\sqrt{2}, 11, 2\sqrt{2}. So

e1=12(1,0,1),e2=(0,1,0),e3=12(1,0,−1),M(T,(e1,e2,e3))=(400020002).e_1 = \tfrac{1}{\sqrt{2}}(1, 0, 1),\quad e_2 = (0, 1, 0),\quad e_3 = \tfrac{1}{\sqrt{2}}(1, 0, -1),\qquad \mathcal{M}\big(T, (e_1, e_2, e_3)\big) = \begin{pmatrix} 4 & 0 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 2 \end{pmatrix}.

Problem 4 · Which Quadratic Is Always Invertible?

Given: TT is a self-adjoint operator on a finite-dimensional real inner product space VV — any such VV, any such TT. Which operator is guaranteed to be invertible?

✅ Correct! b2=4<20=4cb^2 = 4 < 20 = 4c. Directly: ⟨(T2+2T+5I)v,v⟩=∥Tv+v∥2+4∥v∥2>0\langle (T^2 + 2T + 5I)v, v \rangle = \|Tv + v\|^2 + 4\|v\|^2 > 0 for v≠0v \neq 0.
❌ Not quite. Here b2=16=4cb^2 = 16 = 4c, equality rather than <<: T2−4T+4I=(T−2I)2T^2 - 4T + 4I = (T - 2I)^2, which is the zero operator when T=2IT = 2I. The theorem needs the strict inequality.
❌ Not quite. b2=25>24=4cb^2 = 25 > 24 = 4c, so the quadratic has real zeros: T2−5T+6I=(T−2I)(T−3I)T^2 - 5T + 6I = (T - 2I)(T - 3I) sends every eigenvector with eigenvalue 22 to 00 — for instance every vector when T=2IT = 2I.
❌ Not quite. Positive coefficients do not help: b2=16>12=4cb^2 = 16 > 12 = 4c, and T2+4T+3I=(T+I)(T+3I)T^2 + 4T + 3I = (T + I)(T + 3I) is the zero operator for the self-adjoint T=−IT = -I.
Show solution

The theorem on invertible quadratic expressions applies exactly when b2<4cb^2 < 4c: only (b) qualifies (4<204 < 20); (a) has 16=1616 = 16, (c) has 25>2425 > 24, (d) has 16>1216 > 12.

Direct check for (b). Since T=T∗T = T^*, ⟨T2v,v⟩=⟨Tv,Tv⟩=∥Tv∥2\langle T^2 v, v \rangle = \langle Tv, Tv \rangle = \|Tv\|^2, and over R\mathbf{R}, ∥Tv+v∥2=∥Tv∥2+2⟨Tv,v⟩+∥v∥2\|Tv + v\|^2 = \|Tv\|^2 + 2\langle Tv, v \rangle + \|v\|^2. Hence

⟨(T2+2T+5I)v,v⟩=∥Tv∥2+2⟨Tv,v⟩+5∥v∥2=∥Tv+v∥2+4∥v∥2≥4∥v∥2>0\langle (T^2 + 2T + 5I)v, v \rangle = \|Tv\|^2 + 2\langle Tv, v \rangle + 5\|v\|^2 = \|Tv + v\|^2 + 4\|v\|^2 \ge 4\|v\|^2 > 0

for v≠0v \neq 0, so (T2+2T+5I)v≠0(T^2 + 2T + 5I)v \neq 0: the operator is injective, hence invertible since VV is finite-dimensional.

The others fail for T=2IT = 2I, T=2IT = 2I and T=−IT = -I respectively, each a self-adjoint operator.

Solved: 0 / 4