konjugierttransponiert

The conjugate transpose, also called the Hermitian adjoint, is an operation on a complex matrix that combines complex conjugation with transposition. For an \(m \times n\) matrix \(A\), its conjugate transpose is denoted \(A^{*}\) or \(A^\dagger\) and defined by \((A^{*})_{ij} = \overline{A_{ji}}\). That is, one first swaps the matrix’s indices and then takes the complex conjugate of every entry. The operation is linear with respect to scalar multiplication but not to addition: \((\lambda A + \mu B)^{*} = \overline{\lambda}\,A^{*} + \overline{\mu}\,B^{*}\).

A matrix equals its own conjugate transpose precisely when it is Hermitian (or self‑adjoint). Hermitian matrices have real eigenvalues and orthogonal eigenvectors, properties that underlie many results in spectral theory. If a matrix is unitary, its adjoint is its inverse, i.e., \(U^{*}U = UU^{*} = I\). An anti‑Hermitian matrix satisfies \(A^{*} = -A\).

The conjugate transpose appears frequently in applied mathematics, physics, and engineering. In quantum mechanics, observable quantities are represented by Hermitian operators, and the adjoint is used to express expectation values and transition amplitudes. In signal processing, the Fourier transform matrix is unitary, and its adjoint implements the inverse transform. The operation also features in numerical linear algebra: algorithms for solving systems, computing eigenvalues, and matrix factorizations often rely on properties of \(A^{*}\).

A simple example: if \(A = \begin{pmatrix} 1 + i & 2 \\ -i & 0 \end{pmatrix}\), then \(A^{*} = \begin{pmatrix} 1 - i & i \\ 2 & 0 \end{pmatrix}\). The process demonstrates both transposition and entry‑wise complex conjugation.