Math 2.0

definition

Adjoint of a linear map

Definition

Let VV and WW be finite-dimensional inner product spaces over R\R or C\C, and let T ⁣:V→WT \colon V \to W be a linear map. The adjoint of TT is the unique linear map T∗ ⁣:W→VT^* \colon W \to V such that ⟨T(v),w⟩=⟨v,T∗(w)⟩for all v∈V and w∈W.\langle T(v), w \rangle = \langle v, T^*(w) \rangle \qquad \text{for all } v \in V \text{ and } w \in W.

Remarks

The existence and uniqueness follow from the Riesz representation theorem. It satisfies (S+T)∗=S∗+T∗(S + T)^* = S^* + T^*, (aT)∗=aˉT∗(aT)^* = \bar a T^*, (ST)∗=T∗S∗(ST)^* = T^* S^* and T∗∗=TT^{**} = T. In orthonormal bases, the matrix of T∗T^* is the conjugate transpose of the matrix of TT. It satisfies ker⁡T∗=(im⁡T)⊥\ker T^* = (\im T)^\perp.

Explanations

L1 human

The adjoint lets us move a map from one side of an inner product to the other. For real matrices with the dot product, the adjoint is the transpose: (Ax)⋅y=x⋅(ATy)(Ax) \cdot y = x \cdot (A^T y). For complex matrices, it is the conjugate transpose.

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 5 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. Adjoint of a linear map definition

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Hermitian_adjoint, Definition for bounded operators between Hilbert spaces