(the matrix with b 1 and b 2 as columns). If x is a vector in R 2, then its coordinate vector [x] B relative to B satisfies the formula.

Similar documents
Recall : Eigenvalues and Eigenvectors

Announcements Monday, November 06

Diagonalization of Matrix

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

Math Matrix Algebra

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

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

Lecture 15, 16: Diagonalization

City Suburbs. : population distribution after m years

Eigenvalues, Eigenvectors, and Diagonalization

Eigenvalues and Eigenvectors 7.2 Diagonalization

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

ICS 6N Computational Linear Algebra Eigenvalues and Eigenvectors

Econ Slides from Lecture 7

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

4. Linear transformations as a vector space 17

MA 265 FINAL EXAM Fall 2012

From Lay, 5.4. If we always treat a matrix as defining a linear transformation, what role does diagonalisation play?

MAT 1302B Mathematical Methods II

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

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

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

ft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST

235 Final exam review questions

Final A. Problem Points Score Total 100. Math115A Nadja Hempel 03/23/2017

a 11 a 12 a 11 a 12 a 13 a 21 a 22 a 23 . a 31 a 32 a 33 a 12 a 21 a 23 a 31 a = = = = 12

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

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

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

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

DM554 Linear and Integer Programming. Lecture 9. Diagonalization. Marco Chiarandini

Lecture 3 Eigenvalues and Eigenvectors

Linear Algebra II Lecture 22

Math 315: Linear Algebra Solutions to Assignment 7

AMS10 HW7 Solutions. All credit is given for effort. (-5 pts for any missing sections) Problem 1 (20 pts) Consider the following matrix 2 A =

Announcements Wednesday, November 01

Math 3191 Applied Linear Algebra

Eigenvalues and Eigenvectors

EXAM. Exam #3. Math 2360, Spring April 24, 2001 ANSWERS

Diagonalization. Hung-yi Lee

The eigenvalues are the roots of the characteristic polynomial, det(a λi). We can compute

Study Guide for Linear Algebra Exam 2

Lecture 12: Diagonalization

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

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

MATH 221, Spring Homework 10 Solutions

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

Unit 5. Matrix diagonaliza1on

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

Homogeneous Linear Systems of Differential Equations with Constant Coefficients

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

MAC Module 12 Eigenvalues and Eigenvectors

1. Let A = (a) 2 (b) 3 (c) 0 (d) 4 (e) 1

Lecture 11: Diagonalization

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

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

MATH. 20F SAMPLE FINAL (WINTER 2010)

First of all, the notion of linearity does not depend on which coordinates are used. Recall that a map T : R n R m is linear if

Dimension. Eigenvalue and eigenvector

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

Math Final December 2006 C. Robinson

Chapter 3. Determinants and Eigenvalues

Math 205, Summer I, Week 4b:

Mathematical Methods for Engineers 1 (AMS10/10A)

Review Notes for Linear Algebra True or False Last Updated: January 25, 2010

Linear Algebra: Matrix Eigenvalue Problems

1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det

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

1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued)

Jordan Normal Form and Singular Decomposition

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

ft-uiowa-math2550 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 12/31/2014 at 10:36pm CST

CS 246 Review of Linear Algebra 01/17/19

MATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018

Jordan Canonical Form Homework Solutions

2 Eigenvectors and Eigenvalues in abstract spaces.

Announcements Wednesday, November 01

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

80 min. 65 points in total. The raw score will be normalized according to the course policy to count into the final score.

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

Eigenspaces and Diagonalizable Transformations

Linear Algebra Practice Problems

Name: Final Exam MATH 3320

UNIT 6: The singular value decomposition.

Chapter 5. Eigenvalues and Eigenvectors

MATH 223 FINAL EXAM APRIL, 2005

1. General Vector Spaces

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors

0.1 Eigenvalues and Eigenvectors

Math 489AB Exercises for Chapter 2 Fall Section 2.3

Definition (T -invariant subspace) Example. Example

