
TL;DR
This paper introduces the nonlinear steepest descent method for Riemann-Hilbert problems, demonstrating its applications in asymptotic analysis, integrable systems, and random matrix theory.
Contribution
It provides an accessible introduction to the method and showcases its diverse applications in mathematical physics and analysis.
Findings
Asymptotic analysis of special functions using Riemann-Hilbert problems
Application to inverse scattering for integrable systems
Proof of universality in random matrix ensembles
Abstract
These lectures introduce the method of nonlinear steepest descent for Riemann-Hilbert problems. This method finds use in studying asymptotics associated to a variety of special functions such as the Painlev\'{e} equations and orthogonal polynomials, in solving the inverse scattering problem for certain integrable systems, and in proving universality for certain classes of random matrix ensembles. These lectures highlight a few such applications.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials
\customizeamsrefs
Riemann–Hilbert Problems
Percy Deift
Department of Mathematics, Courant Institute of Mathematical Sciences, New York University
Abstract.
These lectures introduce the method of nonlinear steepest descent for Riemann-Hilbert problems. This method finds use in studying asymptotics associated to a variety of special functions such as the Painlevé equations and orthogonal polynomials, in solving the inverse scattering problem for certain integrable systems, and in proving universality for certain classes of random matrix ensembles. These lectures highlight a few such applications.
Contents
Lecture 1
These four lectures are an abridged version of 14 lectures that I gave at the Courant Institute on RHPs in 2015. These 14 lectures are freely available on the AMS website AMS Open Notes.
Basic references for RHPs are [ClanceyGohberg, Litvinchuk1987, DeiftOrthogonalPolynomials]. Basic references for complex function theory are [Duren, Garnett2007, Goluzin1969]. Many more specific references will be given as the course proceeds.
Special functions are important because they provide explicitly solvable models for a vast array of phenomena in mathematics and physics. By “special functions” I mean Bessel functions, Airy functions, Legendre functions, and so on. If you have not yet met up with these functions, be assured, sooner or later, you surely will.
It works like this. Consider the Airy equation (see, e.g. [AbramowitzStegun, DLMF])
[TABLE]
Seek a solution of (1) in the form
[TABLE]
for some functions and some contours in the complex plane . We have
[TABLE]
provided we can drop the boundary terms. In order to solve (1) we need to have
[TABLE]
Thus
[TABLE]
provides a solution of the Airy equation.
The particular choice
[TABLE]
and in Figure 1 is known as Airy’s integral
[TABLE]
Other contours provide other, independent solutions of Airy’s equation, such as (see [AbramowitzStegun]). Now the basic fact of the matter is that the integral representation (2) for enables us, using the classical method of stationary phase/steepest descent, to compute the asymptotics of as and with any desired accuracy. We find, in particular [AbramowitzStegun, p. 448], that for
[TABLE]
as , where
[TABLE]
and that
[TABLE]
as .
Such results for solutions of general 2nd order equations are very rare. Formulae (3) and (4) solve the fundamental connection problem or scattering problem for solutions of the Airy equation. Thus, if we know that a solution of the Airy equation behaves like
[TABLE]
as , then we know precisely how it behaves as , and vice versa, by (3) (4), see Figure 2.
Exercise 5**.**
Use the classical steepest-descent method to verify (3) and (4). There are similar precise results for all the classical special functions. The diligent student should regard Abramowitz & Stegun [AbramowitzStegun] as an exercise book for the steepest descent method — verify all the asymptotic formulae!
Now in recent years it has become clear that a new and extremely broad class of problems in mathematics, engineering and physics is described by a new class of special functions, the so-called Painlevé functions. There are six Painlevé equations and we will say more about them later on. Whereas the classical special functions, such as Airy functions, Bessel functions, etc. typically arise in linear (or linearized problems) such as acoustics or electromagnetism, the Painlevé equations arise in nonlinear problems, and they are now recognized as forming the core of modern special function theory. Here are some examples of how Painlevé equations arise:
Example 6**.**
Consider solutions of the modified Korteweg–de Vries equation (MKdV)
[TABLE]
Then [deiftzhoumkdv] as , in the region ,
[TABLE]
where is a particular solution of the Painlevé II (PII) equation
[TABLE]
Example 9**.**
Let be a permutation of the numbers . We say that is an increasing subsequence of of length k if
[TABLE]
and
[TABLE]
Thus if and , then 125 and 136 are increasing subsequences of of length 3. Let denote the length of a longest increasing subsequence of , e.g., for and as above, , which is the length of the longest increasing subsequences 125 and 136.
Now equip with uniform measure. Thus
[TABLE]
Question**.**
How does behave statistically as ?
Theorem 10** ([Baik1999b]).**
Center and scale as follows:
[TABLE]
then
[TABLE]
where is the (unique) solution of Painlevé II (the so-called Hastings-McLeod solution) normalized such that
[TABLE]
The distribution on the right in Theorem 10 is the famous Tracy-Widom distribution for the largest eigenvalue of a GUE matrix in the edge scaling limit. Theorem 1 is one of a very large number of probabilistic problems in combinatorics and related areas, whose solution is expressed in terms of Random Matrix Theory (RMT) via Painlevé functions (see, e.g., [Baik2017]).
The key question is the following: Can we describe the solutions of the Painlevé equations as precisely as we can describe the solutions of the classical special functions such as Airy, Bessel, ? In particular, can we describe the solutions of the Painlevé equations asymptotically with arbitrary precision and solve the connection/scattering problem as in (3) and (4) for the Airy equation (or any other of the classical special functions):
[TABLE]
and vice versa.
As we have indicated, at the technical level, connection formulae such as (3) and (4) can be obtained because of the existence of an integral representation such as (2) for the solution. Once we have such a representation the asymptotic behavior is obtained by applying the (classical) steepest descent method to the integral. There are, however, no known integral representations for solutions of the Painlevé equations and we are led to the following questions:
Question 1: Is there an analog of an integral representation for solutions of the Painlevé equations?
Question 2: Is there an analog of the classical steepest descent method which will enable us to extract precise asymptotic information about solutions of the Painlevé equations from this analog representation?
The answer to both questions is yes: In place of an integral representation such as (2), we have a Riemann–Hilbert Problem (RHP), and in place of the classical steepest descent method we have the nonlinear (or non-commutative) steepest descent method for RHPs (introduced by P. Deift and X. Zhou [deiftzhoumkdv]).
So what is a RHP? Let be an oriented contour in the plane, see Figure 3.
By convention, if we move along an arc in in the direction of the orientation, the -sides lie on the left (resp. right). Let , the jump matrix, be an invertible matrix function defined on with
[TABLE]
We say that an matrix function is a solution of the RHP if
z$$z^{\prime}\to z^{-}$$z^{\prime}\to z^{+}
If, in addition, and
[TABLE]
we say that solves the normalized RHP .
RHPs involve a lot of technical issues. In particular
- •
How smooth should be?
- •
What measure theory/function spaces are suitable for RHPs?
- •
What happens at points of self intersection (see Figure 4)?
- •
In what sense are the limits achieved?
- •
In the case , in what sense is the limit achieved?
- •
Does an solution exist?
- •
In the normalized case, is the solution unique?
And most importantly
- •
at the analytical level, what kind of problem is a RHP? As we will see, the problem reduces to the analysis of singular integral equations on .
There is not enough time in these 4 lectures to address all these issues systematically. Rather we will address specific issues as they arise.
As an example of how things work, we now show how PII is related to a RHP (see, e.g. [FokasPainleve]). Let denote the union of six rays
[TABLE]
oriented outwards. Let be complex numbers satisfying the relation
[TABLE]
Let , be constant on each ray as indicated in Figure 5 and for fixed set
[TABLE]
where
[TABLE]
Thus for
[TABLE]
and so on.
For fixed , let be the matrix solution of the normalized RHP . Then
[TABLE]
is a solution of the PII equation where
[TABLE]
as . (This result is due to Jimbo and Miwa [Jimbo], and independently to Flaschka and Newell [Flaschka].) The asymptotic behavior of as is then obtained from the RHP by the nonlinear steepest descent method.
In the classical steepest descent method for integrals such as (2) above, the contour is deformed so that the integral passes through a stationary phase point where the integrand is maximal and the main contribution to the integral then comes from a neighborhood of this point. The nonlinear (or non-commutative) steepest descent method for RHPs involves the same basic ideas as in the classical scalar case in that one deforms the RHP, , in such a way that the exponential terms (see e.g. above) in the RHP have maximal modulus at points of the deformed contour . The situation is far more complicated than the scalar integral case, however, as the problem involves matrices that do not commute. In addition, terms of the form also appear in the problem and must be separated algebraically from terms involving , so that in the end the terms involving and both have maximal modulus along (see [deiftzhoumkdv, deiftzhounls, Deift1995a]). A simple example of the nonlinear steepest descent method is given at the end of Lecture 4.
One finds, in particular, ([Deift1995a], and also [Its1994, FokasPainleve]) the following:
Let . Then as ,
[TABLE]
where
[TABLE]
and
[TABLE]
As
[TABLE]
These asymptotics should be compared with (3), (4) for the Airy function. Note from (3) that as
[TABLE]
Also observe that PII
[TABLE]
is a clearly a nonlinearization of the Airy equation
[TABLE]
and so we expect similar solutions when the nonlinear term is small.
Also note that (12) and (13) solve the connection problem for PII. If we know the behavior of the solutions of PII as , then we certainly know from (15). But then we know and in (13) and (14) and hence we know the asymptotics of as from (12). Conversely, if we know the asymptotics of as , we certainly know from (12) and hence we know from (13), . But then again from (12), we know , and hence from (14). Thus we know , and hence the asymptotics of the solution as from (15). Finally note the similarity of the multiplier
[TABLE]
for the Airy equation with the multiplier
[TABLE]
in the RHP for PII. Setting in (16)
[TABLE]
which agrees with (17) up to appropriate scalings.
Also note from (11) that PII is parameterized by parameters lying on a 2-dim variety: this corresponds to the fact that PII is second order.
The fortunate and remarkable fact is that the class of problems in physics, mathematics, and engineering expressible in terms of a RHP is very broad and growing. Here is one more, with more to come!
The RHP for the MKdV equation (7) is as follows (see e.g., [deiftzhoumkdv]): Let , oriented from to . For fixed let
[TABLE]
where and is a given function in with
[TABLE]
and
[TABLE]
There is a bijection from the initial data for MKdV onto such functions — see later. The function is called the reflection coefficient for , see (13).
Let be the solution of the normalized RHP . Then
[TABLE]
is the solution of MKdV with initial condition corresponding to . Here
[TABLE]
as .
The asymptotic result (8) is obtained by applying the nonlinear steepest descent method to the RHP in the region . In this case PII emerges as the RHP is “deformed” into the RHP in Figure 5.
As we will see, RHPs are useful not only for asymptotics, but also they can be used to determine symmetries and formulae/identities/equations, and also for analytical purposes.
Lecture 2
We now consider some of technical issues that arise for RHPs, which are listed with bullet points above.
A key role in RH theory is played by the Cauchy operator. We first consider the case when . Here the Cauchy operator is given by
[TABLE]
for suitable functions on (General refs for the case , and also when , are [Duren] and [Garnett2007].) Assume first that , the Schwartz space of functions on . Let . Then
[TABLE]
Now
[TABLE]
Then, by dominated convergence,
[TABLE]
Write
[TABLE]
where
[TABLE]
and
[TABLE]
As
[TABLE]
is an odd function about , can be written as
[TABLE]
and so
[TABLE]
which goes to [math] as . Finally
[TABLE]
We have
[TABLE]
and so as , again by dominated convergence,
[TABLE]
as the final integrand is odd.
Thus we see that for and
[TABLE]
where
[TABLE]
is called the Hilbert transform of . Note that
[TABLE]
which converges to
[TABLE]
as , so that indeed exists pointwise for .
Similarly one finds
[TABLE]
and we obtain the fundamental relations for
[TABLE]
and
[TABLE]
Exercise 2**.**
Show that the limits are in fact non-tangential limits i.e. where lies in a cone of arbitrary opening angle (see Figure 7), and similarly for (see refs. [Ontheline, Bottcher, ClanceyGohberg]).
A critical property of the singular integral operator , and hence the operators , is that, as we now show, is a bounded operator from for all . To prove the result for , recall that the Fourier transform
[TABLE]
and the inverse Fourier transform
[TABLE]
are unitary maps
[TABLE]
from onto . Moreover
[TABLE]
[TABLE]
For , fix , and set
[TABLE]
Then
[TABLE]
by Fubini’s Theorem.
Now for fixed and large, and
[TABLE]
Exercise 4**.**
Show that, for , we have
[TABLE]
Hence for fixed and
[TABLE]
But we also have
Exercise 5**.**
For
[TABLE]
is bounded in uniformly for .
It follows that we may take the limit in (3) in the -integral and so for
[TABLE]
Exercise 6**.**
Show, by a similar argument, that
[TABLE]
Thus
[TABLE]
where
[TABLE]
Now as is dense in , and as is clearly bounded in it follows that
[TABLE]
Moreover
[TABLE]
is clearly also a bounded operator in and for
[TABLE]
which converges to [math] as , again by dominated convergence. In other words, for ,
[TABLE]
In particular, it follows by general measure theory, that for some sequence
[TABLE]
pointwise a.e. In particular (7) holds for . But then by our previous calculations, converges pointwise for all , and we conclude that for and a.e.
[TABLE]
Thus and, hence , extend to bounded operators on and
[TABLE]
where if and if .
We have shown the following: For ,
[TABLE]
and similarly
[TABLE]
The following argument of Riesz shows that in fact , and hence , are bounded in , for all . Consider first the case . Suppose , the infinitely differentiable functions with compact support. Then as ,
[TABLE]
and is continuous down to the axis. By Cauchy’s theorem
[TABLE]
where is given in Figure 8, and as
[TABLE]
we conclude that
[TABLE]
But then as we obtain
[TABLE]
Now suppose that is real. Then is real and the real part of (8) yields
[TABLE]
hence
[TABLE]
for any . Take . Then
[TABLE]
The case when is complex valued is handled by taking real and imaginary parts. Thus, by density, maps boundedly to .
Exercise 9**.**
Show that maps for all . Hints:
- (1)
Show that the above argument works for all even integers . 2. (2)
Show that the result follows for all by interpolation. 3. (3)
Show that the result for now follows by duality.
Exercise 10**.**
Show that is not bounded from . (However maps .) As indicated in Lecture 1, RHPs take place on contours which self-intersect (see Figure 9).
We will need to know, for example, that if is supported on , say, and we consider
[TABLE]
for , say, then if . Here is a prototype result which one can prove using the Mellin transform, which we recall is the Fourier transform for the multiplicative group . We have [Ontheline, p. 88] the following:
For and , set
[TABLE]
where . Then
[TABLE]
where
[TABLE]
One can also show that for any
[TABLE]
for some .
Results such as (11) are useful in many ways. For example, we have the following result.
Theorem 12**.**
Suppose . Then is uniformly Hölder- in and in . In particular, is continuous down to the axis in and in .
Proof.
For
[TABLE]
Now suppose , and the straight line through intersects the line at at an angle as in Figure 10.
Then as \int_{\mathbb{R}}\frac{f^{\prime}(s)}{s-z}\;{\mathord{\text{\lower 0.21529pt\hbox{\mathchar 22\relax}{\mkern-11.0mud}}}}s=\int^{\infty}_{x}\;\frac{f^{\prime}(s)}{s-z}\;{\mathord{\text{\lower 0.21529pt\hbox{\mathchar 22\relax}{\mkern-11.0mud}}}}s+\int^{x}_{-\infty}\;\frac{f^{\prime}(s)}{s-z}\;{\mathord{\text{\lower 0.21529pt\hbox{\mathchar 22\relax}{\mkern-11.0mud}}}}s, and as it follows from (11) that
[TABLE]
But
[TABLE]
We now consider general contours , which are composed curves: By definition a composed curve is a finite union of arcs which can intersect only at their end points. Each arc is homeomorphic to an interval :
[TABLE]
Here has the natural topology generated by the sets where . A loop, in particular the unit circle , is a composed curve on the understanding that it is a union of (at least) two arcs.
Although it is possible, and sometimes useful, to consider other function spaces (e.g. Hölder continuous functions), we will only consider RHPs in the sense of for .
So the first question is “What is ?”. The natural measure theory for each arc is generated by arc length measure as follows. If and are the end-points of some arc , and is any partition of (we assume succeeds in the ordering induced on by , symbolically then
[TABLE]
If we say that the arc is rectifiable and is its arc length. We will only consider composed curves that are locally rectifiable i.e. for any , is rectifiable (note that the latter set is an at most countable union of simple arcs and rectifiability of the set means that the sum of the arc lengths of these arcs is finite. In particular, the unit circle as a union of rectifiable subarcs, is rectifiable, and is locally rectifiable.) For any interval on (the case where passes through , must be treated separately — exercise!) define
[TABLE]
Now the sets form a semi-algebra (see [Royden]) and hence can be extended to a complete measure on a -algebra containing the Borel sets on . The restriction of the measure to the Borel sets is unique. For , we can define to be the set of measurable with respect to on for which,
[TABLE]
and then all the “usual” properties go through. One usually writes . For is simply the direct sum of .
Exercise 13**.**
is also equal to Hausdorff-1 measure on .
Note that if and then is not a composed curve, although and are both locally rectifiable.
For as above we define the Cauchy operator for , , by
[TABLE]
Given the homeomorphisms , the contour carries a natural orientation, and the integral here is a line integral following the orientation; if we parametrize the arcs in by arc length ,
[TABLE]
and (14) is a sum over its subarcs of integrals of the form
[TABLE]
for each , the integrand (clearly) lies in .
Now the fact of the matter is that many of the properties that were true for when , go through for in the general situation. (See, in particular, [Goluzin1969].) In particular for , the non-tangential limits
[TABLE]
exist pointwise a.e. on . Figure 11 demonstrates non-tangential limits.
Note that as is locally rectifiable, the tangent vector to the arc exists at a.e. point : the normal to bisects the cone.
Moreover,
[TABLE]
where the Hilbert transform is now given by
[TABLE]
and the points for which the non-tangential limits (15) exists are precisely the points for which the limit in (16) exists.
Again, for with ,
[TABLE]
The following issue is crucial for the analysis of RHPs:
Question**.**
For which locally rectifiable contours are the operators and bounded in ?
Quite remarkably, it turns out that there are necessary and sufficient conditions on a simple rectifiable curve for to be bounded in . The result is due to many authors, starting with Calderón [C], and then Coifman, Meyer and McIntosh [CMM], with Guy David [D] (see [Bottcher] for details and historical references) making the final decisive contribution.
Let be a simple, rectifiable curve in . For any , and any , let
[TABLE]
where is the ball of the radius centered at , see Figure 13.
Set
[TABLE]
Theorem 17**.**
Suppose . Then for any , the limit in (16) exists for a.e. and defines a bounded operator for any
[TABLE]
Conversely if the limit in (16) exists a.e. and defines a bounded operator in for some , then gives rise to a bounded operator for all , , and .
An excellent reference for the above Theorem, and more, is [Bottcher].
Remarks**.**
Additional remarks:
- (1)
Locally rectifiable curves for which are called Carleson curves, 2. (2)
the constant in (18) has the form for some continuous, increasing function, , independent of , such that .
The fact that is independent of , is very important for the nonlinear steepest descent method, where one deforms curves in a similar way to the classical steepest descent method for integrals.
Carleson curves are sometimes called AD-regular curves: the A and D denote Ahlfors and David. To get some sense of the subtlety of the above result, consider the following curve with a cusp at the origin (see Figure 14):
[TABLE]
Clearly so that the Hilbert transform is bounded in , .
Exercise 19**.**
For in Figure 14, prove directly that is bounded in . The presence of the cusp makes the proof surprisingly difficult.
Lecture 3
We now make the notion of a RHP precise (see [ClanceyGohberg, deiftzhounls, Litvinchuk1987]). Let be a composite, oriented Carleson contour in and let be a jump matrix on , with . Let be the associated Cauchy and Hilbert operators.
We say that a pair of function if there exists a (unique) function such that
[TABLE]
In turn we call , , the extension of * off * .
Definition 1**.**
Fix . Given and a measurable function on , we say that solves an inhomogeneous RHP of the first kind () if
[TABLE]
Definition 2**.**
Fix . Given and a function , we say that solves an inhomogeneous RHP of the second kind if
[TABLE]
Recall that solves the normalized RHP if, at least formally,
[TABLE]
More precisely, we make the following definition.
Definition 4**.**
Fix . We say that solves the normalized RHP if solves the with .
In the above definition, if , then clearly the extension
[TABLE]
off solves the normalized RHP in the formal sense of (3).
Let
[TABLE]
be a pointwise a.e. factorization of , i.e., for a.e. , with , and let . Let denote the basic associated operator
[TABLE]
acting on matrix valued functions . As , , the bounded operators on , for all . The utility of and will soon become clear, see Figure 15.
Theorem 5**.**
If and are such that for some , then
[TABLE]
solves if solves with . Conversely if , then
[TABLE]
solves if solves with .
The first part of this result is straightforward: Suppose solves on with . Then
[TABLE]
or with . The converse is more subtle and is left as an exercise:
Exercise 6**.**
Show .
We now show that the RHPs and , and, in particular, the normalized RHP are intimately connected with the singular integral operator .
Let and let for some . Also suppose . Set
[TABLE]
and define
[TABLE]
Then we have on , using
[TABLE]
Similarly
[TABLE]
Thus
[TABLE]
But ; i.e. for some . However, from (7)
[TABLE]
We conclude that .
Conversely, if solves then the above calculations show that satisfies
[TABLE]
Thus setting , we see that and . In particular solves iff solves the homogeneous RHP.
[TABLE]
We summarize the above calculations as follows:
Proposition 9**.**
Let . Then
[TABLE]
Moreover, if one, and hence all three of the above conditions, is satisfied, then for all
[TABLE]
where solves with the given and solves with (!), and if solves with , then
[TABLE]
Finally, if and , then (10) remains valid provided we interpret
[TABLE]
This is true, in particular, for the normalized RHP where .
Remark**.**
If is invertible, for one choice of , then (exercise) it is invertible for all choices of such that
[TABLE]
Note that if we take , in particular, then
[TABLE]
The above Proposition implies, in particular, that if solves
[TABLE]
in the sense of (11) i.e. ,
[TABLE]
then solves the normalized RHP . It is in this precise sense that the solution of the normalized RHP is equivalent to the solution of a singular integral equation (12), (13) on .
One very important consequence of the proof of Proposition 9 is given by the following
Corollary 14**.**
Let .
Let solve with the given and let solve with . Then
[TABLE]
for some constants . In particular if we know, or can show, that , or , then we can conclude from (15) or (16) that is bounded in with a corresponding bound. Conversely if we know that exists, then the above calculations show that and for corresponding constants .
Finally we consider uniqueness for the solution of the normalized RHP as given in Definition 4. Observe first that if for and for , , , then a simple computation shows that
[TABLE]
where
[TABLE]
where again , and similarly for . As clearly lies in , it follows that
[TABLE]
(Note: even if is in , even though is not bounded in .)
Theorem 19**.**
Fix . Suppose solves the normalized RHP . Suppose that exists a.e. on and , , . Then the solution of the normalized RHP is unique.
Proof.
Suppose is a 2nd solution of the normalized RHP. We have, by assumption, for some . (It is an Exercise to show that , the extension of to , is in fact .).
Then arguing as above
[TABLE]
for some .
Hence
[TABLE]
But
[TABLE]
and so . Thus or . ∎
Theorem 20**.**
If and , then the solution of the normalized RHP is unique.
Proof.
Because and , (17), (18) , where and so a.e. But as , and so . But then . Hence, if
[TABLE]
and so clearly . The result now follows from Theorem 19. ∎
These results immediately imply that the normalized RHP for MKdV with given by (18) has a unique solution in . Indeed, factorize
[TABLE]
so that
[TABLE]
But for , we have
Exercise 21**.**
Both and are orthogonal projections in and so .
Using the Hilbert-Schmidt matrix norm , we have
[TABLE]
and so, as ,
[TABLE]
It follows that for each , exists in and
[TABLE]
and the proof of the existence and uniqueness for follows from Proposition 9. On the other hand, just uniqueness alone follows from Theorem 20 as on .
Now it turns out that a key role in the theory of RHPs is played by Fredholm operators. Recall that a bounded linear operator from a Banach space to a Banach space is Fredholm if
[TABLE]
and
[TABLE]
[TABLE]
Exercise 22**.**
If is Fredholm, then ran is closed in .
Exercise 23**.**
is Fredholm iff it has a pseudo-inverse such that and where is a compact operator in and is a compact operator in .
We know that a normalized RHP , say, has a (unique) solution if exists. The situation where we know, for example, that , as in the example above so that exists, is very rare. For example, for the KdV equation on
[TABLE]
the associated RHP is exactly the same as for MKdV, except that now, generically,
[TABLE]
but
[TABLE]
Thus and the above proof of the existence and uniqueness for the RHP breaks down. A more general approach to proving the existence and uniqueness of solutions to normalized RHPs, is to attempt the following:
- •
Prove is Fredholm.
- •
Prove .
- •
Prove .
Then it follows that is a bijection, and hence the normalized RHP has a unique solution.
Let’s see how this goes for KdV with normalized RHP , but now satisfies (24), (25). By our previous comments (see Remark above), it is enough to consider the special case so that and . Thus
[TABLE]
We assume is continuous and as . Let be the operator
[TABLE]
Then
[TABLE]
as . But .
Thus
[TABLE]
and we see that
[TABLE]
But
Exercise 26**.**
\quad K\,h=C^{-}\left[\left(C^{+}\,h\left(v^{-1}-I\right)\right)(v-I)\right]\quad\text{is compact in L^{2}(\mathbb{R}).}
Hint: is a continuous function which as and hence can be approximated in by finite linear combinations of functions of the form for suitable constants and points . Then use the following fact:
Exercise 27**.**
If are compact operators in and as for some operator , then is compact.
Similarly
[TABLE]
Thus is Fredholm.
Now we use the following fact:
Exercise 28**.**
Suppose that for , is a norm-continuous family of Fredholm operators. Then for ,
[TABLE]
Apply this fact to , where we replace by in ,
[TABLE]
The proof above shows that is a norm continuous family of Fredholm operators and so as and the index of the identity operator is clearly [math].
Finally suppose
[TABLE]
Then using (8), and solve .
Consider for where is the extension of off i.e. if , , then . Then for a contour , pictured in Figure 16, as is analytic.
Letting and , we obtain (exercise) ; i.e.
[TABLE]
Taking adjoints and adding, we find
[TABLE]
But a direct calculation shows that is diagonal and
[TABLE]
Now since a.e. (in fact everywhere except ), we conclude that . But and so we see that .
The result of the above chain of arguments is that the solution of the normalized RHP for KdV exists and is unique. Such Fredholm arguments have wide applicability in Riemann–Hilbert Theory [FokasPainleve].
One last general remark. The scalar case is special. This is because the RHP can be solved explicitly by formula. Indeed, if , then it follows that and hence is given by Plemelj’s formula, which provides the general solution of additive RHPs, via
[TABLE]
and so
[TABLE]
a formula which is easily checked directly. However, there is a hidden subtlety in the business: On , say, although may go rapidly to [math] as , may wind around [math] and so may not be integrable at both . Thus there is a topological obstacle to the existence of a solution of the RHP. If , there are many more such “hidden” obstacles.
Lecture 4
RHP’s arise in many difference ways. For example, consider orthogonal polynomials: we are given a measure on with finite moments,
[TABLE]
Performing Gram-Schmidt on with respect to , we obtain (monic) orthogonal polynomials
[TABLE]
such that
[TABLE]
(Here we assume that has infinite support: otherwise there are only a finite number of such polynomials.)
Associated with the ’s are the orthonormal polynomials
[TABLE]
such that
[TABLE]
Orthogonal polynomials are of great historical and continuing importance in many different areas of mathematics, from algebra, through combinatorics, to analysis. The classical orthogonal polynomials, such as the Hermite polynomials, the Legendre polynomials, the Krawchouk polynomials, are well known and much is known about their properties. In view of our earlier comments it should come as no surprise that much of this knowledge, particularly asymptotic properties, follows from the fact that these polynomials have integral representations analogous to the integral representation for the Airy function in the first lecture. For example, for the Hermite polynomials
[TABLE]
one has the integral representation
[TABLE]
where is a (small) circle enclosing the origin, (Note: the ’s are not monic, but are proportional to the ’s, where the ’s are explicit) and the asymptotic behavior of the ’s follow from the classical steepest descent method. For general weights, however, no such integral representations are known.
The Hermite polynomials play a key role in random matrix theory in the so-called Gaussian Unitary, Orthogonal and Symplectic Ensembles. However it was long surmised that local properties of random matrix ensembles were universal, i.e., independent of the underlying weights. In other words if one considers general weights such as etc., instead of the weight for the Hermite polynomials, the local properties of the random matrices, at the technical level, boil down to analyzing the asymptotics of the polynomials orthogonal with respect to the weights , , etc., for which no integral representations are known. What to do?
It turns out however, that orthogonal polynomials with respect to an arbitrary weight can be expressed in terms of a RHP. Suppose , for some such that
[TABLE]
and suppose for simplicity that
[TABLE]
Fix and let solve the RHP normalized so that
[TABLE]
Exercise 3**.**
Show that we then have (see e.g. [DeiftOrthogonalPolynomials])
[TABLE]
where is the Cauchy operator on , are the monic orthogonal polynomials with respect to and is the normalization coefficient for as in (1). (Note that by (2) and Theorem 12, is continuous down to the axis for all .) This discovery is due to Fokas, Its and Kitaev [FIK]. Moreover this is just exactly the kind of problem to which the nonlinear steepest descent method can be applied to obtain ([Deift1999, DeiftWeights4]) the asymptotics of the ’s with comparable precision to the classical cases, Hermite, Legendre, , and so prove universality for unitary ensembles (and later, Deift and Gioev, Shcherbina, for Orthogonal & Symplectic Ensembles of random matrices, see [DeiftGioev] and the references therein).
As mentioned earlier, RHPs are useful not only for asymptotic analysis, but also to analyze analytical and algebraic issues. Here we show how RHPs give rise to difference equations, or differential equations, in other situations.
Consider the solution for the orthogonal polynomial RHP . The key fact is that the jump matrix is independent of : the dependence on is only in the boundary condition
[TABLE]
So we have and .
Let . Then
[TABLE]
Hence has no jump across and so, by an application of Morera’s Theorem, is in fact entire. But as
[TABLE]
Thus must be a polynomial of order 1,
[TABLE]
for suitable and , or,
[TABLE]
which is a difference equation for orthogonal polynomials with respect to a fixed weight.
Exercise 5**.**
Make the argument leading to (4) rigorous (why does exist, etc.)
Exercise 6**.**
Show that (4) implies the familiar three term recurrence relation for orthogonal polynomials
[TABLE]
.
Whereas the RHP for orthogonal polynomials comes “out of the blue”, there are some systematic methods to produce RHP representations for certain problems of interest. This is true in particular for RHPs associated with ordinary differential equations. For example, consider the ZS–AKNS equation (Zakharov-Shabat, Ablowitz-Kaup-Newell-Segur)
[TABLE]
(see e.g. [deiftzhounls]). Here and at some sufficiently fast rate as . Equation (7) is intimately connected with the defocusing Nonlinear Schrödinger Equation (NLS) by virtue of the fact that the operator
[TABLE]
undergoes an isospectral deformation if solves NLS
[TABLE]
In other words, if solves NLS then the spectrum of
[TABLE]
is constant: Thus the spectrum of provides constants of the motion for (9), and so NLS is “integrable”. The key fact is that there is a RHP naturally associated with which expresses the integrability of NLS in a form that is useful for analysis. Here we follow Beals and Coifman, see [BC]. Let in (8) be given with as sufficiently rapidly. Then for any ,
Exercise 10**.**
The equation has a unique solution such that as and is bounded . Such are called Beals-Coifman solutions.
Remark 11**.**
These solutions have the following properties:
- (1)
For fixed , is analytic in , and is continuous down to the axis. That is exist for all . 2. (2)
For fixed , as ,
[TABLE]
for some matrix residue term .
Now clearly , are two fundamental solutions of and so for ,
[TABLE]
for all , where is independent of . In other words, by (1) of Remark 11, solves a RHP , normalized as in (12). In this way differential equations give rise to RHPs in a systematic way.
One can calculate (exercise) the precise form of and one finds
[TABLE]
where, again (cf. (18) for MKdV) we have for , the reflection coefficient,
[TABLE]
Now the map
[TABLE]
is a bijection between suitable spaces: , the direct map, is constructed from via the solutions as above. The inverse map is constructed by solving the RHP normalized by (12) for any fixed . One obtains
[TABLE]
(cf (19) for MKdV).
Now if solves NLS then evolves simply,
[TABLE]
i.e. linearizes NLS. This leads to the following formula for the solution of NLS with initial data
[TABLE]
The effectiveness of this representation, which one should view as the RHP analog of NLS of the integral representation (2) for the Airy equation, depends on the effectiveness of the nonlinear steepest descent method for RHPs.
Question**.**
Where in the representation (14) is the information encoded that solves NLS?
The answer is as follows. Let be the solution of the RHP with jump matrix
[TABLE]
normalized as in (12). Set and observe that
[TABLE]
for which the jump matrix is independent of and . This means that we can differentiate (15) with respect to and , and conclude, as in the case of orthogonal polynomials, that and are entire, and evaluating these combinations as , we obtain two equations
[TABLE]
for suitable polynomials matrix functions and . These functions constitute the famous Lax pair for NLS. Compatibility of these two equations requires
[TABLE]
which reduces directly to NLS. In this way RHP’s lead to difference and differential equations.
Another systematic way that RHP’s arise is through the distinguished class of so-called integrable operators. Let be an oriented contour in and let and be bounded measurable functions on . We say that an operator acting on , is integrable if it has a kernel of the form
[TABLE]
for such functions ,
[TABLE]
Integrable operators were first singled out as a distinguished class of operators by Sakhnovich [sakh] in the late 1960’s, and their theory was developed fully by Its, Izergin, Korepin and Slavnov [IIKS] in the early 1990’s (see [Deift1999a] for a full discussion). The famous sine kernel of random matrix theory
[TABLE]
is a prime example of such an operator, as is likewise the well-known Airy kernel operator.
Integrable operators form an algebra, but their most remarkable property is that their inverses can be expressed in terms of the solution of a naturally associated RHP. Indeed, let be the solution of the normalized RHP where
[TABLE]
(Here we assume for simplicity that , for all as in the sine-kernel: otherwise (16) must be slightly modified).
Then has the form where is an integrable operator
[TABLE]
and
[TABLE]
This means that if, for example, depends on parameters, as in the case of the sine kernel, asymptotic problems involving as the parameters become large, are converted into asymptotic problems for a RHP, to which the nonlinear steepest descent method can be applied.
As an example, we show how to use RHP methods to give a proof of Szegő’s celebrated Strong Limit Theorem. Let be the unit circle.
Theorem 18** (Szegő Strong Limit Theorem).**
Let , where and are Fourier coefficients of . Let be the Toeplitz determinant generated by , where is the matrix with entries , and are the Fourier coefficients of . Then as ,
[TABLE]
Sketch of proof.
Let , be the standard basis in . Then the map , , takes onto the trigonometric polynomials of degree and induces a map
[TABLE]
which is conjugate to .
We then calculate
[TABLE]
Now for any
[TABLE]
After some simple calculations (Exercise) one finds that
[TABLE]
where is the integrable operator on with kernel of the form
[TABLE]
where
[TABLE]
We have, in particular, from (19) and (20), for ,
[TABLE]
and for and one easily shows that
[TABLE]
Thus is finite rank, and hence trace class, and has block form with respect to the orthonormal basis for as given in Figure 17. And so
[TABLE]
Associated with the integrable operator we have the normalized RHP where, by (16), (22)
[TABLE]
on . Now
[TABLE]
For , set
[TABLE]
Clearly and . Now and so we have from (21)
[TABLE]
and it follows that in (24)
[TABLE]
where
[TABLE]
where by (17)
[TABLE]
Here refers to the solution of the RHP where involves rather than in (23), and similarly for .
Hence (Exercise)
[TABLE]
So we see that in order to evaluate as we must evaluate the asymptotics of the solution of the normalized RHP as , for each , and substitute this information into (26) using (25). This is precisely what can be accomplished [Deift1999a] using the nonlinear steepest descent method.
Here we present the nonlinear steepest descent analysis in the case when is analytic in an annulus
[TABLE]
around . The idea of the proof, which is a common feature of all applications of the nonlinear steepest descent method, is to move the term (or its analog in the general situation) in into and the term into : then as , these terms are exponentially small, and can be neglected.
But first we must separate the and terms of algebraically. This is done using the lower-upper pointwise factorization of
[TABLE]
which is easily verified.
Extend where we choose . Now define a piecewise analytic function by the definitions in Figure 18.
This definition is motivated by the fact that
[TABLE]
as in (27). It follows that solves the normalized RHP where
[TABLE]
Now as , on and on . This means that where solves the normalized RHP where
[TABLE]
But this RHP is a direct sum of scalar RHP’s and hence can be solved explicitly, as noted earlier (cf. (29)). In this way we obtain the asymptotics of as and hence the asymptotics of the Toeplitz determinant . ∎
Here is what, alas, I have not done and what I had hoped to do in these lectures (see AMS open notes):
- •
Show that in addition to the usefulness of RHP’s for algebraic and asymptotic purposes, RHP’s are also useful for analytic purposes. In particular, RHP’s can be used to show that the Painlevé equations indeed have the Painlevé property.
- •
Show that in addition to RHP’s arising “out of the blue” as in the case of orthogonal polynomials and systematically in the case of ODE’s and also integrable operators, RHP’s also arise in a systematic fashion in Wiener–Hopf Theory.
- •
Describe what happens to an RHP when the operator is Fredholm, but not bijective, and
- •
Finally, I have not succeeded in showing you how the nonlinear steepest descent method works in general. All I have shown is one simple case.
\bibspread
References
