Title looks a little bit twisted. What I want to say is the following:

$A\in\mathbb{R}^{n\times n}$, polynomial of matrix $A$: $P(A)=\displaystyle \sum_{k=0}^{n} c_k A^k$. $\lambda(A)$ is the set of eigenvalues of $A$.

So, we want to prove $\lambda(P(A))=P(\lambda(A))$

So far, I can prove it when $A$ is diagonalisable, but when $A$ is not diagonalisable, it seems we can't just simply use Jordan normal form to prove it. (Or this statement won't hold when it's not diagonalisable?)

Can anyone suggest me something and help me out? Thanks!


The result is true only if you allow complex eigenvalues.

If $\lambda$ is a eigenvalue of $A$ then $Av=\lambda v$ for a nonzero column vector $v\in\mathbb R^n$. It is easy to show that in this case $p(A)v=p(\lambda)v$ for any nonconstant polynomial $p$, which shows that $p\bigl(\lambda(A)\bigr)\subseteq\lambda\bigl(p(A)\bigr)$. For the converse, let $\mu\in\lambda\bigl(p(A)\bigr)$, where $p$ is a nonconstant polynomial. You can factor $p(X)-\mu$ on the complex numbers, obtaining


where $a,a_i\in\mathbb C$. Thus, we have $p(A)-\mu I=a\prod_{i=1}^m(A-a_iI)$. Since the matrix $p(A)-\mu I$ is not invertible, then some matrix $A-a_iI$ is not invertible. This shows that $\mu=p(a_i)$, where $a_i$ is a complex eigenvalue of $A$, that is, for some nonzero column vector $w\in\mathbb C^n$ you have $Aw=a_iw$.

For the necessity of the inclusion of complex eigenvalues, consider the matrix $A=\binom{0\ -1}{1\ \ \ 0}$, which has not real eigenvalues (check it). However $A^2=-I$ do has $-1$ as eigenvalue. What happens in this case is that $i$ and $-i$ are the complex eigenvalues of $A$, so in particular $\lambda(A^2)=\{(\pm i)^2\}=\{-1\}$.

  • $\begingroup$ This explanation is awesome! $\endgroup$ – Cancan Sep 12 '13 at 22:56
  • $\begingroup$ This fills the gaps of my previous answer very well! (+1) $\endgroup$ – Mårten W Sep 12 '13 at 23:00
  • 1
    $\begingroup$ Good answer. Why $\mu=p(a_i)$? $\endgroup$ – Planche Sep 28 '16 at 12:52
  • $\begingroup$ @Planche Actually we have $p(a_j)=0$ for each $j$, because of the factorization of the polynomial $p(X)-\mu$. $\endgroup$ – Matemáticos Chibchas Sep 28 '16 at 22:12
  • 2
    $\begingroup$ @Planche I don't understand Matemáticos Chibchas' answer to your question so I'll give my own. There is an $x$ such that $(p(A)-I\mu)x = (a\Pi (A-I a_i))(x) = 0.$ Notice $a\neq 0$ as $p$ is non-constant. Then $(A-I a_i)(x)=0$ for some $i.$ This gives $Ax = a_i x$ and so $\mu x = p(A)x = p(a_i) x.$ $\endgroup$ – JKEG Mar 12 '18 at 20:31

I am very surprised that @user1551 did not scream when he read this question (4 years ago). Of course, the answer is correct; yet, that is interesting, it is not the set of the eigenvalues but the MULTISET of the eigenvalues -we take into account the multiplicities-. Indeed, when using this result, in 99% of cases, we need the multiset version.

It is well-known that the multiset version proof is a direct consequence of the fact that any complex matrix is triangularizable.


Your Answer

