and let s calculate the image of some vectors under the transformation T.

Similar documents
Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Remark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Therefore, A and B have the same characteristic polynomial and hence, the same eigenvalues.

Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?

Math 3191 Applied Linear Algebra

Math 315: Linear Algebra Solutions to Assignment 7

City Suburbs. : population distribution after m years

Eigenvalues and Eigenvectors

Recall : Eigenvalues and Eigenvectors

Computationally, diagonal matrices are the easiest to work with. With this idea in mind, we introduce similarity:

Eigenvalues and Eigenvectors

c c c c c c c c c c a 3x3 matrix C= has a determinant determined by

Diagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix

Linear Algebra Practice Problems

Determinants by Cofactor Expansion (III)

Study Guide for Linear Algebra Exam 2

MA 265 FINAL EXAM Fall 2012

(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).

Eigenvalues and Eigenvectors

Eigenvalue and Eigenvector Homework

1. In this problem, if the statement is always true, circle T; otherwise, circle F.

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS

Diagonalization. Hung-yi Lee

ANSWERS. E k E 2 E 1 A = B

Math 304 Fall 2018 Exam 3 Solutions 1. (18 Points, 3 Pts each part) Let A, B, C, D be square matrices of the same size such that

2. Every linear system with the same number of equations as unknowns has a unique solution.

Solutions to Final Exam

MAT1302F Mathematical Methods II Lecture 19

MATH 1553, C. JANKOWSKI MIDTERM 3

Eigenvalues, Eigenvectors, and Diagonalization

Calculating determinants for larger matrices

LINEAR ALGEBRA REVIEW

Diagonalization of Matrix

Examples True or false: 3. Let A be a 3 3 matrix. Then there is a pattern in A with precisely 4 inversions.

MATH 221, Spring Homework 10 Solutions

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion

Definition (T -invariant subspace) Example. Example

MATH 1553 PRACTICE MIDTERM 3 (VERSION B)

LU Factorization. A m x n matrix A admits an LU factorization if it can be written in the form of A = LU

Chapter 5 Eigenvalues and Eigenvectors

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.

Eigenvalues and Eigenvectors 7.1 Eigenvalues and Eigenvecto

4. Determinants.

PROBLEM SET. Problems on Eigenvalues and Diagonalization. Math 3351, Fall Oct. 20, 2010 ANSWERS

Eigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization

Chapter 3. Determinants and Eigenvalues

235 Final exam review questions

Linear Algebra. Rekha Santhanam. April 3, Johns Hopkins Univ. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, / 7

Matrices and Linear Algebra

Linear algebra II Tutorial solutions #1 A = x 1

Online Exercises for Linear Algebra XM511

Final Review Written by Victoria Kala SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015

Math 314/ Exam 2 Blue Exam Solutions December 4, 2008 Instructor: Dr. S. Cooper. Name:

Math 314H Solutions to Homework # 3

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

Question 7. Consider a linear system A x = b with 4 unknown. x = [x 1, x 2, x 3, x 4 ] T. The augmented

