A phase transition for non-intersecting Brownian motions, and the Painleve II equation
Steven Delvaux, Arno B. J. Kuijlaars
Introduction and statement of results
This paper deals with non-intersecting Brownian motions with two fixed starting positions , and two fixed ending positions , . Let us first describe the general framework in which this paper fits.
.
Consider one-dimensional Brownian motions (actually Brownian bridges) such that of them start from the point at time , for , and of them arrive in the point at time , for , and such that the particles are conditioned not to collide with each other in the time interval .
We are interested in the limiting behavior where the number of Brownian particles tends to infinity in such a way that each of the fractions , and , has a limit in . To obtain non-trivial limiting behavior we assume that the transition probability density of the Brownian motions scales as
where is a parameter (the inverse of the overall variance) that increases as increases. In a non-critical regime we will simply take .
Under these assumptions, it is expected that the particles will asymptotically fill a bounded region in the time-space plane (-plane). It is also expected that for every , the particles at time are asymptotically distributed according to some well-defined limiting distribution. See Figures 1 and 2 for possible behaviors when and , respectively.
It is natural to ask for an explicit description of this limiting distribution. Such a result is known in the classical case where , which is connected to Dyson’s Brownian motion . Here it is known that up to a suitable scaling and translation, the Brownian particles at time have the same joint distribution as the eigenvalues of the Gaussian unitary ensemble (GUE) of size , and the limiting distribution as is given by Wigner’s semicircle law. More precisely, if all Brownian motions start from at time and end up at at time , and if , then the non-intersecting Brownian particles at time are asymptotically distributed on the interval with endpoints
and with limiting density of the particles given by the semicircle law on that interval
By varying , the endpoints (1.2), (1.3) parameterize an ellipse in the time-space plane, see Figure 1.
Explicit descriptions of the limiting distribution of the non-intersecting Brownian motions are also known when , . Also in this case there is an underlying random matrix model .
The limiting distribution is also known when , , , and . In this case the limiting distribution as of the Brownian particles at time is obtained from a certain algebraic curve of degree four . In contrast to the previous cases, however, it is not known if the Brownian particles for finite can be described as the eigenvalues of a random matrix ensemble. See Figure 2 for an illustration of this case.
2 Separation of the endpoints
The main results of this paper will concern non-intersecting Brownian motions with two starting points at time , two ending points at time , and in addition
which are varying with , then we assume that
for certain limiting values . We also assume that increases with such that
If the assumptions (1.5)–(1.9) hold, and if the separation between the starting points and , and the ending points and is large enough, then in analogy with (1.2)–(1.4), one would expect the Brownian particles to be asymptotically distributed on two disjoint ellipses in the -plane, whose intersections with the vertical line through are given by the two intervals and with
for , and with limiting densities on these two intervals given by the semicircle laws
for each . This situation is illustrated in Figure 2. Note that
We derive the precise condition for this two-ellipse scenario to happen. It is clear that a necessary condition is the disjointness of the two ellipses.
(Disjointness of the two ellipses) The two ellipses parameterized by (1.10)–(1.11) are disjoint if and only if
proof. The two ellipses are disjoint if and only if for all . From (1.10)–(1.11) this leads to the condition
which after putting is equivalent to
The left-hand side is a quadratic expression in , whose discriminant is negative if and only if (1.13) holds. The lemma then easily follows since and .
We will call (1.13) the case of large separation.
(Large, critical and small separation) For each , consider non-intersecting Brownian motions with two starting points at time and two ending points at time , and assume that the hypotheses (1.5)–(1.9) hold. If (1.13) holds, we say that we are in a situation of large separation of the endpoints. If instead
we are in a situation of small separation, and if
we are in a situation of critical separation between the endpoints. In the latter case, we define the critical time as
The non-intersecting Brownian motions corresponding to each of these three cases are illustrated in Figure 2–2. In the case of critical separation, the time is precisely the time where the two ellipses with endpoints parameterized by (1.10)–(1.11) are tangent, cf. Figure 2.
We may equivalently view the critical behavior in terms of the temperature parameter . With , , and fixed for , there is a critical temperature
such that (low temperature), (high temperature), and (critical temperature) correspond to large, small, and critical separation, respectively.
3 Large separation: decoupling of the Brownian motions
The case of small separation of the endpoints was considered in for the special case when . In the present paper, we will focus instead on the cases of large and critical separation. As is to be expected, in these regimes the Brownian motions asymptotically decouple into two separate groups, as is evidenced by Figures 2 and 2. This is our first main theorem.
(Decoupling of Brownian motions) Consider non-intersecting Brownian motions with two starting points at time and two ending points at time . Assume that the hypotheses (1.5)–(1.9) hold, and assume that either
there is large separation of the endpoints (1.13), or
there is critical separation of the endpoints (1.16) and , where is given by (1.17).
Then as the Brownian particles at time are asymptotically supported on the two disjoint intervals and given by (1.10)–(1.11), with limiting densities given by the semicircle laws (1.12).
In the case of critical separation, we strongly expect that the conclusion of the theorem should also be valid when . However, we will not consider the critical time in this paper.
Our proof of Theorem 1.3 follows from a steepest descent analysis of the underlying Riemann-Hilbert problem that will be described in Section 1.4. The Riemann-Hilbert problem is of size and it was also used in to analyze the case of small separation. In the (apparently) simpler case of large separation one expects that for large , the RH problem asymptotically decouples into two smaller RH problems of size . This is indeed the case, but in order to show this, we need a preliminary transformation where we introduce auxiliary curves in the complex plane and subsequently perform a Gaussian elimination step in the jump matrix of the RH problem, serving to annihilate some undesired entries of this matrix. This Gaussian elimination step is similar to the so-called global opening of the lens discussed in .
It follows from our analysis that the interaction between the two groups of Brownian particles decays exponentially with in case of large separation, and polynomially (like a power ) in case of critical separation at a non-critical time. In the limit when the particles will then indeed be distributed inside two disjoint ellipses in the time-space plane.
4 Riemann-Hilbert problem
The non-intersecting Brownian motions described in the previous subsections are related to the following Riemann-Hilbert problem (RH problem) which we already alluded to above. The RH problem was introduced in as a generalization of the RH problem for orthogonal polynomials in , see also . In accordance with Section 1.1 we will state the RH problem for general numbers of starting and ending positions of the Brownian motions, although in our applications we will eventually take .
The RH problem consists in finding a matrix-valued function of size by such that
where denotes the identity matrix of size ; where denotes the rank-one matrix (outer product of two vectors)
The RH problem has a unique solution that can be described in terms of certain multiple orthogonal polynomials (actually multiple Hermite polynomials); details will be given in Section 1.6.
Let us explain the connection between the non-intersecting Brownian motions and the RH problem in the case . It is well-known , see also , that the distribution of the non-intersecting Brownian motions at time describes a determinantal point process, determined by an associated correlation kernel. According to the correlation kernel can be expressed in terms of the solution to the RH problem as
By general properties of determinantal point processes, Theorem 1.3 then comes down to the statement that under the conditions of Theorem 1.3, the limit of as exists and is equal to
for . This is what we will show in Sections 2 and 3.
Our method will also allow us to obtain the local scaling limits of the correlation kernel that are common in random matrix theory and related areas, namely the sine kernel in the bulk and the Airy kernel at the endpoints of the intervals and . We will not go into details about this in this paper.
5 Critical separation and the double scaling limit
where can be interpreted as a temperature variable. For (critical temperature) we have by (1.16), (1.25) and Theorem 1.3 that in the large limit, the particles fill out two ellipses, which are tangent to each other at the critical time , see Figure 2. By varying around the critical value we move from a case of disjoint ellipses (for ) to a case of small separation (for ), where the two-ellipses scenario is not valid anymore. Hence we see a phase transition in the case of critical separation, which is clearly seen at the critical time . At a non-critical time the phase transition is less obvious, but there is also a nontrivial transitional effect. Indeed, the distribution of particles at time in the case of small separation differs from the distribution of two semicircle laws of two disjoint intervals, which it is for large separation. Hence the endpoints of the intervals do not depend analytically on the starting and ending points, which indicates the phase transition. It is a surprising outcome of our analysis that the phase transition for the case where can be described by the Painlevé II equation.
In the case of critical separation we investigate the behavior of the Brownian particles in a double scaling limit where , and simultaneously . More precisely, we consider the endpoints , , , fixed so that (1.25) holds for all . The temperature is varying with as follows:
We will show that in the double scaling regime described above, the steepest descent analysis of the Riemann-Hilbert problem leads in a natural way to a model Riemann-Hilbert problem related to the Painlevé II equation. More precisely, we will be led to the construction of a local parametrix that can be mapped onto the model RH problem satisfied by the -functions (Lax pair) associated with the Hastings-McLeod solution of the Painlevé II equation
The Hasting-McLeod solution is the special solution of (1.27) which is real for real and satisfies as , where Ai denotes the usual Airy function. The precise form of the model RH problem will be described in Section 3.3.
The Hastings-McLeod solution of the Painlevé II equation also appears in the famous Tracy-Widom distributions for the largest eigenvalues of large random matrices. It also appears in the critical unitarily invariant matrix models, where the parameters in the model are fine-tuned so that the limiting mean eigenvalue density vanishes quadratically at an interior point of its support . In this case it leads to a new family of local scaling limits of the eigenvalue correlation kernel that involve the -functions associated with .
In our situation the Painlevé II equation does not manifest itself in the local scaling limits of the correlation kernel. The construction of the local parametrix is done at a point strictly outside of the support and it does not influence the local correlation functions for the positions of any of the particles. The point does not seem to have any physical meaning.
We emphasize that our asymptotic analysis will be only valid when . At the critical time where the two ellipses are tangent, one is led to a considerably more difficult, multi-critical situation. Here one expects the appearance of a model RH problem related to some as yet unknown fourth order ODE. As already mentioned, we will not attempt to study this case in the present paper.
6 Generalities on multiple orthogonal polynomials
While the appearance of the Hastings-McLeod solution of the RH problem does not affect any of the local scaling limits, it is felt by the recurrence coefficients of the multiple Hermite polynomials. These polynomials appear in the solution of the RH problem given in Section 1.4.
To state the results, let us first recall some generalities on multiple orthogonal polynomials in the sense of . In accordance with Sections 1.1 and 1.4 we will again give the definitions for general values of and , although in our applications we will eventually take .
Put , and similarly for and . Assume . We say that a sequence of polynomials is multiple orthogonal with respect to the above data if (i) the polynomials have degrees bounded by :
for and .
Note that (1.30) states that has vanishing moments with respect to the weight , .
A schematic illustration of Definition 1.4 is shown in Figure 3. Let us comment on this figure. The left part of the figure shows the polynomials and their corresponding number of free coefficients , . The middle part of the figure shows how the polynomials should be assembled into the function defined in (1.29). Finally, the right part of the figure schematically shows the orthogonality relations of with respect to the different weights , and it shows next to each weight also the number of vanishing moments of with respect to this weight.
We will refer to the polynomials in Definition 1.4 as multiple orthogonal polynomials (MOP). Note that these polynomials were called multiple orthogonal polynomials of mixed type in and mixed MOPs in . We will also find it convenient to use the vectorial notation . To stress the dependence on the multi-indices , we will sometimes write and similarly .
The coefficients of the multiple orthogonal polynomials in Definition 1.4 can be found from a homogeneous linear system with unknowns (polynomial coefficients) and equations (orthogonality conditions). The restriction in Definition 1.4 guarantees that this system has a nontrivial solution. In fact, the solution space to this linear system will be at least one-dimensional. This corresponds to the fact that the MOP are only determined up to some multiplicative factor. If the MOP are unique up to a multiplicative factor then the pair of indices is called normal .
The fact that the multiple orthogonal polynomials are only determined up to some multiplicative factor allows for different choices of normalization.
(Normalization types of MOP; cf. ) Assume the data in Definition 1.4 and assume that is a normal pair of indices. Then the MOP in Definition 1.4 are said to satisfy
the normalization of type I with respect to the th index, , if the th moment of with respect to is equal to one, i.e., if
the normalization of type II with respect to the th index, , if the leading coefficient of is equal to one, i.e., if
The vectors of MOP corresponding to the above normalizations will be denoted as and , respectively.
The above normalizations might not always be possible. The type normalization is not possible in those cases where the integral on the left side of (1.31) is equal to zero. Similarly, the type normalization is not possible in those cases where the th polynomial has degree strictly smaller than .
As mentioned above, the MOP appear in the solution of the RH problem in Section 1.4. Let us describe this is somewhat more detail.
Recall that in Definition 1.4 we needed the condition to ensure the existence of the multiple orthogonal polynomials. But let us now assume that . In this case, the definition of MOP makes no sense. Indeed, the coefficients of the MOP would then solve a homogeneous linear system with as many equations as unknowns, which has in general only the trivial solution.
Therefore, to apply the definition of MOP in a meaningful way for a pair of multi-indices satisfying , we should first adapt the multi-indices. There are essentially ways to proceed:
One can increase one of the components , i.e., one can work with the pair of multi-indices , for some .
One can decrease one of the components , i.e., one can work with the pair of multi-indices , for some .
Here denotes the vector which has all its entries equal to zero, except for the th entry which equals one. The length of should be clear from the context.
Let us discuss the MOP corresponding to each of the pairs of multi-indices above. In the case of a pair of multi-indices , we are dealing with multiple orthogonal polynomials where the th polynomial , has increased degree; it will be natural to normalize the resulting MOP such that this th polynomial is monic, i.e., to work with a normalization of type . This leads to the vector of MOP
In the case of a pair of multi-indices , we are dealing with multiple orthogonal polynomials where the th orthogonality condition, has a decreased number of vanishing moments; it will be natural to normalize the resulting MOP such that this omitted moment equals one, i.e., to work with a normalization of type . This leads to the vector of MOP
Of course we are assuming here that all type I and type II normalizations in (1.33) and (1.34) exist. It turns out that the existence of each of these vectors of MOP is equivalent to a single condition , to which we will loosely refer here as the solvability condition. This condition will always be satisfied in the case of Gaussian weight functions (1.18)–(1.19).
Now we can use the above MOP to solve the RH problem in Section 1.4. Indeed, the vectors of MOP in (1.33), (1.34) are row vectors of length , and they can therefore be stacked into the first columns of a matrix of size . Denote with such a matrix. The entries in the remaining columns of are defined as Cauchy transforms of the functions and defined as in (1.29). More precisely, the last entries in the rows of are defined by
(Solution to the Riemann-Hilbert problem; cf. ) Let with be such that the solvability condition holds. Then there exists a unique solution of the RH problem in Section 1.4. This solution is given by
where is the matrix constructed from the MOP as described above, and where .
For example, in the special case where , the solution of the Riemann-Hilbert problem in Section 1.4 is given by the matrix
where , and where the entries denoted with are certain Cauchy transforms as in (1.35) and (1.36). The latter entries will be irrelevant in what follows.
7 Recurrence relations for multiple Hermite polynomials
In analogy with the three-term recurrence relations for classical orthogonal polynomials on the real line, one can show that the multiple orthogonal polynomials in Section 1.6 satisfy certain term recurrence relations. We will state these relations in the case of multiple Hermite polynomials, i.e., when the weight functions of the MOP are given by the Gaussians (1.18)–(1.19). For simplicity, we assume throughout that , as in (1.37).
Define the next term in the asymptotic expansion of in (1.22) as
The entries of the matrix in (1.38) will be denoted by .
(Recurrence relations for multiple Hermite polynomials) Assume and let the weight functions be defined by (1.18)–(1.19). Then the multiple Hermite polynomials in (1.37) satisfy the -term recurrence relations
Here we denote with the entries of the matrix in (1.38).
The proof of Proposition 1.7 will be given in a more general setting in Section 5.1. The explicit form of the first term in the right-hand side of each of (1.39)–(1.42) is only valid under the assumption of Gaussian weight functions (1.18)–(1.19); the explicit form of these terms will be established in Section 5.6.1.
Note that the recurrence relations (1.39)–(1.42) contain several recurrence coefficients of the form with ; it will be convenient to collect them in the by matrix
It turns out that there exist certain connections between these recurrence coefficients.
(Relations between recurrence coefficients) Assume and let the weight functions be defined by (1.18)–(1.19). Then the by submatrix
of (1.43) has row sums equal to , , and column sums equal to , . Next, assume that and . Then all the recurrence coefficients in (1.43) can be expressed in terms of and alone, by means of the following relations:
Note that (1.45)–(1.47) follow immediately from the stated row and column sum relations for the matrix (1.44). The latter will be established for general values of and in Section 5.4; see also Section 5.5 for a spectral curve interpretation of these relations. On the other hand, the equation (1.48) will be established (in a slightly more general form) in Section 5.6.2.
8 Painlevé II asymptotics for recurrence coefficients
Finally we are in position to formulate the Painlevé II asymptotics of the recurrence coefficients in (1.39)–(1.42) under the double scaling regime in Section 1.5. This is our second main result. We first consider the off-diagonal recurrence coefficients, i.e., the recurrence coefficients of the form with .
(Asymptotics of off-diagonal recurrence coefficients) Assume the double scaling regime (1.25)–(1.26), and let be a non-critical time, i.e., . Define the constants
where is defined in (1.26). Then we have
as , where denotes the Hastings-McLeod solution to the Painlevé II equation. The asymptotic behavior of the other recurrence coefficients with is then determined by (1.45)–(1.48) in Proposition 1.8.
The key point of Theorem 1.9 is that it shows that the Painlevé II equation shows up in the large behavior of the recurrence coefficients in the case of critical separation at a non-critical time.
(The case of large separation) Using the results in this paper, one can prove a similar result for the case of large separation of the endpoints (1.13). In this case, it can be shown that there exists a constant such that
(The case of small separation) Performing a similar analysis of the results in , one can show that in case of small separation of the endpoints (1.15), and assuming the additional hypothesis , the following expansions hold:
We have a similar theorem for the diagonal recurrence coefficients in (1.39)–(1.42), i.e., for the first terms in the right-hand side of each of these equations.
(Asymptotics of diagonal recurrence coefficients) Under the same assumptions as in Theorem 1.9 we have that
9 Phase diagram
The main results of this paper and their relation to the other results known in the literature can be nicely summarized by means of a phase diagram. See Figure 4.
Let us comment on Figure 4. Assume that the endpoints , , are fixed and satisfy the critical separation (1.25). The horizontal axis in the figure denotes the time and the vertical axis denotes the temperature . The diagram is divided into different regions according to the behavior of the limiting distribution for of the non-intersecting Brownian motions at time and temperature . The region where corresponds to the case of large separation; according to Theorem 1.3 the limiting distribution is given here by two semicircles on the two disjoint intervals and . At temperature , these two intervals meet each other at a certain critical time . When further increases, the intersection region between the two groups of Brownian motions starts to grow; this is indicated by the boldface curve in the middle of the picture. In the region below this curve but above , the limiting distribution at time is still supported on two disjoint intervals, but now with distribution described in terms of a certain algebraic curve of degree 4 , rather than semicircle laws. In the region above the curve, the limiting distribution is on one interval .
In case where , one can find an explicit description of the boundary curve in Figure 4 from the results in ; it turns out that this curve is given by the equation
The curve plotted in Figure 4 corresponds to the choice of endpoints and hence .
Figure 4 also displays the phase transitions between the different regions. On the horizontal line the phase transition is described in terms of the Painlevé II equation as shown in this paper. On the curve (1.61) one expects a description in terms of the Pearcey kernels; although for the case of two starting and two ending points this has not been strictly proven. For the case of non-intersecting Brownian motion with one starting and two ending points, the Pearcey kernels were obtained in (in the equivalent setting of Gaussian random matrices with external source), see also . Finally, at the place where the two curves in Figure 4 meet, one expects a phase transition in terms of an as yet unknown family of kernels. This is indicated by the question mark in the figure.
10 Outline of the paper
The remainder of this paper is organized as follows. In Sections 2 and 3 we apply the Deift-Zhou steepest descent analysis to the Riemann-Hilbert problem for multiple Hermite polynomials. We perform this analysis for the case of large separation in Section 2 and for the case of critical separation at a non-critical time in Section 3, leading to the proof of Theorem 1.3. In the critical case we are also led to a local parametrix for the RH problem in terms of the Painlevé II equation. Next, we investigate the large asymptotics of the recurrence coefficients of the multiple Hermite polynomials under the double scaling regime. This is done in Section 4, leading to the proof of Theorems 1.9 and 1.12. Finally, the Propositions 1.7 and 1.8 are established in Section 5.
Steepest descent analysis in the case of large separation
In this section we analyse the non-intersecting Brownian motions in case of large separation between the endpoints (1.13). Using the Deift/Zhou steepest descent analysis of the Riemann-Hilbert problem, we show that the interaction between the two groups of Brownian particles decays exponentially with , thereby establishing Theorem 1.3.
Our starting point is the RH problem (1.20)–(1.22) with and in addition and . As in (1.6) we write . Without loss of generality we take (i.e., ). For the case of large separation corresponds to . Since as , we already assume that is so large that
Thus satisfies the following RH problem.
The entries of the rank-one block in (2.1) can be written explicitly as
It will be convenient to write the diagonal entries of (2.1) as
Our goal is to show that in the large limit the matrix valued RH problem for essentially decouples into two smaller problems with weight functions (2.3) and (2.4). To show that this decoupling indeed occurs, we need to show that in some sense, the off-diagonal entries in (2.1) can be neglected with respect to the diagonal entries of (2.1). More precisely, one expects that
around the interval , the entry of (2.1) is dominant (as ) with respect to the other three entries.
around the interval , the entry of (2.1) is dominant with respect to the other three entries.
Here , for are as in (1.10)–(1.11).
Remarkably, these expectations are not confirmed by a straightforward steepest descent analysis in which the first transformation of the RH problem is based on the two semicircle densities (1.12) and the corresponding -functions. This approach turns out to be successful only for near the critical time defined in (1.17). When is sufficiently close to however, one runs into difficulties since then
the entry of (2.1) blows up (i.e., becomes exponentially large when ) somewhere in the interval , and
the entry of (2.1) blows up somewhere in the interval .
Similar problems occur when is close to , but then with the roles of the and entries of reversed.
In order to prevent the blow-up of undesired entries, we make a first preliminary transformation that is described in the next subsection. The transformation is different for the two cases and . For definiteness we assume from now on
The case where is similar and the corresponding modifications will be briefly commented on later.
2 First transformation: Gaussian elimination in the jump matrix
The first transformation of the RH problem is a Gaussian elimination step for the jump matrix, serving to annihilate some of the undesired entries in (2.1). This elimination step will be at the price of introducing new jump matrices on certain contours , in the complex plane. This transformation is similar to the so-called global opening of the lens discussed in .
for . Since is varying with , the quantities (2.8)–(2.9) are also varying with . For they tend to and given by (1.10)–(1.11) with . Define the corresponding semicircle laws
which are also (slightly) varying with .
We take a reference point and we choose unbounded contours , in the complex plane, crossing the real axis in points , so that
Thus satisfies the following RH problem.
For the asymptotic condition (2.14) we note that
Note also that the jump matrices on and tend to the identity matrix as .
What we have gained is that in the jump matrices on the intervals and , the first and second columns of the top right block (2.1) of the jump matrix have been eliminated, respectively.
The description of the Gaussian elimination step above has been done under the assumption (2.7), i.e., . The case where is different since it requires other entries of the jump matrix to be eliminated in the different regions of the complex plane. In order to do so one would define differently as (compare with (2.11), (2.12))
The further steps in the steepest descent analysis will then be similar to the case where and we will not discuss this any further.
Alternatively, the results for could be reduced to those for by virtue of the involution symmetry to be discussed in Section 5.3.3; a further note about this will be given in Remark 4.5.
3 Second transformation: g𝑔g-functions
The second transformation is the normalization of the RH problem at infinity. To this end we use the so-called -functions.
As said before, in the limit we expect the Brownian particles to be distributed on two separate intervals and (recall is fixed), with limiting densities given by the two Wigner semicircle laws (1.12).
For finite , we have defined and by (2.8)–(2.9) and the densities (2.10) that are varying with . We use the -functions corresponding to these varying semicircle densities. We define
It follows from the above observations and from the definitions (2.5), (2.6), (1.10)–(1.11) that
Moreover, from the signs of the square roots in (2.18) and (2.19) we have
The above equations (2.22)–(2.25) are the Euler-Lagrange variational conditions for the equilibrium measure under an external field. Indeed, the Wigner semicircle laws (2.10) (after normalization by a factor ) are the equilibrium measures in the presence of the quadratic external fields , , respectively, see . The fact that in (2.5) has a factor in its denominator can be interpreted by noting that for , the external field gets stronger and stronger and hence the (potential theoretic) electrostatic particles are pushed together onto a narrower and narrower interval, which is confirmed by (2.8)–(2.9).
Now we use the -functions to normalize the RH problem at infinity. We define a new matrix-valued function by
The RH problem for is normalized at infinity in the sense that
as . This follows from the fact that as for , so that
as . Hence the factor in (2.26) cancels the powers of appearing in (2.14). Also note that the similarity relation with the matrix in (2.26) does not change the asymptotics (2.29).
Using (2.34) and after a little calculation, we find that we can write all jump matrices in the RH problem for as shown in Figure 6. On the jump matrix is
Thus satisfies the following RH problem.
4 Asymptotic behavior of the jump matrices
In this subsection, we investigate the asymptotic behavior in the large limit of each of the jump matrices in the RH problem for in Figure 6. Our goal is to show that all the jump matrices are exponentially close (as ) to the identity matrix, except for the jump matrices on the intervals and which have an oscillatory behavior. To be able do so we still have the freedom to take the reference point and the contours and in an appropriate way. We also have the constant in (2.28) at our disposal.
In what follows we will make extensive use of the -functions which are essentially the derivatives of the -functions. We define
Inserting (2.18)–(2.19) and (2.8)–(2.9) into these expressions, we obtain after some simplification,
proof. All statements immediately follow from (2.43), except maybe the statement of part (c). Part (c) follows from the fact that
which is indeed non-negative because of our assumption (2.7).
The main property of the -functions is contained in the following lemma. It will only be valid under the large separation assumption, as we will see in the proof.
There is a value such that
proof. We prove the lemma in two steps. In the first step we show that there exists such that
This we can do by giving the explicit value
which means that lies between the midpoints of the two intervals, and so in particular .
Because we are assuming that we are in a situation of large separation we have so that we obtain from (2.46)
It then follows that both factors on the left-hand sides of (2.47) and (2.48) are positive, so that
Furthermore, we obtain from (2.47) and (2.48)
it follows from (2.49) that , as claimed as well.
If , then , and since by what we already proved, the inequality holds for some , there also exists where equality holds. Then by the monotonicity properties of the -functions (stated in parts (a) and (b) of Lemma 2.2)
Then by slightly increasing we find such that the inequalities (2.44) hold (with strict inequalities).
If , then as above we have
Then for slightly larger than , we have (2.44) with strict inequalities, since and , see formulas (2.43).
If , then . Since is increasing we find , see Lemma 2.2. Thus there exists with . We have , , and
again by Lemma 2.2, so that and the inequalities (2.44) hold.
It follows from the proof that in most cases we may assume that the inequalities (2.44) are strict. Only if then and then we can only obtain
After the preliminaries on the -functions we consider the jump matrices on and . We want that the jump matrices on these curves, shown in Figure 6, are exponentially close to the identity matrix as . Thus we want to choose and so that
for certain constants , that do not depend on .
We take the point satisfying the inequalities (2.44) of Lemma 2.3. We have by (2.34)
The constant is still at our disposal. We choose it here so that (2.54) vanishes for . Thus
see (2.37), we can then find and sufficiently close to so that and
We will choose and so that they cross the real axis in and , respectively. It remains to show that they can be extended to infinity, while remaining in the open sets
The fact that we can indeed choose and this way, follows from the following lemma.
For , let denote the connected component of that contains . Then is unbounded. In addition, for each there exists so that
Suppose that (the closure of ) has nonempty intersection with the interval . Since is connected, and symmetric with respect to the real axis, it will then surround the point , so that must be bounded and
Then if is bounded we obtain a contradiction with the maximum principle in the same way. Thus is unbounded, and likewise is unbounded as well.
as , since as . In addition, we have
We conclude from Lemma 2.4 that the curves , can be extended to infinity so that
for some constants . Since as we are in a non-critical situation, the contours and the constants can be taken independently of for large enough. Then the off-diagonal entries in the jump matrices on and are uniformly exponentially small as , as required.
We next investigate the jump matrices in the RH problem for on the various parts of the real line. Recall that the jump matrices are given in Figure 6 and so we are interested in the behavior of on the real line for various combinations of and .
proof. (a) From the definitions (2.34) and (2.5)–(2.6) it follows that for ,
so that part (a) is a restatement of the Euler-Lagrange conditions (2.22)–(2.25).
(b) Recall that the constant was chosen so that . Then in view of part (a) we know that
Taking and sufficiently close to (which we can do without loss of generality), we then have the inequalities (2.64)–(2.65) on the interval .
where the last inequality holds because of Lemma 2.3. Since
The inequality (2.65) for follows in the same way.
It follows from Lemma 2.5 that, up to exponentially small corrections, the jump matrices on the real line in the RH problem for take the following form
and on .
The matrices (2.66) and (2.67) are in a standard form. By standard arguments we have that the non-trivial diagonal entries of (2.66) and (2.67) are rapidly oscillating on the intervals and , respectively, and they are equal to outside these intervals.
From part (a) of Lemma 2.5 we can further deduce that (2.66) reduces to
Outside these intervals, the jump matrices (2.66) and (2.67) are exponentially close to the identity.
4.4 Summary
Summarizing, we have shown that we can take and so that all jumps in the RH problem for tend to the identity matrix as , except for the jump matrices on the two intervals , , which are given by (2.68)–(2.69) plus an exponentially small term.
Observe that each of the asymptotic jump matrices above has the sparsity pattern
It follows that the RH problem for asymptotically decouples into two RH problems of size , one involving rows and columns and and the other involving rows and columns and . The coupling between the two RH problems is exponentially small as . Thus we are dealing now essentially with two RH problems of size . The remaining steps in the Deift-Zhou steepest descent analysis can then be done in a standard way on these decoupled problems. This will be described in the next subsection.
5 Remaining steps of the steepest descent analysis
The next step in the steepest descent analysis is to open lenses around the intervals , . This operation serves to transform the oscillating jumps on these intervals into exponentially decaying or constant ones. This can be done in the usual way on each of the decoupled problems. We obtain in this way a new matrix function obtained from by multiplication on the right with a suitable transformation matrix, the precise form of which depends on the different regions of the complex plane.
Let us describe this in detail. First consider the interval . We have here the matrix factorization
We can then open a lens around and define
Similarly we open a lens around and define
The matrix function satisfies the following RH problem
on
on
on the lips of the lens around ,
on the lips of the lens around .
On the remaining contours and , the jumps for are exactly the same as those for .
As already mentioned before, the entries in positions , , and in the jump matrices for are all exponentially small when (use parts (a) and (b) of Lemma 2.5).
5.2 Model RH problem: Parametrix away from the branch points
We consider now the model RH problem obtained from the RH problem for by ignoring all exponentially small entries in the jump matrices. The model RH will be defined in the region
The solution to this model RH problem can be constructed in the usual way for each of the two problems into which the problem decouples. This leads to the parametrix
and where we choose the principal branches of the powers.
5.3 Local parametrices around the branch points
Consider disks around the branch points , with sufficiently small radius. Inside these disks one can construct local parametrices to the RH problem for in terms of Airy functions. Once again, these parametrices can be constructed in the usual way on each of the two RH problems. We omit further details.
5.4 Fourth transformation and completion of the steepest descent analysis
Define a final matrix-valued function by
From the construction of the parametrices it then follows that satisfies a RH problem
has jumps on , that satisfy
as , uniformly for in the complex plane. This completes the RH steepest descent analysis.
6 Proof of Theorem 1.3 in the case of large separation
We will now establish Theorem 1.3 in the case of large separation. The idea is that from the asymptotic decoupling of the RH problem for large , there follows a similar decoupling for the kernel in (1.23) and hence for the associated non-intersecting Brownian particles.
First assume that and consider the correlation kernel (1.23) , which for short we denote by . By virtue of (2.11) we obtain
Now it follows from (2.77) by standard arguments (e.g. [7, Section 9]) that
uniformly in . Inserting this into (2.78) yields
uniformly in . Now in the limit when , the last two terms in (2.79) become exponentially small by virtue of Lemma 2.5(b). Then by letting and using l’Hôpital’s rule and find
as , where the last step follows from (2.43). We conclude that
For we obtain in a similar way that tends to the semi-circle density on the interval . Thus by (1.23) we have completed the proof of Theorem 1.3 in the case of large separation (recall that ).
Steepest descent analysis in the case of critical separation
In this section we study the non-intersecting Brownian motions in case of critical separation between the endpoints. We will work under the assumption of the double scaling regime (1.25)–(1.26). This means that we take the endpoints , fixed such that
and that we consider the temperature to be varying with as
Before proceeding further, let us recall the main objects needed for the steepest descent analysis. The points , are as defined in (2.8)–(2.9), but now with in (3.2) not identically equal to 1:
for . The limiting values for of these points are denoted by (cf. (1.10)–(1.11))
. Recall also the -functions and -functions which are given by (2.34) and (2.43). We will denote the limiting values for of these functions by , , . For example, the functions are given by
Throughout this section we will assume again that the hypothesis (2.7) holds, but now with strict inequality, i.e.,
The time is now the time where the two ellipses in Figure 2 are tangent to each other. The case where can be handled in a similar way; cf. Remark 2.1. The behavior at the tangent time itself leads to a multi-critical situation which is outside the scope of this paper.
The main technical tool that made the analysis in Section 2.4 work was the existence of a point such that the string of inequalities (2.44) holds, cf. Lemma 2.3. It will turn out that in the present context, this can be achieved by the point given by the explicit formula
Note that we already encountered the analogue of the point (3.9) in the proof of Lemma 2.3, cf. (2.45). In particular, in the proof of Lemma 2.3 we derived inequalities (2.47) and (2.48) in case of large separation of the endpoints. Running through the proof of these inequalities, we find that in case of critical separation these inequalities become equalities:
These equalities can be restated in the form
The positivity of the right-hand sides of (3.10)–(3.11) follows from our assumption (3.8).
In what follows we will also need the identities
These identities follow immediately from the definitions (3.9) and (3.5)–(3.6).
Under the double scaling regime (3.1)–(3.2), the point defined in (3.9) satisfies the inequalities
proof. From the definitions (3.7) and keeping track of the correct branches of the powers, we find
Similarly, .
Note that the relations (3.14) correspond to the two outermost inequalities in (2.44), evaluated asymptotically for . By continuity, these inequalities then also hold for finite but sufficiently large.
In a similar way we would like to have the middle inequality in (2.44), i.e., . However, this is not the case, since instead we have equality . We need a more detailed statement of the zero behavior.
where is the positive constant given by
proof. Recall from Section 2 that we choose the constant such that
Now we consider the subsequent derivatives of at . We start with the first derivative . Recall that in the proof of Lemma 2.3 we showed that this derivative is negative provided there is large separation between the endpoints. The same proof shows that in case of critical separation, this derivative is zero. This means that
as we already alluded to in the paragraph before the statement of Lemma 3.2.
of at . It follows immediately from (3.7) that
Inserting (3.10)–(3.13), and keeping track of the branches of the 1/2 powers, we see that both terms in (3.19) cancel each other when and hence (3.19) vanishes.
of at . We have
We will then choose so that it lies in the sectors with negative real part and so that it lies in the sectors with positive real part. In particular, note that and now both pass through . Just as in Section 2, we will choose these curves independent of .
2 Transformations of the RH problem
We are now ready to describe the steepest descent analysis in case of critical separation, assuming the double scaling limit (3.1)–(3.2) with fixed and sufficiently large.
The first transformation of the steepest descent analysis is a Gaussian elimination in the jump matrix. This is done in the same way as in Section 2.2, except that we choose the contours and in a different way. As explained at the end of the previous subsection, these curves should be chosen fixed (independent of ) and such that they pass through the point in certain sectors of the complex plane.
2.2 Second transformation: Normalization at infinity
The transformation is the same as in Section 2.3. The new matrix valued function is normalized at infinity in the sense that as . The jump matrices in the RH problem for are shown in Figure 8.
2.3 Asymptotic behavior of the jump matrices
By Lemmas 3.1 and 3.2 and the choice of the contours and , we see that the conclusions of Section 2.4 all remain valid for sufficiently large, except that in a neighborhood of the point (through which now both and pass), the jump matrices are not exponentially close to the identity matrix. This means that, except for a small neighborhood of , the RH problem again asymptotically decouples into two problems involving rows and columns , and , , respectively, in exactly the same way as in (2.68)–(2.69).
The only place where the above decoupling is not valid is in a neighborhood of . In fact, since is away from the intervals and for sufficiently large, the jump matrices on the real line close to are all exponentially close to the identity matrix. Ignoring these jump matrices, the only jump conditions that remain are those on the curves and . From Figure 8 we see that the latter constitute essentially a RH problem involving rows and columns and only. This leads to the jump matrices shown in Figure 9.
2.4 Third transformation: Opening of the lenses
Around the intervals and , we are in the region where the RH problem decouples into two problems. We can then define a transformation by opening lenses around these intervals. This is done in exactly the same way as in Section 2.5.1. Since these operations have no influence on the behavior around (which is our main point of interest here), we omit a detailed description.
2.5 Model RH problem: Parametrix away from the special points
We describe now the solution to the model RH problem where we ignore all exponentially small entries in the jump matrices, and where we stay away from the special points and . Since we are considering the region away from the special point , we are essentially dealing with two matrix valued RH problems. The construction of the parametrix is then exactly the same as in Section 2.5.2.
In small disks around the endpoints of the intervals and , one can construct local parametrices to the RH problem in terms of Airy functions. The construction is exactly the same as in Section 2.5.3.
Our next task is to build a local parametrix in a neighborhood of the special point . This will be the main technical part of the analysis. In this subsection we will first recall the model RH problem associated with the Hastings-McLeod solution of the Painlevé II equation. We describe this RH problem and a few basic deformations of it, serving to bring it closer to the form we will need.
The matrix valued function then satisfies the following RH problem:
For , has jumps as shown in Figure 10;
where denotes the third Pauli matrix.
The corresponding Painlevé II function is recovered from the RH problem by the formula
The Hastings-McLeod solution to the Painlevé II equation corresponds to the special choice of Stokes multipliers
Since , we see that the jump on the imaginary axis in Figure 10 disappears. The jump matrices of the RH problem then reduce to the situation in Figure 11. Note that we have reversed the orientation of the two leftmost rays.
Now we apply a rotation over degrees, i.e., we set
Then satisfies the following RH problem:
On the rays , has jump matrix , On the rays , has jump matrix , see Figure 12;
Now we apply one final modification. Define a new matrix function
Then satisfies the following RH problem:
On the rays , has jump matrix , On the rays , has jump matrix , see Figure 13;
3.2 Construction of local parametrix
Now we construct a local parametrix near the special point . It turns out that the construction can be done in a similar way as done by Claeys and Kuijlaars in ; see also . We also note that the construction of a local parametrix with -functions associated with Painlevé II played a role and .
We are going to construct the local parametrix in the neighborhood
of , where the radius is fixed but sufficiently small.
Recall that for sufficiently large the jumps near are essentially those of a matrix-valued RH problem involving rows and columns , , with jump matrices shown in Figure 9. To construct the local parametrix near , we construct similar jumps via the model RH problem for in Figure 13. To this end, we propose a local parametrix of the form
where is the solution to the model RH problem in Section 3.2.5 and where we set
We will show in the next lemma that is a conformal map mapping the neighborhood of (provided is small enough) onto a neighborhood of the origin in the -plane. It follows that in (3.29) is a well-defined analytic function in , due to pole-zero cancelation at . Indeed, this follows from the fact that both terms in the numerator of (3.29) vanish at , cf. (3.18).
(Conformal map) The function is analytic in a neighborhood of and satisfies
as , where the constant is defined in (1.49).
proof. This follows from (3.28) and Lemma 3.2.
From the above definitions (3.27)–(3.29) we see that if and , then the exponent occurring in the jump matrices in Figure 13 reduces to
This shows that has precisely the required jumps in the RH problem near , cf. Figure 9, provided the contours and near are chosen in such a way that they are mapped by the conformal map to the straight lines in Figure 13. We have indeed the freedom to choose and in that way near .
A technical issue that remains is showing that the RH problem for is solvable. This is equivalent with the fact that stays away from , the set of poles of the Hastings-McLeod solution to the Painlevé II equation. This will indeed follow from the next lemma. Recall that we are working under the double scaling assumption
(Asymptotics of ) We have as ,
and the -term in (3.31) is uniform for .
proof. Since and it follows from (3.3)–(3.4) that
as . Then by (3.33) and (3.34) we have uniformly for ,
and the term is uniform for .
The lemma now follows because of the definition of in (3.29) and the fact that has a simple zero at .
We have as and ,
where the real constant is defined in (1.50).
for every and for all large enough .
By (3.32), (3.5)–(3.6), and (3.10)–(3.11) we have for ,
where for the last equality we used the definition of , see (1.49), and the relation (1.50) between and . Now (3.37) follows from (3.38) and (3.41).
(b) The equation (3.37) implies that there exist constants and , independent of and , such that for and large enough,
Since is real, and since the Hastings-McLeod solution has no poles on the real line, part (b) follows.
Now we can check that the local parametrix defined by (3.27) satisfies the following ‘local RH problem’
is analytic in ;
On and , has jumps with jump matrices of the form where the matrices indicated by are given in Figure 9;
uniformly for on the circle .
The matching condition (3) follows from the definition (3.27) and the fact that as uniformly for all of the form .
4 Fourth transformation and completion of the proof of Theorem 1.3
Using the global parametrix and the local parametrices and , we define the final transformation by
From the constructions in this section it follows that satisfies the following RH problem
has jumps on , that satisfy
as , uniformly for in the complex plane. This completes the RH steepest descent analysis.
We will explicitly compute this term in Section 4.
4.2 Proof of Theorem 1.3 in the critical case
We have now completed the steepest descent analysis of the RH problem under the double scaling regime (3.1)–(3.2). In a completely similar way as in Section 2.6 we can now use the result (3.44) to show that the non-intersecting Brownian particles are asymptotically distributed on the two intervals according to two semicircle laws. This completes the proof of Theorem 1.3.
Proofs of Theorems 1.9 and 1.12
In this section we investigate the large asymptotics of the recurrence coefficients of the multiple Hermite polynomials (Sections 1.7 and 1.8) under the assumptions in Section 3. This will lead to the proofs of Theorems 1.9 and 1.12.
We have not yet proved Proposition 1.7. This will be done in Section 5, but anticipating this result, we call the combinations
the off-diagonal recurrence coefficients, and
Recall that the are the entries of the matrix in the expansion
Following the transformations (2.13), (2.26), (2.73) and (3.43) in the steepest descent analysis, we have the following representation for in the region between the contours and
where , and are matrices from the expansions as ,
We are only interested in the combinations (4.1) and (4.2) of entries of . Since is a diagonal matrix, the factors and in (4.4) will not play a role for these combinations. Also, since is a diagonal matrix (which is clear from (4.5), since is diagonal), this does not play a role either. Therefore we have for ,
In what follows we evaluate and .
The evaluation of is straightforward.
proof. Recall that is defined by means of (2.74) and (2.75). For we have the expansions
Since , see (3.3)–(3.4), we obtain (4.10) from (2.74) and (4.6).
2 Second term in the expansion of the jump matrix for R(z)𝑅𝑧R(z)
We use the clockwise orientation on the circle around . Thus the outside of the circle is the -side and the inside of the circle is the -side. The matrix valued function in (3.43) then satisfies the jump condition
on , with jump matrix given by
see (3.27). To prepare for the evaluation of , we first compute the second term in the expansion of the jump matrix as .
(Asymptotics of jump matrix for ) The jump matrix in (4.11), (4.12) has the asymptotics
uniformly for on the circle . Here denotes the Hastings-McLeod solution to Painlevé II, denotes the Hamiltonian
and is the conformal map in (3.28).
proof. First, we calculate the large asymptotics of the matrix which occurs in the expression (4.12). Recall from Section 3.3.1 that is defined as an easy modification of the model RH matrix associated to the Hastings-McLeod solution to the Painlevé II equation. It is known (see e.g. ) that the asymptotic expansion (3.22) of in powers of can be refined to
where denotes the Hastings-McLeod solution of Painlevé II and denotes the Hamiltonian (4.15). Following the sequence of transformations in Section 3.3.1 we obtain
as , uniformly for all on the circle .
Then (4.14) follows from (4.16), (4.12), and (4.13).
Note that depends on , as is obvious from the appearance of in (4.14). Also depends on . As , the -dependent entries have limits, and therefore we can still obtain from the expansion (4.13) of a similar expansion of the RH matrix
The coefficient , in this expansion can be found by inserting (4.13) and (4.17) into the jump condition and collecting terms of order . This leads to the following additive RH problem for :
for ,
The jump matrix (4.14) has a simple pole at . As in , the RH problem for then has the explicit solution
As in other works (see e.g. ) the expansions of as and commute with each other. It thus follows from (4.17) and (4.18) that
In view of (4.19) the evaluation of comes down to the determination of the residue of at . The result is the following.
where is the constant defined in (1.49) and where the blocks , , , are given by
To evaluate we observe that by (2.74) we need the entries , for . We compute the squares of these
where we used (2.75). We emphasize that we use to denote the positive square root of a positive real number. Now recall that and are varying with , and satisfy , . For the starred quantities we can use the identities (3.10)–(3.13), so that (4.26) yields
Since (as can easily be seen from (2.75) and the fact that ), we obtain after simple calculations
Putting (4.27) and (4.28) into (2.74) we find
Using the fact that has a block structure with blocks having determinant one, we then also obtain
Then we insert (4.29) and (4.30) into (4.25) and after simple calculations we obtain (4.20)–(4.24), see also (4.19).
4 Proofs of Theorems 1.9 and 1.12
Having Lemmas 4.2 and 4.4 it is now straightforward to compute the asymptotic behavior of the recurrence coefficients from (4.8) and (4.9).
As an example, let us compute the expression in (1.40). By (4.9) and from the fact that whenever is odd, see (4.10), we have
which since and , reduces to
Using this and (4.32) in (4.31), we obtain
which proves the second formula in Theorem 1.12. The other formulas in Theorems 1.9 and 1.12 are established in a similar way.
(The case where ) Recall that the above derivations have all been made under the assumption that . The case where can be handled by means of similar calculations; see also Remark 2.1. Alternatively, one can immediately reduce this to the case where by virtue of the involution symmetry in Corollary 5.13. After a straightforward calculation, one sees then that the expansion in Lemma 4.4, and hence the conclusions of Theorems 1.9 and 1.12, remain valid for as well.
Proofs of Propositions 1.7 and 1.8
In this final section, we prove Propositions 1.7 and 1.8. We start by considering recurrence relations for general multiple orthogonal polynomials. Next we specialize these results to the multiple Hermite case (i.e., the case of Gaussian weight functions (1.18)–(1.19)). An important tool will be the Lax pair satisfied by the multiple Hermite polynomials. The compatibility condition of this Lax pair allows us to derive more detailed information for the multiple Hermite case. For example, we show how this condition implies certain scalar product relations between row and column vectors in ; these turn out to be essentially given by the numbers of Brownian particles associated with the different starting or ending points.
This section is organized as follows. Section 5.1 discusses recurrence relations for multiple orthogonal polynomials in a general setting. The rest of the section is devoted to the multiple Hermite case. In Section 5.2 we discuss a differential equation satisfied by multiple Hermite polynomials. Section 5.3 deals with the compatibility condition of the Lax pair for multiple Hermite polynomials. Sections 5.4 and 5.5 deal with the induced scalar product relations. Finally, Section 5.6 completes the proof of Propositions 1.7 and 1.8.
We start by discussing the recurrence relations for general multiple orthogonal polynomials, leading in particular to the proof of the expression for the off-diagonal recurrence coefficients as given in Proposition 1.7.
It is a classical result that orthogonal polynomials on the real line satisfy a three-term recurrence relation. In this subsection, we discuss the term recurrence relations for the multiple orthogonal polynomials of Definition 1.4.
As in the classical case , it turns out that the recurrence relations can be conveniently derived from the Riemann-Hilbert problem in Section 1.4. To this end, we introduce the next two terms in the asymptotics of the matrix in (1.22):
Note that the matrices and are constant (independent of ).
Our goal is to find recurrence relations between the RH matrices with multi-indices and , respectively.
Above we use and as row vectors. In some of the matrix calculations that follow, we also use these standard basis vectors, but then we see them as column vectors, as is usual in matrix algebra. For example where is the transpose, denotes a matrix whose only nonzero entry is a one at the th position, while is the scalar product of the two vectors. So we introduce the convention that is a row vector when used as a multi-index. In matrix computations it is considered as a column vector. We trust that this will not lead to any confusion.
To derive the recurrence relations, assume some fixed and . From the fact that the jump matrix of on the real line is independent of (cf. (1.20), (1.21)), it follows that the matrix valued function
is entire. From (5.2) and the normalizations at infinity in (5.1), it follows that for we have
Here the middle factor in (5.3) is just the identity matrix with its th and th diagonal entries replaced by and , respectively. By Liouville’s theorem it then follows that is a polynomial and so by (5.3)
Summarizing, we obtain the following proposition.
(Forward matrix recurrence relations) Let and . Then we have the matrix recurrence relation
with given by (5.4).
Evaluating the different entries of the matrix recurrence relation (5.5) leads to a set of scalar recurrence relations for the MOP. In fact, since the multiplication with the matrix in (5.5) is performed on the left, it easily follows that the th component functions of the MOP, satisfy all the same recurrence relations. So the recurrence relations for the individual components can be conveniently stacked into vector recurrence relations for the vectors .
Let us illustrate this for , . Then the recurrence relation (5.5), (5.4) becomes
This is the desired five-term recurrence relation. Note that the factors are due to the diagonal matrix in Theorem 1.6.
Instead of the first row, one could also evaluate one of the other rows of (5.6). Doing this leads to an additional set of (mostly trivial) relations.
The relation (5.7) has the undesirable feature that it involves vectors of MOP with different types of normalizations. To express everything in terms of one type of normalization, for example the normalization, we need the transition numbers between different types of MOP normalizations.
The transition numbers are contained in the matrix as follows.
(Interpretation of via transition numbers) Let , with be such that the solvability condition holds. Let be the diagonal matrix in Theorem 1.6. Then the off-diagonal entries of the matrix can be expressed as transition numbers between different types of normalizations of MOP. More precisely, the entries of are given as follows:
If and then the entry is ,
If and then the entry is ,
proof. This follows easily from (5.1), (1.37), and from the definition of the normalizations. The result is most easily seen by evaluating (5.1) column by column; we do not provide the details here.
Let us illustrate Proposition 5.4 for the case where . In this case the proposition asserts that
where the diagonal entries denoted with are unspecified, and where the diagonal matrix .
We use the information in Proposition 5.4 to obtain more meaningful expressions for the recurrence coefficients. To this end, consider again the five-term recurrence relation (5.7). This relation yields a connection between several MOP with different multi-indices and different types of normalizations. To express everything in terms of type normalizations it suffices to multiply with the appropriate transition numbers from (5.9). Then (5.7) transforms into the new relation
The relation (5.10) was derived for the special case where and in the recurrence relations. In a similar way, one can find the recurrence relation for general .
(Forward recurrence relations) For any and , we have the term recurrence relation
Note that Proposition 5.5 implies the recurrence relations in Proposition 1.7, except for the explicit form of the first term in the right-hand side of each of (1.39)–(1.42), which will be established in Section 5.6.1. We note that Proposition 5.5 is valid for general weight functions and , not only for Gaussian weights.
We use the terminology ‘off-diagonal’ and ‘diagonal’ recurrence coefficients in analogy with the case of classical orthogonal polynomials . Indeed, in the latter case these recurrence coefficients correspond precisely to the off-diagonal and diagonal entries of the Jacobi matrix.
We collect the off-diagonal recurrence coefficients of Definition 5.6 in an upper triangular matrix
The matrix is the Hadamard product (entry-wise product) of the strictly upper triangular part of with the transpose of the strictly lower triangular part of . For example, when we have
The proof of (5.14) is similar to the proof in the case of classical orthogonal polynomials, see [16, Section 3.2]; we omit the details. A more concise expression in the case of Gaussian weight functions will be derived in Section 5.6.1.
In addition to the forward recurrence relations in Propositions 5.2 and 5.5, one can also run these recurrence relations in backward order. To this end, consider the matrix function
(Note that this is the inverse of the matrix in (5.2).) By copying the approach above one finds:
(Backward matrix recurrence relations) Let and . Then we have
(Backward recurrence relations) For any and , we have the term recurrence relation
For example, when , the above relations become
2 Differential equation for multiple Hermite polynomials
In this subsection we derive a differential equation for multiple Hermite polynomials, i.e., assuming that the weights are Gaussian as in (1.18)–(1.19). The differential equation was already described in .
For general and we consider the weights
We introduce a modification of the RH matrix .
where we used the following functions , :
The reason for defining the matrix function in Definition 5.10 is that it has a constant jump (independent of ) along the real line. More precisely, it satisfies the following Riemann-Hilbert problem:
where denotes the matrix having all entries equal to one;
Since the function is defined from by the multiplication on the right with an -independent matrix (recall that is assumed to be constant), it satisfies exactly the same recurrence relations as the original RH matrix , cf. Section 5.1. Moreover, from the fact that has a constant jump matrix we obtain that the matrix valued function
where the prime denotes the derivative, is analytic in the full complex plane. By using (5.1), (5.18), (5.19), and (5.20), we obtain that as ,
By Liouville’s theorem, it then follows that is a polynomial and hence we obtain from (5.21) that
and where we define and by the partitioning of into blocks:
with the diagonal blocks being of size and , respectively. In other words, we have put , , , and .
Multiplying both sides of (5.20) on the right with , we conclude:
(Differential equation for multiple Hermite polynomials) The multiple Hermite polynomials satisfy the matrix differential equation
with given by (5.22)–(5.24).
3 Lax pair and compatibility conditions
In this subsection we investigate the compatibility condition between the differential equation (5.25) in Section 5.2 and the recurrence relations (5.5), (5.15) in Section 5.1. These relations together constitute the Lax pair for multiple Hermite polynomials and the compatibility yields nonlinear difference equations the recurrence coefficients.
Throughout this subsection we will use the partitioning of in (5.24) and we will also use the similar partitioning
The derivation of the compatibility conditions below will be merely a straightforward calculation. The reader who wishes to avoid this kind of calculations could take these results for granted and move directly to Section 5.4 where we discuss the (elegant) scalar product relations induced by these compatibility conditions.
Fix and . The compatibility condition between the differential equation (5.25) and the forward recurrence relation (5.5) is
where the matrix is given by (5.22), is given analogously by
and is given by (5.4). Using the partitionings (5.24) and (5.26) we rewrite the latter in block form as
where the top left block is of size , and so on. In the right-hand side of (5.29) we use our convention that and denote column vectors, recall Convention 5.1.
Inserting (5.22), (5.28), and (5.29) into (5.27) we find
The left-hand side is independent of , and therefore all terms on the right-hand side involving or cancel out (this can also be checked by direct calculation). Hence the equation reduces to
From the identity (5.30) we obtain the following for the respective blocks.
where denotes the usual commutator of square matrices. Since diagonal matrices commute with each other, we get
This implies for the diagonal entry
Evaluating the th column of this equation, one obtains
Similarly to the case of the block entry, one can now evaluate the different rows of this equation. This yields
block of (5.30): This is just the trivial relation .
Note that by comparing (5.35) and (5.37), one finds the relations
3.2 Backward relations
The relations in Section 5.3.1 constitute in fact only half of the available compatibility relations. The second half is obtained from the differential equation (5.25) and the backward recurrence relation (5.15). Alternatively, these relations may be obtained from the forward relations by using the involution symmetry to be described in Corollary 5.13.
We will not derive all these relations in detail. Instead, we list only the equations that we will need in the sequel. These are the following analogue of (5.31):
and the following analogues of (5.33) and (5.38):
3.3 Involution symmetry
As an aside, this might be a good place to write down explicitly the involution symmetry which we referred to in Section 5.3.2, as well as in Remarks 2.1 and 4.5.
We will temporarily denote the RH matrices corresponding to the original and reversed RH problem with and , respectively. Here we use the vectorial notations and .
It is interesting to see what this involution means in terms of non-intersecting Brownian motions. As already discussed before, in the multiple Hermite case (1.18)–(1.19) the MOP are closely related to non-intersecting Brownian motions in the sense of Section 1.1. Then from the non-intersecting Brownian motions point of view, the above involution reduces to (cf. (1.18)–(1.19))
This means that we interchange the role of starting and ending points and reverse the direction of time. In the -plane this corresponds to a reflection of the Brownian motions with respect to the vertical line .
The proof of Lemma 5.12 can be performed in a straightforward way. It suffices to check that both sides of (5.43) satisfy the same RH problem, and next invoke the fact that the solution to this RH problem is unique; we omit the details.
As an immediate corollary of Lemma 5.12, we can check what the involution does with the matrix in (5.1). The -matrices corresponding to the original and reversed Brownian motions turn out to be related as follows.
denotes a partitioning with diagonal blocks of size and , respectively, then
Using Corollary 5.13, the compatibility relations in Section 5.3.2 may be immediately deduced from those in Section 5.3.1.
4 Scalar product relations
Now we discuss the scalar product relations induced by the compatibility conditions in Section 5.3. These relations are given by the following proposition.
(Scalar product relations) Let and with be fixed and consider the partitioning (5.24) for the matrix . Then we have the relations
proof. If and then the solution of the RH problem (1.20)–(1.22) is upper triangular, so that is the zero-matrix and the relations (5.47) and (5.48) hold in that case. For arbitrary and , these relations then follow from an induction argument based on (5.31), (5.38), (5.39), and (5.41).
The two relations (5.49) and (5.50) are simply (5.33) and (5.40).
We call (5.47)–(5.50) scalar product relations, since these relations can be interpreted as giving the scalar products between row and column vectors of and . The relations (5.47) and (5.48) then involve rows and columns with the same index, while the relations (5.49) and (5.50) involve rows and columns with different indices. Moreover, note that these last two relations determine the off-diagonal entries of the diagonal blocks and in (5.24) in terms of scalar products of the entries in the off-diagonal blocks and in (5.24).
Let us illustrate the above scalar product relations for the case (i.e., ). Then the partitioning (5.24) is, when written out in full,
Then (5.47) and (5.48) give us the four relations
In other words, the number of Brownian particles , starting from the first and second starting point and , respectively, is (up to a common factor ) directly expressed by the scalar products (5.51), (5.52), while the number of Brownian particles , arriving at the first and second endpoints and , respectively, is expressed by the scalar products (5.53), (5.54) (up to the same common factor).
The scalar product relations (5.51)–(5.54) can be nicely expressed in terms of the Hadamard product matrix of (5.13). Indeed, they express that the top rightmost block of this matrix, i.e.,
has fixed row sums equal to , , and fixed column sums equal to , . It follows from this that the matrix (5.55) is fully determined by only one of its entries, since the other entries then follow from these row and column sum relations. This implies in particular the first three relations in Proposition 1.8.
In the case of general and , we have the following result.
(Row and column sum relations) Let and with be fixed and consider the Hadamard product matrix in (5.12). Then the top rightmost block of the matrix , i.e., the submatrix
has fixed row sums equal to , , and fixed column sums equal to , .
proof. These relations are equivalent with the scalar product relations (5.47) and (5.48).
5 Spectral curve interpretation
As an aside, let us discuss an equivalent formulation of Proposition 5.15 in terms of the so-called spectral curve. Let
where . The zero set of the polynomial in (5.57) defines an algebraic curve (the spectral curve).
For example, when we can use (5.22)–(5.24) and (5.57) to see that
The spectral curve in (5.57) defines an algebraic curve which is of degree in the variable . After resolution of singularities, this curve defines a Riemann surface which can be used as a tool in the steepest descent analysis of the RH problem. This is in fact a -sheeted Riemann surface where the th sheet corresponds to the th solution function , .
Now it turns out that an important role in the steepest descent analysis is played by the asymptotic expansions for of the functions . It was observed for some special cases that the following asymptotic expansions hold.
(Asymptotic expansions of the spectral curve) Let and be arbitrary. Then when appropriately labeled, the branches , of the algebraic curve in (5.57) behave as follows:
as , for any and .
Note in particular that the terms in the expansion, up to a factor , are precisely the fractions of Brownian particles starting from the th starting point or arriving in the th ending point , respectively.
proof. We give the proof for the case ; the proof for general and is similar. From (5.58), we see that the only way to have when is that one of the diagonal entries in (5.58) vanishes as . This yields the required linear and constant terms in (5.59) and (5.60).
which by (5.51) and (5.52) leads to (5.59). The term in (5.60) follows in a similar way from (5.53) and (5.54).
We end this subsection with a brief discussion. We described in Proposition 5.14 the scalar product relations induced by the Lax pair for multiple Hermite polynomials. In case where these relations fully describe the off-diagonal entries of . Indeed, the block entries and in (5.24) then have only one row and one column, respectively. The row and column sum relations (5.47) and (5.48) then give explicit expressions for the products , . With a little bit more work one can also obtain explicit expressions for the individual entries ; this leads to the expressions in . Similar remarks hold when .
In the case of general and , however, we are not able to find explicit expressions for the entries of anymore. In this case, the best that we could obtain is showing that the compatibility relations in Section 5.3 can be used to determine the off-diagonal entries of in terms of the off-diagonal entries of . This yields a recursive scheme for computing the off-diagonal entries of by induction on . Unfortunately, we were not able to derive any useful asymptotic information from this recursive scheme; therefore we will not state these relations here.
6 Completion of the proofs of Propositions 1.7 and 1.8
As already noted above, Proposition 1.7 follows as a special case of Proposition 5.5, except for the explicit form of the diagonal recurrence coefficients in the first term in the right hand sides of each of (1.39)–(1.42). The latter expressions are only valid in the multiple Hermite case.
To derive these expressions for the diagonal recurrence coefficients, we will again use the compatibility conditions in Section 5.3. We proceed as follows. By evaluating the th row of (5.34), one obtains
From this expression, we obtain the relation
By the way, note that the right-hand side of (5.61) contains entries of only, and so it is more convenient than (5.14) which also contains an entry of . In addition, (5.61) has only about half as many terms as (5.14).
6.2 Proof of Proposition 1.8
As already noted above, Proposition 1.8 follows from the more general row and column sum relations in Proposition 5.15. The only thing that remains is to prove (1.48).
Assume again that . We will compute the determinant
where we made use of the scalar product relations (5.47) and (5.49).
where we now used (5.48) and (5.50). By equating (5.63) and (5.64) we obtain a relation between the off-diagonal recurrence coefficients and
which for the special case and reduces to (1.48). This ends the proof of Proposition 1.8.