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

Similar documents
Math 108b: Notes on the Spectral Theorem

1 Last time: least-squares problems

Symmetric and anti symmetric matrices

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.

Quantum Computing Lecture 2. Review of Linear Algebra

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 )

Linear Algebra: Matrix Eigenvalue Problems

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

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

MATRICES ARE SIMILAR TO TRIANGULAR MATRICES

Properties of Linear Transformations from R n to R m

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

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.

MATH 221, Spring Homework 10 Solutions

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

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

Spectral Theorem for Self-adjoint Linear Operators

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

The Adjoint of a Linear Operator

Eigenvalues and Eigenvectors A =

Recall : Eigenvalues and Eigenvectors

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

Eigenvalues and Eigenvectors

I. Multiple Choice Questions (Answer any eight)

Math 310 Final Exam Solutions

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

Numerical Linear Algebra Homework Assignment - Week 2

Diagonalizing Matrices

Symmetric and self-adjoint matrices

Chapter 6 Inner product spaces

Review of Linear Algebra

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

Linear Algebra in Actuarial Science: Slides to the lecture

A = 3 B = A 1 1 matrix is the same as a number or scalar, 3 = [3].

EXAM. Exam 1. Math 5316, Fall December 2, 2012

A VERY BRIEF LINEAR ALGEBRA REVIEW for MAP 5485 Introduction to Mathematical Biophysics Fall 2010

GQE ALGEBRA PROBLEMS

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

NOTES ON BILINEAR FORMS

Linear Algebra 2 Spectral Notes

Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem

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

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

Linear Algebra 1. M.T.Nair Department of Mathematics, IIT Madras. and in that case x is called an eigenvector of T corresponding to the eigenvalue λ.

Assignment 1 Math 5341 Linear Algebra Review. Give complete answers to each of the following questions. Show all of your work.

MA 265 FINAL EXAM Fall 2012

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

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

INTRODUCTION TO LIE ALGEBRAS. LECTURE 2.

Linear Algebra using Dirac Notation: Pt. 2

Chapter 5 Eigenvalues and Eigenvectors

AMS526: Numerical Analysis I (Numerical Linear Algebra)

Solutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015

Econ 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms. 1 Diagonalization and Change of Basis

Schur s Triangularization Theorem. Math 422

1. General Vector Spaces

MTH 102: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur. Problem Set

1 Linear Algebra Problems

Definition (T -invariant subspace) Example. Example

Eigenvectors. Prop-Defn

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

FFTs in Graphics and Vision. The Laplace Operator

. The following is a 3 3 orthogonal matrix: 2/3 1/3 2/3 2/3 2/3 1/3 1/3 2/3 2/3

EXERCISES ON DETERMINANTS, EIGENVALUES AND EIGENVECTORS. 1. Determinants

REPRESENTATION THEORY WEEK 7

Math 408 Advanced Linear Algebra

6 Inner Product Spaces

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

Linear Algebra. Workbook

Linear Algebra Lecture Notes-II

Linear Algebra Review

Matrix Theory, Math6304 Lecture Notes from Sept 11, 2012 taken by Tristan Whalen

4. Linear transformations as a vector space 17

Homework 1 Elena Davidson (B) (C) (D) (E) (F) (G) (H) (I)

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

18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in

Lecture 7: Positive Semidefinite Matrices

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

Math 2331 Linear Algebra

Lecture 10 - Eigenvalues problem

MATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL

Lecture notes: Applied linear algebra Part 1. Version 2

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

Math 489AB Exercises for Chapter 2 Fall Section 2.3

Chapter 4 Euclid Space

Econ Slides from Lecture 7

1. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true?

CS 246 Review of Linear Algebra 01/17/19

CS 143 Linear Algebra Review

Applied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic

Eigenvalues and Eigenvectors 7.1 Eigenvalues and Eigenvecto

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

MATH 583A REVIEW SESSION #1

Math Linear Algebra Final Exam Review Sheet

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

Eigenvalues and Eigenvectors

Knowledge Discovery and Data Mining 1 (VO) ( )

Linear Algebra Review. Vectors

Transcription:

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

Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation L : V V satisfying L(x),y = x, L (y) for all x,y V. Theorem 1 If V is finite-dimensional, then the adjoint operator L always exists. Given a matrix A with complex entries, its adjoint matrix is A = A t. Theorem 2 If A is the matrix of a linear operator L relative to an orthonormal basis β, then the matrix of L relative to the same basis is A.

Let L : V V be a linear operator on an inner product space V. Recall that N(L) denotes the null-space of L and R(L) denotes the range of L: N(L) = {x V L(x) = 0}, R(L) = {L(y) y V }. Theorem If the adjoint operator L exists, then N(L) = R(L ) as well as N(L ) = R(L). Proof: x N(L) L(x) = 0 L(x),y = 0 for all y V x, L (y) = 0 for all y V x R(L ) x R(L ). The second equality follows in the same way since (L ) = L. Example. V = R n with the dot product, L(x) = Ax, where A M n,n (R) and vectors are regarded as column vectors. We have L (x) = A x for all x R n. The range of L is the column space of the matrix A = A t, which is the row space of A. Therefore N(L) = {null-space of the matrix A} is the orthogonal complement of the row space of A.

