MATH 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial.

Similar documents
235 Final exam review questions

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

MATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors.

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

Math Matrix Algebra

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

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

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

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

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

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

Symmetric and anti symmetric matrices

Eigenvalues, Eigenvectors, and Diagonalization

MTH 464: Computational Linear Algebra

4. Determinants.

MATH 221, Spring Homework 10 Solutions

Econ Slides from Lecture 7

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

Recall : Eigenvalues and Eigenvectors

MATH 1553-C MIDTERM EXAMINATION 3

MATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.

Math 315: Linear Algebra Solutions to Assignment 7

MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2.

MATH 1553 PRACTICE MIDTERM 3 (VERSION B)

Linear Algebra Primer

MATH 304 Linear Algebra Lecture 34: Review for Test 2.

Math 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Eigenvalues and Eigenvectors A =

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

Lecture 2: Eigenvalues and their Uses

City Suburbs. : population distribution after m years

Eigenvectors. Prop-Defn

Math Linear Algebra Final Exam Review Sheet

1 Last time: least-squares problems

CHAPTER 5 REVIEW. c 1. c 2 can be considered as the coordinates of v

Dimension. Eigenvalue and eigenvector

Properties of Linear Transformations from R n to R m

Announcements Wednesday, November 01

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

Announcements Wednesday, November 01

CS 246 Review of Linear Algebra 01/17/19

Eigenvalues and Eigenvectors

Linear vector spaces and subspaces.

2018 Fall 2210Q Section 013 Midterm Exam II Solution

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

Math 2331 Linear Algebra

Definition (T -invariant subspace) Example. Example

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?

Definitions for Quizzes

Matrices and Linear Algebra

Eigenspaces. (c) Find the algebraic multiplicity and the geometric multiplicity for the eigenvaules of A.

vibrations, light transmission, tuning guitar, design buildings and bridges, washing machine, Partial differential problems, water flow,...

Linear Algebra Review

ICS 6N Computational Linear Algebra Eigenvalues and Eigenvectors

Study Guide for Linear Algebra Exam 2

Chapter 5. Eigenvalues and Eigenvectors

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

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

Diagonalization. Hung-yi Lee

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

6 Inner Product Spaces

Diagonalization of Matrix

Summer Session Practice Final Exam

MA 265 FINAL EXAM Fall 2012

CHAPTER 3. Matrix Eigenvalue Problems

2 Eigenvectors and Eigenvalues in abstract spaces.

0.1 Eigenvalues and Eigenvectors

Matrices and Deformation

Calculating determinants for larger matrices

Review of Some Concepts from Linear Algebra: Part 2

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)

Homework 2. Solutions T =

4. Linear transformations as a vector space 17

Linear Algebra: Matrix Eigenvalue Problems

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

Solutions Problem Set 8 Math 240, Fall

Eigenvalues and Eigenvectors

Linear algebra II Homework #1 solutions A = This means that every eigenvector with eigenvalue λ = 1 must have the form

University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm

1. General Vector Spaces

MATH Spring 2011 Sample problems for Test 2: Solutions

Linear Algebra - Part II

CAAM 335 Matrix Analysis

MATH 583A REVIEW SESSION #1

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

Math 323 Exam 2 Sample Problems Solution Guide October 31, 2013

Math 240 Calculus III

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

Eigenvalues and Eigenvectors

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

33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM

Numerical Linear Algebra Homework Assignment - Week 2

Math 308 Practice Final Exam Page and vector y =

Ma/CS 6b Class 23: Eigenvalues in Regular Graphs

(a) only (ii) and (iv) (b) only (ii) and (iii) (c) only (i) and (ii) (d) only (iv) (e) only (i) and (iii)

Generalized Eigenvectors and Jordan Form

Problem 1: Solving a linear equation

Proofs for Quizzes. Proof. Suppose T is a linear transformation, and let A be a matrix such that T (x) = Ax for all x R m. Then

Eigenvalues and Eigenvectors. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB

What s Eigenanalysis? Matrix eigenanalysis is a computational theory for the matrix equation

Transcription:

MATH 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial.

Geometric properties of determinants 2 2 determinants and plane geometry Let P be a parallelogram in the plane R 2. Suppose that vectors v 1,v 2 R 2 are represented by adjacent sides of P. Then area(p) = det A, where A = (v 1,v 2 ), a matrix whose columns are v 1 and v 2. Consider a linear operator L A : R 2 R 2 given by L A (v) = Av for any column vector v. Then area(l A (D)) = det A area(d) for any bounded domain D. 3 3 determinants and space geometry Let Π be a parallelepiped in space R 3. Suppose that vectors v 1,v 2,v 3 R 3 are represented by adjacent edges of Π. Then volume(π) = det B, where B = (v 1,v 2,v 3 ), a matrix whose columns are v 1, v 2, and v 3. Similarly, volume(l B (D)) = det B volume(d) for any bounded domain D R 3.

v 1 v 3 v 2 volume(π) = det B, where B = (v 1,v 2,v 3 ). Note that the parallelepiped Π is the image under L B of a unit cube whose adjacent edges are e 1,e 2,e 3. The triple v 1,v 2,v 3 obeys the right-hand rule. We say that L B preserves orientation if it preserves the hand rule for any basis. This is the case if and only if det B > 0.

Linear transformations of R 2 Any linear operator L : R 2 R 2 is represented as multiplication of a 2-dimensional column vector by a 2 2 matrix: L(x) = Ax or L ( x y ) = ( a b c d ) ( ) x. y Linear transformations corresponding to particular matrices can have various geometric properties.

Texture A = ( ) 0 1 1 0 Texture Rotation by 90 o

Texture A = ( 1 2 1 ) 2 1 2 1 2 Texture Rotation by 45 o

