Mon Mar matrix eigenspaces. Announcements: Warm-up Exercise:

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

Mon Jan Matrix and linear transformations. Announcements: Warm-up Exercise:

Announcements Wednesday, November 01

Dimension. Eigenvalue and eigenvector

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

Exercise Set 7.2. Skills

Eigenvalues, Eigenvectors, and Diagonalization

Diagonalization of Matrix

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

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

Announcements Monday, November 06

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

Study Guide for Linear Algebra Exam 2

Announcements Wednesday, November 01

Definition (T -invariant subspace) Example. Example

Tues Feb Vector spaces and subspaces. Announcements: Warm-up Exercise:

Announcements Wednesday, November 7

Math 3191 Applied Linear Algebra

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

Announcements Wednesday, November 7

Announcements Monday, November 26

Math 315: Linear Algebra Solutions to Assignment 7

Math 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith

Theorem 3: The solution space to the second order homogeneous linear differential equation y p x y q x y = 0 is 2-dimensional.

Diagonalization. Hung-yi Lee

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

Announcements Monday, November 26

235 Final exam review questions

Practice Final Exam Solutions

is any vector v that is a sum of scalar multiples of those vectors, i.e. any v expressible as v = c 1 v n ... c n v 2 = 0 c 1 = c 2

Mon Feb Matrix algebra and matrix inverses. Announcements: Warm-up Exercise:

Eigenvalues and Eigenvectors

MATH 1553-C MIDTERM EXAMINATION 3

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

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

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

Spring 2019 Exam 2 3/27/19 Time Limit: / Problem Points Score. Total: 280

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

= L y 1. y 2. L y 2 (2) L c y = c L y, c.

Eigenvalues and Eigenvectors

Name: Final Exam MATH 3320

Math 314H Solutions to Homework # 3

spring, math 204 (mitchell) list of theorems 1 Linear Systems Linear Transformations Matrix Algebra

Announcements Monday, November 13

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

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

Solutions to Final Exam

Math 21b. Review for Final Exam

Math 205, Summer I, Week 4b:

Linear Algebra II Lecture 13

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

Linear Systems. Class 27. c 2008 Ron Buckmire. TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5.4

Math 110 Linear Algebra Midterm 2 Review October 28, 2017

Math 205, Summer I, Week 4b: Continued. Chapter 5, Section 8

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

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

Announcements Monday, November 13

Definition: An n x n matrix, "A", is said to be diagonalizable if there exists a nonsingular matrix "X" and a diagonal matrix "D" such that X 1 A X

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?

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2

Recall : Eigenvalues and Eigenvectors

City Suburbs. : population distribution after m years

Week Quadratic forms. Principal axes theorem. Text reference: this material corresponds to parts of sections 5.5, 8.2,

MATH 1553 PRACTICE FINAL EXAMINATION

Eigenvalues and Eigenvectors

MATH 221, Spring Homework 10 Solutions

Mon Feb Matrix inverses, the elementary matrix approach overview of skipped section 2.5. Announcements: Warm-up Exercise:

MAT 1302B Mathematical Methods II

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

6. The scalar multiple of u by c, denoted by c u is (also) in V. (closure under scalar multiplication)

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #2 Solutions

MA 265 FINAL EXAM Fall 2012

Final Exam Practice Problems Answers Math 24 Winter 2012

4. Linear transformations as a vector space 17

Check that your exam contains 30 multiple-choice questions, numbered sequentially.

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

Homework 3 Solutions Math 309, Fall 2015

Linear Algebra Practice Problems

Math 113 Homework 5 Solutions (Starred problems) Solutions by Guanyang Wang, with edits by Tom Church.

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

No books, no notes, no calculators. You must show work, unless the question is a true/false, yes/no, or fill-in-the-blank question.

7. Symmetric Matrices and Quadratic Forms

MATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL

Math 121 Practice Final Solutions

Homogeneous Linear Systems of Differential Equations with Constant Coefficients

Lec 2: Mathematical Economics

Dot Products. K. Behrend. April 3, Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem.

Eigenvalues and Eigenvectors

Linear Algebra: Matrix Eigenvalue Problems

Matrices related to linear transformations

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

Math Matrix Algebra

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

Final. for Math 308, Winter This exam contains 7 questions for a total of 100 points in 15 pages.

