Proof problem(Linear Algebra- Eigenvalues/Eigenvectors)

  • Thread starter Thread starter foxofdesert
  • Start date Start date
  • Tags Tags
    Algebra Proof
foxofdesert
Messages
21
Reaction score
0

Homework Statement


True/False
The geometric multiplicity of an eigenvalue of a symmetric matrix necessarily equals to its algebric multiplicity.

Homework Equations




The Attempt at a Solution


True.
If a matrix is symmetric, then the matrix is diagonalizable. Since the matrix is diagonalizable, there must be eigenvectors correspond to each eigenvalues.


So, I did the proof, but I'm not so sure if it sounds right. I think there could be something more tricky or missing. Would you guys check if this sounds right to you?
 
Physics news on Phys.org
Sound right to me.
 
Thanks for checking. Just quick checking tho,
'A matrix is symmetric if and only if the matrix is diagonalizable.'

Is this a right statement?

or 'orthogonally diagonalizable'
 
foxofdesert said:
Thanks for checking. Just quick checking tho,
'A matrix is symmetric if and only if the matrix is diagonalizable.'

Is this a right statement?

or 'orthogonally diagonalizable'

No, it's not iff. Is the matrix [[1,1],[0,0]] diagonalizable? Is it symmetric?
 
oh, thanks!
 
foxofdesert said:
oh, thanks!

Well, it is true that "orthogonally diagonalizable" iff symmetric.
 
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