Math 2.0

statement theorem

Spectral theorem for normal matrices

Statement

Let AA be an n×nn \times n complex matrix. Then AA is normal if and only if there are a unitary matrix UU and a diagonal matrix DD with A=UDU∗.A = U D U^*.

Remarks

The columns of UU are then an orthonormal basis of Cn\C^n of eigenvectors of AA. If AA is Hermitian, then DD is real; if AA is unitary, then the diagonal entries of DD have absolute value 11. Over R\R, a normal matrix need not be diagonalisable: a rotation of the plane is normal.

Explanations

L1 human

The normal matrices are exactly the complex matrices that are diagonal in some orthonormal basis. This generalises the spectral theorem from Hermitian matrices to all normal matrices. The eigenvalues can now be any complex numbers.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 7 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Identity matrix object
  2. Matrix definition
  3. Transpose definition
  4. Conjugate transpose definition
  5. Normal matrix definition
  6. Unitary matrix definition
  7. Spectral theorem for normal matrices statement

Sources

  1. Web https://en.wikipedia.org/wiki/Normal_matrix, Consequences