jagomart
digital resources
picture1_Matrix Pdf 174023 | Cayley Hamilton


 200x       Filetype PDF       File size 0.11 MB       Source: math.ucr.edu


File: Matrix Pdf 174023 | Cayley Hamilton
cayley hamilton theorem for jordan form matrices if a is an n n matrix the cayley hamilton theorem describes an explict polynomial a t of degree n the characteristic polynomial ...

icon picture PDF Filetype PDF | Posted on 27 Jan 2023 | 2 years ago
Partial capture of text on file.
                           Cayley – Hamilton Theorem for Jordan form matrices
                      If A is an n × n matrix, the Cayley – Hamilton Theorem describes an explict polynomial
                 χA(t) of degree n (the characteristic polynomial) such that χA(A) = 0. One can define it using
                 determinants, but since Axler does not treat these until the last chapter in the book we have to
                 give an ad hoc description here which is valid if A is in Jordan form. Namely, if A is in Jordan
                 form (hence A is upper triangular), then
                                                                  n
                                                     χ (t) = Y (t−a ).
                                                       A                   j,j
                                                                 j=1
                 Derivation of the Cayley – Hamilton Theorem for Jordan form matrices.                  Amatrix in
                 Jordan form is a block sum of elementary Jordan k ×k matrices (c      ) such that c  =λfor some
                                                                                     i,j            i,i
                 fixed λ and all values of i = 1 through k, and ci,j+1 = 1 for i = 1,...,k − 1 with ci,j = 0 in all
                                                                                                             n
                 remaining cases. If C is such a matrix, then it follows immediately that χ (C) = (C −λI) = 0.
                                                                                           C
                      Suppose now that A is a block sum
                                                         A = P 0
                                                                    0  Q
                 whereP andQaresquarematrices. Foruppertriangularmatricesofthistypewehaveχ = χ ·χ ,
                                                                                                        A     P  Q
                 and it follows that if χ (P) = 0 and χ (Q) = 0, then
                                        P               Q
                                                                   χ (P)χ (P)            0       
                                 χ (A) = χ (A)·χ (A) =                P      Q
                                   A           P       Q                   0        χ (Q)χ (Q)
                                                                                      P     Q
                 is zero. By induction a similar result holds for block sums with an arbitrary finite number of
                 summands, and if A is in Jordan form, say A ∼ B ⊕ ··· ⊕B , where each B is an elementary
                                                                    1            r               j
                 Jordan matrix, then we see that
                                    χ (t) = Y χ (t)            and     χ (A) = Y χ (B )
                                      A               B                  A               B    j
                                                       j                                   j
                 and by the previous discussion each factor on the right hand side of the second equation is zero.
                 This yields the desired identity χA(A) = 0.
                 Final remark. The characteristic polynomial can be defined for an arbitrary square matrix, and
                 it has the following key property: If B = P−1AP where P is an invertible matrix, then χ      =χ .
                                                                                                           B     A
                 However, the definition of the polynomial and the proof of its key property use the theory of
                 determinants, which has not yet been covered in the course.
The words contained in this file might help you see if this file matches what you are looking for:

...Cayley hamilton theorem for jordan form matrices if a is an n matrix the describes explict polynomial t of degree characteristic such that one can dene it using determinants but since axler does not treat these until last chapter in book we have to give ad hoc description here which valid namely hence upper triangular then y j derivation amatrix block sum elementary k c some i xed and all values through ci with remaining cases follows immediately suppose now p q wherep andqaresquarematrices foruppertriangularmatricesofthistypewehave zero by induction similar result holds sums arbitrary nite number summands say b where each r see previous discussion factor on right hand side second equation this yields desired identity final remark be dened square has following key property ap invertible however denition proof its use theory yet been covered course...

no reviews yet
Please Login to review.