Jordan Canonical Form of a Nilpotent Matrix. Math 422

Similar documents
1 Last time: least-squares problems

Schur s Triangularization Theorem. Math 422

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

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

MATH SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

Chapter 3. Determinants and Eigenvalues

MAT 1302B Mathematical Methods II

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

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

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

Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur

Lecture 21: The decomposition theorem into generalized eigenspaces; multiplicity of eigenvalues and upper-triangular matrices (1)

Review problems for MA 54, Fall 2004.

LINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS

The Jordan Canonical Form

The Cayley-Hamilton Theorem and the Jordan Decomposition

(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).

NONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction

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

Linear algebra II Tutorial solutions #1 A = x 1

Math 3191 Applied Linear Algebra

LinGloss. A glossary of linear algebra

The Cyclic Decomposition of a Nilpotent Operator

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

Problem # Max points possible Actual score Total 120

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

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Cheat Sheet for MATH461

Final Exam Practice Problems Answers Math 24 Winter 2012

Lecture 7: Positive Semidefinite Matrices

EIGENVALUE PROBLEMS. Background on eigenvalues/ eigenvectors / decompositions. Perturbation analysis, condition numbers..

Math Final December 2006 C. Robinson

MAT1302F Mathematical Methods II Lecture 19

Math 121 Practice Final Solutions

Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015

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

Definition (T -invariant subspace) Example. Example

Study Guide for Linear Algebra Exam 2

I. Multiple Choice Questions (Answer any eight)

1.4 Solvable Lie algebras

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background

m We can similarly replace any pair of complex conjugate eigenvalues with 2 2 real blocks. = R

Definition 2.3. We define addition and multiplication of matrices as follows.

Lecture 22: Jordan canonical form of upper-triangular matrices (1)

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 )

Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012

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

Lecture 11: Diagonalization

Notes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T.

Numerical Methods I Eigenvalue Problems

Section 3.3. Matrix Rank and the Inverse of a Full Rank Matrix

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors

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

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

Problem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show

The Singular Value Decomposition

Matrix Operations: Determinant

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

Jordan Normal Form and Singular Decomposition

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

DIAGONALIZATION BY SIMILARITY TRANSFORMATIONS

22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices

1. Select the unique answer (choice) for each problem. Write only the answer.

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Math 489AB Exercises for Chapter 2 Fall Section 2.3

Math Spring 2011 Final Exam

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

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

NAME MATH 304 Examination 2 Page 1

Math 315: Linear Algebra Solutions to Assignment 7

Math 110 Linear Algebra Midterm 2 Review October 28, 2017

Vector Spaces and Linear Transformations

c i r i i=1 r 1 = [1, 2] r 2 = [0, 1] r 3 = [3, 4].

Jordan Canonical Form

Homework 11/Solutions. (Section 6.8 Exercise 3). Which pairs of the following vector spaces are isomorphic?

The Singular Value Decomposition (SVD) and Principal Component Analysis (PCA)

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

8. Diagonalization.

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

(the matrix with b 1 and b 2 as columns). If x is a vector in R 2, then its coordinate vector [x] B relative to B satisfies the formula.

Recall : Eigenvalues and Eigenvectors

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

2 Eigenvectors and Eigenvalues in abstract spaces.

Math 308 Practice Final Exam Page and vector y =

forms Christopher Engström November 14, 2014 MAA704: Matrix factorization and canonical forms Matrix properties Matrix factorization Canonical forms

1. Determine by inspection which of the following sets of vectors is linearly independent. 3 3.

The Jordan Normal Form and its Applications

A proof of the Jordan normal form theorem

MTH 464: Computational Linear Algebra

(Can) Canonical Forms Math 683L (Summer 2003) M n (F) C((x λ) ) =

Question 7. Consider a linear system A x = b with 4 unknown. x = [x 1, x 2, x 3, x 4 ] T. The augmented

Exercise Set 7.2. Skills

Lecture 3: QR-Factorization

Lecture 10 - Eigenvalues problem

AMS526: Numerical Analysis I (Numerical Linear Algebra)

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

Diagonalization of Matrix

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

Transcription:

