Schur s Triangularization Theorem. Math 422

Similar documents
Diagonalizing Matrices

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

Diagonalization of Matrix

AMS526: Numerical Analysis I (Numerical Linear Algebra)

I. Multiple Choice Questions (Answer any eight)

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

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

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

Matrix Theory, Math6304 Lecture Notes from September 27, 2012 taken by Tasadduk Chowdhury

Eigenvalues and Eigenvectors

Math 3191 Applied Linear Algebra

AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)

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

Chapter 6: Orthogonality

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

Draft. Lecture 14 Eigenvalue Problems. MATH 562 Numerical Analysis II. Songting Luo. Department of Mathematics Iowa State University

MATH 221, Spring Homework 10 Solutions

Math 108b: Notes on the Spectral Theorem

Eigenvalues and eigenvectors

Chapter 6 Inner product spaces

LinGloss. A glossary of linear algebra

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

BASIC ALGORITHMS IN LINEAR ALGEBRA. Matrices and Applications of Gaussian Elimination. A 2 x. A T m x. A 1 x A T 1. A m x

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

1. General Vector Spaces

Quadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.

Lecture 15, 16: Diagonalization

Lecture 10 - Eigenvalues problem

Spectral Theorem for Self-adjoint Linear Operators

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

Linear Algebra Practice Problems

Exercise Set 7.2. Skills

Definition (T -invariant subspace) Example. Example

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

22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices

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

Eigenvalues and Eigenvectors

MAT 1302B Mathematical Methods II

Linear Algebra II Lecture 13

Math 315: Linear Algebra Solutions to Assignment 7

Eigenvalue and Eigenvector Problems

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

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

Name: Final Exam MATH 3320

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

Symmetric and self-adjoint matrices

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?

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 =

Chapter 5 Eigenvalues and Eigenvectors

Lecture notes: Applied linear algebra Part 1. Version 2

Math Linear Algebra II. 1. Inner Products and Norms

Study Guide for Linear Algebra Exam 2

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

Linear Algebra Lecture Notes-II

Warm-up. True or false? Baby proof. 2. The system of normal equations for A x = y has solutions iff A x = y has solutions

1 Last time: least-squares problems

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

MA 265 FINAL EXAM Fall 2012

Math 489AB Exercises for Chapter 2 Fall Section 2.3

MATH 115A: SAMPLE FINAL SOLUTIONS

Math 205, Summer I, Week 4b:

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.

5.3.5 The eigenvalues are 3, 2, 3 (i.e., the diagonal entries of D) with corresponding eigenvalues. Null(A 3I) = Null( ), 0 0

6 Inner Product Spaces

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

Review problems for MA 54, Fall 2004.

Recall : Eigenvalues and Eigenvectors

Math 102 Final Exam - Dec 14 - PCYNH pm Fall Name Student No. Section A0

Homework For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable.

Lecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1)

Announcements Monday, November 26

Lecture 3 Eigenvalues and Eigenvectors

MATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL

MATH Linear Algebra

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

Chapter 7: Symmetric Matrices and Quadratic Forms

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )

c 1 v 1 + c 2 v 2 = 0 c 1 λ 1 v 1 + c 2 λ 1 v 2 = 0

Linear Algebra: Matrix Eigenvalue Problems

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

Eigenvalue and Eigenvector Homework

Lecture 3: QR-Factorization

235 Final exam review questions

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

2 Eigenvectors and Eigenvalues in abstract spaces.

Lecture 11: Diagonalization

Exercise Sheet 1.

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

Math Spring 2011 Final Exam

The University of Texas at Austin Department of Electrical and Computer Engineering. EE381V: Large Scale Learning Spring 2013.

Linear Algebra (MATH ) Spring 2011 Final Exam Practice Problem Solutions

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

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

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.

Solutions to Final Exam

Numerical Methods I Eigenvalue Problems

Numerical Linear Algebra Homework Assignment - Week 2

Linear algebra 2. Yoav Zemel. March 1, 2012

Math 2331 Linear Algebra

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

Transcription:

Schur s Triangularization Theorem Math 4 The characteristic polynomial p (t) of a square complex matrix A splits as a product of linear factors of the form (t λ) m Of course, finding these factors is a difficult problem, but having factored p (t) we can triangularize A whether or not A is diagonalizable Example 1 The characteristic polynomial p (t) t of the triangular matrix 0 1 A 0 0 hasthesinglerootλ 0, which is an eigenvalue of algebraic multiplicity The eigenspace of λ is one dimensional and is spanned by the single vector 1 0, so the geometric multiplicity of λ is 1 Therefore A is defective and is not diagonalizable (one needs three linearly independent eigenvectors to construct a transition matrix P that diagonalizes A) Let V n be an n-dimensional complex inner product space with Euclidean inner product Definition A hyperplane in V n is a translation of an (n 1)-dimensional subspace Note that the orthogonal complement u of a non-zero vector u C n is a hyperplane through the origin Consider the matrix P I 1 kuk uu ; then Q P 1 kuk uu I kuk uu is the Householder matrix associated with u Proposition N (P ) span {u} and multiplication by P is orthogonal projection on u, ie, for all x C n, Px proj u x Proof If Px 0, then x x u x u u 0or equivalently x u Thus x tu for some t C, and kuk kuk N (P )span {u} Furthermore, for all x C n, Px x proj u x proj u x Definition 4 Let x, y, u C n with u 6 0 Then y is the reflection of x in the hyperplane u iff x y proj u x Proposition 5 Let u C n be a non-zero vector reflection in the hyperplane u The Householder transformation associated with u is Proof Note that for all x C n, Thus Qx x Ã! x u kuk u x proj u x x Qx proj u x 1