Texture Texture A = ( ) 1 0 0 1 Reflection about the vertical axis

Texture Texture A = ( ) 0 1 1 0 Reflection about the line x y = 0

Texture A = ( ) 1 1/2 0 1 Texture Horizontal shear

Texture A = ( ) 1/2 0 0 1/2 Texture Scaling

Texture A = ( ) 3 0 0 1/3 Texture Squeeze

Texture A = ( ) 1 0 0 0 Vertical projection on the horizontal axis

Texture A = ( ) 0 1 0 1 Horizontal projection on the line x + y = 0

Texture A = ( ) 1 0 0 1 Texture Identity

Eigenvalues and eigenvectors Definition. Let A M n,n (F). A scalar λ F is called an eigenvalue of the matrix A if Av = λv for a nonzero column vector v F n. The vector v is called an eigenvector of A belonging to (or associated with) the eigenvalue λ. Remarks. Alternative notation: eigenvalue = characteristic value, eigenvector = characteristic vector. The zero vector is never considered an eigenvector.

Example. A = ( ) ( ) 0 1 1 = 1 0 1 ( ) 0 1. 1 0 ( ) 1, 1 ( ) ( ) 0 1 1 = 1 0 1 ( ) 1. 1 ( ) 1 Hence is an eigenvector of A belonging to the 1 ( ) 1 eigenvalue 1, while is an eigenvector of A 1 belonging to the eigenvalue 1.

Eigenspaces Let A be an n n matrix. Let v be an eigenvector of A belonging to an eigenvalue λ. Then Av = λv = Av = (λi)v = (A λi)v = 0. Hence v N(A λi), the null-space of the matrix A λi. Conversely, if x N(A λi) then Ax = λx. Thus the eigenvectors of A belonging to the eigenvalue λ are nonzero vectors from N(A λi). Definition. If N(A λi) {0} then it is called the eigenspace of the matrix A corresponding to the eigenvalue λ.

How to find eigenvalues and eigenvectors? Theorem Given a square matrix A and a scalar λ, the following conditions are equivalent: λ is an eigenvalue of A, N(A λi) {0}, the matrix A λi is not invertible, det(a λi) = 0. Definition. det(a λi) = 0 is called the characteristic equation of the matrix A. Eigenvalues λ of A are roots of the characteristic equation. Associated eigenvectors of A are nonzero solutions of the equation (A λi)x = 0.

Example. A = ( ) a b. c d det(a λi) = a λ c = (a λ)(d λ) bc b d λ = λ 2 (a + d)λ + (ad bc).

a 11 a 12 a 13 Example. A = a 21 a 22 a 23. a 31 a 32 a 33 a 11 λ a 12 a 13 det(a λi) = a 21 a 22 λ a 23 a 31 a 32 a 33 λ = λ 3 + c 1 λ 2 c 2 λ + c 3, where c 1 = a 11 + a 22 + a 33 (the trace of A), c 2 = a 11 a 12 a 21 a 22 + a 11 a 13 a 31 a 33 + a 22 a 23 a 32 a 33, c 3 = det A.

Theorem. Let A = (a ij ) be an n n matrix. Then det(a λi) is a polynomial of λ of degree n: det(a λi) = ( 1) n λ n + c 1 λ n 1 + + c n 1 λ + c n. Furthermore, ( 1) n 1 c 1 = a 11 + a 22 + + a nn and c n = det A. Definition. The polynomial p(λ) = det(a λi) is called the characteristic polynomial of the matrix A. Corollary Any n n matrix has at most n eigenvalues.

Example. A = ( ) 2 1. 1 2 Characteristic equation: 2 λ 1 1 2 λ = 0. (2 λ) 2 1 = 0 = λ 1 = 1, λ 2 = 3. ( ) ( ) ( ) 1 1 x 0 (A I)x = 0 = 1 1 y 0 ( ) ( ) ( ) 1 1 x 0 = x + y = 0. 0 0 y 0 The general solution is ( t, t) = t( 1, 1), t R. Thus v 1 = ( 1, 1) is an eigenvector associated with the eigenvalue 1. The corresponding eigenspace is the line spanned by v 1.

( ) ( ) ( ) 1 1 x 0 (A 3I)x = 0 = 1 1 y 0 ( ) ( ) ( ) 1 1 x 0 = x y = 0. 0 0 y 0 The general solution is (t, t) = t(1, 1), t R. Thus v 2 = (1, 1) is an eigenvector associated with the eigenvalue 3. The corresponding eigenspace is the line spanned by v 2.

Summary. A = ( ) 2 1. 1 2 The matrix A has two eigenvalues: 1 and 3. The eigenspace of A associated with the eigenvalue 1 is the line t( 1, 1). The eigenspace of A associated with the eigenvalue 3 is the line t(1, 1). Eigenvectors v 1 = ( 1, 1) and v 2 = (1, 1) of the matrix A are orthogonal and form a basis for R 2. Geometrically, the mapping x Ax is a stretch by a factor of 3 away from the line x + y = 0 in the orthogonal direction.

Eigenvalues and eigenvectors of an operator Definition. Let V be a vector space and L : V V be a linear operator. A scalar λ is called an eigenvalue of the operator L if L(v) = λv for a nonzero vector v V. The vector v is called an eigenvector of L associated with the eigenvalue λ. If V = F n then the linear operator L is given by L(x) = Ax, where A is an n n matrix. In this case, eigenvalues and eigenvectors of the operator L are precisely eigenvalues and eigenvectors of the matrix A. For a general finite-dimensional vector space V, we choose an ordered basis α. Then L(v) = λv [L] α [v] α = λ[v] α. Hence the eigenvalues of L coincide with those of the matrix [L] α. Moreover, the associated eigenvectors of [L] α are coordinates of the eigenvectors of L.