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

Put content here**Definition.** A complex square matrix $A$ is *normal* if it commutes with its conjugate transpose:
$$A A^* = A^* A$$
⏎
**Examples of normal matrices:**
- Hermitian matrices: $A = A^*$, so $AA^* = A^2 = A^*A$
- Skew-Hermitian matrices: $A = -A^*$
- Unitary matrices: $A^* = A^{-1}$, so $AA^* = I = A^*A$
- Diagonal matrices: they commute with everything
⏎
**Example.** $A = \begin{pmatrix} 1 & -1 \\ 1 & 1 \end{pmatrix}$ is normal since $AA^T = A^T A = \begin{pmatrix} 2 & 0 \\ 0 & 2 \end{pmatrix}$.
⏎
Normal matrices form the broadest class of matrices that can be unitarily diagonalized.

# Parents

* Normal matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026