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
# The eigenvectors of a normal matrix are an orthonormal basis.

Put content here**Theorem.** Every normal matrix has an orthonormal basis of eigenvectors.
⏎
If $A$ is normal, then there exist orthonormal vectors $v_1, \ldots, v_n$ and eigenvalues $\lambda_1, \ldots, \lambda_n$ such that $Av_i = \lambda_i v_i$.
⏎
**Proof.** By the Principal Axis Theorem, $A = UDU^*$ where $U$ is unitary and $D$ is diagonal. The columns of $U$ are orthonormal eigenvectors of $A$.
⏎
**Key property.** For a normal matrix, eigenvectors corresponding to different eigenvalues are orthogonal:
If $Av = \lambda v$ and $Aw = \mu w$ with $\lambda \neq \mu$, then $\langle v, w \rangle = 0$.
⏎
**Example.** The unitary matrix $U = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix}$ is normal with orthonormal eigenvectors $\frac{1}{\sqrt{2}}(1,1)^T$ and $\frac{1}{\sqrt{2}}(1,-1)^T$.

# Parents

* Normal matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026