Linear Algebra: Is the matrix diagonalizable?

Theorem.
Messages
236
Reaction score
5

Homework Statement


Let A be a square matrix and f_A (\lambda) its characteristic polynomial. In each of the following cases (i) to (iv), write down whether
A is diagonalizable over R
A is not diagonalizable over R
its not possible to say one way or the other.

THEN say whether or not the matrix can certainly be diagonalizable over C

I am only having trouble with the following case:
f_A (\lambda)=(\lambda^2+3)^2


Homework Equations



There aren't any relevant equations strictly speaking

The Attempt at a Solution


Well it is clear that the eigenvalues are \sqrt{3}i and -\sqrt{3}i, both having multiplicity 2 in the characteristic polynomial. Clearly then A is not diagonalizable over R as its eigenvalues are not real. Where I get stuck is deciding if the matrix can certainly be diagonalizable over C or not. from the characteristic polynomial I see that A is 4x4, and it does not have 4 distinct eigenvalues, which doesn't help me. I am not sure how to approach this really its the first time I have encoutered a characteristic polynomial of this sort and can't seem to find anything helpful in my textbook. Any help/advice would be greatly appreciated
-Curtis
 
Physics news on Phys.org
if an nxn matrix has n distinct eignvalues in a field Q, then it is diagonalisable over Q.

if the eignevalues are not in Q, it is not diagonalisable over Q
if there are repeated eigenvalues, then you can't say until you check the dimensions of the eigenspaces sum to n
 
lanedance said:
if an nxn matrix has n distinct eignvalues in a field Q, then it is diagonalisable over Q.

if the eignevalues are not in Q, it is not diagonalisable over Q
if there are repeated eigenvalues, then you can't say until you check the dimensions of the eigenspaces sum to n

Thanks for the reply lanedance,
This is the criteria I used when I evaluated the 3 other cases (which I did not post here). I think when I read the question I thought that for the complex portion of the question, I was to state whether the Matrix was diagonalizable or not (Yes/No as apposed to Yes/No/Can't tell), Perhaps I have just read the question wrong?
This matrix definitely falls in the last category: All its Eigenvalues are in C, but it is impossible to say whether or not the dimensions of the eigenspaces sum to n without being given the matrix itself (as there are repeated eigenvalues).
 
sounds good to me
 
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