Symmetric matrix is always diagonalizable? I'm reading my linear algebra textbook and there are two sentences that make me confused.
(1) Symmetric matrix $A$ can be factored into $A=Q\lambda Q^{T}$ where $Q$ is orthogonal matrix : Diagonalizable
($Q$ has eigenvectors of $A$ in its columns, and $\lambda$ is diagonal matrix which has eigenvalues of $A$)   
(2) Any symmetric matrix has a complete set of orthonormal eigenvectors
whether its eigenvalues are distinct or not.  
It's a contradiction, right?
Diagonalizable means the matrix has n distinct eigenvectors (for $n$ by $n$ matrix).
If symmetric matrix can be factored into $A=Q\lambda Q^{T}$, it means that
symmetric matrix has n distinct eigenvalues.
Then why the phrase "whether its eigenvalues are distinct or not" is added in (2)?
After reading eigenvalue and eigenvector part of textbook, I conclude that every symmetric matrix is diagonalizable. Is that true?
 A: In symmetric matrix geometric multiplicity to be equal to the algebraic multiplicity of eigenvalues.Hence we are heaving complete set of the eigen vectors and Eigenvectors of the symmetric can always be made orthogonal by gram schmidt orthogonalisation.
Second thing is that Diagonalizable does'nt mean n distinct eigenvalues.for example identity matrix has repeated eigenvalues still it is diagonalizable.
A: There is a difference between algebraic multiplicity of eigenvalues (how many times an eigenvalue shows up in the characteristic polynomial) and their geometric multiplicity (nullity). I presume this is the confusing part!
For diagonalizability, it is required that geometric multiplicity to be equal to the algebraic multiplicity of eigenvalues.
See similarity transformation for more details.
A: Diagonalizable doesn't mean it has distinct eigenvalues. Think about the identity matrix, it is diagonaliable (already diagonal, but same eigenvalues. But the converse is true, every matrix with distinct eigenvalues can be diagonalized.  
A: It is definitively NOT true that a diagonalizable matrix has all distinct eigenvalues--take the identity matrix. This is sufficient, but not necessary. There is no contradiction here.
A: Actually, symmetric matrix is a Hermitian matrix with specialty of having a equal conjugate. And all Hermitian matrix can find an unitary matrix to diagonalize no matter its eigenvalues are distinct or not.  
