Math 2.0

statement theorem

Eigenvalues of a self-adjoint operator are real

Statement

Let VV be a finite-dimensional inner product space over R\R or C\C, and let T ⁣:V→VT \colon V \to V be a self-adjoint linear map. Then each eigenvalue of TT is a real number.

Remarks

If T(v)=λvT(v) = \lambda v with v≠0v \ne 0, then λ⟨v,v⟩=⟨T(v),v⟩=⟨v,T(v)⟩=λˉ⟨v,v⟩\lambda \langle v, v \rangle = \langle T(v), v \rangle = \langle v, T(v) \rangle = \bar\lambda \langle v, v \rangle, so λ=λˉ\lambda = \bar\lambda. In particular, a Hermitian matrix has only real eigenvalues. So a real symmetric matrix has only real eigenvalues, also when we view it as a complex matrix.

Explanations

L1 human

Self-adjoint maps never have complex eigenvalues that are not real. For example, the symmetric matrix (0110)\begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix} has the eigenvalues 11 and −1-1. By contrast, the rotation matrix (0−110)\begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix} is not symmetric, and its eigenvalues are ±i\pm i.

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 9 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. Vector space definition
  2. Inner product definition
  3. Linear map definition
  4. Inner product space definition
  5. Endomorphism definition
  6. Adjoint of a linear map definition
  7. Eigenvalue definition
  8. Self-adjoint operator definition
  9. Eigenvalues of a self-adjoint operator are real statement

Sources

  1. Web https://en.wikipedia.org/wiki/Self-adjoint_operator, Properties