HOME

TheInfoList



OR:

In mathematics, Riemann–Hilbert problems, named after Bernhard Riemann and David Hilbert, are a class of problems that arise in the study of
differential equation In mathematics, a differential equation is an equation that relates one or more unknown functions and their derivatives. In applications, the functions generally represent physical quantities, the derivatives represent their rates of change, a ...
s in the
complex plane In mathematics, the complex plane is the plane formed by the complex numbers, with a Cartesian coordinate system such that the -axis, called the real axis, is formed by the real numbers, and the -axis, called the imaginary axis, is formed by th ...
. Several
existence theorem In mathematics, an existence theorem is a theorem which asserts the existence of a certain object. It might be a statement which begins with the phrase " there exist(s)", or it might be a universal statement whose last quantifier is existential ...
s for Riemann–Hilbert problems have been produced by Mark Krein,
Israel Gohberg Israel Gohberg ( he, ישראל גוכברג; russian: Изра́иль Цу́дикович Го́хберг; 23 August 1928 – 12 October 2009) was a Bessarabian-born Soviet and Israeli mathematician, most known for his work in operator theory a ...
and others (see the book by Clancey and Gohberg (1981)).


The Riemann problem

Suppose that \Sigma is a closed simple contour in the complex plane dividing the plane into two parts denoted by \Sigma_ (the inside) and \Sigma_ (the outside), determined by the
index Index (or its plural form indices) may refer to: Arts, entertainment, and media Fictional entities * Index (''A Certain Magical Index''), a character in the light novel series ''A Certain Magical Index'' * The Index, an item on a Halo megastru ...
of the contour with respect to a point. The classical problem, considered in Riemann's PhD dissertation (see ), was that of finding a function :M_+(z) = u(z) + i v(z) analytic inside \Sigma_ such that the boundary values of ''M''+ along \Sigma satisfy the equation :a(z)u(z) - b(z)v(z) = c(z) for all z\in \Sigma, where ''a'', ''b'', and ''c'' are given real-valued functions . By the
Riemann mapping theorem In complex analysis, the Riemann mapping theorem states that if ''U'' is a non-empty simply connected open subset of the complex number plane C which is not all of C, then there exists a biholomorphic mapping ''f'' (i.e. a bijective holomorphic ma ...
, it suffices to consider the case when \Sigma is the unit circle . In this case, one may seek ''M''+(''z'') along with its Schwarz reflection: :M_-(z) = \overline. On the unit circle Σ, one has z = 1/\bar, and so :M_-(z) = \overline,\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 :\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 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 \Sigma one has :\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 \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 functions, ''M''+ and ''M'' analytic, respectively, on the + and − side of \Sigma, subject to the equation :\alpha(z) M_+(z) + \beta(z) M_-(z) = c(z) for all ''z'' ∈ Σ.


Generalization: Matrix factorization problems

Given an oriented "contour" Σ (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 ''V'' defined on the contour Σ, to find a holomorphic matrix function M defined on the complement of Σ, such that two conditions be satisfied: # If ''M''+ and ''M'' denote the non-tangential limits of ''M'' as we approach Σ, then ''M''+ = ''M''V, at all points of non-intersection in Σ. #As ''z'' tends to infinity along any direction outside Σ, ''M'' tends to the
identity matrix In linear algebra, the identity matrix of size n is the n\times n square matrix with ones on the main diagonal and zeros elsewhere. Terminology and notation The identity matrix is often denoted by I_n, or simply by I if the size is immaterial ...
. 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 ''L''2 sense. At end-points or intersection points of the contour Σ 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).


Applications to integrability theory

Riemann–Hilbert problems have applications to several related classes of problems. ;A. Integrable models: The
inverse scattering In mathematics and physics, the inverse scattering problem is the problem of determining characteristics of an object, based on data of how it scatters incoming radiation or particles. It is the inverse problem to the direct scattering problem, w ...
or inverse spectral problem associated to the Cauchy problems for 1+1 dimensional
partial differential equations In mathematics, a partial differential equation (PDE) is an equation which imposes relations between the various partial derivatives of a multivariable function. The function is often thought of as an "unknown" to be solved for, similarly to ...
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 In mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal to each other under some inner product. The most widely used orthogonal polynomials are the cl ...
, 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 for example ). ;C. Combinatorial
probability Probability is the branch of mathematics concerning numerical descriptions of how likely an Event (probability theory), event is to occur, or how likely it is that a proposition is true. The probability of an event is a number between 0 and ...
: 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 (e.g.). The numerical analysis of Riemann–Hilbert problems can provide an effective way for numerically solving integrable PDEs, see eg. Trogdon & Olver (2016).


