The resolvent operator of a linear operator is the parameter-dependent inverse
defined for those complex numbers for which this inverse exists as a bounded operator on the underlying space. It converts the equation into , while its dependence on reveals the spectral properties of . Resolvents are fundamental tools in functional analysis, connecting finite-dimensional matrix theory with differential operators, evolution equations, and quantum mechanics.
Definition and conventions
Let be a complex Banach space, and let
be a closed, densely defined linear operator. Here is its domain, and is the identity operator.
The resolvent set consists of all such that
is bijective and its inverse is bounded as a map from to . For such ,
is the resolvent operator. Its range is exactly , and
For a closed operator, bijectivity already implies boundedness of the inverse by the closed graph theorem. Nevertheless, boundedness is included explicitly in the standard definition.
The spectrum is the complement
Thus the resolvent exists precisely outside the spectrum. In infinite dimensions, spectral points need not be eigenvalues: the shifted operator may instead fail to be surjective, or may have an inverse on its range that is not bounded.
A second common convention defines the resolvent as , the negative of . Both conventions contain the same information, but signs in derivative, contour-integral, and resolvent identities must be adjusted consistently.
Matrices and elementary examples
For a complex matrix ,
exists exactly when
Its entries are rational functions of , with possible poles at eigenvalues.
If admits a diagonalization
then
This shows directly how the resolvent encodes both eigenvalues and their associated spectral subspaces.
Nontrivial Jordan blocks produce higher-order poles. For example, if
then
The pole structure therefore contains information beyond the locations of eigenvalues.
Resolvent identities and analytic dependence
For , the first resolvent identity is
In particular, resolvents of the same operator commute:
The resolvent set is an open set, and is an operator-valued analytic function on it. Its derivatives satisfy
These properties follow locally from a Neumann series. If and
then
with convergence in operator norm.
For two bounded operators and , the second resolvent identity is
whenever . The same formula holds for suitable unbounded operators, in particular when and have the same domain and their difference extends to a bounded operator on . It is a basic tool for studying how solutions and spectra change under perturbations.
Norm estimates and spectral information
If is bounded, then for ,
and
This expansion is the operator analogue of a geometric series.
For an operator with nonempty spectrum,
Thus the resolvent norm necessarily becomes large when a point approaches the spectrum.
For a normal operator on a Hilbert space, the spectral theorem gives the exact formula
For nonnormal operators, the norm can be much larger. Consequently, eigenvalues alone may give an incomplete account of sensitivity or transient behavior.
This distinction motivates the pseudospectrum. One common convention defines the -pseudospectrum by
In finite-dimensional problems, this describes spectral sensitivity to small perturbations. If is bounded and
then . A large resolvent norm therefore indicates that comparatively small perturbations may destroy invertibility.
Spectral projections and functions of operators
The resolvent permits constructions modeled on the Cauchy integral formula from complex analysis. For a bounded operator and a function holomorphic on a neighborhood of ,
where is an appropriate positively oriented contour, or collection of contours, in enclosing the spectrum. This is the holomorphic functional calculus.
If a contour encloses an isolated part of the spectrum and excludes the remainder, then
is a Riesz projection. It satisfies , commutes with in the appropriate domain sense, and separates the corresponding invariant spectral subspace.
For an isolated matrix eigenvalue , this projection selects the generalized eigenspace. The order of the resolvent pole at equals the size of the largest Jordan block associated with that eigenvalue. For general infinite-dimensional operators, however, an isolated spectral point need not be a pole of the resolvent.
Self-adjoint operators and compact resolvent
For a self-adjoint operator , the spectrum is real, so every nonreal belongs to . In particular,
If is the projection-valued spectral measure of , then
This representation connects resolvent boundary values near the real axis with spectral measures. It is especially important for Hamiltonians in quantum mechanics.
An operator has compact resolvent if its resolvent set is nonempty and is a compact operator for some . The resolvent identity then implies compactness of for every .
For such an operator, every spectral point is an isolated eigenvalue of finite algebraic multiplicity, and there is no finite accumulation point of the spectrum. This property occurs for many elliptic operators on bounded domains with appropriate boundary conditions. It explains why these infinite-dimensional problems can possess discrete spectral expansions resembling matrix decompositions.
Differential equations and Green's functions
For a differential operator , solving
is a parameter-dependent boundary-value problem. When the resolvent admits an integral-kernel representation,
the kernel is a Green's function for the shifted operator with the specified boundary conditions.
The domain of is essential: the same differential expression with different boundary conditions generally defines different operators, spectra, and resolvents. For example, Dirichlet and Neumann realizations of the Laplacian on the same bounded region have different spectral properties.
Resolvents also connect stationary equations with evolution equations. If generates a strongly continuous operator semigroup satisfying
then, for ,
Thus the resolvent is the Laplace transform of the evolution operators. This relation underlies semigroup approaches to the heat equation and other linear evolution problems.
Computational interpretation
In computation, applying to a vector usually means solving the linear system
not explicitly forming the inverse matrix. Factorizations and iterative methods can exploit sparsity or differential-operator structure.
The resolvent norm measures the worst-case amplification of perturbations in . The relative condition number of the shifted system additionally depends on . Near spectral points, or in nonnormal regions with large resolvent norm, accurate solution may be difficult even when the shift is not especially close to an eigenvalue.
A related but distinct use occurs in nonlinear analysis: for a possibly nonlinear or set-valued operator , the expression
is also called a resolvent. Its single-valuedness and regularity require additional assumptions, such as maximal monotonicity; they do not follow from the linear spectral theory described above.