Review : Eigenvalues & Eigenvectors — Question 4

PDF ↗

Question 4

An eigenpair satisfies Av=λvAv=\lambda v with v≠0v\ne 0. The eigenspace Eλ=ker⁡(A−λI)E_\lambda=\ker(A-\lambda I) includes zero, although zero is not an eigenvector. Algebraic multiplicity counts roots of det⁡(λI−A)\det(\lambda I-A); geometric multiplicity is dim⁡Eλ\dim E_\lambda. Work over ℝ\mathbb R unless complex scalars are explicitly requested.

Consider the real symmetric matrix S=(21012000−1).S=\begin{pmatrix}2&1&0\\1&2&0\\0&0&-1\end{pmatrix}.

Tasks

  1. Find an orthonormal eigenvector basis and an orthogonal diagonalization S=QDQTS=QDQ^T. Verify the columns directly.

  2. Prove that eigenvectors of a real symmetric matrix belonging to distinct real eigenvalues are perpendicular, and connect the proof to your basis.

  3. Find the sharp minimum and maximum of xTSxx^TSx over real vectors with ∥x∥=1\|x\|=1, giving every equality case.

  4. Use the spectral decomposition to find S−1S^{-1} and verify it. Explain why a negative eigenvalue does not prevent invertibility but does prevent positive definiteness.

Original worksheet page 1: question and worked solution for 5-3-004
Show solutionHide solution

Question 4 – Solution

Strategy. An orthonormal eigenvector basis turns both a quadratic form and an inverse into scalar calculations.

Step 1: Construct and check the basis. Take q1=12(1,1,0)T,q2=12(1,−1,0)T,q3=(0,0,1)T.q_1=\frac 1{\sqrt 2}(1,1,0)^T,\quad q_2=\frac 1{\sqrt 2}(1,-1,0)^T,\quad q_3=(0,0,1)^T. Direct multiplication gives eigenvalues 3,1,−13,1,-1, respectively. The columns are orthonormal, so Q=(q1q2q3)Q=(q_1\ q_2\ q_3) has QTQ=IQ^TQ=I. Thus SQ=QDSQ=QD with D=diag⁡(3,1,−1)D=\operatorname{diag}(3,1,-1), and S=QDQT\boxed{S=QDQ^T}.

Step 2: Prove perpendicularity. For a real symmetric matrix, if Sa=λaSa=\lambda a and Sb=μbSb=\mu b, then λaTb=(Sa)Tb=aTSTb=aTSb=μaTb.\lambda a^Tb=(Sa)^Tb=a^TS^Tb=a^TSb=\mu a^Tb. When λ≠μ\lambda\ne\mu, this forces aTb=0a^Tb=0. Normalizing the three perpendicular directions gives exactly the orthonormal basis above.

Step 3: Derive the sharp quadratic-form bounds. Write x=c1q1+c2q2+c3q3x=c_1q_1+c_2q_2+c_3q_3. For a unit vector, c12+c22+c32=1c_1^2+c_2^2+c_3^2=1, and xTSx=3c12+c22−c32.x^TSx=3c_1^2+c_2^2-c_3^2. This is a weighted average of 3,1,−13,1,-1, so −1≤xTSx≤3\boxed{-1\le x^TSx\le 3}. The minimum occurs exactly at x=±q3x=\pm q_3; the maximum exactly at x=±q1x=\pm q_1. The coefficients of all other directions must vanish at an endpoint.

Step 4: Invert the nonzero eigenvalues. Since no eigenvalue is zero, S−1=Qdiag⁡(1/3,1,−1)QT=(2/3−1/30−1/32/3000−1).\boxed{S^{-1}=Q\operatorname{diag}(1/3,1,-1)Q^T =\begin{pmatrix}2/3&-1/3&0\\-1/3&2/3&0\\0&0&-1\end{pmatrix}.} Multiplying by SS gives I3I_3. Invertibility excludes zero eigenvalues, not negative ones. But q3TSq3=−1<0q_3^TSq_3=-1<0, so SS is not positive definite; in fact its quadratic form takes both positive and negative values.

Original worksheet page 2: question and worked solution for 5-3-004

Original worksheet layout. Use Enlarge or open the PDF for a closer view.