If $A$ is symmetric (real) matrix,
CASE 1: $\lambda$ distinct $\rightarrow$ eigenvectors are orthonormal
CASE 2: $\lambda$ not distinct $\rightarrow$ eigenvectors are orthogonal (and then they can be normalized)
I'm focusing on CASE 2.
It is trivial becuase every symmetric matrix can be diagonalized by orthogonal matrix.
But I want to show that mathematically. (eg. inner product, etc...)
Also, in CASE 2, the number of eigenvectors are equal to multiplicity of eigenvalues. Why they can not exceed that? (It's trivial too, but I want to show it precisely!)
We can conclude this by constructing an orthonormal basis of $R^n$ using eigenvectors of $A$.
I think I know principal theorems related to them but have problems with applying them.
Please help me and don't just throw a hint, I need detailed explanation!
Thanks.