lecture_38 - MA 265 LECTURE NOTES: WEDNESDAY, APRIL 16...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: MA 265 LECTURE NOTES: WEDNESDAY, APRIL 16 Matrices That Are Diagonalizable Distinct Eigenvalues. Let A be an n n matrix. We show that if A has distinct eigenvalues, then A can be diagonalized. To see why, let { 1 , 2 , ..., n } denote the distinct eigenvalues, and S = { x 1 , x 2 , ..., x n } be the asso- ciated eigenvectors. Consider the following subsets of S : S 1 = { x 1 } S 2 = { x 1 , x 2 } . . . S k = { x 1 , x 2 , ..., x k } If all of these subsets are linearly independent, otherwise S = S n would be linearly independent. Hence S would be a basis for R n , and so A would be diagonalizable. To the contrary, say that S k +1 is linearly dependent, yet S k is linearly independent. That means we can write x k +1 = a 1 x 1 + a 2 x 2 + + a k x k . Not all of these scalars a i are zero because x k +1 is a nonzero vector. Upon multiplying A to both sides, we find that k +1 x k = A x k +1 = a 1 A x 1 + a 2 A x 2 + + a k A x k = a 1 1 x 1 + a 2 2 x 2 + + a k k x k . Upon multiplying k +1 to both sides, we find that k +1 x k = a 1 k +1 x 1 + a 2 k +1 x 2 + + a k k +1 x k . Now subtract: = a 1 ( k +1- 1 ) x 1 + a 2 ( k +1- 2 ) x 2 + + a k ( k +1- k ) x k ....
View Full Document

Page1 / 3

lecture_38 - MA 265 LECTURE NOTES: WEDNESDAY, APRIL 16...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online