Finding eigenvalues, Shankar exercise 1.8.3

TimID
Messages
4
Reaction score
0
First, I appologise if this is in the wrong place, while the book is QM, the question is pure maths. Also I'm not sure if this techically counts as homework as I am self studying. Finally, sorry for the poor formatting, I'm not that good with LaTeX

Homework Statement



Given the matrix: \Omega =
\left[ {\begin{array}{ccc}<br /> 2 &amp; 0 &amp; 0 \\<br /> 0 &amp; 3 &amp; -1 \\<br /> 0 &amp; -1 &amp; 3 \\<br /> \end{array} } \right]<br />

Show that \omega1 = \omega2 = 1; \omega3 = 2

Homework Equations


The Attempt at a Solution



So det(\Omega - \omegaI) = (2 - \omega)((3 - \omega)(3 - \omega) - 1)

Which obviously leaves \omega = 2, but also (3 - \omega)2 = 1, the solutions to which should be \omega = 2 and \omega = 4.

Where am I going wrong?

Any help greatfully appreciated.
 
Physics news on Phys.org
You're not going wrong for the given matrix. Are you sure you're doing the right problem?
 
You're absolutely right, there was a factor of a half in the original question that I completely missed, thanks. I must have checked the original problem a dozen times before posting and didn't spot it, I hate my brain sometimes.

Thanks again,

Tim
 
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...

Similar threads

Back
Top