Eigenvectors of a symmetric matrix.

  • #1

Main Question or Discussion Point

Is it true that an nxn symmetric matrix has n linearly independent eigenvectors even for non-distinct eigenvalues? How can we show it rigorously? Basically, I want to prove that if an nxn symmetric matrix has eigenvalue 0 with multiplicity k, then its rank is (n - k). If we can prove that there exist k linearly independent eigenvectors which solve Ax = 0, then we can use the rank-nullity theorem to directly show the result, right?
 

Answers and Replies

  • #2
Bacle2
Science Advisor
1,089
10

Related Threads on Eigenvectors of a symmetric matrix.

Replies
5
Views
13K
Replies
2
Views
2K
Replies
1
Views
1K
Replies
3
Views
2K
Replies
1
Views
3K
Replies
3
Views
1K
  • Last Post
Replies
1
Views
614
Replies
2
Views
11K
Replies
1
Views
6K
Top