1. ## Eigenvalue problem

This is my attempt at a solution:

A^2(x) = A(A(x))
A^2(x) = lambda^2(x)

Therefore x is an eigenvector of A^2 with eigenvalue lambda^2. The statement for general N>0 follows in the same way.

Am I missing anything?

2. Originally Posted by temaire

This is my attempt at a solution:

A^2(x) = A(A(x))
A^2(x) = lambda^2(x)

Therefore x is an eigenvector of A^2 with eigenvalue lambda^2. The statement for general N>0 follows in the same way.

Am I missing anything?

Not really: now just round up the proof doing some induction.

Tonio

3. Originally Posted by tonio
Not really: now just round up the proof doing some induction.

Tonio
I haven't learned what induction is. Or maybe its a word for something I already know. What do you mean by it?

4. A proof by induction works like this: first show your statement holds for $\displaystyle n=1$ or $\displaystyle 0$ or the first $\displaystyle n$ for which it is true, then assume it to be true for $\displaystyle n=m$ (this is your induction hypothesis) and then show it to be true for $\displaystyle n=m+1$ using your hypothesis. if $\displaystyle \lambda$ is an eigenvalue of$\displaystyle A$, $\displaystyle Ax=\lambda x$ and $\displaystyle A^2x=A\lambda x =\lambda Ax=\lambda^2 x$ so $\displaystyle \lambda^n$ is an eigenvalue of $\displaystyle A^n$ for $\displaystyle n=2$. suppose it is true for $\displaystyle n=m$,then $\displaystyle A^{m+1}x=AA^mx=A\lambda^mx=\lambda^mAx=\lambda^{m+ 1}$
it is essentially what you said but a a bit more rigorous
induction is a really useful tool, you should practice using it