Dashboard

Featured nodes

Roots

  • Public root

Templates

  • Test template
  • iCorps template
  • Guanyu's Latex template
  • Ivar's latex template
  • Family Tree template
  • Latex template
  • Router template

Trees

  • Public trees

Orphans

  • Browse orphan nodes
Related nodes

Parents1

  • Symmetric matrices

Siblings8
  • Sort by title
  • Sort by date

  • Definition of symmetric matrix
  • Symmetric matrices are square.
  • Eigenvectors of a symmetric matrix with different eigenvalues are orthogonal.
  • The spectral theorem for symmetric matrices
  • Formula for the spectral decomposition for a symmetric matrix
  • Definition of orthogonally diagonalizable matrix
  • A matrix is orthogonally diagonalizable if and only if it is symmetric.
  • Definition of skew-symmetric matrix
Knowenβ
  • Help
    • Welcome to Knowen!
    • Edit test node (no login required)
    • Create new test node (no login required)
  • Not logged in
    • Sign in
    • Sign up

History & Comments

Back

Fill content

Description:Added mathematical content
# Eigenvectors of a symmetric matrix with different eigenvalues are orthogonal.

Put content here**Theorem.** Eigenvectors of a real symmetric matrix corresponding to distinct eigenvalues are orthogonal.
⏎
Let $A$ be a real symmetric matrix. If $Av_1 = \lambda_1 v_1$ and $Av_2 = \lambda_2 v_2$ with $\lambda_1 \neq \lambda_2$, then $v_1 \cdot v_2 = 0$.
⏎
**Proof.** We have:
$$\lambda_1 (v_1 \cdot v_2) = (Av_1)^T v_2 = v_1^T A^T v_2 = v_1^T A v_2 = v_1^T (\lambda_2 v_2) = \lambda_2 (v_1 \cdot v_2)$$
Since $\lambda_1 \neq \lambda_2$, we must have $v_1 \cdot v_2 = 0$.
⏎
**Example.** For $A = \begin{pmatrix} 2 & 1 \\ 1 & 2 \end{pmatrix}$, eigenvalues are $\lambda_1 = 3$ and $\lambda_2 = 1$ with eigenvectors $v_1 = (1, 1)^T$ and $v_2 = (1, -1)^T$, which are orthogonal.

# Parents

* Symmetric matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026