Kunze Linear Algebra · Problem 4.3.3

Polynomials

Mathematics — Methods · lagrange-interpolation-diagonal-matrix-projections

Problem

Let FF be the field of real numbers, A=[2000020000300001],p=(x−2)(x−3)(x−1).A = \begin{bmatrix} 2 & 0 & 0 & 0 \\ 0 & 2 & 0 & 0 \\ 0 & 0 & 3 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix}, \qquad p = (x-2)(x-3)(x-1). ((a)) Show that p(A)=0p(A) = 0. ((b)) Let P1,P2,P3P_1, P_2, P_3 be the Lagrange polynomials for t1=2t_1 = 2, t2=3t_2 = 3, t3=1t_3 = 1. Compute Ei=Pi(A)E_i = P_i(A), i=1,2,3i = 1, 2, 3. ((c)) Show that E1+E2+E3=IE_1 + E_2 + E_3 = I, EiEj=0E_i E_j = 0 if i≠ji \neq j, Ei2=EiE_i^2 = E_i. ((d)) Show that A=2E1+3E2+E3A = 2E_1 + 3E_2 + E_3.
Intuitive explanation

This problem explores the spectral decomposition of a diagonalizable matrix using the minimal polynomial and Lagrange interpolation. Since AA is diagonal with distinct eigenvalues {1,2,3}\{1, 2, 3\}, the polynomial pp annihilates it, and the Lagrange projectors EiE_i isolate each eigenspace. Computing these projectors and verifying their orthogonality properties reveals how to reconstruct AA as a weighted sum of projections onto its eigenspaces—the core idea behind diagonalization.

Intuitive explanation

This problem explores the spectral decomposition of a diagonalizable matrix using the minimal polynomial and Lagrange interpolation. Since AA is diagonal with distinct eigenvalues {1,2,3}\{1, 2, 3\}, the polynomial pp annihilates it, and the Lagrange projectors EiE_i isolate each eigenspace. Computing these projectors and verifying their orthogonality properties reveals how to reconstruct AA as a weighted sum of projections onto its eigenspaces—the core idea behind diagonalization.

Related theory

Browse the problem library