Linear Algebra and Eigenvalues

Bluesman01
Messages
3
Reaction score
0
Suppose A is a diagonlizable nxn matrix where 1 and -1 are the only eigenvalues (algebraic multiplicity is not given). Compute A^2.

The only thing I could think to do with this question is set A=PD(P^-1) (definition of a diagonalizable matrix) and then A^2=(PD(P^-1))(PD(P^-1))=P(D^2)(P^-1)

This is how I left it on the test but I am sure this isn't right. How can you solve this without having the original matrix A or the algebraic multiplicity of the eigenvalues?
 
Physics news on Phys.org
Bluesman01 said:
Suppose A is a diagonlizable nxn matrix where 1 and -1 are the only eigenvalues (algebraic multiplicity is not given). Compute A^2.

The only thing I could think to do with this question is set A=PD(P^-1) (definition of a diagonalizable matrix) and then A^2=(PD(P^-1))(PD(P^-1))=P(D^2)(P^-1)
Since A is diagonalizable, and its only eigenvalues are 1 and -1, then what form must D take? Even more to the point, what does D2 have to be?
Bluesman01 said:
This is how I left it on the test but I am sure this isn't right. How can you solve this without having the original matrix A or the algebraic multiplicity of the eigenvalues?
 
But if the multiplicity of either eigenvalue is more than one, D changes form. Both P and D do. That's where I got stuck.
 
Bluesman01 said:
But if the multiplicity of either eigenvalue is more than one, D changes form. Both P and D do. That's where I got stuck.

Of course D changes form. D^2 doesn't. What is it? Once you figure out what it is, P won't matter.
 
Ah I see it now. Thanks to all who replied.
 
That would be all two of us: Dick and myself...
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top