Riemann–Hilbert Problem

In mathematics, Riemann–Hilbert problems, named after Bernhard Riemann and David Hilbert, are a class of problems that arise in the study of differential equations in the complex plane. Several existence theorems for Riemann–Hilbert problems have been produced by Mark Krein, Israel Gohberg and others.

The Riemann problem

Suppose that $\Sigma$ is a smooth, simple, closed contour in the complex plane. Divide the plane into two parts denoted by $\Sigma_$ (the inside) and $\Sigma_$ (the outside), determined by the index of the contour with respect to a point. The classical problem, considered in Riemann's PhD dissertation, was that of finding a function

:$M_+(t) = u(t) + i v(t),$

analytic inside $\Sigma_$, such that the boundary values of $M_+$ along $\Sigma$ satisfy the equation

:$a(t)u(t) - b(t)v(t) = c(t),$
for $t \in \Sigma$, where $a(t)$, $b(t)$ and $c(t)$ are given real-valued functions. For example, in the special case where $a = 1, b=0$ and $\Sigma$ is a circle, the problem reduces to deriving the Poisson formula.

By the Riemann mapping theorem, it suffices to consider the case when $\Sigma$ is the circle group $\mathbb T = \$. In this case, one may seek $M_+(z)$ along with its Schwarz reflection

:$M_-(z) = \overline.$

For $z\in \mathbb$, one has $z = 1/\bar$ and so

:$M_-(z) = \overline.$

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

:$\fracM_+(z) + \fracM_-(z) = c(z),$

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

:$\lim_M_-(z) = \overline.$

The Hilbert problem

Hilbert's generalization of the problem attempted to find a pair of analytic functions $M_+(t)$ and $M_-(t)$ on the inside and outside, respectively, of the curve $\Sigma$, such that for $t \in \Sigma$ one has

:$\alpha(t) M_+(t) + \beta(t) M_-(t) = \gamma(t),$

where $\alpha(t)$, $\beta(t)$ and $\gamma(t)$ are given complex-valued functions (no longer just complex conjugates).

Riemann–Hilbert problems

In the Riemann problem as well as Hilbert's generalization, the contour $\Sigma$ 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 $\Sigma$. The Riemann–Hilbert problem is to find a pair of analytic functions $M_+(t)$ and $M_-(t)$ on the "+" and "−" side of $\Sigma$, respectively, such that for $t \in \Sigma$ one has
:$\alpha(t) M_+(t) + \beta(t) M_-(t) = \gamma(t),$
where $\alpha(t)$, $\beta(t)$ and $\gamma(t)$ are given complex-valued functions.

Matrix Riemann–Hilbert problems

Given an oriented contour $\Sigma$ (technically: an oriented union of smooth curves without points of infinite self-intersection in the complex plane), a ''Riemann–Hilbert factorization problem'' is the following.

Given a matrix function $G(t)$ defined on the contour $\Sigma$, find a holomorphic matrix function $M(z)$ defined on the complement of $\Sigma$, such that the following two conditions are satisfied

# If $M_+$ and $M_-$ denote the non-tangential limits of $M$ as we approach $\Sigma$, then $M_+(t)=G(t)M_-(t)$, at all points of non-intersection in $\Sigma$.
# $M(z)$ tends to the identity matrix $I_N$ as $z \to \infty$ along any direction outside $\Sigma$.

In the simplest case $G(t)$ 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 $L^2$-sense.
At end-points or intersection points of the contour $\Sigma$, the jump condition is not defined; constraints on the growth of $M$ near those points have to be posed to ensure uniqueness (see the scalar problem below).

Example: Scalar Riemann–Hilbert factorization problem

Suppose $G = 2$ and \Sigma= 1,1/math>. Assuming $M$ is bounded, what is the solution $M$?

To solve this, let's take the logarithm of equation $M_+=GM_-$.

:$\log M_+(z) = \log M_-(z) + \log 2.$

Since $M(z)$ tends to $1$, $\log M \to 0$ as $z \to \infty$.

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

:$\frac\int_ \frac \, d\zeta - \frac \int_ \frac \, d\zeta = \log 2$
when $z\in\Sigma$. Because the solution 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

:$\log M = \frac\int_\fracd\zeta = \frac\int^_\fracd\zeta = \frac \log,$

and therefore

:$M(z)=\left( \frac \right)^,$

which has a branch cut at contour $\Sigma$.

Check:

:$\begin M_+(0) &=(e^ )^ = e^ \\ M_-(0) &=(e^)^ = e^ \end$

therefore,

:$M_+(0)=M_-(0)e^=M_-(0)2.$

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

CAVEAT 2: The boundedness (or at least a constraint on the blow-up) of $M$ near the special points $1$ and $-1$ is crucial. Otherwise any function of the form
:$M(z)=\left( \frac \right)^ + \frac+ \frac$
is also a solution. In general, conditions on growth are necessary at special points (the end-points of the jump contour or intersection point) to ensure that the problem is well-posed.