(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

MATH 220 FINAL EXAMINATION December 13, Name ID # Section #

MAC Module 12 Eigenvalues and Eigenvectors. Learning Objectives. Upon completing this module, you should be able to:

MAC Module 12 Eigenvalues and Eigenvectors

Math Linear Algebra Final Exam Review Sheet

MAT 1302B Mathematical Methods II

Symmetric and anti symmetric matrices

MATH 304 Linear Algebra Lecture 33: Bases of eigenvectors. Diagonalization.

A = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is,

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION

Eigenvalues and Eigenvectors

Math 205, Summer I, Week 4b:

CAAM 335 Matrix Analysis

Topic 2 Quiz 2. choice C implies B and B implies C. correct-choice C implies B, but B does not imply C

Properties of Linear Transformations from R n to R m

Eigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization

Dimension. Eigenvalue and eigenvector

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

Final Exam Practice Problems Answers Math 24 Winter 2012

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015

Math Final December 2006 C. Robinson

Lecture 15, 16: Diagonalization

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Chapter 5. Eigenvalues and Eigenvectors

Math 110 Linear Algebra Midterm 2 Review October 28, 2017

Math 1553 Worksheet 5.3, 5.5

Glossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB

Review for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions.

Third Midterm Exam Name: Practice Problems November 11, Find a basis for the subspace spanned by the following vectors.

MATH 1553-C MIDTERM EXAMINATION 3

Lecture Notes: Eigenvalues and Eigenvectors. 1 Definitions. 2 Finding All Eigenvalues

Homework sheet 4: EIGENVALUES AND EIGENVECTORS. DIAGONALIZATION (with solutions) Year ? Why or why not? 6 9

Conceptual Questions for Review

TMA Calculus 3. Lecture 21, April 3. Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013

No books, notes, any calculator, or electronic devices are allowed on this exam. Show all of your steps in each answer to receive a full credit.

HW2 - Due 01/30. Each answer must be mathematically justified. Don t forget your name.

Lecture 12: Diagonalization

MAC Module 3 Determinants. Learning Objectives. Upon completing this module, you should be able to:

Problem 1: Solving a linear equation

1. Select the unique answer (choice) for each problem. Write only the answer.

Eigenvalues and Eigenvectors: An Introduction

Transcription:

Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) = A v. Example 5... Consider the transformation T : R 2 R 2 given by its standard matrix ( ) 3 A =, 5 3 and let s calculate the image of some vectors under the transformation T. ( ) ( ) ( ) ( ) 3 2 T = =, 5 3 2 ( ) ( ) ( ) ( ) 3 3 3 6 T = =. 3 5 3 3 6 We may notice that the image of (x, x) is 2(x, x). Let s calculate some more images: ( ) ( ) ( ) ( ) 3 2 T = =, 5 5 3 5 ( ) ( ) ( ) ( ) 2 3 2 4 T = =. 5 3 2 We may notice that the image of a vector (x, 5x) is 2(x, 5x). A couple of more

74 Eigenvalues and Eigenvectors images: ( ) ( ) ( ) ( ) 2 3 2 3 T = =, 3 5 3 3 ( ) ( ) ( ) ( ) T 3 4 = = 5 3 8. There are no such nice patterns for these vectors. Although a transformation given by a matrix A may move vectors in a variety direction, it often happens that there are special vectors on which the action is quite simple. In this section we would like to find those nonzero vectors v, which are mapped to a scalar multiple of itself, that is A v = λ v for some scalar λ. In our example above, these vectors are (x, x) and (x, 5x), where x can be any nonzero number. Definition 5... If A is an n n matrix, then a nonzero vector v in R n is called an eigenvector of A if there is a scalar λ such that A v = λ v. The scalar λ is called an eigenvalue of A, and v is said to be an eigenvector of A corresponding to λ. We emphasize that eigenvectors are nonzero vectors. So the question is: when can we find a nonzero vector v which satisfies the matrix equation A v = λ v with some scalar λ? Let s rearrange this equation A v = λ v to A v λ v =. Then, we can factor v from both terms of the left hand side. However we have to be careful, because these products are not commutative, so we have to keep the order, and we will also have to write λi (a matrix) instead of λ, which is only a number. So we get (A λi) v =.

5.2 Examples 75 This is a homogeneous equation B v = with B = A λi. This homogeneous linear system has nonzero solutions, if det(b) =. That is if det(a λi) =. So here is the idea: first we find those values of λ for which det(a λi) =. Then for a such value of λ we solve the linear system (A λi) v = to get an eigenvector. Definition 5..2. The equation det(a λi) = is called the characteristic equation of A. When expanded, the determinant det(a λi) is a polynomial in λ. This is called the characteristic polynomial of A. Definition 5..3. The eigenvectors corresponding to λ are the nonzero vectors in the solution space of (A λi) v =. We call this solution space the eigenspace of A corresponding to λ. Remark 5... In some books you will find that the characteristic polynomial is defined by det(λi A). Using this as a definition, the characteristic polynomial would have as its leading coefficient. You can show that the polynomials det(λi A) and det(a λi) differ only by a negative sign if the size of A is odd. If the size of A is even, then the two polynomials are the same. 5.2 Examples Example 5.2.. Let 2 A = 2 3 The characteristic polynomial of A is λ 2 det(a λi) = det 2 λ = λ 3 + 5λ 2 8λ + 4. 3 λ To get the eigenvalues, find the zeroes of the characteristic polynomial: λ 3 + 5λ 2 8λ + 4 = (λ 2) 2 (λ ), the eigenvalues of A are: λ = 2, which has algebraic multiplicity of 2, (that is λ = 2 is a double root of the characteristic equation) and λ =, which has algebraic multiplicity of (that is λ = is a simple root of the characteristic equation).