Jordan Canonical Form of a Nilpotent Matrix Math Schur s Triangularization Theorem tells us that every matrix A is unitarily similar to an upper triangular matrix T However, the only thing certain at this point is that the the diagonal entries of T are the eigenvalues of A The off-diagonal entries of T seem unpredictable and out of control Recall that the Core-Nilpotent Decomposition of a singular matrix A of index k produces a block diagonal matrix C L similar to A in which C is non-singular, rank (C) =rank A k, and L is nilpotent of index k Isitpossible to simplify C and L via similarity transformations and obtain triangular matrices whose off-diagonal entries are predictable? The goal of this lecture is to do exactly this for nilpotent matrices Let L be an n n nilpotent matrix of index k Then L k =and L k = Let s compute the eigenvalues of L Suppose x = satisfies Lx = λx then =L k x = L k (Lx) =L k (λx) =λl k x = λl k (Lx) = λ L k x = = λ k x thus λ =is the only eigenvalue of L Now if L is diagonalizable, there is an invertible matrix P and a diagonal matrix D such that P LP = D Since the diagonal entries of D are the eigenvalues of L, and λ =is the only eigenvalue of L, wehave D = Solving P LP =for L gives L = Thus a diagonalizable nilpotent matrix is the zero matrix, or equivalently, a non-zero nilpotent matrix L is not diagonalizable And indeed, some off-diagonal entries in the simplified form of L will be non-zero Let L be a non-zero nilpotent matrix Since L is triangularizable, there exists an invertible P such that P LP = The simplification procedure given in this lecture produces a matrix similar to L whose non-zero entries lie exclusively on the superdiagonal of P LP An example of this procedure follows below Definition Let L be nilpotent of index k and define L = I For p =,,,k, let x C n such that y = L p x = The Jordan chain on y of length p is the set L p x,,lx,x ª Exercise Let L be nilpotent of index k If x C n satisfies L k x =, prove that L k x,, linearly independent Example Let L = then L = and L = Let x = a b then c Lx = a b = b +c c and L x = a b = c c c Lx,x} is Note that L x, Lx, x ª is linearly independent iff c = Thus if x =[] T, then y = L x =[9] T and the Jordan chain on y is 9, 8 9, Form the matrix P = L x Lx x = 9 8 9

then P LP = is the Jordan form of L 7 7 7 8 8 9 8 9 = Since λ =is the only eigenvalue of an n n non-zero nilpotent L, the eigenvectors of L are exactly the non-zero vectors in N (L) Butdim N (L) <nsince L is not diagonalizable and possesses an incomplete set of linearly independent eigenvectors So the process by which one constructs the desired similarity transformation P LP involves appropriately extending a deficient basis for N (L) to a basis for C n This process has essentially two steps: Construct a somewhat special basis B for N (L) Extend B toabasisforc n by building Jordan chains on the elements of B Definition A nilpotent Jordan block is a matrix of the form A nilpotent Jordan matrix is a block diagonal matrix of the form J J J m, () where each J i is a nilpotent Jordan block When the context is clear we refer to a nilpotent Jordan matrix as a Jordan matrix Theorem 5 Every n n nilpotent matrix L of index k is similar to an n n Jordan matrix J in which the number of Jordan blocks is dim N (L) the size of the largest Jordan block is k k for j k, the number of j j Jordan blocks is rank L j rank L j + rank L j+ the ordering of the J i s is arbitrary Whereas the essentials of the proof appear in the algorithm below, we omit the details Definition If L is a nilpotent matrix, a Jordan form of L is a Jordan matrix J = P LP The Jordan structure of L is the number and size of the Jordan blocks in every Jordan form J of L Theorem 5 tells us that Jordan form is unique up to ordering of the blocks J i Indeed, given any prescribed ordering, there is a Jordan form whose Jordan blocks appear in that prescribed order

Definition 7 The Jordan Canonical Form (JCF) of a nilpotent matrix L is the Jordan form of L in which the Jordan blocks are distributed along the diagonal in order of decreasing size Example 8 Let us determine the Jordan structure and JCF of the nilpotent matrix 5 5 L = 5 the number of Jordan blocks is dim N (L) = Then L = has rank and L =therefore the index (L) =and the size of the largest Jordan block is Let then the number n i of i i Jordan blocks is r = rank L = r = rank L = r = rank L = r = rank L = r = rank L = n = r r + r = n = r r + r = n = r r + r = Obtain the JCF by distributing these blocks along the diagonal in order of decreasing size Then the JCF of L is This leaves us with the task of determining a non-singular matrix P such that P LP is the JCF of L As mentioned above, this process has essentially two steps A detailed algorithm follows our next definition and a key exercise Definition 9 Let E be any row-echelon form of a matrix A Let c,,c q index the columns of E containing leading s and let y i denote the c th i column of A The columns y,,y q are called the basic columns of A Exercise Let B = [b b p ] be an n p matrix with linearly independent columns Prove that multiplication by B preserves linear independence, ie, if {v,,v s } is linearly independent in C p,then {Bv,,Bv s } is linearly independent in C n