Use for asymptotic solutions

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 In mathematics, the method of steepest descent or saddle-point method is an extension of Laplace's method for approximating an integral, where one deforms a contour integral in the complex plane to pass near a stationary point ( saddle point), in ...
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. 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 In mathematics, in the theory of integrable systems, a Lax pair is a pair of time-dependent matrices or operators that satisfy a corresponding differential equation, called the ''Lax equation''. Lax pairs were introduced by Peter Lax to discuss s ...
) is not
self-adjoint In mathematics, and more specifically in abstract algebra, an element ''x'' of a *-algebra is self-adjoint if x^*=x. A self-adjoint element is also Hermitian, though the reverse doesn't necessarily hold. A collection ''C'' of elements of a sta ...
, 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 In mathematics, particularly in complex analysis, a Riemann surface is a connected one-dimensional complex manifold. These surfaces were first studied by and are named after Bernhard Riemann. Riemann surfaces can be thought of as deformed ve ...
. The correct factorization problem is no more holomorphic, but rather meromorphic, by reason of the
Riemann–Roch theorem The Riemann–Roch theorem is an important theorem in mathematics, specifically in complex analysis and algebraic geometry, for the computation of the dimension of the space of meromorphic functions with prescribed zeros and allowed poles. It ...
. 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 The Toda lattice, introduced by , is a simple model for a one-dimensional crystal in solid state physics Solid-state physics is the study of rigid matter, or solids, through methods such as quantum mechanics, crystallography, electromagnetism, and ...
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 Arnoldus Bernardus Jacobus Kuijlaars (born 1963) is a Dutch mathematician, specializing in approximation theory. Kuijlaars completed his undergraduate studies at the Eindhoven University of Technology and received in 1991 his Ph.D. from Utrecht U ...
and collaborators, see e.g. .


Example: Scalar Riemann–Hilbert factorization problem

Suppose ''V'' = 2, and Σ is a contour from ''z'' = −1 to ''z'' = 1. Assuming M is bounded, what is the solution of ''M''? To solve this, let's take the
logarithm In mathematics, the logarithm is the inverse function to exponentiation. That means the logarithm of a number  to the base  is the exponent to which must be raised, to produce . For example, since , the ''logarithm base'' 10 of ...
of equation M_+=M_- V. : \log M_+(z) = \log M_-(z) + \log 2. Since ''M'' tends to 1, log ''M'' → 0 as ''z'' → ∞. A standard fact about the Cauchy transform is that C_+ -C_- = I where C_+ , C_- are the limits of the Cauchy transform from above and below Σ; therefore, we get : \frac\int_ \frac \, d\zeta - \frac \int_ \frac \, d\zeta = \log 2 \text z\in\Sigma. Because the solution ''M'' of a Riemann–Hilbert factorization problem is unique (an easy application of
Liouville's theorem (complex analysis) In complex analysis, Liouville's theorem, named after Joseph Liouville (although the theorem was first proven by Cauchy in 1844), states that every bounded entire function must be constant. That is, every holomorphic function f for which there ex ...
), the Sokhotski–Plemelj theorem gives the solution. We get :\log M = \frac\int_\fracd\zeta = \frac\int^_\fracd\zeta = \frac \log, i.e. : 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.


See also

*
Riemann–Hilbert correspondence In mathematics, the term Riemann–Hilbert correspondence refers to the correspondence between regular singular flat connections on algebraic vector bundles and representations of the fundamental group, and more generally to one of several generaliz ...


References

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


External links

* {{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