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
# A matrix is orthogonally diagonalizable if and only if it is symmetric.

Put content here**Theorem.** A real matrix $A$ is orthogonally diagonalizable if and only if it is symmetric.
⏎
**Proof ($\Leftarrow$):** Follows from the Spectral Theorem -- every real symmetric matrix has an orthonormal basis of eigenvectors.
⏎
**Proof ($\Rightarrow$):** If $A = PDP^T$ with $P$ orthogonal and $D$ diagonal, then:
$$A^T = (PDP^T)^T = PD^T P^T = PDP^T = A$$
(since $D^T = D$ for a diagonal matrix).
⏎
This theorem establishes a fundamental connection: among all real matrices, the symmetric ones are exactly those that can be diagonalized by an orthogonal change of basis.

# Parents

* Symmetric matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026