Homework Set 5 Solutions

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

1 Invariant subspaces

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 SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by

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

Definition (T -invariant subspace) Example. Example

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

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

Math 3191 Applied Linear Algebra

The Jordan Normal Form and its Applications

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

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

Jordan Canonical Form Homework Solutions

Homework 6 Solutions. Solution. Note {e t, te t, t 2 e t, e 2t } is linearly independent. If β = {e t, te t, t 2 e t, e 2t }, then

Dimension. Eigenvalue and eigenvector

Study Guide for Linear Algebra Exam 2

Recall : Eigenvalues and Eigenvectors

Math 113 Midterm Exam Solutions

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

Bare-bones outline of eigenvalue theory and the Jordan canonical form

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

MATH 221, Spring Homework 10 Solutions

MATH JORDAN FORM

MATH 205 HOMEWORK #3 OFFICIAL SOLUTION. Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. (a) F = R, V = R 3,

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

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

Math 108b: Notes on the Spectral Theorem

Math 113 Homework 5. Bowei Liu, Chao Li. Fall 2013

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors

Lecture 12: Diagonalization

NONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction

235 Final exam review questions

The Cayley-Hamilton Theorem and the Jordan Decomposition

The Spectral Theorem for normal linear maps

MATRIX LIE GROUPS AND LIE GROUPS

Homogeneous Linear Systems of Differential Equations with Constant Coefficients

MATH 115A: SAMPLE FINAL SOLUTIONS

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

Math 113 Winter 2013 Prof. Church Midterm Solutions

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

Math 110 Linear Algebra Midterm 2 Review October 28, 2017

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

Symmetric and self-adjoint matrices

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

Linear Algebra 2 Spectral Notes

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

Then x 1,..., x n is a basis as desired. Indeed, it suffices to verify that it spans V, since n = dim(v ). We may write any v V as r

Lecture Notes for Math 414: Linear Algebra II Fall 2015, Michigan State University

LINEAR ALGEBRA REVIEW

Linear Algebra Final Exam Solutions, December 13, 2008

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

1.4 Solvable Lie algebras

MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS

2 Eigenvectors and Eigenvalues in abstract spaces.

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

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

City Suburbs. : population distribution after m years

Eigenvalues and Eigenvectors A =

Travis Schedler. Thurs, Oct 27, 2011 (version: Thurs, Oct 27, 1:00 PM)

MATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018

Lecture Summaries for Linear Algebra M51A

Final Review Written by Victoria Kala SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015

PROBLEM SET. Problems on Eigenvalues and Diagonalization. Math 3351, Fall Oct. 20, 2010 ANSWERS

Section 8.2 : Homogeneous Linear Systems

Lecture 11: Eigenvalues and Eigenvectors

Algebra Homework, Edition 2 9 September 2010

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear Algebra 2 Final Exam, December 7, 2015 SOLUTIONS. a + 2b = x a + 3b = y. This solves to a = 3x 2y, b = y x. Thus

4. Linear transformations as a vector space 17

Definitions for Quizzes

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

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors

University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam May 25th, 2018

Math Final December 2006 C. Robinson

Math Linear Algebra Final Exam Review Sheet

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

Math 113 Final Exam: Solutions

LINEAR ALGEBRA SUMMARY SHEET.

Solving Homogeneous Systems with Sub-matrices

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

Activity 8: Eigenvectors and Linear Transformations

Eigenvectors. Prop-Defn

2.2. Show that U 0 is a vector space. For each α 0 in F, show by example that U α does not satisfy closure.

Math 121 Practice Final Solutions

Name: Final Exam MATH 3320

Linear Algebra II Lecture 13

Eigenvalues, Eigenvectors, and Diagonalization

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

Diagonalization of Matrix

= main diagonal, in the order in which their corresponding eigenvectors appear as columns of E.

Generalized Eigenvectors and Jordan Form

Answer Keys For Math 225 Final Review Problem

Exercise Set 7.2. Skills

Online Exercises for Linear Algebra XM511

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

18.06 Problem Set 7 Solution Due Wednesday, 15 April 2009 at 4 pm in Total: 150 points.

Solutions Problem Set 8 Math 240, Fall

GENERALIZED EIGENVECTORS, MINIMAL POLYNOMIALS AND THEOREM OF CAYLEY-HAMILTION

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Transcription:

MATH 672-010 Vector Spaces Prof. D. A. Edwards Due: Oct. 7, 2014 Homework Set 5 Solutions 1. Let S, T L(V, V finite-dimensional. (a (5 points Prove that ST and T S have the same eigenvalues. Solution. Let z be an eigenvector for ST corresponding to λ. Then (T ST z = T (ST z = T (λz = λ(t z, so T z is an eigenvector for T S if T z 0. If T z = 0, we see that λ = 0 must be an eigenvalue for ST because ST z = S0 = 0 = 0z. If N (S {0}, then for any y N (S, we have T Sy = T 0 = 0 = 0y, so λ = 0 is an eigenvalue for T S. If S is invertible, let y = S 1 z. Then we have T Sy = T z = 0 = 0y, so λ = 0 is an eigenvalue for T S. Since the roles of T and S can be switched arbitrarily, we have that ST and T S have the same eigenvalues. (b (4 points Show that ST T S I for any S, T L(V. Explain why it might be true if V is infinite-dimensional. Solution. Assume that ST T S = I, and let z be an eigenvector for ST corresponding to λ, the eigenvalue for ST (and hence also T S with smallest real part. Then (ST T Sz = Iz (T Sz = λz z, and hence we see that z is an eigenvector for T S corresponding to λ 1. But this contradicts λ having the smallest real part, so ST T S I. Note that if V is infinite-dimensional, it may have an infinite set of eigenvalues, so there may not be a smallest one. 2. (3 points Let T L(V be an invertible transformation, and let U be a subspace of V. Prove that if U is invariant under T, U is invariant under T 1. Solution. Let B U = {u i } n 1 be a basis for U, and let v U be defined by v = c i u i. If U is invariant under T, then T (v = T c i u i = c i T (u i = d i u i for some constants d i. Since T is invertible, it is onto, so every u U can be written as Copyright 2014 D. A. Edwards All Rights Reserved

M672F14Sol5.2 But then u = T 1 (u = T 1 d i u i = and hence U is invariant under T 1 as well. d i u i. T 1 (c i T (u i = c i u i U, 3. An operator N L(V is called nilpotent if N k = O for some integer k. (a (3 points Show that the only eigenvalue for N is λ = 0. Solution. Let z be an eigenvector for N. Then Nz = λz N 2 z = N(Nz = N(λz = λnz = λ 2 z N k z = 0z = 0 = λ k z. Since z 0, λ k = 0 and hence λ = 0. (b (3 points Let P n. Give an example of a nilpotent operator N such that N n+1 = O, but N j O for any j n. Solution. Let N be differentiation. Then applying N repeatedly, we have n 1 N(p(x = N a i x i = (i + 1a i x i n j N j (p(x = (i + j(i + j 1 (1a i x i N n (p(x = n(n 1 (1a 0 x 0 N n+1 (p(x = 0 Therefore, we see that N j 0 for any j n, but also N n+1 = 0. 4. Let T L(V, where U i is invariant under T. Show that (a (3 points Solution. Since R(T = R (T

M672F14Sol5.3 each element v V can be written as v = u i, u i (A for a unique choice of vectors u i, so every T v R(T can be written as T v = T u i, Since the U i are invariant under T, T u i and hence T u i R(T. Moreover, since we see that T u i T u j for any i j, so the representation is unique. Since every vector in R(T can be written uniquely as a sum of vectors in R(T, R(T = R(T. (b (3 points N (T = N (T Solution. Let v N (T. Applying T to both sides of (A, we obtain T v = 0 = T u i = w i, w i since the U i are invariant under T. But then by (A with v = 0, we see that w i = 0 by the definition of the direct sum. Thus T u i = 0, which implies that u i N (T. Since every v N (T can be written uniquely as a sum of these u i, we have that N (T = N (T. 5. (8 points Two operators S and T L(V are said to be simultaneously diagonalizable if M(T, Z, Z and M(S, Z, Z are diagonal for the same basis Z of V. Prove that if S and T are simultaneously diagonalizable, ST = T S.

M672F14Sol5.4 Solution. From notes in class, we know that Z = {z j } n 1 is an eigenvector basis for V. Denote the entries of M(T, Z, Z by t ij and the entries of M(S, Z, Z by s ij. Defining v V by v = c j z j, we obtain (ST v = S c j T (z j = S = c j t jj n s ij z i = c j n c j t jj s jj z j, t ij z i = S c j t jj z j = c j t jj S(z j (A.1 where we have used the fact that S and T are diagonal, so only s ii and t ii are nonzero. Similarly, n (T Sv = c j S(z j = T c j s ij z i = T c j s jj z j = c j s jj T (z j = c j s jj n t ij z i = c j s jj t jj z j. Since equations (A agree and v is arbitrary, ST = T S. (A.2 6. (8 points Let T L(V, dim n, λ be an eigenvalue of T. Furthermore, assume that the dimension of the eigenspace of T corresponding to λ is m. Show that there exists a basis W for V such that ( λi B M(T, W, W =, B R m (n m, C R (n m (n m, O C where I is the identity matrix in R m m, and O is the zero matrix in R (n m m. Solution. Let B W = {w j } m 1 be a basis for the eigenspace of T corresponding to λ. Extend it to a basis W for V by adding S = {s j } n m+1. Then since T (w j = λw j, we have T (w j = m m ij w i + i=m+1 m ij s j = λw j + m 0w i + i j i=m+1 0s i, where m ij is the ijth entry of M(T, W, W. Since m ij = 0 for i j in the first m columns of M(T, W, W and m ii = λ, these columns form ( λi, O

M672F14Sol5.5 where I is the identity matrix in R m m, and O is the zero matrix in R n m m. The other entries are arbitrary, so as desired. ( λi B M(T, W, W = O C, B R m (n m, C R (n m (n m,