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
# Definition of orthogonally diagonalizable matrix

Put content here**Definition.** An $n \times n$ matrix $A$ is *orthogonally diagonalizable* if there exists an orthogonal matrix $P$ (i.e., $P^T = P^{-1}$) and a diagonal matrix $D$ such that:
$$A = P D P^T \quad \text{or equivalently} \quad P^T A P = D$$
⏎
This means $A$ has an orthonormal basis of eigenvectors. The columns of $P$ are the orthonormal eigenvectors of $A$, and the diagonal entries of $D$ are the corresponding eigenvalues.
⏎
**Example.** The symmetric matrix $A = \begin{pmatrix} 1 & 0 \\ 0 & 2 \end{pmatrix}$ is orthogonally diagonalizable with $P = I$ and $D = A$.
⏎
Note: Orthogonal diagonalizability is stronger than ordinary diagonalizability -- it requires not just a basis of eigenvectors, but an *orthonormal* basis.

# Parents

* Symmetric matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026