Math 2.0

definition

Self-adjoint operator

Definition

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 an endomorphism. The map TT is self-adjoint when T∗=TT^* = T, where T∗T^* is the adjoint of TT. Equivalently, ⟨T(v),w⟩=⟨v,T(w)⟩\langle T(v), w \rangle = \langle v, T(w) \rangle for all v,w∈Vv, w \in V.

Remarks

In an orthonormal basis, TT is self-adjoint if and only if its matrix is symmetric (over R\R) or Hermitian (over C\C). Orthogonal projections are self-adjoint. The eigenvalues of a self-adjoint map are real, see the reality of the eigenvalues. Self-adjoint maps are the subject of the spectral theorem.

Explanations

L1 human

A self-adjoint map can move freely from one side of the inner product to the other. For real matrices, these are the symmetric matrices. They model observable quantities in quantum mechanics, because their eigenvalues are real.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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. 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. Self-adjoint operator definition

What depends on this

5 nodes use this node, directly or through other nodes.

Sources

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