Nilpotent Reduction to JCF Given a nilpotent matrix L of index k, set i = k and let S k = {y,,y q } be the basic columns of L k Extend S k S i to a basis for R L i N (L) in the following way: (a) Let {b,,b p } be the basic columns of L i and let B =[b b p ] (b) Solve LBx =for x and obtain a basis {v,,v s } for N (LB) then {Bv,,Bv s } is a basis for R L i N (L) by Lemma below o (c) Form the matrix [y y q Bv Bv s ] its basic columns ny,,y q,bv β,,bv βj form a basis for R L i N (L) containing S k S i Let S i = nbv β,,bv βj o (d) Decrement i, let {y,,y q } be the basic columns of L i, and repeat step until i = Then S k S = {b,,b t } is a basis for N (L) For each j, if b j S i, find a particular solution x j of L i x = b j and build a Jordan chain ª L i x j,,lx j,x j Set p j = L i x j Lx j x j the desired similarity transformation is defined by the matrix P =[p p t ] Lemma In the notation of the algorithm above, {Bv,,Bv s } is a basis for R L i N (L) Proof Note that Bv j R (B) and LBv j =implies Bv j N (L) But R (B) =R L i implies that Bv j R (B) N (L) for all j The set {Bv,,Bv s } is linearly independent by Exercise To show that {Bv,,Bv s } spans R (B) N (L), lety R (B) N (L) Since y R (B), there is some u C n such that y = Bu since y N (L), =Ly = LBu Thus u N (LB) and we may express u in the basis {v,,v s } as u = c v + +c s v s Therefore y = Bu = B (c v + + c s v s )=c Bv + +c s Bv s and {Bv,,Bv s } spans Example Let s construct the matrix P that produces the Jordan form of L in Example 8 Since L has index, we L and find one basic column y =[,,,,, ] T Then S = {y } contains the basic column of R L set i = Extend S to a basis for R (L) N (L): (a) Row-reducing, we find that the basic columns of L are its first three columns Thus we let 5 B = 5

(b) Compute LB and solve LBx =to obtain a basis for N (LB): 5 5 LB = = 5 5 v =, v = Then n Bv =[ ] T,Bv =[ 5 7 ] T o is a basis for R (L) N (L) (c) Form the matrix [y Bv Bv ]= 5 7 columns and are its basic columns, hence {y,y = Bv } is a basis for R (L) N (L) containing S Let S = n[ 5 o 7 ] T and decrement i then i = Extend S S = {y,y } to a basis for R L N (L) =N (L): (a) Since L = I, we let B = I (b) Since LB = L, we findabasisforn (LB) =N (L): 5 5 5 v =, v =, v = Then a basis for N (L) is {Bv,Bv,Bv } = {v,v,v } 5 5

(c) Form the matrix [y y v v v ]= 5 7 5 columns,, and are its basic columns, hence {y,y,v } is a a basis for N (L) containing S S Let S = n[ o ] T and decrement i then i =and the process terminates having produced the basis S S S for N (L) Let S = {b }, S = {b }, and S = {b } For j =,,, build a Jordan chain on b j S i of length i + by finding a particular solution x j of L i x = b j When j =we see by inspection that L e = b Thus p = L e Le e = 5 When j =we solve Lx = b : 5 5 7 5 A particular solution is x =[ ] T hence 5 7 p =[Lx x ]= 5 When j =we have L = I, and the unique solution of L x = b is x = b S Thus the Jordan chain on b consists only of b and we have p =[ ] T Finally, we form the matrix 5 7 P =[p p p ]= 5 Then as expected, the JCF of L is J = P LP =

Exercise A Hessenberg matrix H and a Jordan matrix J appear below Find an invertible matrix P such that J = P HP (Note: Some texts define the JCF with s below the main diagonal as in H) H = Exercise Prove that the Jordan matrices J = J =, J = are not similar invertible) (Hint: Show that if P =(p ij ) is a matrix such that PJ = J P, then P is not Exercise 5 A nilpotent matrix L is given below Find matrices P and J such that P LP = J has Jordan form: L = 5 Exercise Consider the 5 5 matrix: L = a Show that L is nilpotent and determine its index of nilpotency b Find the Jordan Form J of L c Find an invertible matrix P such that J = P LP Exercise 7 Determine the Jordan structure of the following 8 8 nilpotent matrix: 5 7 5 9 9 9 8 9 L = 5 5 7 7 --8 7