0
$\begingroup$

Here's the statement that I am to prove/disprove:

If the minimum polynomial of $A$ is $A^5 = 5 A^2$, then $A$ is not diagonalizable.

First, I'm confused about how this can actually be a minimum polynomial. From my understanding, the minimum polynomial is a specific polynomial of least degree which $A$ satisfies. But, couldn't I just multiply both sides of that equation by $A^{-2}$? Then the minimum polynomial would be $A^3 - 5I = 0$, which is of lesser degree. That's really confusing for me!!

Anyway, I continue with this problem focusing on the given polynomial. I know that $A$ is at least 5x5, because the minimum polynomial is of degree 5. However, there are only two distinct roots of the minimum polynomial:

$A^5 - 5A^2 = 0 \Longleftrightarrow A^2 (A^3 - 5I) = 0 \Longrightarrow$ eigenvalues: $0,\,5^{1/3}$.

Is that correct? If there were 5 distinct roots, and I knew $A$ were exactly 5x5, then this question would be cake, and it's definitely diagonalizable. Instead, all I know is that there are only 2 eigenvalues, which does not necessarily mean that these are no more than 2 eigenvectors, so $A$ may or may not be diagonalizable (e.g., when looking at roots of $I$).

Any help is appreciated.

Thanks!

  • 0
    Clark, the minimal polynomial of the identity matrix is $x-1$, which is $\prod(x-\lambda)$ over the distinct eigenvalues, of which there is only one. The minimal polynomial has no repeated roots, consistent with my comment.2012-11-27

1 Answers 1

1

If you meant (a guess) that $\,m_A(x):=x^5-5x^2\,$ is the minimal polynomial of a matrix $\,A\,$, then since $\,m_A(x)=x^2(x^3-5)\,\,,\,\,A$ is not diagonalizable since it is not the product of different linear factors (never mind whether the field of definition of $\,A\,$ contains or not the roots of the factor $\,x^3-5\,$).

Diagonalization does not depend on the number of different eigenvalues a matrix has but whether there are as many linearly independent eigenvectors of the matrix as its order, or not.