Practice problems for Exam 3 A =

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

Further Mathematical Methods (Linear Algebra) 2002

MATH 369 Linear Algebra

EE5120 Linear Algebra: Tutorial 6, July-Dec Covers sec 4.2, 5.1, 5.2 of GS

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.

2 b 3 b 4. c c 2 c 3 c 4

Eigenvalues and Eigenvectors 7.1 Eigenvalues and Eigenvecto

Transcription:

4 Diagonalization 4 Change of basis Let B (b,b ) be an ordered basis for R and let B b b (the matrix with b and b as columns) If x is a vector in R, then its coordinate vector x B relative to B satisfies the formula Bx B x We can see this by writing x B α,α T to get Bx B α b b α α b +α b x The columns of B are linearly independent (since they form a basis) so B has full rank and is therefore invertible This allows us to solve the equation above for the coordinate vector: x B B x 4 Example Let B (b,b ) be the ordered basis of R with b, T and b, T Use the formula above to find the coordinate vector x B where x, T Solution We have so x B B x B b b, 5 (Check: ( 5)b +()b 5 + x) 5 Let C (c,c ) be another ordered basis for R and put C c c For any vector x in R, the coordinate vectors of x relative to B and C satisfy the equation Bx B Cx C

4 DIAGONALIZATION This equation holds since both sides equal x by the first equation of the section We can solve for x B to get x B B } {{ C } x C P The matrix P B C is called the transformation matrix from C to B 4 Example Let B (b,b ) and C (c,c ) be the ordered bases of R with 0 b, b 6, c 4, c 5 and let x and y be vectors in R (a) Find the transformation matrix P from C to B (b) Given that x C,6 T, find x B (c) Given that y B 7, T, find y C Solution (a) We have P B 0 C 6 4 5 4 6 0 5 4 (b) We have x B Px C 6 9 5 (c) Multiplying both sides of the change of basis formula by P we get y C P y B 7 5 0 8 6 Here is the general formulation for a change of basis:

4 DIAGONALIZATION Change of basis Let B (b,b,,b n ) and C (c,c,,c n ) be two ordered bases for R n, and put B b b b n and C c c c n For any vector x in R n, we have so that Bx B Cx C x B } B {{ C } x C P The matrix P B C is called the transformation matrix from C to B 4 Linear function and basis change Theorem Let L : R n R n be a linear function, let B and C be ordered bases for R n, let P be the transformation matrix from C to B, and let A be the matrix of L relative to B The matrix of L relative to C is P AP, that is, for all x R n L(x) C P APx C Proof For all x R n we have P APx C P Ax B definition of transformation matrix P L(x) B A is matrix of L relative to B L(x) C P is transformation matrix from B to C 4 Example Let L : R R be the linear function given by L(x) x + x x + x (a) Find the matrix A of L (relative to the standard ordered basis E (e,e ))

4 DIAGONALIZATION 4 (b) Find the transformation matrix P from C (, T,, T ) to E (c) Use the theorem to find the matrix of L relative to C Solution (a) We have A L(e ) L(e ) (b) Writing E e e we see that E I, so that P E C I C C (c) According to the theorem, the matrix of L relative to C is P AP C AC 4 0 0 0 0 In this example, the matrix of L relative to the basis C turned out to be much simpler than the matrix relative to the standard basis The reason is that C is a basis for R consisting of eigenvectors of L We investigate such bases in the next section 4 Method for diagonalization The matrix 0 0 0 0 0 0 is an example of a diagonal matrix In general, a diagonal matrix is a matrix having the property that every entry not on the main diagonal is 0 An n n matrix A is diagonalizable if there exists an invertible n n matrix P such that P AP D, where D is a diagonal matrix

4 DIAGONALIZATION 5 Theorem Let A be an n n matrix The matrix A is diagonalizable if and only if there exists a basis for R n consisting of eigenvectors of A In this case, if P is the matrix with the eigenvectors as columns, then P AP D with D diagonal Proof We will prove only the case n Assume that there exists a basis {b,b } for R consisting of eigenvectors of A Let λ and λ be the corresponding eigenvalues and write D We have λ 0 0 λ AP A λ b b Ab Ab λ b λ b b b 0 PD 0 λ Therefore, P AP D Conversely, if P diagonalizes A, then the equation above shows that the columns of P must be eigenvectors of A and these columns are linearly independent since P is invertible 4 Example Let A If possible, find an invertible 4 matrix P such that P AP D, where D is a diagonal matrix Solution According to the theorem, such a matrix P exists if and only if there exists a basis for R consisting of eigenvectors of A The characteristic polynomial of A is det(a λi) λ 4 λ ( λ)(4 λ)+ λ 5λ+6 (λ )(λ ) The eigenvalues of A are the zeros of this polynomial, namely, λ, Next, the λ-eigenspace of A is the solution set of the equation (A λi)x 0: (λ ) A I 0 0 0 0 0 0 0, so the -eigenspace of A is {t,t T t R} Letting t, we get a -eigenvector, T ;

4 DIAGONALIZATION 6 (λ ) A I 0 0 0 0 0 0 0, so the -eigenspace of A is { t,tt t R} Letting t (to avoid fractions), we get a -eigenvector, T Theeigenvectors, T and, T ofa formabasisforr (neitherisamultiple of the other so they are linearly independent; since dimr, they form a basis) According to the theorem, the matrix P with these vectors as columns should have the indicated property: P Computing we get P AP 4 4 0 D 0 4 (Note that the eigenvalues of A appear along the main diagonal of D) 4 Example Is the matrix A Solution The characteristic polynomial of A is det(a λi) λ λ λ + 0 diagonalizable? Explain 0 Since this polynomial has no zeros (in R), the matrix A has no eigenvalues Therefore, there is no basis for R consisting of eigenvectors of A and A is not diagonalizable according to the theorem (Here s another way to see that A has no eigenvalues A is the matrix of the linear function 90 clockwise rotation Since this function sends no nonzero vector to a multiple of itself, it has no eigenvalues, and therefore A has no eigenvalues either) 44 Power of matrix It is often necessary to compute high powers of a square matrix A, such as A 0 Just multiplying the matrix A by itself overand overagaincan be quite tedious

4 DIAGONALIZATION 7 However, if A is diagonalizable, then there is an observation that greatly reduces the number of computations: Let A be a diagonalizable matrix, so that P AP D with D diagonal Solving this equation for A, we get A PDP Note that and in less detail In general, A AA (PDP )(PDP ) PD(P P)DP PDIDP PDDP PD P, A (PDP )(PDP )(PDP ) PD P P AP D A n PD n P Note that since D is diagonal, the powerd n is obtained by raisingeach diagonal entry to the nth power 44 Example Compute A 0, where A 4 Solution In Example 4 we found a matrix P such that P AP D with D diagonal Using the results of that example we get 0 A 0 PD 0 P 0 0 0 0 0 0 0 0 0 0 0 0 + 0 0 0 + 0 5700 5805 6050 7074

4 DIAGONALIZATION 8 4 Exercises 4 Let B (b,b ) and C (c,c ) be the ordered bases of R with 0 b, b, c 5, c 4 and let x be a vector in R (a) Find the transformation matrix P from C to B (b) Given that x C, T, use part (a) to find x B and check your answer by showing that both coordinate vectors yield the same vector x 4 Let L : R R be reflection across the line x x / (the line through the origin making an angle of 0 with the x -axis) (a) Find the matrix A of L (relative to the standard ordered basis E (e,e )) (b) Find the transformation matrix P from C (, T,, T ) to E (c) Use the theorem in Section 4 to find the matrix of L relative to C Hint: Recall the 0-60-90 triangle with legs,, and 4 Let A 5 6 (a) If possible, find an invertible matrix Psuch that P AP D, where D is a diagonal matrix (b) Find A 0 (Hint: Use the formula in Section 44)