Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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?

share|improve this question

3 Answers 3

up vote 5 down vote accepted

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.

share|improve this answer
    
Oh, in my textbook says "diagonalization can fail only if there are repaeated eigenvalues" and added "even then, it does not always fail, think about identity matrix" in the next page. I overlooked it. Thanks! –  niagara Dec 10 '12 at 17:38

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.

share|improve this answer
    
Oh, in my textbook says "diagonalization can fail only if there are repaeated eigenvalues" and added "even then, it does not always fail, think about identity matrix" in the next page. I overlooked it. Thanks! –  niagara Dec 10 '12 at 17:38

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.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.