Exercise 6 Earlier we proved that a real Householder matrix Q is symmetric and orthogonal, ie,q T Q and Q 1 Q T Generalize this result for complex matrices: Prove that complex Householder matrices Q are Hermitian and unitary Let v (v 1,,v n ) beanon-zerovectorinc n and set x v 1v kv 1 vk Then x (x 1,,x n ) C n is a unit vector with x 1 R Letu x e 1 then kuk (x e 1 ) (x e 1 )x x x e 1 e 1 x + e 1 e 1 x 1 (1 x e 1 ) x u x (x e 1 )x x x e 1 1 x e 1 If x 6 e 1, then u 6 0and we may apply the Householder transformation Q associated with u to x and e 1 : Qx x x u kuk u x (1 x e 1) (1 x e 1 ) u x u x (x e 1)e 1 ; applying Q to both sides we have Q x x Qe 1 If x e 1, set Q I; then in either case x Qe 1 and e 1 Qx are reflection of each other in the hyperplane (x e 1 ) For a unit vector x R, the line (x e 1 ) bisects the angle between x and e 1 We are ready to prove our main theorem in this lecture: Theorem 7 (Schur s Triangularization Theorem) Every square complex matrix A is unitarily similar to an upper-triangular matrix, ie, there exists a unitary matrix U such that T U AU is triangular Proof Use induction on the size of A For n 1there is nothing to prove So assume n>1 and that the result holds for all matrices of size less than n Since every complex matrix has an eigenvalue, choose an eigenvalue λ of A and an associated eigenvector v (v 1,,v n ) Let x v 1v kv 1 vk and set u x e 1; if x 6 e 1, let Q be the Householder matrix associated with u; if x e 1 let Q I Then x Qe 1 by the discussion above, so x is the first column of Q ByExercise6,Q is Hermitian and unitary, so x is the first row of Q Since Q Q 1 Q we have Q [x V ] x V and QAQ QA [x V ]Q [λx AV ] λe 1 x V λ AV x AV 0 V AV Now apply the induction hypothesis to V AV, which is an (n 1) (n 1) matrix, and obtain an (n 1) (n 1) unitary matrix R such that T n 1 R (V AV ) R is upper-triangular Let 1 0 U Q ; then U 1 0 U Q 1 0 1 0 Q I R so U is unitary Hence T U 1 0 1 0 AU QAQ 1 0 λ x AV 1 0 0 V AV 1 0 λ x AV R 0 V AV R λ x AV R λ x V AV R AV R 0 T n 1

is triangular as claimed

Remark 8 Since similar matrices have the same eigenvalues, the eigenvalues of A are the diagonal entries of every Schur triangularization T U AU When all eigenvalues of A are real, Schur s Triangularization Theorem tells us that A is orthogonally similar to a triangular matrix Our next example demonstrates this Example 9 Let s find a Schur triangularization of the matrix 1 1 A 8 11 8 10 11 7 The eigenvalues of A are λ 1 1,λ and λ Arbitrarily choose an eigenvalue, say λ 1 1, then 1 A I 8 1 8 1 0 1 0 1 1 10 11 6 0 0 0 and x 1/ / is an associated unit eigenvector Let u x e 1 4/ / and let Q be the associated / / Householder matrix, ie, Q I 4 uut 1 1 1 [x V ], 1 where V 1 1 1 Then QAQ 1 64 1 0 1 1 and V T AV 1 1 1 16 5 0 16 5 Now triangularize the matrix V T AV, which has the single eigenvalue The vector x 1 1 17 4 is a unit vector associated with Let u x e 1 1 1 17 17 4 and let R be the Householder matrix associated with u, ie, 04 54 0970 14 R 0970 14 04 54 Then RV T 17/ AV R 0 is a Schur triangularization of V T AV Finally,let U Q 1 0 then U T AU 1 0970 5 1747 0 000 56667 0 0 000 is a (numerically approximate) Schur triangularization of A 4

Exercise 10 Show that the matrix A in Example 9 is defective and hence not diagonalizable 1 1 8 11 8 10 11 7 In summary, every matrix is triangularizable but only non-defective matrices are diagonalizable Following the proof of Schur s Triangularization Theorem, find an orthogonal matrix P such that P T AP is upper triancular: 1 1 Exercise 11 A 1 Exercise 1 A 1 1 1 9 Exercise 1 A 16 11 5