6.3 Diagonalization

In this section, we consider the problem of factoring an n×n matrix A into a product of the form XDX1, where D is diagonal. We will give a necessary and sufficient condition for the existence of such a factorization and look at a number of examples. We begin by showing that eigenvectors belonging to distinct eigenvalues are linearly independent.

Theorem 6.3.1

If λ1,λ2,,λk are distinct eigenvalues of an n×n matrix A with corresponding eigenvectors x1,x2,,xk, then x1,,xk are linearly independent.

Proof

Let r be the dimension of the subspace of n spanned by x1,,xk and suppose that r<k. We may assume (reordering the xi’s and λi’s if necessary) that x1,,xr are linearly independent. Since x1,x2,,xr,xr+1 are linearly dependent, ...

Get Linear Algebra with Applications, 10th Edition now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.