Normal operators Definition. A linear operator L on an inner product space V is called normal if it commutes with its adjoint. That is, if the adjoint operator L exists and L L = L L. There are several special classes of normal operators important for applications. The operator L is self-adjoint if L = L. Equivalently, L(x),y = x, L(y) for all x,y V. The operator L is anti-selfadjoint if L = L. The operator L is unitary if L = L 1.

Normal matrices Definition. A square matrix A with real or complex entries is normal if AA = A A. Theorem Let L be a linear operator on a finite-dimensional inner product space. Suppose A is the matrix of L relative to an orthonormal basis. Then the operator L is normal if and only if the matrix A is normal. Special classes of normal operators give rise to special classes of normal matrices. A matrix A M n,n (C) is Hermitian if A = A, skew-hermitian if A = A, and unitary if A = A 1. A square matrix B with real entries is symmetric if B t = B, skew-symmetric if B t = B, and orthogonal if B t = B 1.

Properties of normal operators Theorem Suppose L is a normal operator on an inner product space V. Then (i) L(x) = L (x) for all x V; (ii) N(L) = N(L ); (iii) an operator given by x L(x) λx is normal for any scalar λ; (iv) the operators L and L share eigenvectors; namely, if L(v) = λv then L (v) = λv; (v) eigenvectors of L belonging to distinct eigenvalues are orthogonal; (vi) if a subspace V 0 V is invariant under L, then the orthogonal complement V0 is also invariant under L.

Properties of normal operators L(x) = L (x) for all x V. L(x) 2 = L(x), L(x) = x, L (L(x)) = x, L(L (x)) = L(L (x)),x = L (x), L (x) = L (x), L (x) = L(x) 2. If v 1 and v 2 are eigenvectors of L belonging to distinct eigenvalues λ 1 and λ 2, then v 1,v 2 = 0. We have L(v 1 ) = λ 1 v 1 and L (v 2 ) = λ 2 v 2. Then λ 1 v 1,v 2 = λ 1 v 1,v 2 = L(v 1 ),v 2 = v 1, L (v 2 ) = v 1,λ 2 v 2 = λ 2 v 1,v 2. It follows that (λ 1 λ 2 ) v 1,v 2 = 0. Since λ 1 λ 2, we obtain v 1,v 2 = 0.

Diagonalization of normal operators Theorem A linear operator L on a finite-dimensional inner product space V is normal if and only if there exists an orthonormal basis for V consisting of eigenvectors of L. Proof ( if ): Suppose β is an orthonormal basis consisting of eigenvectors of L. Then the matrix A = [L] β is diagonal, A = diag(λ 1,λ 2,...,λ n ). Since β is orthonormal, [L ] β = A = diag(λ 1,λ 2,...,λ n ). Clearly, AA = A A. Hence L L = L L. Idea of the proof ( only if ): The statement is derived from the following two lemmas. Lemma 1 (Schur s Theorem) There exists an orthonormal basis β for V such that the matrix [L] β is upper triangular. Lemma 2 If a normal matrix is upper triangular, then it is actually diagonal.

Diagonalization of normal operators Theorem A linear operator L on a finite-dimensional inner product space V is normal if and only if there exists an orthonormal basis for V consisting of eigenvectors of L. Corollary 1 Suppose L is a normal operator. Then (i) L is self-adjoint if and only if all eigenvalues of L are real (λ = λ); (ii) L is anti-selfadjoint if and only if all eigenvalues of L are purely imaginary (λ = λ); (iii) L is unitary if and only if all eigenvalues of L are of absolute value 1 (λ = λ 1 ). Corollary 2 A linear operator L on a finite-dimensional, real inner product space V is self-adjoint if and only if there exists an orthonormal basis for V consisting of eigenvectors of L.

Diagonalization of normal matrices Theorem (a) A M n,n (C) is normal there exists an orthonormal basis for C n consisting of eigenvectors of A; (b) A M n,n (R) is symmetric there exists an orthonormal basis for R n consisting of eigenvectors of A. Example. A = 1 0 1 0 3 0. 1 0 1 A is symmetric. A has three eigenvalues: 0, 2, and 3. Associated eigenvectors are v 1 = ( 1, 0, 1), v 2 = (1, 0, 1), and v 3 = (0, 1, 0), respectively. 1 Vectors 2 1 v 1, 2 v 2,v 3 form an orthonormal basis for R 3.

( ) cos φ sin φ Example. A φ =. sin φ cos φ A φ A ψ = A φ+ψ A 1 φ = A φ = A t φ A φ is orthogonal det(a φ λi) = (cosφ λ) 2 + sin 2 φ. Eigenvalues: λ 1 = cosφ + i sin φ = e iφ, λ 2 = cosφ i sin φ = e iφ. Associated eigenvectors: v 1 = (1, i), v 2 = (1, i). Vectors 1 2 v 1 and 1 2 v 2 form an orthonormal basis for C 2.