Symmetric, irreducible, tridiagonal matrix: Eigenvalues

Scootertaj
Messages
97
Reaction score
0

Homework Statement


A) Let A be a symmetric, irreducible, tridiagonal matrix. Show that A cannot have a multiple eigenvalue.
B) Let A be an upper Hessenberg matrix with all its subdiagonal elements non-zero. Assume A has a multiple eigenvalue. Show that there can only be one eigenvector associated with it.



2. Relevant definitions
Symmetric: A = AT
Irreducible: not a good definition for it, but essentially it's well-connected
Tridiagonal: obvious
Upper Hessenberg: http://en.wikipedia.org/wiki/Hessenberg_matrix Essentially, it's a mix between a tridiagonal and a upper triangular. It's tridiagonal with non-zero elements above its 3rd subdiagonal.



The Attempt at a Solution


A) It seems contradiction would be the best combined with using the Jordan canonical form of A-\lambdaI.
Jordan canonical form: http://en.wikipedia.org/wiki/Jordan_normal_form
So, we know that we can get the Jordan canonical form of A which has all \lambda's in the diagonal.
Thus, is there anyway we can look at the canonical form of A-\lambdaI and deduce from it's rank that it has no multiple eigenvalues?
B) The hint says to use a similar strategy as A
 
Physics news on Phys.org
Just a bump.
 
Just another bump. This is a tough problem.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top