76 Eigenvalues and Eigenvectors Let s find the eigenspace and a basis for the eigenspace for each of the eigenvalues of A. To find the eigenspace corresponding to λ, we have to find the solutions space of the equation (A λi) v =. So for λ = 2, the augmented matrix is: 2 2 whose row-echelon form is Since there are two free variables the solution space of (A 2I) (v) =, and therefore the eigenspace of A corresponding to λ = 2 has dimension two. The geometric multiplicity of the eigenvalue λ = 2 is 2 (the dimension of the corresponding eigenspace). The solutions of (A 2I) v = are ( v 3, v 2, v 3 ) where v 2 and v 3 are free variables. These are the eigenvectors of A corresponding to λ = 2. The eigenspace corresponding to λ = 2 is A basis for the eigenspace is. v 3 v 2 : v 2, v 3 C. v 3,. To find the eigenspace corresponding to λ = we have to repeat the same procedure. We have to find the solutions space of the equation (A I) v =, the augmented matrix is: whose row-echelon form is 2 2 2,.

5.2 Examples 77 Since there is only one free variable the solution space of (A I) v =, and therefore the eigenspace of A corresponding to λ = has dimension one. The geometric multiplicity of the eigenvalue λ = is. The solutions of (A I) v = are ( 2v 3, v 3, v 3 ), where v 3 is a free variable. These are the eigenvectors of A corresponding to λ =. The eigenspace corresponding to λ = is 2v 3 v 3 : v 3 C. v 3 A basis for the eigenspace is 2. Example 5.2.2. Let 5 4 B = 3. 2 It is a triangular matrix. The eigenvalues of B are λ = 5, 3, and 2. Each has algebraic multiplicity of one. For each eigenvalue we can find the eigenspace, and a basis for the eigenspace. The eigenspace corresponding to λ = 5 is v : v C. A basis for the eigenspace is. The eigenspace corresponding to λ = 3 is v 2 : v 2 C.

78 Eigenvalues and Eigenvectors A basis for the eigenspace is. The eigenspace corresponding to λ = 2 is 4 v 7 3 5 v 3 : v 3 C. v 3 A basis for the eigenspace is 4 7 5 or a more convenient one is: ( 2, 7, 35). Example 5.2.3. Let ( ) 5 C =. 3 The characteristic polynomial of C is ( ) 5 λ det(c λi) = det = λ 2 8λ + 6. 3 λ To find the eigenvalues we have to find the roots of the characteristic polynomial λ 2 8λ + 6 = (λ 4) 2, so C has only one eigenvalue λ = 4, which has algebraic multiplicity of two (i.e. it is a double root of the characteristic equation). To find the eigenspace corresponding to λ = 4 we have to find the solutions space of the equation (4I A) v =, the augmented matrix is: ( )

5.3 Diagonalization 79 whose row-echelon form is ( ). Since there is only one free variable the solution space, and therefore the eigenspace corresponding to λ = 4 has dimension one. The geometric multiplicity of the eigenvalue λ = 4 is. The solutions, so the eigenvectors are (v 2, v 2 ), where v 2 is a free variable. The eigenspace corresponding to λ = 4 is {( ) } v 2 v 2 : v 2 C A basis for the eigenspace is {( )}. Example 5.2.4. Let 2 3 N = 4, a triangular matrix. Then the matrix N λi 2 λ 3 N = 4 λ λ is also triangular, therefore the determinant of N λi is the product of the entries along the main diagonal: (2 λ)( 4 λ)( λ), and the roots of the characteristic equation of N are λ = 2, 4, and. If N is a triangular matrix, then the entries along its main diagonal are its eigenvalues. Remark 5.2.. If you add the algebraic multiplicity of all eigenvalues of a given matrix, it should be equal to the size of the matrix. The geometric multiplicity of an eigenvalue cannot be greater than its algebraic multiplicity..

