Register to reply

Cayley Hamilton Theorem

by negation
Tags: cayley, hamilton, theorem
Share this thread:
negation
#1
May25-14, 11:53 AM
P: 819
Given a Matrix A = [a,b;c,d] and it's characteristic polynomial, why does the characteristic polynomial enables us to determine the result of the Matrix A raised to the nth power?
Phys.Org News Partner Mathematics news on Phys.org
Heat distributions help researchers to understand curved space
Professor quantifies how 'one thing leads to another'
Team announces construction of a formal computer-verified proof of the Kepler conjecture
HallsofIvy
#2
May25-14, 03:12 PM
Math
Emeritus
Sci Advisor
Thanks
PF Gold
P: 39,552
The scalar "[itex]\lambda[/itex]" is an "eigenvalue" for matrix A if and only if there exist a non-zero vector, v, such that [itex]Av= \lambda v[/itex]. It can be shown that [itex]\lambda[/itex] is an eigenvalue for A if and only if it satisfies A's characteristic equation. A vector v, satisfying [itex]Av= \lambda v[/itex] is an eigenvector for A corresponding to eigenvalue [itex]\lambda[/itex] (some people require that v be non-zero to be an "eigenvector" but I prefer to include the 0 vector as an eigenvector for every eigenvalue).

Further, if we can find n independent eigenvectors for A (always true if A has n distinct eigenvalues but often true even if the eigenvalues are not all distinct) then the matrix, P, having those eigenvectors as columns is invertible and [itex]P^{-1}AP=D[/itex] where D is the diagonal matrix having the eigenvalues of A on its diagonal. Then it is also true that [itex]PDP^{-1}= A[/itex] and [tex]A^n= (PDP^{-1})^n= (PDP^{-1})(PDP^{-1})\cdot\cdot\cdot(PDP^{-1})= PD(P^{-1}P)(D)(P^{-1}P)\cdot\cdot\cdot(P^{-1}P)DP= PD^nP^{-1}[/tex]

Of course, [itex]D^n[/itex] is easy to calculate- it is the diagonal matrix having the nth power of the entries in D on its diagonal.

Notice that this is "if we can find n independent eigenvectors for A". (Such a matrix is said to be "diagonalizable" matrix.) There exist non-diagonalizable matrices. They can be put in what is called "Jordan normal form" which is slightly more complicated than a diagonal matrix and it is a little more complicated to find powers.
AlephZero
#3
May25-14, 03:53 PM
Engineering
Sci Advisor
HW Helper
Thanks
P: 7,160
What HallsofIvy said is true, but I think it's not quite the point of the question.

The Cayley-Hamilton theorem says that the matrix ##A## satisfies its own characteristic equation. For an ##n \times n## matrix, the characteristic equation is of order ##n##, so ##A^n## is a linear combination of ##I, A, \dots, A^{n-1}##. It follows that every power ##A^k## where ##k > n## is also a linear combination of the first ##n-1## powers.

For A ##2 \times 2## matrix, that means every power of ##A## is a linear combination of ##A## and ##I##. That is true even if the eigenvectors are not independent, and you can't diagonalize ##A##.


Register to reply

Related Discussions
Cayley Hamilton Theorem Calculus & Beyond Homework 5
Applications of Cayley-Hamilton theorem General Math 1
Cayley Hamilton Theorem Linear & Abstract Algebra 3
Cayley-Hamilton theorem for Operator Differential Equations 1
Cayley - hamilton theorem Linear & Abstract Algebra 7