Generalizations

DBAR problem

Suppose $D$ is some simply connected domain of the complex $z$ plane. Then the scalar equation
:$\frac=f(z,\bar), \quad z \in D,$
is a generalization of a Riemann-Hilbert problem, called the DBAR problem (or $\overline$ problem). It is the complex form of the nonhomogeneous Cauchy-Riemann equations. To show this, let
:$M = u + i v, \quad f = \frac, \quad z = x + iy,$
with $u(x,y)$, $v(x,y)$, $g(x,y)$ and $h(x,y)$ all real-valued functions of real variables $x$ and $y$. Then, using
:$\frac = \frac\left(\frac + i\frac\right),$
the DBAR problem yields
:$\frac -\frac = g(x,y), \quad \frac + \frac = h(x,y).$
As such, if $M$ is holomorphic for $z \in D$, then the Cauchy-Riemann equations must be satisfied.

In case $M \to 1$ as $z \to \infty$ and $D := \mathbb$, the solution of the DBAR problem is
:$M(z,\bar) = 1 + \frac \iint_ \frac\, d\zeta \wedge d\bar,$
integrated over the entire complex plane; denoted by $\mathbb^2$, and where the wedge product is defined as
:$d\zeta \wedge d\bar = (d\xi + i d\eta)\wedge(d\xi - i d\eta) = -2i d\xi d\eta.$

Generalized analytic functions

If a function $M(z)$ is holomorphic in some complex region $R$, then
:$\frac = 0,$
in $R$. For generalized analytic functions, this equation is replaced by
:$\frac = A(z,\bar)M + B(z,\bar)\overline,$
in a region $R$, where $\overline$ is the complex conjugate of $M$ and $A(z,\bar)$ and $B(z,\bar)$ are functions of $z$ and $\bar$.

Generalized analytic functions have applications in differential geometry, in solving certain type of multidimensional nonlinear partial differential equations and multidimensional inverse scattering.

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 problems for 1+1 dimensional partial differential equations on the line, or to periodic problems, or even to initial-boundary value problems (), can be stated as a Riemann–Hilbert problem. Likewise the inverse monodromy problem for Painlevé equations can be stated as a Riemann–Hilbert problem.

;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 classical ensembles is reduced to computations involving orthogonal polynomials (see e.g. ).

;C. Combinatorial probability: The most celebrated example is the theorem of on the distribution of the length of the longest increasing subsequence of a random permutation. Together with the study of B above, it is one of the original rigorous investigations of so-called "integrable probability". But the connection between the theory of integrability and various classical ensembles of random matrices goes back to the work of Dyson (see e.g. ).

;D. Connection to Donaldson-Thomas theory: The work of Bridgeland studies a class of Riemann-Hilbert problems coming from Donaldson-Thomas theory and makes connections with Gromov-Witten theory and exact WKB.

The numerical analysis of Riemann–Hilbert problems can provide an effective way for numerically solving integrable PDEs (see e.g. ).

Use for asymptotics

In particular, Riemann–Hilbert factorization problems are used to extract asymptotic values 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 , expanding on a previous idea by and and using technical background results from and . A crucial ingredient of the Deift–Zhou analysis is the asymptotic analysis of singular integrals on contours. The relevant kernel is the standard Cauchy kernel (see ; also cf. the scalar example below).

An essential extension of the nonlinear method of stationary phase has been the introduction of the so-called finite gap g-function transformation by , 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 (see ). The g-function is the logarithmic transform of the maximizing "equilibrium" measure. The analysis of the small dispersion limit of KdV equation 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 . 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 existence of a regular solution, under some conditions on the external field, was done in ; the contour arising is an "S-curve", as defined and studied in the 1980s by Herbert R. Stahl, Andrei A. Gonchar and Evguenii A Rakhmanov.

An alternative asymptotic analysis of Riemann–Hilbert factorization problems is provided in , 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 .

Another extension of the theory appears in where the underlying space of the Riemann–Hilbert problem is a compact hyperelliptic Riemann surface. The correct factorization problem is no more holomorphic, but rather meromorphic, by reason of the Riemann–Roch theorem. The related singular kernel is not the usual Cauchy kernel, but rather a more general kernel involving meromorphic differentials defined naturally on the surface (see e.g. the appendix in ). 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 Arno Kuijlaars and collaborators, see e.g. .

See also

* Riemann–Hilbert correspondence
* Wiener-Hopf method

Notes

References

*
*.
*.
*
*.
*.
*.
*.
*.
*.
*.
*.
*
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*
*.
*
*
*.
*.

{{DEFAULTSORT:Riemann-Hilbert problem
Complex analysis
Exactly solvable models
Integrable systems
Solitons
Scattering theory
Harmonic analysis
Microlocal analysis
Ordinary differential equations
Partial differential equations
Mathematical problems
Bernhard Riemann
David Hilbert