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

  • Normal matrices

Siblings3
  • Sort by title
  • Sort by date

  • Definition of normal matrix
  • A matrix is orthogonally diagonalizable if and only if it is normal (The principal axis theorem).
  • The eigenvectors of a normal matrix are an orthonormal basis.
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 normal (The principal axis theorem).

Put content here**Principal Axis Theorem (Complex Spectral Theorem).** A complex matrix $A$ is unitarily diagonalizable (i.e., there exists a unitary matrix $U$ and diagonal matrix $D$ such that $A = UDU^*$) if and only if $A$ is normal.
⏎
**Proof ($\Leftarrow$):** By Schur decomposition, $A = UTU^*$ with $T$ upper triangular. Since $A$ is normal, $T$ is also normal. A normal upper triangular matrix must be diagonal.
⏎
**Proof ($\Rightarrow$):** If $A = UDU^*$, then $A^* = UD^*U^*$, and $AA^* = UDD^*U^* = UD^*DU^* = A^*A$.
⏎
This theorem generalizes the spectral theorem for symmetric/Hermitian matrices and shows that normality is the precise condition for unitary diagonalizability.

# Parents

* Normal matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026