Show that Characteristic polynomial = minimal polynomial

PirateFan308
Messages
91
Reaction score
0

Homework Statement


Let A = \begin{pmatrix}1 & 1 & 0 & 0\\-1 & -1 & 0 & 0\\-2 & -2 & 2 & 1\\ 1 & 1 & -1 & 0 \end{pmatrix}

The characteristic polynomial is f(x)=x^2(x-1)^2. Show that f(x) is also the minimal polynomial of A.

Method 1: Find v having degree 4.
Method 2: Find a vector v of degree 2, whose minimal polynomial (on A of v) is x^2, and another, w, whose minimal polynomial is (w-1)^2. Or, just show that v and w exist.

The Attempt at a Solution


I'm confused as to how a vector can have a degree of more than 1. Isn't a vector simply:
v= \begin{pmatrix}a\\b\\c\\...\\n\end{pmatrix} in R^n? I think I can get the question once I understand this. Thanks!
 
Physics news on Phys.org
I think what they mean by a vector v having degree 4 is that A^4(v)=0 but A^3(v) is not equal to zero.
 
Oh, ok. Thanks!
 
PirateFan308 said:
Oh, ok. Thanks!

You're welcome but rereading that I'm not sure what the hint really means. Since f is the characteristic polynomial you know f(A)=A^2(A-1)^2=0. To show it's minimal you need to show A(A-1)^2 and A^2(A-1) are not zero. The 'degree of a vector' seems pretty unclear to me as well.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top