Exercise Set 7.2. Skills

Similar documents
which are not all zero. The proof in the case where some vector other than combination of the other vectors in S is similar.

22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices

Diagonalization of Matrix

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

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

Definition (T -invariant subspace) Example. Example

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

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

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

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

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

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

I. Multiple Choice Questions (Answer any eight)

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

Contents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2

33A Linear Algebra and Applications: Practice Final Exam - Solutions

Math 315: Linear Algebra Solutions to Assignment 7

Practice problems for Exam 3 A =

Diagonalization. Hung-yi Lee

Review problems for MA 54, Fall 2004.

Lecture 15, 16: Diagonalization

MATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL

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

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

Math 108b: Notes on the Spectral Theorem

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

4. Linear transformations as a vector space 17

Mathematical Methods for Engineers 1 (AMS10/10A)

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

1 Last time: least-squares problems

235 Final exam review questions

Chapter 7: Symmetric Matrices and Quadratic Forms

Lecture 10 - Eigenvalues problem

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

7. Symmetric Matrices and Quadratic Forms

Jordan Canonical Form Homework Solutions

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?

City Suburbs. : population distribution after m years

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

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

5.) For each of the given sets of vectors, determine whether or not the set spans R 3. Give reasons for your answers.

Diagonalizing Matrices

Answer Keys For Math 225 Final Review Problem

Problem 1: Solving a linear equation

Math 205, Summer I, Week 4b:

Eigenvalue and Eigenvector Homework

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 =

MATH 1553-C MIDTERM EXAMINATION 3

Linear Algebra II Lecture 13

Math 3191 Applied Linear Algebra

Schur s Triangularization Theorem. Math 422

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

Lecture 7: Positive Semidefinite Matrices

Math 314H Solutions to Homework # 3

MATH 1553 SAMPLE FINAL EXAM, SPRING 2018

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

Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015

The value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.

Jordan Normal Form and Singular Decomposition

Final Exam. Linear Algebra Summer 2011 Math S2010X (3) Corrin Clarkson. August 10th, Solutions

Math 1553, Introduction to Linear Algebra

MATH 221, Spring Homework 10 Solutions

This is a closed book exam. No notes or calculators are permitted. We will drop your lowest scoring question for you.

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

EXERCISES ON DETERMINANTS, EIGENVALUES AND EIGENVECTORS. 1. Determinants

Section 7.3: SYMMETRIC MATRICES AND ORTHOGONAL DIAGONALIZATION

Chapter 6: Orthogonality

Applied Linear Algebra in Geoscience Using MATLAB

Recall : Eigenvalues and Eigenvectors

Final Exam Practice Problems Answers Math 24 Winter 2012

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

Homework 11 Solutions. Math 110, Fall 2013.

Announcements Monday, November 06

Math 4153 Exam 3 Review. The syllabus for Exam 3 is Chapter 6 (pages ), Chapter 7 through page 137, and Chapter 8 through page 182 in Axler.

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

MAC Module 12 Eigenvalues and Eigenvectors

MATH 1553, C. JANKOWSKI MIDTERM 3

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

Final Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson

LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT FALL 2006 PRINCETON UNIVERSITY

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

Eigenvalues and Eigenvectors

Math Spring 2011 Final Exam

Solutions to Final Exam

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

MA 265 FINAL EXAM Fall 2012

Chapter 3 Transformations

Family Feud Review. Linear Algebra. October 22, 2013

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

Last name: First name: Signature: Student number:

Practice Final Exam Solutions

PRACTICE FINAL EXAM. why. If they are dependent, exhibit a linear dependence relation among them.

ICS 6N Computational Linear Algebra Symmetric Matrices and Orthogonal Diagonalization

1 Inner Product and Orthogonality

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

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

Lecture 12: Diagonalization

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

MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003

AMS526: Numerical Analysis I (Numerical Linear Algebra)

Transcription:

