Symmetric matrix and diagonalization

  • Thread starter EvLer
  • Start date
  • #1
458
0
This is a T/F question:
all symmetric matrices are diagonalizable.

I want to say no, but I do not know how exactly to show that.... all I know is that to be diagonalizable, matrix should have enough eigenvectors, but does multiplicity of eigenvalues matter, i.e. can I say that if eignvalue has multiplicity > 1 then the matrix is not diagonalizable?
Thanks

EDIT: zero matrix is diagonalizable, right?
 
Last edited:

Answers and Replies

  • #2
Dick
Science Advisor
Homework Helper
26,260
619
This is a T/F question:
all symmetric matrices are diagonalizable.

I want to say no, but I do not know how exactly to show that.... all I know is that to be diagonalizable, matrix should have enough eigenvectors, but does multiplicity of eigenvalues matter, i.e. can I say that if eignvalue has multiplicity > 1 then the matrix is not diagonalizable?
Thanks

EDIT: zero matrix is diagonalizable, right?
The zero matrix is already diagonal. So it's VERY diagonalizable. Think spectral theorem.
 
  • #3
458
0
...Think spectral theorem.
ummm... not there yet
 
  • #4
Dick
Science Advisor
Homework Helper
26,260
619
You must have something like it. Note that it also makes a big difference whether the entries are real or complex. If they are real then it's true, but a proof is just a proof of the finite dimensional version of the spectral theorem. If they are complex, then you just need a counter example. Because it's false.
 
Last edited:
  • #5
458
0
oh, yeah, looked at further chapters, now I see the spectral theorem. Thanks a lot.
 
  • #6
370
0
Uhhh. Not true.

Remember eigenvalues have a lot to do with what field you're in.

Principal axis theorem is the theorem you want.
 
  • #7
HallsofIvy
Science Advisor
Homework Helper
41,833
961
A symmetric matrix is "self-adjoint"- that is, for a symmetric matrix A, the dot product (Ax).y= x.(Ay). It's fairly easy to prove, it may already be proven in your book, that any self-adjoint (and, so, any symmetric) n by n matrix has n independent eigenvectors. Using those eigenvectors as basis gives you a diagonal matrix with the eigenvalues on the diagonal.
 
  • #8
matt grime
Science Advisor
Homework Helper
9,395
3
....over an algebraically closed field....
 
  • #9
HallsofIvy
Science Advisor
Homework Helper
41,833
961
A symmetric matrix is "self-adjoint"- that is, for a symmetric matrix A, the dot product (Ax).y= x.(Ay). It's fairly easy to prove, it may already be proven in your book, that any self-adjoint (and, so, any symmetric) n by n matrix has n independent eigenvectors. Using those eigenvectors as basis gives you a diagonal matrix with the eigenvalues on the diagonal.
....over an algebraically closed field....
Was that in response to my post? The field of real numbers is not algebraically closed but it is certainly true that any symmetric matrix over the real numbers has real eigenvalues. In fact, any self-adjoint linear transformation on a vector space over the real numbers has all real eigenvalues.
 
  • #10
matt grime
Science Advisor
Homework Helper
9,395
3
I should have said 'not necessarily over the field of definition of the matrix'. Or 'a field with sufficiently many elements'.
 

Related Threads on Symmetric matrix and diagonalization

  • Last Post
Replies
1
Views
2K
Replies
4
Views
4K
Replies
3
Views
20K
  • Last Post
Replies
17
Views
6K
Replies
4
Views
2K
Replies
5
Views
5K
Replies
0
Views
1K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
3
Views
2K
Top