# Riemann–Hilbert problem

In mathematics, Riemann–Hilbert problems, named after Bernhard Riemann and David Hilbert, are a class of problems that arise, inter alia, in the study of differential equations in the complex plane. Several existence theorems for Riemann–Hilbert problems have been produced by Krein, Gohberg and others (see the book by Clancey and Gohberg (1981)).

## The Riemann problem

Suppose that Σ is a closed simple contour in the complex plane dividing the plane into two parts denoted by Σ+ (the inside) and Σ (the outside), determined by the index of the contour with respect to a point. The classical problem, considered in Riemann's PhD dissertation (see Template:Harvtxt), was that of finding a function

${\displaystyle M_{+}(z)=u(z)+iv(z)\!}$

analytic inside Σ+ such that the boundary values of M+ along Σ satisfy the equation

${\displaystyle a(z)u(z)-b(z)v(z)=c(z)\!}$

for all z ∈ Σ, where a, b, and c are given real-valued functions Template:Harv.

By the Riemann mapping theorem, it suffices to consider the case when Σ is the unit circle Template:Harv. In this case, one may seek M+(z) along with its Schwarz reflection:

${\displaystyle M_{-}(z)={\overline {M_{+}\left({\bar {z}}^{-1}\right)}}.}$

On the unit circle Σ, one has ${\displaystyle z=1/{\bar {z}}}$, and so

${\displaystyle M_{-}(z)={\overline {M_{+}(z)}},\quad z\in \Sigma .}$

Hence the problem reduces to finding a pair of functions M+(z) and M(z) analytic, respectively, on the inside and the outside of the unit disc, so that on the unit circle

${\displaystyle {\frac {a(z)+ib(z)}{2}}M_{+}(z)+{\frac {a(z)-ib(z)}{2}}M_{-}(z)=c(z),}$

and, moreover, so that the condition at infinity holds:

${\displaystyle \lim _{z\to \infty }M_{-}(z)={\bar {M}}_{+}(0).}$

## The Hilbert problem

Hilbert's generalization was to consider the problem of attempting to find M+ and M- analytic, respectively, on the inside and outside of the curve Σ, such that on Σ one has

${\displaystyle \alpha (z)M_{+}(z)+\beta (z)M_{-}(z)=c(z)\,}$

where α, β, and c are arbitrary given complex-valued functions (no longer just complex conjugates).

## Riemann–Hilbert problems

In the Riemann problem as well as Hilbert's generalization, the contour Σ was simple. A full Riemann–Hilbert problem allows that the contour may be composed of a union of several oriented smooth curves, with no intersections. The + and − sides of the "contour" may then be determined according to the index of a point with respect to Σ. The Riemann–Hilbert problem is to find a pair of functions, M+ and M- analytic, respectively, on the + and − side of Σ, subject to the equation

${\displaystyle \alpha (z)M_{+}(z)+\beta (z)M_{-}(z)=c(z)\,}$

for all z∈Σ.

## Generalization: factorization problems

Given an oriented "contour" Σ (technically: an oriented union of smooth curves without points of infinite self-intersection in the complex plane). A Birkhoff factorization problem is the following.

Given a matrix function V defined on the contour Σ, to find a holomorphic matrix function M defined on the complement of Σ, such that two conditions be satisfied:

1. If M+ and M denote the non-tangential limits of M as we approach Σ, then M+ = MV, at all points of non-intersection in Σ.
2. As z tends to infinity along any direction outside Σ, M tends to the identity matrix.

In the simplest case V is smooth and integrable. In more complicated cases it could have singularities. The limits M+ and M could be classical and continuous or they could be taken in the L2 sense.

## Applications to Integrability Theory

Riemann–Hilbert problems have applications to several related classes of problems.

A. Integrable models. The inverse scattering or inverse spectral problem associated to the Cauchy problem for 1+1 dimensional partial differential equations on the line, periodic problems, or even initial-boundary value problems, can be stated as Riemann–Hilbert problems.

B. Orthogonal polynomials, Random matrices. Given a weight on a contour, the corresponding orthogonal polynomials can be computed via the solution of a Riemann–Hilbert factorization problem. Furthermore, the distribution of eigenvalues of random matrices in several ensembles is reduced to computations involving orthogonal polynomials (see for example Template:Harvtxt).

C. Combinatorial probability. The most celebrated example is the theorem of Template:Harvtxt on the distribution of the length of the longest increasing subsequence of a random permutation.

