Adjoint operator Created 2026-09-24 Updated 2026-10-14
For a bounded linear operator between real or complex Hilbert spaces, its adjoint is the unique bounded linear operator satisfying
The inner product here is linear in its first argument. The adjoint operator transfers an output measurement back to the input: measuring against the vector gives exactly the same scalar as measuring against . It depends on both inner products.
Figure 1.
The adjoint transfers a measurement direction while preserving its measured value
. Details.
In this real example,
Both inner products equal . The dashed lines collect all vectors giving that same measurement: the output line becomes the input line . The adjoint operator therefore moves the direction that describes the measurement. It generally differs from the inverse matrix: here .
For an explicitly complex example, use the standard inner product on . In the standard orthonormal basis, the adjoint operator is represented by the conjugate transpose:
For and , direct matrix multiplication gives
and hence
The complex conjugate is essential to this agreement.
Existence follows from the Riesz representation theorem: for fixed , the bounded linear functional has a unique representing vector . The resulting adjoint operator has the same operator norm as , and
MIT's lecture 18 develops the representation argument and the conjugate transpose example.[ref]
This transfer explains the normal equation for a linear inverse problem: a least-squares solution has residual orthogonal to every attainable direction , so for every , equivalently . An output residual becomes an input condition through the same adjoint operator. All identities in this section concern bounded operators defined on the whole source Hilbert space; for a densely defined operator that is not bounded, use the adjoint of a densely defined operator and check its operator domain.
A linear operator on a Banach space is called a dissipative operator when
On a Hilbert space, using the inner product linear in its first argument,
If , this proves the defining inequality. Conversely that inequality implies for every ; letting gives
For the next spectral assertion, dissipativity must be retained as a hypothesis. Let be closed, densely defined and dissipative. For , the dissipative bound makes injective. Its range is closed: if , the bound makes Cauchy, and then converges. Closedness produces a preimage of . If the range is all of , the same bound gives a bounded inverse, so is in the resolvent set. If the closed range is proper, there is a nonzero vector in its orthogonal complement, and the definition of the adjoint of a densely defined operator gives
This proves that the positive spectrum of a dissipative operator is adjoint point spectrum:
Without dissipativity the PDF's assertion is false. For example, multiplication by on is bounded, closed and densely defined. The value is spectral: normalized functions supported closer and closer to make tend to zero. But has no eigenvector for eigenvalue , since a square-integrable function supported on the singleton is zero.
For the given maximal-domain operator , finite-support sequences belong to , so the domain is dense. Coordinatewise limits also show it is closed: if and in , each defining coordinate equation passes to the limit, giving and hence .
Put and . For ,
Since by Cauchy-Schwarz inequality, has a finite limit . Its increments are square summable as well. Direct summation gives
The original inner-product series converges because . Taking therefore gives
Thus is dissipative, including its full maximal domain; the limiting boundary term has not been discarded.
To decide generation, solve for arbitrary and fixed . The first coordinate gives , and the rest give
Because all denominators are at least one,
Hence is bounded, so belongs to . The coordinate equations give , proving and surjectivity of . Together with density, closedness and dissipativity, the Lumer-Phillips theorem proves the contraction generator from an exponentially weighted difference operator conclusion:
The domain is crucial. The formal transposed matrix suggests a positive-eigenvalue solution
which is square summable because the products converge. It is not a true adjoint eigenvector: the admissible test vector has , so , while . These cannot agree for unless . This exemplifies how boundary terms exclude formal adjoint eigenvectors, and explains why a calculation using only finite-support test vectors would give the wrong generation answer.