Orthogonally diagonalizable matrix Spectral decomposition (or eigenvalue decomposition) Schur decomposition Subdiagonal Upper Hessenburg form Upper Hessenburg decomposition Skills Be able to recognize an orthogonally diagonalizable matrix. Know that eigenvalues of symmetric matrices are real numbers. Know that for a symmetric matrix eigenvectors from different eigenspaces are orthogonal. Be able to orthogonally diagonalize a symmetric matrix. Be able to find the spectral decomposition of a symmetric matrix. Know the statement of Schur's Theorem. Know the statement of Hessenburg's Theorem. Exercise Set 7.2 1. Find the characteristic equation of the given symmetric matrix, and then by inspection determine the dimensions of the eigenspaces. (a) (b) (c) (d) (e) (f) (a) one-dimensional; one-dimensional (b) one-dimensional; two-dimensional

(c) one-dimensional; two-dimensional (d) two-dimensional; one-dimensional (e) three-dimensional; one-dimensional (f) two-dimensional; two-dimensional In Exercises 2 9, find a matrix P that orthogonally diagonalizes A, and determine. 2. 3. 4. 5. 6. 7.

8. 9. 10. Assuming that, find a matrix that orthogonally diagonalizes 11. Prove that if A is any matrix, then has an orthonormal set of n eigenvectors. 12. (a) Show that if v is any matrix and I is the identity matrix, then is orthogonally diagonalizable. (b) Find a matrix P that orthogonally diagonalizes if 13. Use the result in Exercise 19 of Section 5.1 to prove Theorem 7.2.2a for symmetric matrices. 14. Does there exist a symmetric matrix with eigenvalues, and corresponding eigenvectors If so, find such a matrix; if not, explain why not. 15. Is the converse of Theorem 7.2.2b true? Explain. No 16. Find the spectral decomposition of each matrix. (a) (b) (c)

(d) 17. Show that if A is a symmetric orthogonal matrix, then 1 and are the only possible eigenvalues. 18. (a) Find a symmetric matrix whose eigenvalues are, and for which the corresponding eigenvectors are,,. (b) Is there a symmetric matrix with eigenvalues,, and corresponding eigenvectors,,? Explain your reasoning. 19. Let A be a diagonalizable matrix with the property that eigenvectors from distinct eigenvalues are orthogonal. Must A be symmetric? Explain you reasoning. Yes 20. Prove: If is an orthonormal basis for, and if A can be expressed as then A is symmetric and has eigenvalues. 21. In this exercise we will establish that a matrix A is orthogonally diagonalizable if and only if it is symmetric. We have shown that an orthogonally diagonalizable matrix is symmetric. The harder part is to prove that a symmetric matrix A is orthogonally diagonalizable. We will proceed in two steps: first we will show that A is diagonalizable, and then we will build on that result to show that A is orthogonally diagonalizable. (a) Assume that A is a symmetric matrix. One way to prove that A is diagonalizable is to show that for each eigenvalue the geometric multiplicity is equal to the algebraic multiplicity. For this purpose, assume that the geometric multiplicity of is k, let be an orthonormal basis for the eigenspace corresponding to, extend this to an orthonormal basis for, and let P be the matrix having the vectors of B as columns. As shown in Exercise 34(b) of Section 5.2, the product can be written as Use the fact that B is an orthonormal basis to prove that [a zero matrix of size. (b) It follows from part (a) and Exercise 34(c) of Section 5.2 that A has the same characteristic polynomial as Use this fact and Exercise 34(d) of Section 5.2 to prove that the algebraic multiplicity of is the same as the geometric multiplicity of. This establishes that A is diagonalizable. (c) Use Theorem 7.2.2(b) and the fact that A is diagonalizable to prove that A is orthogonally diagonalizable. -False Exercises In parts (a) (g) determine whether the statement is true or false, and justify your answer. (a) If A is a square matrix, then and are orthogonally diagonalizable.

(b) If and are eigenvectors from distinct eigenspaces of a symmetric matrix, then. (c) Every orthogonal matrix is orthogonally diagonalizable. False (d) If A is both invertible and orthogonally diagonalizable, then is orthogonally diagonalizable. (e) Every eigenvalue of an orthogonal matrix has absolute value 1. (f) If A is an orthogonally diagonalizable matrix, then there exists an orthonormal basis for consisting of eigenvectors of A. False (g) If A is orthogonally diagonalizable, then A has real eigenvalues. Copyright 2010 John Wiley & Sons, Inc. All rights reserved.