# How to prove real symmetric matrix can be diagonalized via my approach?

My idea of proving every real symmetric matrix can be diagonalized is that, first prove two eigenvectors with different eigenvalues must be orthogonal, then I failed to prove that all the eigenvectors span the whole vector space.

To be specific, my question is, if $A$ is a real symmetric $n\times n$ matrix, let $p(t)=\det(tI-A)$ be the characteristic polynomial of $A$, and $\lambda$ be some eigenvalue of $A$, and $\lambda$ is a root of $p(t)$ of order $k$, then how to prove $\dim (\ker(\lambda I-A))=k$?

-
Do you already know a proof of the theorem and want to find your own using this particular caracterisation of diagonalizability, or do you ask for any proof of this fact? I ask because it seems to me a little unsuited, but comments and answers may prove me wrong, to go about proving the theorem uaing this criterion of diagonalizability. – Olivier Bégassat May 3 '12 at 9:27
@OlivierBégassat Yes, I do know a proof, yet I find the proof in my textbook seems delibrately avoid the question I put here, so I'm here asking for help~ – rhenskyyy May 3 '12 at 9:31
What is the gist of your textbook proof? One way to prove it is to use the fact that any real endomorphism stabilizes a line or a plane (possibly both), to show that the induced endomorphism remains symmetric, and that the orthogonal complement is also stabilized, and to use recursion. there are slightly easier proofs along the same lines... – Olivier Bégassat May 3 '12 at 9:36
Do you know what is relation between the multiplicity of $\lambda$ and $\dim (\ker(\lambda I-A))=k$? – Babak Miraftab May 3 '12 at 9:41
On another note: you are aware that it is possible for a symmetric matrix to have repeated eigenvalues, and yet still have orthonormal eigenvectors, right? – J. M. May 3 '12 at 9:45

Let $v$ be an eigenvector to the eigenvalue $\lambda$. Set $U=\mathbb R v$ and write $\mathbb R^n=U\bot U^\bot$. Then $A(U)\subseteq U$ and $A(U^\bot)\subseteq U^\bot$ (you use symmetry here). Therefore we can restrict $A$ to $U^\bot$, get a symmetric matrix and proceed by induction. This is somewhat the standard proof of the spectral theorem.
Another way - I think a way closer to what you asked - would be the following lemma: If $x\in Ker(\lambda I-A)^k$, then $x\in Ker(\lambda I-A)$. For simplicity I will proof the case $k=2$. Let $x\in Ker(\lambda I-A)^2$ and $y=(\lambda I-A)x$. We want to show $y=0$. We have $$\lambda x=Ax+y$$ and $$\lambda y=Ay$$ It follows $$\lambda \left<y,x\right >=\left<y,Ax+y\right >=\left<y,Ax\right >+\left<y,y\right >=\left<Ay,x\right >+\left<y,y\right >=\lambda\left<y,x\right >+\left<y,y\right >$$ Which means $y=0$.