Maths WorkshopMaths problems with full solutions
Exercise 509Linear algebra › Matrices and linear systemsL1Added 3 Nov 2026

Powers of a diagonal matrix

#diagonal matrix#powers#induction

Statement

Let D=diag⁡(λ1,…,λn)D = \operatorname{diag}(\lambda_1,\ldots,\lambda_n). Show that Dk=diag⁡(λ1k,…,λnk)D^k = \operatorname{diag}(\lambda_1^k,\ldots,\lambda_n^k) for all k≥1k \ge 1.

Hint

Prove by induction on kk, using the fact that the product of two diagonal matrices is diagonal.

Show solutionHide solution

Solution

Base case. For k=1k=1, D1=D=diag⁡(λ1,…,λn)D^1 = D = \operatorname{diag}(\lambda_1,\ldots,\lambda_n).

Inductive step. Assume Dk=diag⁡(λ1k,…,λnk)D^k = \operatorname{diag}(\lambda_1^k,\ldots,\lambda_n^k). Then
Dk+1=DkD=diag⁡(λ1k,…,λnk)diag⁡(λ1,…,λn)=diag⁡(λ1k+1,…,λnk+1).D^{k+1} = D^k D = \operatorname{diag}(\lambda_1^k,\ldots,\lambda_n^k)\operatorname{diag}(\lambda_1,\ldots,\lambda_n) = \operatorname{diag}(\lambda_1^{k+1},\ldots,\lambda_n^{k+1}).

Conclusion. The formula holds for all k≥1k \ge 1.