| Thread Closed |
proving a matrix is diagonaziable. |
Share Thread | Thread Tools |
| Jul7-07, 08:03 AM | #1 |
|
|
proving a matrix is diagonaziable.
im given a matrix H from M_n(C) (the space of nxn matrices above the comples field).
and we know that for every a in C, dim(ker(H-aI)^2)<=1. prove that H is diagonizable. obviously if i prove that its characteristic poly exists then bacuase every poly above C can be dissected to linear factors, then also its minimal poly can be dissected to linear factors and thus H is diagonaizable, but how to do it? thanks in advance. |
| Jul8-07, 05:43 AM | #2 |
|
Recognitions:
|
Every matrix has a characteristic poly, so your argument is invalid. The characteristic poly doesn't tell you anything about diagonalizability. The minimal poly may tell you something useful.
|
| Jul8-07, 11:57 AM | #3 |
|
|
care to elaborate a bit more?
i mean what exactly the minimial polynomial can help here? |
| Jul8-07, 05:05 PM | #4 |
|
Recognitions:
|
proving a matrix is diagonaziable.
If the minimal polynomial has no repeated roots, then...
|
| Jul8-07, 05:48 PM | #5 |
|
Recognitions:
|
do you know what a jordan form is?
|
| Jul10-07, 02:00 AM | #6 |
|
|
but how to translate it to here. i mean im given that d=dimKer(H-xI)^2<=1, now if H-xI=0 then we have that minimal poly is linear product, but i dont see how to arrive at this, if i prove that dimKer(H-xI)=n then im done, but how to do it? p.s mathwonk, i do know what is jordan noraml form is, but i don't see here relevancy? |
| Jul10-07, 06:00 AM | #7 |
|
Recognitions:
|
Why don't you see the relevance of JNF? It gives the answer instantly. A matrix is not diagonalizable if and only if there is a jordan block of size greater than 1. But the condition you have precludes that happening.
|
| Jul10-07, 08:45 AM | #8 |
|
|
but the maximum size of jordan block is determined by the multicipity of the eigen value in the minimal polynomial.
oh, wait a minute, bacuase it's above C, then it means that the minimal poly is product of linear polys, so obviously we don't have higher degrees, and Ker(H-aI) is a subspace of Ker(H-aI)^2, so dim(Ker(H-aI))<=1, so we have just one block at most, but every Ker(H-aI)^2 its dim is <= 1, so obviously we don't have here dome subspace which nullifies the entire C^n, but still we ned to have information on the minimal poly to gain information about the maximal size of the block. |
| Jul10-07, 08:55 AM | #9 |
|
Recognitions:
|
yes. If we have a Jordan block of size 2, or more, and e-value t, then there are vectors x and y such that Mx=tx, and My=ty+x. That is the definition of a Jordan block. Now show that x and y are killed by (M-t)^2. |
| Thread Closed |
| Thread Tools | |
Similar Threads for: proving a matrix is diagonaziable.
|
||||
| Thread | Forum | Replies | ||
| Help! Diagonal matrix similar to upper triangular matrix? | Linear & Abstract Algebra | 1 | ||
| Proving kernel of matrix is isomorphic to 0 eigenvalue's eigenvectors | Calculus & Beyond Homework | 3 | ||
| Proving that a triangular matrix is invertible | Calculus & Beyond Homework | 7 | ||
| Matrix, making R2 to R3, finding standard matrix A! where did i mess up? | Calculus & Beyond Homework | 1 | ||
| Matrix Norms, and proving their characteristics | Introductory Physics Homework | 5 | ||