8 Eigenvalues and Eigenvectors 5.3 Diagonalization Definition 5.3.. A square matrix is called diagonalizable if there exists an invertible matrix P so that P AP is diagonal. Procedure for diagonalizing a matrix. Find the characteristic polynomial of the matrix A. 2. Find the roots to obtain the eigenvalues. 3. Repeat (a) and (b) for each eigenvalue λ of A: (a) Form the augmented matrix to the equation (A λi) v = and bring it to a row-echelon form. (b) Find a basis for the eigenspace corresponding to λ. That is find a basis for the solution space of (A λi) v =. 4. Consider the collection S = { v, v 2,..., v m } of all basis vectors of the eigenspaces found in step 3. (a) If m is less than the size of the matrix A, then A is not diagonalizable. (b) If m is equal to the size of the matrix A, then A is diagonalizable, and the matrix P is the matrix whose columns are the vectors v, v 2,..., v m found in step 3, and λ... λ 2... D =.................. λ n where v corresponds to λ, v 2 corresponds to λ 2, and so on. We will look at the three examples we did in Section 5.2, and see whether the matrices A, B, and C are diagonalizable.

5.3 Diagonalization 8 Example 5.3.. 2 A = 2 3 is diagonalizable, because it has three basis vectors for all of its eigenspaces combined: 2 and are corresponding to λ = 2, and is corresponding to λ =. So 2 P = and 2 D = 2. Note: Since we could have found anther basis for the eigenspaces, this matrix P is not unique. Example 5.3.2. The matrix 5 4 B = 3 2 is also diagonalizable, because we found 3 basis vectors for the eigenspaces combined. Therefore and 2 P = 7 35 5 D = 3. 2

82 Eigenvalues and Eigenvectors Example 5.3.3. The matrix ( ) 5 C =. 3 is not diagonalizable, because it only has one basis vector for its eigenspace(s). Example 5.3.4. If all eigenvalues are different, then the matrix is diagonalizable, because for each eigenvalue there will be one basis vector for the corresponding eigenspace. For example: M = 4 7 8 has eigenvalues λ = 4, 2 ± 3. All eigenvalues are different, so A is diagonalizable. To find the matrix P, you will have to find a basis for each of the three eigenspaces. However, we already know the diagonal form will be: 4 D = 2 + 3 2. 3 Example 5.3.5. The triangular matrix 2 3 N = 4, has eigenvalues λ = 2, 4 and. The eigenvalues of N are all different, so N is diagonalizable, and D can be 2 4. To find the corresponding matrix P, to each eigenvalue you will have to find a corresponding eigenvector. Example 5.3.6. The matrix ( ) 2 3

5.4 Computing Powers of a Matrix 83 has complex eigenvalues, λ = ± 6i. In the diagonal form we would see these complex entries. Since the diagonal form is not a matrix over R, we say this matrix is not diagonalizable over R. 5.4 Computing Powers of a Matrix There are numerous problems that require the computation of high powers of a matrix. If the matrix is diagonal, then this is easy. Example 5.4.. The th power of 2 D = 2 is 2 D = 2. Suppose that a matrix A is not diagonal, but diagonalizable. That is P AP = D for some diagonal matrix D and form some invertible matrix P. Multiply this equation by P from the left, and by P from the right: P P AP P = P DP, using that P P = I, P P = I and AI = A, we get that Now, let s take powers of A: A = P DP. A n = (P DP )(P DP )(P DP ) (P DP )(P DP ) = P D(P P )D(P P )DP P D(P P )DP = P DDD DDP = P D n P.

84 Eigenvalues and Eigenvectors Therefore A n = P D n P. Example 5.4.2. Let s calculate the 5th power of 2 A = 2. 3 We showed in Example 5.3. that A is diagonalizable with matrix 2 P =, and then So 2 D = 2. A 5 = P D 5 P 5 2 2 2 = 2 2 2 5 2 = 2 5 2 2 5 2 2 6 = 2 5 2 5 2 5. 2 5 2 6 For further applications you may see Section A.2 in the appendix.