2

This one is a little confusing to me, but I'll show what I've done so far.

I know that a symmetric matrix is a matrix that is equal to its transpose, like the identity matrix.

I also know that for a vector to be an eigenvector of some matrix $A$, the following must be true

$Av = \lambda v$,

and for the eigenvectors to be orthogonal, their dot product must be $0$.

Does this mean that the only eigenvectors for a symmetric $n\times n$ matrix are the zero vectors?

Any help will be appreciated.

1 Answers1

1

Suppose $\vec x_1$ and $\vec x_2$ are eigenvectors of the matrix $A$, corresponding to eigenvalues $\mu_1 \ne \mu_2$; then

$A \vec x_1 = \mu_1 \vec x_1, \tag 1$

and

$A \vec x_2 = \mu_2 \vec x_2; \tag 2$

then, using the angle-bracket notation for the inner or "dot" product, we have

$\mu_1 \langle \vec x_1, \vec x_2 \rangle = \langle \mu_1 \vec x_1, \vec x_2 \rangle = \langle A \vec x_1, \vec x_2 \rangle$ $= \langle \vec x_1, A^T \vec x_2 \rangle = \langle \vec x_1, A \vec x_2 \rangle = \langle \vec x_1, \mu_2 \vec x_2 \rangle = \mu_2 \langle \vec x_1, \vec x_2 \rangle; \tag 3$

thus,

$(\mu_1 - \mu_2) \langle \vec x_1, \vec x_2 \rangle = 0; \tag 4$

since $\mu_1 \ne \mu_2$, $\mu_1 - \mu_2 \ne 0$, forcing

$\langle \vec x_1, \vec x_2 \rangle = 0. \tag 5$

Robert Lewis
  • 71,180