Review : Eigenvalues & Eigenvectors — Question 9

PDF ↗

Question 9

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.

Let A=(010100002),B=A2.A=\begin{pmatrix}0&1&0\\1&0&0\\0&0&2\end{pmatrix},\qquad B=A^2. For a polynomial pp, define p(A)p(A) by replacing each scalar power with the corresponding matrix power and each constant with that constant times I3I_3.

Tasks

  1. Find the eigenvalues and eigenspaces of AA and BB, and explain why squaring merges some eigenspaces.

  2. Give a nonzero eigenvector of BB that is not an eigenvector of AA. Prove the general forward implication from an eigenpair of AA to an eigenpair of p(A)p(A), and explain why its converse can fail.

  3. Find the monic polynomial of least degree satisfying p(A)=0p(A)=0. Prove both the identity and the minimality of its degree.

  4. Use that polynomial identity to express A−1A^{-1} as a polynomial in AA. Compute the inverse explicitly and verify it.

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

Question 9 – Solution

Strategy. A polynomial changes eigenvalues without changing each original eigenvector, but different eigenvalues can acquire the same image.

Step 1: Compare the two spectra. For AA, the eigenspaces are E1=span⁡{(1,1,0)T},E−1=span⁡{(1,−1,0)T},E2=span⁡{(0,0,1)T}.E_1=\operatorname{span}\{(1,1,0)^T\},\quad E_{-1}=\operatorname{span}\{(1,-1,0)^T\},\quad E_2=\operatorname{span}\{(0,0,1)^T\}. These vectors form a basis. Since B=diag⁡(1,1,4)B=\operatorname{diag}(1,1,4), its eigenspace for 11 is the entire plane x3=0x_3=0, and its eigenspace for 44 is the third coordinate axis. Squaring sends both 11 and −1-1 to 11.

Step 2: Prove the forward rule and refute the converse. The vector e1=(1,0,0)Te_1=(1,0,0)^T satisfies Be1=e1Be_1=e_1 but Ae1=(0,1,0)TAe_1=(0,1,0)^T, not a multiple of e1e_1. In general, Av=λvAv=\lambda v implies Akv=λkvA^kv=\lambda^kv by induction; linearity then gives p(A)v=p(λ)v\boxed{p(A)v=p(\lambda)v}. The merged eigenspace permits new combinations that are eigenvectors of p(A)p(A) without being eigenvectors of AA.

Step 3: Find the least-degree annihilating polynomial. Any polynomial with p(A)=0p(A)=0 must vanish at 1,−1,21,-1,2, by applying the identity to the three nonzero eigenvectors. A nonzero polynomial therefore needs degree at least three. The monic candidate is p(z)=(z−1)(z+1)(z−2)=z3−2z2−z+2.\boxed{p(z)=(z-1)(z+1)(z-2)=z^3-2z^2-z+2.} It annihilates all three basis eigenvectors, hence every vector, proving p(A)=0p(A)=0 and minimality. It is the unique monic cubic with those roots.

Step 4: Recover the inverse from the identity. Rearrange A3−2A2−A+2I=0A^3-2A^2-A+2I=0 to get A(−A2+2A+I)/2=IA(-A^2+2A+I)/2=I. The factors commute, so the reverse product is also II. Thus A−1=−A2+2A+I2=(010100001/2).\boxed{A^{-1}=\frac{-A^2+2A+I}{2} =\begin{pmatrix}0&1&0\\1&0&0\\0&0&1/2\end{pmatrix}.} Direct multiplication confirms the inverse without division by a matrix expression.

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

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