In particular, Riemann–Hilbert factorization problems are used to extract asymptotics for the three problems above (say, as time goes to infinity, or as the dispersion coefficient goes to zero, or as the polynomial degree goes to infinity, or as the size of the permutation goes to infinity). There exists a method for extracting the asymptotic behavior of solutions of Riemann–Hilbert problems, analogous to the method of stationary phase and the method of steepest descent applicable to exponential integrals.

By analogy with the classical asymptotic methods, one "deforms" Riemann–Hilbert problems which are not explicitly solvable to problems that are. The so-called "nonlinear" method of stationary phase is due to Template:Harvtxt, expanding on a previous idea by Template:Harvtxt and Template:Harvtxt. A crucial ingredient of the Deift-Zhou analysis is the asymptotic analysis of singular integrals on contours.

An essential extension of the nonlinear method of stationary phase has been the introduction of the so-called finite gap g-function transformation by Template:Harvtxt, which has been crucial in most applications. This was inspired by work of Lax, Levermore and Venakides, who reduced the analysis of the small dispersion limit of the KdV equation to the analysis of a maximization problem for a logarithmic potential under some external field: a variational problem of "electrostatic" type. The g-function is the logarithmic transform of the maximizing "equilibrium" measure. The analysis of the small dispersion limit of KdV has in fact provided the basis for the analysis of most of the work concerning "real" orthogonal polynomials (i.e. with the orthogonality condition defined on the real line) and Hermitian random matrices.

Perhaps the most sophisticated extension of the theory so far is the one applied to the "non self-adjoint" case, i.e. when the underlying Lax operator (the first component of the Lax pair) is not self-adjoint, by Template:Harvtxt. In that case, actual "steepest descent contours" are defined and computed. The corresponding variational problem is a max-min problem: one looks for a contour that minimizes the "equilibrium" measure. The study of the variational problem and the proof of a regular solution, under some conditions on the external field, was done in Template:Harvtxt.

An alternative asymptotic analysis of Riemann–Hilbert factorization problems is provided in Template:Harvtxt, especially convenient when jump matrices do not have analytic extensions. Their method is based on the analysis of d-bar problems, rather than the asymptotic analysis of singular integrals on contours. An alternative way of dealing with jump matrices with no analytic extensions was introduced in Template:Harvtxt.

Another extension of the theory appears in Template:Harvtxt where the underlying space of the Riemann–Hilbert problem is a compact hyperelliptic Riemann surface. The right factorization problem is no more holomorphic, but rather meromorphic, by reason of the Riemann-Roch theorem. The Riemann–Hilbert problem deformation theory is applied to the problem of stability of the infinite periodic Toda lattice under a "short range" perturbation (for example a perturbation of a finite number of particles).

Most Riemann–Hilbert factorization problems studied in the literature are 2-dimensional, i.e. the unknown matrices are of dimension 2. Higher-dimensional problems have been studied by Kuijlaars and collaborators, see e.g. Template:Harvtxt.

## Example: Scalar Riemann-Hilbert factorization problem

Suppose V=2, and Σ is a contour from z=-1 to z=1. What is the solution of M?

To solve this, let's take the logarithm of equation ${\displaystyle M_{+}=M_{-}V}$.

${\displaystyle \log M_{+}(z)=\log M_{-}(z)+\log 2.}$

Since M tends to 1, log M tends to zero as z tends to infinity.

A standard fact about the Cauchy Transform is that ${\displaystyle C_{+}-C_{-}=I}$ where ${\displaystyle C_{+},C_{-}}$ are the limits of the Cauchy transform from above and below Σ; therefore, we get

${\displaystyle {\frac {1}{2\pi i}}\int _{\Sigma _{+}}{\frac {\log {2}}{\zeta -z}}d\zeta -{\frac {1}{2\pi i}}\int _{\Sigma _{-}}{\frac {\log {2}}{\zeta -z}}d\zeta =\log {2}\,\,\,\mathrm {when} \,\,z\in \Sigma .}$

Because the solution M of a Riemann-Hilbert factorization problem is unique (an easy application of Liouville's theorem (complex analysis)), the Sokhotski–Plemelj theorem gives the solution. We get

${\displaystyle \log M={\frac {1}{2\pi i}}\int _{\Sigma }{\frac {\log {2}}{\zeta -z}}d\zeta ={\frac {\log 2}{2\pi i}}\int _{-1-z}^{1-z}{\frac {1}{\zeta }}d\zeta ={\frac {\log 2}{2\pi i}}\log {\frac {z-1}{z+1}},}$

CAVEAT: If the problem is not scalar one cannot take logarithms. In general explicit solutions are very rare.

## References

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}.