Eigenvalues and Eigenvectors 7.2 Diagonalization

Eigenspaces and Diagonalizable Transformations

Section Instructors: by now you should be scheduled into one of the following Sections:

Math 205B Exam 02 page 1 03/19/2010 Name /7 4/7 1/ /7 1/7 5/ /7 1/7 2/

Jordan Canonical Form Homework Solutions

Solving a system by back-substitution, checking consistency of a system (no rows of the form

Transcription:

Math 227-4 Week notes We will not necessarily finish the material from a given day's notes on that day We may also add or subtract some material as the week progresses, but these notes represent an in-depth outline of what we plan to cover These notes cover material in 52-54 Mon Mar 2 52 matrix eigenspaces Announcements: Warm-up Exercise:

Monday Review! We've been studying linear transformations T : V W between vector spaces, which are generalizations of matrix transformations T : n m given as T x = A x We've been studying how coordinates change when we change bases for finite dimensional vector spaces V On Friday we introduced the notion of eigenvectors for linear transformations T : V V, non-zero vectors v so that T transforms v to a multiple of itself This multiple is called the eigenvalue of v In other words, T v = v For our eigenvector discussion we're focusing on T : n n, T x = A x In this case we talk about eigenvectors of the matrix A, with eigenvalue, A v = v The idea is that because eigenvectors are transformed in ust about the most simple way possible by the matrix, they will give us computational and conceptual insite into the matrix transformation We'll see how this plays out On Friday we introduced the characteristic equation method of finding eigenvalues of a matrix first, and then the eigenvectors (eigenspace bases) second:

How to find eigenvalues and eigenvectors (eigenspace bases) systematically: If A v = v A v v = where I is the identity matrix A v I v = A I v = As we know, this last equation can have non-zero solutions v if and only if the matrix A I is not invertible, ie det A I = So, to find the eigenvalues and eigenvectors of matrix you can proceed as follows: Compute the polynomial in λ p = det A I If A n n then p will be degree n This polynomial is called the characteristic polynomial The eigenvalues will be the roots of the characteristic equation det A I = ie For each such root, the homogeneous solution space of vectors v solving A I v = Nul A will be the sub vector space of eigenvectors with eigenvalue This subspace of eigenvectors will be at least one dimensional, since A I does not reduce to the identity and so the explicit homogeneous solutions will have free parameters Find a basis of eigenvectors for this subspace Follow this procedure for each eigenvalue, ie for each root of the characteristic polynomial Notation: The subspace of eigenvectors for eigenvalue is called the eigenspace, and we'll denote it by E = The basis of eigenvectors is called an eigenbasis for E = I

We did part a on Friday, but didn't get to part b: Exercise ) a) Use the systematic algorithm to find the eigenvalues and eigenbases for the non-diagonal matrix A = 3 2 b) Use your work to describe the geometry of the linear transformation in terms of directions that get stretched: T x = 3 2 x 2 x x 2 a) A I = 3 2 = 3 2 3 2 p = = 3 2 2 = 2 5 4 = 4 So the eigenvalues of A are =, 4 E = 4 : Nul A 4 I E = 4 2 E = : Nul A I 2 2 E = Let's do part b!

b) Use the eigenspace information to describe the geometry of the linear transformation in terms of directions that get stretched A = 3 2 E = 4 2 E =

Exercise 2) Find the eigenvalues and eigenspace bases for 4 2 B := 2 2 2 3 (i) Find the characteristic polynomial and factor it to find the eigenvalues (p = 2 2 ) (ii) for each eigenvalue, find bases for the corresponding eigenspaces (iii) Can you describe the transformation T x = Bx geometrically using the eigenbases? Does det B have anything to do with the geometry of this transformation?

Your solution will be related to the output below: In most of our examples so far, it turns out that by collecting bases from each eigenspace for the matrix A n n, and putting them together, we get a basis for n This lets us understand the geometry of the transformation T x = A x almost as well as if A is a diagonal matrix It does not always happen that the matrix A an basis of n made consisting of eigenvectors for A (Even when all the eigenvalues are real) When it does happen, we say that A is diagonalizable Here's an example of a matrix which is NOT diagonalizable: Exercise 3: Find matrix eigenvalues and eigenspace basis for each eigenvalue, for A = 3 2 3 Explain why there is no basis of 2 consisting of eigenvectors of A