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 a1a_{1}, a2a_{2} and two fixed ending positions b1b_{1}, b2b_{2}. Let us first describe the general framework in which this paper fits.

∑k=1pnk=∑l=1qml=:n\sum_{k=1}^{p}n_{k}=\sum_{l=1}^{q}m_{l}=:n.

Consider nn one-dimensional Brownian motions (actually Brownian bridges) such that nkn_{k} of them start from the point aka_{k} at time t=0t=0, for k=1,…,pk=1,\ldots,p, and mlm_{l} of them arrive in the point blb_{l} at time t=1t=1, for l=1,…,ql=1,\ldots,q, and such that the nn particles are conditioned not to collide with each other in the time interval t∈(0,1)t\in(0,1).

We are interested in the limiting behavior where the number of Brownian particles nn tends to infinity in such a way that each of the fractions nk/nn_{k}/n, k=1,…,pk=1,\ldots,p and ml/nm_{l}/n, l=1,…,ql=1,\ldots,q has a limit in (0,1)(0,1). To obtain non-trivial limiting behavior we assume that the transition probability density of the Brownian motions scales as

where NN is a parameter (the inverse of the overall variance) that increases as nn increases. In a non-critical regime we will simply take N=nN=n.

Under these assumptions, it is expected that the particles will asymptotically fill a bounded region in the time-space plane (txtx-plane). It is also expected that for every t∈(0,1)t\in(0,1), the particles at time tt are asymptotically distributed according to some well-defined limiting distribution. See Figures 1 and 2 for possible behaviors when p=q=1p=q=1 and p=q=2p=q=2, respectively.

It is natural to ask for an explicit description of this limiting distribution. Such a result is known in the classical case where p=q=1p=q=1, 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 t∈(0,1)t\in(0,1) have the same joint distribution as the eigenvalues of the Gaussian unitary ensemble (GUE) of size n×nn\times n, and the limiting distribution as n→∞n\to\infty is given by Wigner’s semicircle law. More precisely, if all Brownian motions start from a:=a1a:=a_{1} at time t=0t=0 and end up at b:=b1b:=b_{1} at time t=1t=1, and if N=n/TN=n/T, then the non-intersecting Brownian particles at time t∈(0,1)t\in(0,1) are asymptotically distributed on the interval [α(t),β(t)][\alpha(t),\beta(t)] with endpoints

and with limiting density of the particles given by the semicircle law on that interval

By varying t∈t\in, 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 p=1p=1, q>1q>1. Also in this case there is an underlying random matrix model .

The limiting distribution is also known when p=q=2p=q=2, m1=n1=m2=n2=n/2m_{1}=n_{1}=m_{2}=n_{2}=n/2, N=nN=n, and (a1−a2)(b1−b2)<2(a_{1}-a_{2})(b_{1}-b_{2})<2. In this case the limiting distribution as n→∞n\to\infty of the Brownian particles at time t∈(0,1)t\in(0,1) 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 nn 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 a1>a2a_{1}>a_{2} at time t=0t=0, two ending points b1>b2b_{1}>b_{2} at time t=1t=1, and in addition

which are varying with nn, then we assume that

for certain limiting values p1∗,p2∗∈(0,1)p_{1}^{*},p_{2}^{*}\in(0,1). We also assume that NN increases with nn such that

If the assumptions (1.5)–(1.9) hold, and if the separation between the starting points a1a_{1} and a2a_{2}, and the ending points b1b_{1} and b2b_{2} 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 txtx-plane, whose intersections with the vertical line through tt are given by the two intervals [α1∗,β1∗][\alpha_{1}^{*},\beta_{1}^{*}] and [α2∗,β2∗][\alpha_{2}^{*},\beta_{2}^{*}] with

for j=1,2j=1,2, and with limiting densities on these two intervals given by the semicircle laws

for each t∈(0,1)t\in(0,1). 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 α1∗(t)>β2∗(t)\alpha_{1}^{*}(t)>\beta_{2}^{*}(t) for all t∈(0,1)t\in(0,1). From (1.10)–(1.11) this leads to the condition

which after putting u=t1−tu=\sqrt{\frac{t}{1-t}} is equivalent to

The left-hand side is a quadratic expression in uu, whose discriminant is negative if and only if (1.13) holds. The lemma then easily follows since b1>b2b_{1}>b_{2} and a1>a2a_{1}>a_{2}. \hfill□\hfill\square\\

We will call (1.13) the case of large separation.

(Large, critical and small separation) For each nn, consider nn non-intersecting Brownian motions with two starting points a1>a2a_{1}>a_{2} at time t=0t=0 and two ending points b1>b2b_{1}>b_{2} at time t=1t=1, 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 tcrit∈(0,1)t_{\textrm{crit}}\in(0,1) 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 tcritt_{\textrm{crit}} 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 T=n/NT=n/N. With aja_{j}, bjb_{j}, and pj∗p_{j}^{*} fixed for j=1,2j=1,2, there is a critical temperature

such that T<TcritT<T_{\textrm{crit}} (low temperature), T>TcritT>T_{\textrm{crit}} (high temperature), and T=TcritT=T_{\textrm{crit}} (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 p1=p2=1/2p_{1}=p_{2}=1/2. 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 nn non-intersecting Brownian motions with two starting points a1>a2a_{1}>a_{2} at time t=0t=0 and two ending points b1>b2b_{1}>b_{2} at time t=1t=1. 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 t≠tcritt\neq t_{\textrm{crit}}, where tcritt_{\textrm{crit}} is given by (1.17).

Then as n→∞n\to\infty the Brownian particles at time t∈(0,1)t\in(0,1) are asymptotically supported on the two disjoint intervals [α1∗(t),β1∗(t)][\alpha_{1}^{*}(t),\beta_{1}^{*}(t)] and [α2∗(t),β2∗(t)][\alpha_{2}^{*}(t),\beta_{2}^{*}(t)] 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 t=tcritt=t_{\textrm{crit}}. 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 4×44\times 4 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 nn, the 4×44\times 4 RH problem asymptotically decouples into two smaller RH problems of size 2×22\times 2. 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 nn in case of large separation, and polynomially (like a power n−1/3n^{-1/3}) in case of critical separation at a non-critical time. In the limit when n→∞n\to\infty 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 p,qp,q of the Brownian motions, although in our applications we will eventually take p=q=2p=q=2.

The RH problem consists in finding a matrix-valued function Y(z)=Y(z)= Yn1,…,np;m1,…,mq(z)Y_{n_{1},\ldots,n_{p};m_{1},\ldots,m_{q}}(z) of size p+qp+q by p+qp+q such that

where IkI_{k} denotes the identity matrix of size kk; where W(x)W(x) 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 p=q=2p=q=2. It is well-known , see also , that the distribution of the non-intersecting Brownian motions at time t∈(0,1)t\in(0,1) describes a determinantal point process, determined by an associated correlation kernel. According to the correlation kernel K(x,y)=Kn1,n2;m1,m2(x,y)K(x,y)=K_{n_{1},n_{2};m_{1},m_{2}}(x,y) 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 1nKn1,n2;n1,n2(x,x)\frac{1}{n}K_{n_{1},n_{2};n_{1},n_{2}}(x,x) as n→∞n\to\infty exists and is equal to

for j=1,2j=1,2. 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 [α1∗,β1∗][\alpha_{1}^{*},\beta_{1}^{*}] and [α2∗,β2∗][\alpha_{2}^{*},\beta_{2}^{*}]. We will not go into details about this in this paper.

5 Critical separation and the double scaling limit

where TT can be interpreted as a temperature variable. For T=1T=1 (critical temperature) we have by (1.16), (1.25) and Theorem 1.3 that in the large nn limit, the particles fill out two ellipses, which are tangent to each other at the critical time tcritt_{\textrm{crit}}, see Figure 2. By varying TT around the critical value Tcrit=1T_{\textrm{crit}}=1 we move from a case of disjoint ellipses (for T<1T<1) to a case of small separation (for T>1T>1), 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 tcritt_{\textrm{crit}}. At a non-critical time t≠tcritt\neq t_{\textrm{crit}} the phase transition is less obvious, but there is also a nontrivial transitional effect. Indeed, the distribution of particles at time t≠tcritt\neq t_{\textrm{crit}} 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 t≠tcritt\neq t_{\textrm{crit}} 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 n,N→∞n,N\to\infty, and simultaneously T→Tcrit=1T\to T_{\textrm{crit}}=1. More precisely, we consider the endpoints a1a_{1}, a2a_{2}, b1b_{1}, b2b_{2} fixed so that (1.25) holds for all nn. The temperature T=Tn=n/NT=T_{n}=n/N is varying with nn 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 Ψ\Psi-functions (Lax pair) associated with the Hastings-McLeod solution of the Painlevé II equation

The Hasting-McLeod solution is the special solution q(s)q(s) of (1.27) which is real for real ss and satisfies q(s)∼Ai(s)q(s)\sim\textrm{Ai}(s) as s→∞s\to\infty, 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 Ψ\Psi-functions associated with q(s)q(s).

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 x0x_{0} strictly outside of the support and it does not influence the local correlation functions for the positions of any of the particles. The point x0x_{0} does not seem to have any physical meaning.

We emphasize that our asymptotic analysis will be only valid when t≠tcritt\neq t_{\textrm{crit}}. At the critical time t=tcritt=t_{\textrm{crit}} 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 pp and qq, although in our applications we will eventually take p=q=2p=q=2.

Put n:=(n1,…,np)\mathbf{n}:=(n_{1},\ldots,n_{p}), ∣n∣:=∑k=1pnk|\mathbf{n}|:=\sum_{k=1}^{p}n_{k} and similarly for m\mathbf{m} and ∣m∣|\mathbf{m}|. Assume ∣n∣=∣m∣+1|\mathbf{n}|=|\mathbf{m}|+1. We say that a sequence of polynomials A1(x),A2(x),…,Ap(x)A_{1}(x),A_{2}(x),\ldots,A_{p}(x) is multiple orthogonal with respect to the above data if (i) the polynomials Ak(x)A_{k}(x) have degrees bounded by nk−1n_{k}-1:

for j=0,1,…,ml−1j=0,1,\ldots,m_{l}-1 and l=1,…,ql=1,\ldots,q.

Note that (1.30) states that Q(x)Q(x) has mlm_{l} vanishing moments with respect to the weight w2,l(x)w_{2,l}(x), l=1,…,ql=1,\ldots,q.

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 Ak(x)A_{k}(x) and their corresponding number of free coefficients nkn_{k}, k=1,…,pk=1,\ldots,p. The middle part of the figure shows how the polynomials Ak(x)A_{k}(x) should be assembled into the function Q(x)Q(x) defined in (1.29). Finally, the right part of the figure schematically shows the orthogonality relations of Q(x)Q(x) with respect to the different weights w2,l(x)w_{2,l}(x), and it shows next to each weight w2,l(x)w_{2,l}(x) also the number of vanishing moments mlm_{l} of Q(x)Q(x) with respect to this weight.

We will refer to the polynomials Ak(x)A_{k}(x) 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 A(x)=(A1(x),…,Ap(x))\mathbf{A}(x)=(A_{1}(x),\ldots,A_{p}(x)). To stress the dependence on the multi-indices n\mathbf{n}, m\mathbf{m} we will sometimes write A(x)=An,m(x)\mathbf{A}(x)=\mathbf{A}_{\mathbf{n},\mathbf{m}}(x) and similarly Aj(x)=(Aj)n,m(x)A_{j}(x)=(A_{j})_{\mathbf{n},\mathbf{m}}(x).

The coefficients of the multiple orthogonal polynomials in Definition 1.4 can be found from a homogeneous linear system with ∣n∣|\mathbf{n}| unknowns (polynomial coefficients) and ∣m∣|\mathbf{m}| equations (orthogonality conditions). The restriction ∣n∣=∣m∣+1|\mathbf{n}|=|\mathbf{m}|+1 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 n,m\mathbf{n},\mathbf{m} 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 n,m\mathbf{n},\mathbf{m} 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 llth index, l∈{1,…,q}l\in\{1,\ldots,q\}, if the mlm_{l}th moment of Q(x)Q(x) with respect to w2,l(x)w_{2,l}(x) is equal to one, i.e., if

the normalization of type II with respect to the kkth index, k∈{1,…,p}k\in\{1,\ldots,p\}, if the leading coefficient of Ak(x)A_{k}(x) is equal to one, i.e., if

The vectors of MOP An,m(x)\mathbf{A}_{\mathbf{n},\mathbf{m}}(x) corresponding to the above normalizations will be denoted as An,m(I,l)(x)\mathbf{A}_{\mathbf{n},\mathbf{m}}^{(I,l)}(x) and An,m(II,k)(x)\mathbf{A}_{\mathbf{n},\mathbf{m}}^{(II,k)}(x), respectively.

The above normalizations might not always be possible. The type (I,l)(I,l) normalization is not possible in those cases where the integral on the left side of (1.31) is equal to zero. Similarly, the type (II,k)(II,k) normalization is not possible in those cases where the kkth polynomial Ak(x)A_{k}(x) has degree strictly smaller than nk−1n_{k}-1.

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 ∣n∣=∣m∣+1|\mathbf{n}|=|\mathbf{m}|+1 to ensure the existence of the multiple orthogonal polynomials. But let us now assume that ∣n∣=∣m∣|\mathbf{n}|=|\mathbf{m}|. 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 ∣n∣=∣m∣|\mathbf{n}|=|\mathbf{m}|, we should first adapt the multi-indices. There are essentially p+qp+q ways to proceed:

One can increase one of the components nkn_{k}, i.e., one can work with the pair of multi-indices n+ek,m\mathbf{n}+\mathbf{e}_{k},\mathbf{m}, for some k∈{1,2,…,p}k\in\{1,2,\ldots,p\}.

One can decrease one of the components mlm_{l}, i.e., one can work with the pair of multi-indices n,m−el\mathbf{n},\mathbf{m}-\mathbf{e}_{l}, for some l∈{1,2,…,q}l\in\{1,2,\ldots,q\}.

Here ek\mathbf{e}_{k} denotes the vector which has all its entries equal to zero, except for the kkth entry which equals one. The length of ek\mathbf{e}_{k} should be clear from the context.

Let us discuss the MOP corresponding to each of the p+qp+q pairs of multi-indices above. In the case of a pair of multi-indices n+ek,m\mathbf{n}+\mathbf{e}_{k},\mathbf{m}, we are dealing with multiple orthogonal polynomials where the kkth polynomial AkA_{k}, k∈{1,2,…,p}k\in\{1,2,\ldots,p\} has increased degree; it will be natural to normalize the resulting MOP such that this kkth polynomial AkA_{k} is monic, i.e., to work with a normalization of type (II,k)(II,k). This leads to the vector of MOP

In the case of a pair of multi-indices n,m−el\mathbf{n},\mathbf{m}-\mathbf{e}_{l}, we are dealing with multiple orthogonal polynomials where the llth orthogonality condition, l∈{1,2,…,q}l\in\{1,2,\ldots,q\} 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 (I,l)(I,l). 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 p+qp+q 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 p+qp+q vectors of MOP in (1.33), (1.34) are row vectors of length pp, and they can therefore be stacked into the first pp columns of a matrix of size (p+q)×(p+q)(p+q)\times(p+q). Denote with Y~(z)\widetilde{Y}(z) such a matrix. The entries in the remaining qq columns of Y~(z)\widetilde{Y}(z) are defined as Cauchy transforms of the functions Q(II,k)Q^{(II,k)} and Q(I,l)Q^{(I,l)} defined as in (1.29). More precisely, the last qq entries in the rows k=1,…,pk=1,\ldots,p of Y~(z)\widetilde{Y}(z) are defined by

(Solution to the Riemann-Hilbert problem; cf. ) Let n,m\mathbf{n},\mathbf{m} with ∣n∣=∣m∣|\mathbf{n}|=|\mathbf{m}| be such that the solvability condition holds. Then there exists a unique solution Y(z)=Yn,m(z)Y(z)=Y_{\mathbf{n},\mathbf{m}}(z) of the RH problem in Section 1.4. This solution is given by

where Y~(z)\widetilde{Y}(z) is the matrix constructed from the MOP as described above, and where D=diag⁡(Ip,−2πiIq)D=\operatorname{diag}(I_{p},-2\pi iI_{q}).

For example, in the special case where p=q=2p=q=2, the solution Y(z)Y(z) of the Riemann-Hilbert problem in Section 1.4 is given by the 4×44\times 4 matrix

where D:=diag⁡(1,1,−2πi,−2πi)D:=\operatorname{diag}(1,1,-2\pi i,-2\pi i), 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 p+q+1p+q+1 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 p=q=2p=q=2, as in (1.37).

Define the next term in the asymptotic expansion of Y(z)Y(z) in (1.22) as

The entries of the matrix Y1=(Y1)n,mY_{1}=(Y_{1})_{\mathbf{n},\mathbf{m}} in (1.38) will be denoted by (ci,j)i,j=14(c_{i,j})_{i,j=1}^{4}.

(Recurrence relations for multiple Hermite polynomials) Assume p=q=2p=q=2 and let the weight functions be defined by (1.18)–(1.19). Then the multiple Hermite polynomials in (1.37) satisfy the 55-term recurrence relations

Here we denote with ci,jc_{i,j} the entries of the matrix Y1=(Y1)n,mY_{1}=(Y_{1})_{\mathbf{n},\mathbf{m}} 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 ci,jcj,ic_{i,j}c_{j,i} with i<ji<j; it will be convenient to collect them in the 44 by 44 matrix

It turns out that there exist certain connections between these recurrence coefficients.

(Relations between recurrence coefficients) Assume p=q=2p=q=2 and let the weight functions be defined by (1.18)–(1.19). Then the 22 by 22 submatrix

of (1.43) has row sums equal to t(1−t)nkNt(1-t)\frac{n_{k}}{N}, k=1,2k=1,2, and column sums equal to t(1−t)mlNt(1-t)\frac{m_{l}}{N}, l=1,2l=1,2. Next, assume that n1=m1n_{1}=m_{1} and n2=m2n_{2}=m_{2}. Then all the recurrence coefficients ci,jcj,ic_{i,j}c_{j,i} in (1.43) can be expressed in terms of c1,2c2,1c_{1,2}c_{2,1} and c1,4c4,1c_{1,4}c_{4,1} 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 pp and qq 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 ci,jcj,ic_{i,j}c_{j,i} with i<ji<j.

(Asymptotics of off-diagonal recurrence coefficients) Assume the double scaling regime (1.25)–(1.26), and let t∈(0,1)t\in(0,1) be a non-critical time, i.e., t≠tcritt\neq t_{\textrm{crit}}. Define the constants

where LL is defined in (1.26). Then we have

as n→∞n\to\infty, where q(s)q(s) denotes the Hastings-McLeod solution to the Painlevé II equation. The asymptotic behavior of the other recurrence coefficients ci,jcj,ic_{i,j}c_{j,i} with i<ji<j 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 nn 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 c>0c>0 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 p1=p2=1/2p_{1}=p_{2}=1/2, 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 aja_{j}, bjb_{j}, j=1,2j=1,2 are fixed and satisfy the critical separation (1.25). The horizontal axis in the figure denotes the time t∈(0,1)t\in(0,1) and the vertical axis denotes the temperature T>0T>0. The diagram is divided into different regions according to the behavior of the limiting distribution for n→∞n\to\infty of the non-intersecting Brownian motions at time tt and temperature TT. The region where T<1T<1 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 [α1∗(t),β1∗(t)][\alpha_{1}^{*}(t),\beta_{1}^{*}(t)] and [α2∗(t),β2∗(t)][\alpha_{2}^{*}(t),\beta_{2}^{*}(t)]. At temperature T=1T=1, these two intervals meet each other at a certain critical time tcritt_{\textrm{crit}}. When TT 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 T=1T=1, the limiting distribution at time tt 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 p1∗=p2∗=1/2p_{1}^{*}=p_{2}^{*}=1/2, 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 a1=−a2=b1=−b2=1/2a_{1}=-a_{2}=b_{1}=-b_{2}=1/\sqrt{2} and hence tcrit=1/2t_{\textrm{crit}}=1/2.

Figure 4 also displays the phase transitions between the different regions. On the horizontal line T=1T=1 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 nn 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 nn, thereby establishing Theorem 1.3.

Our starting point is the RH problem (1.20)–(1.22) with p=q=2p=q=2 and in addition n1=m1n_{1}=m_{1} and n2=m2n_{2}=m_{2}. As in (1.6) we write pj=nj/np_{j}=n_{j}/n. Without loss of generality we take N=nN=n (i.e., T=1T=1). For T=1T=1 the case of large separation corresponds to (a1−a2)(b1−b2)>(p1∗+p2∗)2(a_{1}-a_{2})(b_{1}-b_{2})>(\sqrt{p_{1}^{*}}+\sqrt{p_{2}^{*}})^{2}. Since pj→pj∗p_{j}\to p_{j}^{*} as n→∞n\to\infty, we already assume that nn is so large that

Thus YY satisfies the following RH problem.

The entries of the rank-one block W=W(x)W=W(x) 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 nn limit the 4×44\times 4 matrix valued RH problem for Y(z)Y(z) essentially decouples into two smaller 2×22\times 2 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 (α1∗,β1∗)(\alpha_{1}^{*},\beta_{1}^{*}), the (1,1)(1,1) entry of (2.1) is dominant (as n→∞n\to\infty) with respect to the other three entries.

around the interval (α2∗,β2∗)(\alpha_{2}^{*},\beta_{2}^{*}), the (2,2)(2,2) entry of (2.1) is dominant with respect to the other three entries.

Here αj∗\alpha_{j}^{*}, βj∗\beta_{j}^{*} for j=1,2j=1,2 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 gg-functions. This approach turns out to be successful only for tt near the critical time tcritt_{\textrm{crit}} defined in (1.17). When tt is sufficiently close to however, one runs into difficulties since then

the (1,2)(1,2) entry of (2.1) blows up (i.e., becomes exponentially large when n→∞n\to\infty) somewhere in the interval (α1∗,β1∗)(\alpha_{1}^{*},\beta_{1}^{*}), and

the (2,1)(2,1) entry of (2.1) blows up somewhere in the interval (α2∗,β2∗)(\alpha_{2}^{*},\beta_{2}^{*}).

Similar problems occur when tt is close to 11, but then with the roles of the (1,2)(1,2) and (2,1)(2,1) entries of WW 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 0<t≤tcrit0<t\leq t_{\textrm{crit}} and tcrit≤t<1t_{crit}\leq t<1. For definiteness we assume from now on

The case where tcrit≤t<1t_{\textrm{crit}}\leq t<1 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 Γ1\Gamma_{1}, Γ2\Gamma_{2} in the complex plane. This transformation is similar to the so-called global opening of the lens discussed in .

for j=1,2j=1,2. Since pjp_{j} is varying with nn, the quantities (2.8)–(2.9) are also varying with nn. For n→∞n\to\infty they tend to αj∗\alpha_{j}^{*} and βj∗\beta_{j}^{*} given by (1.10)–(1.11) with T=1T=1. Define the corresponding semicircle laws

which are also (slightly) varying with nn.

We take a reference point x0∈(β2,α1)x_{0}\in(\beta_{2},\alpha_{1}) and we choose unbounded contours Γ1\Gamma_{1}, Γ2\Gamma_{2} in the complex plane, crossing the real axis in points x1x_{1}, x2x_{2} so that

Thus XX satisfies the following RH problem.

For the asymptotic condition (2.14) we note that

Note also that the jump matrices on Γ1\Gamma_{1} and Γ2\Gamma_{2} tend to the identity matrix as z→∞z\to\infty.

What we have gained is that in the jump matrices on the intervals (−∞,x2)(-\infty,x_{2}) and (x1,∞)(x_{1},\infty), the first and second columns of the top right 2×22\times 2 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., 0<t≤tcrit0<t\leq t_{\textrm{crit}}. The case where tcrit<t<1t_{\textrm{crit}}<t<1 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 XX differently as (compare with (2.11), (2.12))

The further steps in the steepest descent analysis will then be similar to the case where 0<t≤tcrit0<t\leq t_{\textrm{crit}} and we will not discuss this any further.

Alternatively, the results for tcrit<t<1t_{\textrm{crit}}<t<1 could be reduced to those for 0<t≤tcrit0<t\leq t_{\textrm{crit}} 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 gg-functions.

As said before, in the limit n→∞n\to\infty we expect the Brownian particles to be distributed on two separate intervals [α1∗,β1∗][\alpha_{1}^{*},\beta_{1}^{*}] and [α2∗,β2∗][\alpha_{2}^{*},\beta_{2}^{*}] (recall tt is fixed), with limiting densities given by the two Wigner semicircle laws (1.12).

For finite nn, we have defined αj\alpha_{j} and βj\beta_{j} by (2.8)–(2.9) and the densities (2.10) that are varying with nn. We use the gg-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 1/pj1/p_{j}) are the equilibrium measures in the presence of the quadratic external fields V1V_{1}, V2V_{2}, respectively, see . The fact that V1V_{1} in (2.5) has a factor p1p_{1} in its denominator can be interpreted by noting that for p1→0p_{1}\to 0, the external field V1V_{1} 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 gg-functions to normalize the RH problem at infinity. We define a new 4×44\times 4 matrix-valued function T=T(z)T=T(z) by

The RH problem for T=T(z)T=T(z) is normalized at infinity in the sense that

as z→∞z\to\infty. This follows from the fact that gj(z)=pjlog⁡z+O(1/z)g_{j}(z)=p_{j}\log z+O(1/z) as z→∞z\to\infty for j=1,2j=1,2, so that

as z→∞z\to\infty. Hence the factor GnG^{n} in (2.26) cancels the powers of zz appearing in (2.14). Also note that the similarity relation with the matrix LL 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 T(z)T(z) as shown in Figure 6. On (x2,x1)(x_{2},x_{1}) the jump matrix is

Thus TT satisfies the following RH problem.

4 Asymptotic behavior of the jump matrices

In this subsection, we investigate the asymptotic behavior in the large nn limit of each of the jump matrices in the RH problem for T=T(z)T=T(z) in Figure 6. Our goal is to show that all the jump matrices are exponentially close (as n→∞n\to\infty) to the identity matrix, except for the jump matrices on the intervals (α1,β1)(\alpha_{1},\beta_{1}) and (α2,β2)(\alpha_{2},\beta_{2}) which have an oscillatory behavior. To be able do so we still have the freedom to take the reference point x0x_{0} and the contours Γ1\Gamma_{1} and Γ2\Gamma_{2} in an appropriate way. We also have the constant κ\kappa in (2.28) at our disposal.

In what follows we will make extensive use of the ξ\xi-functions which are essentially the derivatives of the λ\lambda-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). \hfill□\hfill\square\\

The main property of the ξ\xi-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 x0∈(β2,α1)x_{0}\in(\beta_{2},\alpha_{1}) such that

proof. We prove the lemma in two steps. In the first step we show that there exists x0∈(β2,α1)x_{0}\in(\beta_{2},\alpha_{1}) such that

This we can do by giving x0x_{0} the explicit value

which means that x0x_{0} lies between the midpoints of the two intervals, and so in particular α2<x0<β1\alpha_{2}<x_{0}<\beta_{1}.

Because we are assuming that we are in a situation of large separation we have (p1+p2)2<(a1−a2)(b1−b2)(\sqrt{p_{1}}+\sqrt{p_{2}})^{2}<(a_{1}-a_{2})(b_{1}-b_{2}) 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 ξ3(x0)>ξ4(x0)\xi_{3}(x_{0})>\xi_{4}(x_{0}), as claimed as well.

If ξ3(β2)<Ξ2\xi_{3}(\beta_{2})<\Xi_{2}, then ξ3(β2)<ξ4(β2)\xi_{3}(\beta_{2})<\xi_{4}(\beta_{2}), and since by what we already proved, the inequality ξ3(x)>ξ4(x)\xi_{3}(x)>\xi_{4}(x) holds for some x∈(β2,α1)x\in(\beta_{2},\alpha_{1}), there also exists x∗∈(β2,α1)x^{*}\in(\beta_{2},\alpha_{1}) where equality ξ3(x∗)=ξ4(x∗)\xi_{3}(x^{*})=\xi_{4}(x^{*}) holds. Then by the monotonicity properties of the ξ\xi-functions (stated in parts (a) and (b) of Lemma 2.2)

Then by slightly increasing x∗x^{*} we find x0x_{0} such that the inequalities (2.44) hold (with strict inequalities).

If ξ3(β2)=Ξ2\xi_{3}(\beta_{2})=\Xi_{2}, then as above we have

Then for x0x_{0} slightly larger than β2\beta_{2}, we have (2.44) with strict inequalities, since ξ2′(x0)=+∞\xi_{2}^{\prime}(x_{0})=+\infty and ξ4′(x0)=−∞\xi_{4}^{\prime}(x_{0})=-\infty, see formulas (2.43).

If ξ3(β2)>Ξ2\xi_{3}(\beta_{2})>\Xi_{2}, then ξ3(β2)>ξ2(β2)\xi_{3}(\beta_{2})>\xi_{2}(\beta_{2}). Since ξ2\xi_{2} is increasing we find ξ2(α1)>ξ2(β2)=Ξ2≥Ξ1=ξ3(α1)\xi_{2}(\alpha_{1})>\xi_{2}(\beta_{2})=\Xi_{2}\geq\Xi_{1}=\xi_{3}(\alpha_{1}), see Lemma 2.2. Thus there exists x0∈(β2,α1)x_{0}\in(\beta_{2},\alpha_{1}) with ξ2(x0)=ξ3(x0)\xi_{2}(x_{0})=\xi_{3}(x_{0}). We have ξ4(x0)<ξ2(x0)\xi_{4}(x_{0})<\xi_{2}(x_{0}), ξ1(x0)<ξ3(x0)\xi_{1}(x_{0})<\xi_{3}(x_{0}), and

again by Lemma 2.2, so that ξ1(x0)≤ξ4(x0)\xi_{1}(x_{0})\leq\xi_{4}(x_{0}) and the inequalities (2.44) hold. \hfill□\hfill\square\\

It follows from the proof that in most cases we may assume that the inequalities (2.44) are strict. Only if t=tcritt=t_{\textrm{crit}} then Ξ1=Ξ2\Xi_{1}=\Xi_{2} and then we can only obtain

After the preliminaries on the ξ\xi-functions we consider the jump matrices on Γ1\Gamma_{1} and Γ2\Gamma_{2}. We want that the jump matrices on these curves, shown in Figure 6, are exponentially close to the identity matrix as n→∞n\to\infty. Thus we want to choose Γ1\Gamma_{1} and Γ2\Gamma_{2} so that

for certain constants c1c_{1}, c2c_{2} that do not depend on nn.

We take the point x0x_{0} satisfying the inequalities (2.44) of Lemma 2.3. We have by (2.34)

The constant κ\kappa is still at our disposal. We choose it here so that (2.54) vanishes for z=x0z=x_{0}. Thus

see (2.37), we can then find x1x_{1} and x2x_{2} sufficiently close to x0x_{0} so that β2<x2<x0<x1<α1\beta_{2}<x_{2}<x_{0}<x_{1}<\alpha_{1} and

We will choose Γ1\Gamma_{1} and Γ2\Gamma_{2} so that they cross the real axis in x1x_{1} and x2x_{2}, 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 Γ1\Gamma_{1} and Γ2\Gamma_{2} this way, follows from the following lemma.

For j=1,2j=1,2, let Ωjo\Omega_{j}^{o} denote the connected component of Ωj\Omega_{j} that contains xjx_{j}. Then Ωjo\Omega_{j}^{o} is unbounded. In addition, for each ε>0\varepsilon>0 there exists R>0R>0 so that

Suppose that Ω1o‾\overline{\Omega_{1}^{o}} (the closure of Ω1o\Omega_{1}^{o}) has nonempty intersection with the interval [α2,β2][\alpha_{2},\beta_{2}]. Since Ω1o\Omega_{1}^{o} is connected, and symmetric with respect to the real axis, it will then surround the point x2x_{2}, so that Ω2o\Omega_{2}^{o} must be bounded and

Then if Ω1o\Omega_{1}^{o} is bounded we obtain a contradiction with the maximum principle in the same way. Thus Ω1o\Omega_{1}^{o} is unbounded, and likewise Ω2o\Omega_{2}^{o} is unbounded as well.

as z→∞z\to\infty, since gj(z)=pjlog⁡z+O(1/z)g_{j}(z)=p_{j}\log z+O(1/z) as z→∞z\to\infty. In addition, we have

We conclude from Lemma 2.4 that the curves Γ1\Gamma_{1}, Γ2\Gamma_{2} can be extended to infinity so that

for some constants c1,c2>0c_{1},c_{2}>0. Since as n→∞n\to\infty we are in a non-critical situation, the contours Γj\Gamma_{j} and the constants cjc_{j} can be taken independently of nn for nn large enough. Then the off-diagonal entries in the jump matrices on Γ1\Gamma_{1} and Γ2\Gamma_{2} are uniformly exponentially small as n→∞n\to\infty, as required.

We next investigate the jump matrices in the RH problem for TT 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 λk,+−λj,−\lambda_{k,+}-\lambda_{j,-} on the real line for various combinations of jj and kk.

proof. (a) From the definitions (2.34) and (2.5)–(2.6) it follows that for j=1,2j=1,2,

so that part (a) is a restatement of the Euler-Lagrange conditions (2.22)–(2.25).

(b) Recall that the constant κ\kappa was chosen so that λ3(x0)=λ4(x0)\lambda_{3}(x_{0})=\lambda_{4}(x_{0}). Then in view of part (a) we know that

Taking x1x_{1} and x2x_{2} sufficiently close to x0x_{0} (which we can do without loss of generality), we then have the inequalities (2.64)–(2.65) on the interval (x2,x1)(x_{2},x_{1}).

where the last inequality holds because of Lemma 2.3. Since

The inequality (2.65) for x>x0x>x_{0} follows in the same way. \hfill□\hfill\square\\

It follows from Lemma 2.5 that, up to exponentially small corrections, the jump matrices on the real line in the RH problem for TT take the following form

and (I200I2)\begin{pmatrix}I_{2}&0\\ 0&I_{2}\end{pmatrix} on (x2,x1)(x_{2},x_{1}).

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 [α2,β2][\alpha_{2},\beta_{2}] and [α1,β1][\alpha_{1},\beta_{1}], respectively, and they are equal to 11 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 Γ1\Gamma_{1} and Γ2\Gamma_{2} so that all jumps in the RH problem for TT tend to the identity matrix as n→∞n\to\infty, except for the jump matrices on the two intervals [αj,βj][\alpha_{j},\beta_{j}], j=1,2j=1,2, 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 4×44\times 4 RH problem for T=T(z)T=T(z) asymptotically decouples into two RH problems of size 2×22\times 2, one involving rows and columns 11 and 33 and the other involving rows and columns 22 and 44. The coupling between the two RH problems is exponentially small as n→∞n\to\infty. Thus we are dealing now essentially with two RH problems of size 2×22\times 2. The remaining steps in the Deift-Zhou steepest descent analysis can then be done in a standard way on these decoupled 2×22\times 2 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 (αj,βj)(\alpha_{j},\beta_{j}), j=1,2j=1,2. 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 2×22\times 2 problems. We obtain in this way a new matrix function S=S(z)S=S(z) obtained from T(z)T(z) 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 [α1,β1][\alpha_{1},\beta_{1}]. We have here the matrix factorization

We can then open a lens around [α1,β1][\alpha_{1},\beta_{1}] and define

Similarly we open a lens around [α2,β2][\alpha_{2},\beta_{2}] and define

The matrix function S=S(z)S=S(z) satisfies the following RH problem

S+(x)=S−(x)(0010−en(λ1,+−λ2)1en(λ3,+−λ2)0−10000001)S_{+}(x)=S_{-}(x)\begin{pmatrix}0&0&1&0\\ -e^{n(\lambda_{1,+}-\lambda_{2})}&1&e^{n(\lambda_{3,+}-\lambda_{2})}&0\\ -1&0&0&0\\ 0&0&0&1\end{pmatrix} on (α1,β1)(\alpha_{1},\beta_{1})

S+(x)=S−(x)(1−en(λ2,+−λ1)0en(λ4,+−λ1)000100100−100)S_{+}(x)=S_{-}(x)\begin{pmatrix}1&-e^{n(\lambda_{2,+}-\lambda_{1})}&0&e^{n(\lambda_{4,+}-\lambda_{1})}\\ 0&0&0&1\\ 0&0&1&0\\ 0&-1&0&0\end{pmatrix} on (α2,β2)(\alpha_{2},\beta_{2})

S+(x)=S−(x)(10000100en(λ1−λ3)0100001)S_{+}(x)=S_{-}(x)\begin{pmatrix}1&0&0&0\\ 0&1&0&0\\ e^{n(\lambda_{1}-\lambda_{3})}&0&1&0\\ 0&0&0&1\end{pmatrix} on the lips of the lens around [α1,β1][\alpha_{1},\beta_{1}],

S+(x)=S−(x)(1000010000100en(λ2−λ4)01)S_{+}(x)=S_{-}(x)\begin{pmatrix}1&0&0&0\\ 0&1&0&0\\ 0&0&1&0\\ 0&e^{n(\lambda_{2}-\lambda_{4})}&0&1\end{pmatrix} on the lips of the lens around [α2,β2][\alpha_{2},\beta_{2}].

On the remaining contours Γ1,Γ2,(−∞,α2),(β2,α1)\Gamma_{1},\Gamma_{2},(-\infty,\alpha_{2}),(\beta_{2},\alpha_{1}) and (β1,∞)(\beta_{1},\infty), the jumps for SS are exactly the same as those for TT.

As already mentioned before, the entries in positions (1,2)(1,2), (1,4)(1,4), (2,1)(2,1) and (2,3)(2,3) in the jump matrices for SS are all exponentially small when n→∞n\to\infty (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 S=S(z)S=S(z) by ignoring all exponentially small entries in the jump matrices. The model RH will be defined in the region

The solution P(∞)(z)P^{(\infty)}(z) to this model RH problem can be constructed in the usual way for each of the two 2×22\times 2 problems into which the 4×44\times 4 problem decouples. This leads to the parametrix

and where we choose the principal branches of the 1/41/4 powers.

5.3 Local parametrices around the branch points

Consider disks around the branch points αj,βj\alpha_{j},\beta_{j}, j=1,2j=1,2 with sufficiently small radius. Inside these disks one can construct local parametrices P(Airy)(z)P^{(\textrm{Airy})}(z) to the RH problem for S(z)S(z) in terms of Airy functions. Once again, these parametrices can be constructed in the usual way on each of the two 2×22\times 2 RH problems. We omit further details.

5.4 Fourth transformation and completion of the steepest descent analysis

Define a final matrix-valued function R(z)R(z) by

From the construction of the parametrices it then follows that RR satisfies a RH problem

RR has jumps R+=R−JRR_{+}=R_{-}J_{R} on ΣR\Sigma_{R}, that satisfy

as n→∞n\to\infty, uniformly for zz 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 4×44\times 4 RH problem for large nn, there follows a similar decoupling for the kernel in (1.23) and hence for the associated non-intersecting Brownian particles.

First assume that x,y∈(α1∗,β1∗)x,y\in(\alpha_{1}^{*},\beta_{1}^{*}) and consider the correlation kernel (1.23) Kn1,n2;n1,n2K_{n_{1},n_{2};n_{1},n_{2}}, which for short we denote by KnK_{n}. By virtue of (2.11) we obtain

Now it follows from (2.77) by standard arguments (e.g. [7, Section 9]) that

uniformly in nn. Inserting this into (2.78) yields

uniformly in nn. Now in the limit when y→xy\to x, the last two terms in (2.79) become exponentially small by virtue of Lemma 2.5(b). Then by letting y→xy\to x and using l’Hôpital’s rule and find

as n→∞n\to\infty, where the last step follows from (2.43). We conclude that

For x∈(α2∗,β2∗)x\in(\alpha_{2}^{*},\beta_{2}^{*}) we obtain in a similar way that 1nKn(x,x)\frac{1}{n}K_{n}(x,x) tends to the semi-circle density on the interval [α2∗,β2∗][\alpha_{2}^{*},\beta_{2}^{*}]. Thus by (1.23) we have completed the proof of Theorem 1.3 in the case of large separation (recall that T=1T=1). \hfill□\hfill\square\\

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 aj,bja_{j},b_{j}, j=1,2j=1,2 fixed such that

and that we consider the temperature TT to be varying with nn as

Before proceeding further, let us recall the main objects needed for the steepest descent analysis. The points αj,βj\alpha_{j},\beta_{j}, j=1,2j=1,2 are as defined in (2.8)–(2.9), but now with TT in (3.2) not identically equal to 1:

for j=1,2j=1,2. The limiting values for n→∞n\to\infty of these points are denoted by (cf. (1.10)–(1.11))

j=1,2j=1,2. Recall also the λ\lambda-functions and ξ\xi-functions which are given by (2.34) and (2.43). We will denote the limiting values for n→∞n\to\infty of these functions by λk∗(z)\lambda_{k}^{*}(z), ξk∗(z)\xi_{k}^{*}(z), k=1,…,4k=1,\ldots,4. For example, the functions ξk∗(z)\xi_{k}^{*}(z) 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 tcritt_{\textrm{crit}} is now the time where the two ellipses in Figure 2 are tangent to each other. The case where tcrit<t<1t_{\textrm{crit}}<t<1 can be handled in a similar way; cf. Remark 2.1. The behavior at the tangent time tcritt_{\textrm{crit}} 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 x0∈(β2,α1)x_{0}\in(\beta_{2},\alpha_{1}) 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 x0∗x_{0}^{*} 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 x0∗x_{0}^{*} defined in (3.9) satisfies the inequalities

proof. From the definitions (3.7) and keeping track of the correct branches of the 1/21/2 powers, we find

Similarly, ξ2∗(x0∗)−ξ3∗(x0∗)>0\xi_{2}^{*}(x_{0}^{*})-\xi_{3}^{*}(x_{0}^{*})>0. \hfill□\hfill\square\\

Note that the relations (3.14) correspond to the two outermost inequalities in (2.44), evaluated asymptotically for n→∞n\to\infty. By continuity, these inequalities then also hold for nn finite but sufficiently large.

In a similar way we would like to have the middle inequality in (2.44), i.e., ξ3∗(x0∗)>ξ4∗(x0∗)\xi_{3}^{*}(x_{0}^{*})>\xi_{4}^{*}(x_{0}^{*}). However, this is not the case, since instead we have equality ξ4∗(x0∗)−ξ3∗(x0∗)=0\xi_{4}^{*}(x_{0}^{*})-\xi_{3}^{*}(x_{0}^{*})=0. We need a more detailed statement of the zero behavior.

where cc is the positive constant given by

proof. Recall from Section 2 that we choose the constant κ\kappa such that

Now we consider the subsequent derivatives of λ4∗−λ3∗\lambda_{4}^{*}-\lambda_{3}^{*} at x0∗x_{0}^{*}. We start with the first derivative ξ4∗(x0∗)−ξ3∗(x0∗)\xi_{4}^{*}(x_{0}^{*})-\xi_{3}^{*}(x_{0}^{*}). 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 λ4∗−λ3∗\lambda_{4}^{*}-\lambda_{3}^{*} at x0∗x_{0}^{*}. 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 z=x0∗z=x_{0}^{*} and hence (3.19) vanishes.

of λ4∗−λ3∗\lambda_{4}^{*}-\lambda_{3}^{*} at x0∗x_{0}^{*}. We have

We will then choose Γ1\Gamma_{1} so that it lies in the sectors with negative real part and Γ2\Gamma_{2} so that it lies in the sectors with positive real part. In particular, note that Γ1\Gamma_{1} and Γ2\Gamma_{2} now both pass through x0∗x_{0}^{*}. Just as in Section 2, we will choose these curves independent of nn.

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 nn fixed and sufficiently large.

The first transformation Y↦XY\mapsto X 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 Γ1\Gamma_{1} and Γ2\Gamma_{2} in a different way. As explained at the end of the previous subsection, these curves should be chosen fixed (independent of nn) and such that they pass through the point x0∗x_{0}^{*} in certain sectors of the complex plane.

2.2 Second transformation: Normalization at infinity

The transformation X↦TX\mapsto T is the same as in Section 2.3. The new matrix valued function T=T(z)T=T(z) is normalized at infinity in the sense that T(z)=I+O(1/z)T(z)=I+O(1/z) as z→∞z\to\infty. The jump matrices in the RH problem for T(z)T(z) 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 Γ1\Gamma_{1} and Γ2\Gamma_{2}, we see that the conclusions of Section 2.4 all remain valid for nn sufficiently large, except that in a neighborhood of the point x0∗x_{0}^{*} (through which now both Γ1\Gamma_{1} and Γ2\Gamma_{2} pass), the jump matrices are not exponentially close to the identity matrix. This means that, except for a small neighborhood of x0∗x_{0}^{*}, the RH problem again asymptotically decouples into two 2×22\times 2 problems involving rows and columns 11, 33 and 22, 44, 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 x0∗x_{0}^{*}. In fact, since x0∗x_{0}^{*} is away from the intervals [α1,β1][\alpha_{1},\beta_{1}] and [α2,β2][\alpha_{2},\beta_{2}] for nn sufficiently large, the jump matrices on the real line close to x0∗x_{0}^{*} are all exponentially close to the identity matrix. Ignoring these jump matrices, the only jump conditions that remain are those on the curves Γ1\Gamma_{1} and Γ2\Gamma_{2}. From Figure 8 we see that the latter constitute essentially a 2×22\times 2 RH problem involving rows and columns 33 and 44 only. This leads to the jump matrices shown in Figure 9.

2.4 Third transformation: Opening of the lenses

Around the intervals [α1,β1][\alpha_{1},\beta_{1}] and [α2,β2][\alpha_{2},\beta_{2}], we are in the region where the RH problem decouples into two 2×22\times 2 problems. We can then define a transformation T↦ST\mapsto S 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 x0∗x_{0}^{*} (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 α1,β1,α2,β2\alpha_{1},\beta_{1},\alpha_{2},\beta_{2} and x0∗x_{0}^{*}. Since we are considering the region away from the special point x0∗x_{0}^{*}, we are essentially dealing with two 2×22\times 2 matrix valued RH problems. The construction of the parametrix P(∞)(z)P^{(\infty)}(z) is then exactly the same as in Section 2.5.2.

In small disks around the endpoints of the intervals [α1,β1][\alpha_{1},\beta_{1}] and [α2,β2][\alpha_{2},\beta_{2}], one can construct local parametrices P(Airy)(z)P^{(\textrm{Airy})}(z) 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 x0∗x_{0}^{*}. 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 2×22\times 2 matrix valued function Ψ\Psi then satisfies the following RH problem:

For ζ∈⋃k=05{arg⁡ζ=π/6+kπ/3}\zeta\in\bigcup_{k=0}^{5}\{\arg\zeta=\pi/6+k\pi/3\}, Ψ(ζ,s)\Psi(\zeta,s) has jumps as shown in Figure 10;

where σ3:=diag⁡(1,−1)\sigma_{3}:=\operatorname{diag}(1,-1) 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 s2=0s_{2}=0, 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 9090 degrees, i.e., we set

Then Ψ~\widetilde{\Psi} satisfies the following RH problem:

On the rays arg⁡ζ=±π/3\arg\zeta=\pm\pi/3, Ψ~(ζ,s)\widetilde{\Psi}(\zeta,s) has jump matrix (1−101)\begin{pmatrix}1&-1\\ 0&1\end{pmatrix}, On the rays arg⁡ζ=±2π/3\arg\zeta=\pm 2\pi/3, Ψ~(ζ,s)\widetilde{\Psi}(\zeta,s) has jump matrix (1011)\begin{pmatrix}1&0\\ 1&1\end{pmatrix}, see Figure 12;

Now we apply one final modification. Define a new matrix function

Then MM satisfies the following RH problem:

On the rays arg⁡ζ=±π/3\arg\zeta=\pm\pi/3, M(ζ,s)M(\zeta,s) has jump matrix (1e83ζ3−2sζ01)\begin{pmatrix}1&e^{\frac{8}{3}\zeta^{3}-2s\zeta}\\ 0&1\end{pmatrix}, On the rays arg⁡ζ=±2π/3\arg\zeta=\pm 2\pi/3, M(ζ,s)M(\zeta,s) has jump matrix (10−e−(83ζ3−2sζ)1)\begin{pmatrix}1&0\\ -e^{-(\frac{8}{3}\zeta^{3}-2s\zeta)}&1\end{pmatrix}, see Figure 13;

3.2 Construction of local parametrix

Now we construct a local parametrix near the special point x0∗x_{0}^{*}. 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 Ψ\Psi-functions associated with Painlevé II played a role and .

We are going to construct the local parametrix in the neighborhood

of x0∗x_{0}^{*}, where the radius δ>0\delta>0 is fixed but sufficiently small.

Recall that for nn sufficiently large the jumps near x0∗x_{0}^{*} are essentially those of a 2×22\times 2 matrix-valued RH problem involving rows and columns 33, 44, with jump matrices shown in Figure 9. To construct the local parametrix near x0∗x_{0}^{*}, we construct similar jumps via the model RH problem for M(ζ,s)M(\zeta,s) in Figure 13. To this end, we propose a local parametrix P(x0∗)(z)P^{(x_{0}^{*})}(z) of the form

where P(∞)(z)P^{(\infty)}(z) 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 f(z)f(z) is a conformal map mapping the neighborhood UδU_{\delta} of x0∗x_{0}^{*} (provided δ\delta is small enough) onto a neighborhood of the origin in the ζ\zeta-plane. It follows that sn(z)s_{n}(z) in (3.29) is a well-defined analytic function in UδU_{\delta}, due to pole-zero cancelation at x0∗x_{0}^{*}. Indeed, this follows from the fact that both terms in the numerator of (3.29) vanish at z=x0∗z=x_{0}^{*}, cf. (3.18).

(Conformal map) The function f(z)f(z) is analytic in a neighborhood UδU_{\delta} of x0∗x_{0}^{*} and satisfies

as z→x0∗z\to x_{0}^{*}, where the constant KK is defined in (1.49).

proof. This follows from (3.28) and Lemma 3.2. \hfill□\hfill\square\\

From the above definitions (3.27)–(3.29) we see that if ζ=n1/3f(z)\zeta=n^{1/3}f(z) and s=n2/3sn(z)s=n^{2/3}s_{n}(z), then the exponent occurring in the jump matrices in Figure 13 reduces to

This shows that M(n1/3f(z),n2/3sn(z))M(n^{1/3}f(z),n^{2/3}s_{n}(z)) has precisely the required jumps in the RH problem near x0∗x_{0}^{*}, cf. Figure 9, provided the contours Γ1\Gamma_{1} and Γ2\Gamma_{2} near x0∗x_{0}^{*} are chosen in such a way that they are mapped by the conformal map ff to the straight lines in Figure 13. We have indeed the freedom to choose Γ1\Gamma_{1} and Γ2\Gamma_{2} in that way near x0∗x_{0}^{*}.

A technical issue that remains is showing that the RH problem for M(n1/3f(z),n2/3sn(z))M(n^{1/3}f(z),n^{2/3}s_{n}(z)) is solvable. This is equivalent with the fact that n2/3sn(z)n^{2/3}s_{n}(z) stays away from P{\cal P}, 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 sn(z)s_{n}(z)) We have as n→∞n\to\infty,

and the OO-term in (3.31) is uniform for z∈Uδz\in U_{\delta}.

proof. Since T=1+Ln−2/3T=1+Ln^{-2/3} and pj=pj∗+O(n−1)p_{j}=p_{j}^{*}+O(n^{-1}) it follows from (3.3)–(3.4) that

as n→∞n\to\infty. Then by (3.33) and (3.34) we have uniformly for y∈Uδ‾y\in\overline{U_{\delta}},

and the OO term is uniform for z∈Uδz\in U_{\delta}.

The lemma now follows because of the definition of sn(z)s_{n}(z) in (3.29) and the fact that f(z)f(z) has a simple zero at z=x0∗z=x_{0}^{*}. \hfill□\hfill\square\\

We have as z→x0∗z\to x_{0}^{*} and n→∞n\to\infty,

where the real constant ss is defined in (1.50).

for every z∈Uδz\in U_{\delta} and for all large enough nn.

By (3.32), (3.5)–(3.6), and (3.10)–(3.11) we have for j=1,2j=1,2,

where for the last equality we used the definition of KK, see (1.49), and the relation (1.50) between LL and ss. Now (3.37) follows from (3.38) and (3.41).

(b) The equation (3.37) implies that there exist constants K1K_{1} and K2K_{2}, independent of nn and zz, such that for z∈Uδz\in U_{\delta} and nn large enough,

Since ss is real, and since the Hastings-McLeod solution has no poles on the real line, part (b) follows. \hfill□\hfill\square\\

Now we can check that the local parametrix P(x0∗)P^{(x_{0}^{*})} defined by (3.27) satisfies the following ‘local RH problem’

P(x0∗)P^{(x_{0}^{*})} is analytic in Uδ∖(Γ1∪Γ2)U_{\delta}\setminus(\Gamma_{1}\cup\Gamma_{2});

On Γ1\Gamma_{1} and Γ2\Gamma_{2}, P(x0∗)P^{(x_{0}^{*})} has jumps with jump matrices of the form (I200∗)\begin{pmatrix}I_{2}&0\\ 0&*\end{pmatrix} where the 2×22\times 2 matrices indicated by ∗* are given in Figure 9;

uniformly for zz on the circle ∂Uδ\partial U_{\delta}.

The matching condition (3) follows from the definition (3.27) and the fact that M(ζ,s)=I+O(1/ζ)M(\zeta,s)=I+O(1/\zeta) as ζ→∞\zeta\to\infty uniformly for all ss of the form s=n2/3sn(z)s=n^{2/3}s_{n}(z).

4 Fourth transformation and completion of the proof of Theorem 1.3

Using the global parametrix P(∞)P^{(\infty)} and the local parametrices P(Airy)P^{(\textrm{Airy})} and P(x0∗)P^{(x_{0}^{*})}, we define the final transformation S↦RS\mapsto R by

From the constructions in this section it follows that RR satisfies the following RH problem

RR has jumps R+=R−JRR_{+}=R_{-}J_{R} on ΣR\Sigma_{R}, that satisfy

as n→∞n\to\infty, uniformly for zz in the complex plane. This completes the RH steepest descent analysis.

We will explicitly compute this O(n−1/3)O(n^{-1/3}) 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 nn 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 ci,jc_{i,j} are the entries of the matrix Y1Y_{1} 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 zz in the region between the contours Γ1\Gamma_{1} and Γ2\Gamma_{2}

where G1G_{1}, P1(∞)P_{1}^{(\infty)} and R1R_{1} are matrices from the expansions as z→∞z\to\infty,

We are only interested in the combinations (4.1) and (4.2) of entries of Y1Y_{1}. Since LL is a diagonal matrix, the factors LnL^{n} and L−nL^{-n} in (4.4) will not play a role for these combinations. Also, since G1G_{1} is a diagonal matrix (which is clear from (4.5), since G(z)G(z) is diagonal), this does not play a role either. Therefore we have for i<ji<j,

In what follows we evaluate P1(∞)P_{1}^{(\infty)} and R1R_{1}.

The evaluation of P1(∞)P_{1}^{(\infty)} is straightforward.

proof. Recall that P(∞)(z)P^{(\infty)}(z) is defined by means of (2.74) and (2.75). For z→∞z\to\infty we have the expansions

Since βj−αj=4pjTt(1−t)\beta_{j}-\alpha_{j}=4\sqrt{p_{j}Tt(1-t)}, see (3.3)–(3.4), we obtain (4.10) from (2.74) and (4.6). \hfill□\hfill\square\\

2 Second term in the expansion of the jump matrix for R​(z)𝑅𝑧R(z)

We use the clockwise orientation on the circle ∂Uδ\partial U_{\delta} around x0∗x_{0}^{*}. Thus the outside of the circle is the ++-side and the inside of the circle is the −--side. The matrix valued function R(z)R(z) in (3.43) then satisfies the jump condition

on ∂Uδ\partial U_{\delta}, with jump matrix Δ(z)\Delta(z) given by

see (3.27). To prepare for the evaluation of R1R_{1}, we first compute the second term in the expansion of the jump matrix Δ(z)\Delta(z) as n→∞n\to\infty.

(Asymptotics of jump matrix for R(z)R(z)) The jump matrix Δ(z)\Delta(z) in (4.11), (4.12) has the asymptotics

uniformly for zz on the circle ∂Uδ\partial U_{\delta}. Here q(s)q(s) denotes the Hastings-McLeod solution to Painlevé II, u(s)u(s) denotes the Hamiltonian

and f(z)f(z) is the conformal map in (3.28).

proof. First, we calculate the large nn asymptotics of the matrix M(n1/3f(z),M(n^{1/3}f(z), n2/3sn(z))n^{2/3}s_{n}(z)) which occurs in the expression (4.12). Recall from Section 3.3.1 that M(ζ,s)M(\zeta,s) is defined as an easy modification of the model RH matrix Ψ(ζ,s)\Psi(\zeta,s) associated to the Hastings-McLeod solution to the Painlevé II equation. It is known (see e.g. ) that the asymptotic expansion (3.22) of Ψ(ζ,s)\Psi(\zeta,s) in powers of ζ−1\zeta^{-1} can be refined to

where q(s)q(s) denotes the Hastings-McLeod solution of Painlevé II and u(s)u(s) denotes the Hamiltonian (4.15). Following the sequence of transformations Ψ↦Ψ~↦M\Psi\mapsto\widetilde{\Psi}\mapsto M in Section 3.3.1 we obtain

as n→∞n\to\infty, uniformly for all zz on the circle ∂Uδ\partial U_{\delta}.

Then (4.14) follows from (4.16), (4.12), and (4.13).\hfill□\hfill\square\\

Note that Δ(1)(z)\Delta^{(1)}(z) depends on nn, as is obvious from the appearance of n2/3sn(z)n^{2/3}s_{n}(z) in (4.14). Also P(∞)P^{(\infty)} depends on nn. As n→∞n\to\infty, the nn-dependent entries have limits, and therefore we can still obtain from the expansion (4.13) of Δ(z)\Delta(z) a similar expansion of the RH matrix R(z)R(z)

The coefficient R(1)(z)R^{(1)}(z), in this expansion can be found by inserting (4.13) and (4.17) into the jump condition R+(z)=R−(z)Δ(z)R_{+}(z)=R_{-}(z)\Delta(z) and collecting terms of order n−1/3n^{-1/3}. This leads to the following additive RH problem for R(1)R^{(1)}:

R+(1)(z)=R−(1)(z)+Δ(1)(z)R^{(1)}_{+}(z)=R^{(1)}_{-}(z)+\Delta^{(1)}(z) for z∈∂Uδz\in\partial U_{\delta},

The jump matrix (4.14) has a simple pole at z=x0∗z=x_{0}^{*}. As in , the RH problem for R(1)R^{(1)} then has the explicit solution

As in other works (see e.g. ) the expansions of R(z)R(z) as z→∞z\to\infty and n→∞n\to\infty commute with each other. It thus follows from (4.17) and (4.18) that

In view of (4.19) the evaluation of R1R_{1} comes down to the determination of the residue of Δ(1)\Delta^{(1)} at z=x0∗z=x_{0}^{*}. The result is the following.

where KK is the constant defined in (1.49) and where the 2×22\times 2 blocks AA, BB, CC, DD are given by

To evaluate P(∞)(x0∗)P^{(\infty)}(x_{0}^{*}) we observe that by (2.74) we need the entries γj(x0∗)±γj(x0∗)\gamma_{j}(x_{0}^{*})\pm\gamma_{j}(x_{0}^{*}), for j=1,2j=1,2. We compute the squares of these

where we used (2.75). We emphasize that we use ⋅\sqrt{\cdot} to denote the positive square root of a positive real number. Now recall that αj\alpha_{j} and βj\beta_{j} are varying with nn, and satisfy αj=αj∗+O(n−2/3)\alpha_{j}=\alpha_{j}^{*}+O(n^{-2/3}), βj=βj∗+O(n−2/3)\beta_{j}=\beta_{j}^{*}+O(n^{-2/3}). For the starred quantities we can use the identities (3.10)–(3.13), so that (4.26) yields

Since 0<γ2(x0∗)<1<γ1(x0∗)0<\gamma_{2}(x_{0}^{*})<1<\gamma_{1}(x_{0}^{*}) (as can easily be seen from (2.75) and the fact that α2<β2<x0∗<α1<β1\alpha_{2}<\beta_{2}<x_{0}^{*}<\alpha_{1}<\beta_{1}), we obtain after simple calculations

Putting (4.27) and (4.28) into (2.74) we find

Using the fact that P(∞)(x0∗)P^{(\infty)}(x_{0}^{*}) has a 2×22\times 2 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). \hfill□\hfill\square\\

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 c1,2c2,4c1,4\frac{c_{1,2}c_{2,4}}{c_{1,4}} in (1.40). By (4.9) and from the fact that (P1(∞))i,j=0(P_{1}^{(\infty)})_{i,j}=0 whenever i+ji+j is odd, see (4.10), we have

which since p2=p2∗+O(n−1)p_{2}=p_{2}^{*}+O(n^{-1}) and T=1+O(n−1/3)T=1+O(n^{-1/3}), 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. \hfill□\hfill\square\\

(The case where tcrit<t<1t_{\textrm{crit}}<t<1) Recall that the above derivations have all been made under the assumption that 0<t<tcrit0<t<t_{\textrm{crit}}. The case where tcrit<t<1t_{\textrm{crit}}<t<1 can be handled by means of similar calculations; see also Remark 2.1. Alternatively, one can immediately reduce this to the case where 0<t<tcrit0<t<t_{\textrm{crit}} 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 tcrit<t<1t_{\textrm{crit}}<t<1 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 Y1Y_{1}; 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 p+q+1p+q+1 term recurrence relations for the multiple orthogonal polynomials of Definition 1.4.

As in the classical case p=q=1p=q=1 , 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 z→∞z\to\infty asymptotics of the matrix Y(z)=Yn,m(z)Y(z)=Y_{\mathbf{n},\mathbf{m}}(z) in (1.22):

Note that the matrices Y1=(Y1)n,mY_{1}=(Y_{1})_{\mathbf{n},\mathbf{m}} and Y2=(Y2)n,mY_{2}=(Y_{2})_{\mathbf{n},\mathbf{m}} are constant (independent of zz).

Our goal is to find recurrence relations between the RH matrices with multi-indices n+ek,m+el\mathbf{n}+\mathbf{e}_{k},\mathbf{m}+\mathbf{e}_{l} and n,m\mathbf{n},\mathbf{m}, respectively.

Above we use ek\mathbf{e}_{k} and el\mathbf{e}_{l} 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 ejekT\mathbf{e}_{j}\mathbf{e}_{k}^{T} where ⋅T\cdot^{T} is the transpose, denotes a matrix whose only nonzero entry is a one at the (j,k)(j,k)th position, while ejTek=δj,k\mathbf{e}_{j}^{T}\mathbf{e}_{k}=\delta_{j,k} is the scalar product of the two vectors. So we introduce the convention that ek\mathbf{e}_{k} 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 k∈{1,…,p}k\in\{1,\ldots,p\} and l∈{1,…,q}l\in\{1,\ldots,q\}. From the fact that the jump matrix of Yn,m(z)Y_{\mathbf{n},\mathbf{m}}(z) on the real line is independent of n,m\mathbf{n},\mathbf{m} (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 z→∞z\to\infty we have

Here the middle factor in (5.3) is just the identity matrix with its kkth and (p+l)(p+l)th diagonal entries replaced by zz and , respectively. By Liouville’s theorem it then follows that Un,mk,lU_{\mathbf{n},\mathbf{m}}^{k,l} is a polynomial and so by (5.3)

Summarizing, we obtain the following proposition.

(Forward matrix recurrence relations) Let k∈{1,…,p}k\in\{1,\ldots,p\} and l∈{1,…,q}l\in\{1,\ldots,q\}. Then we have the matrix recurrence relation

with Un,mk,l(z)U_{\mathbf{n},\mathbf{m}}^{k,l}(z) 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 Un,mk,lU_{\mathbf{n},\mathbf{m}}^{k,l} in (5.5) is performed on the left, it easily follows that the kkth component functions Ak(x)A_{k}(x) of the MOP, k=1,…,pk=1,\ldots,p satisfy all the same recurrence relations. So the recurrence relations for the individual components A1(x),…,Ap(x)A_{1}(x),\ldots,A_{p}(x) can be conveniently stacked into vector recurrence relations for the vectors A(x)\mathbf{A}(x).

Let us illustrate this for p=q=2p=q=2, k=l=1k=l=1. Then the recurrence relation (5.5), (5.4) becomes

This is the desired five-term recurrence relation. Note that the factors −2πi-2\pi i are due to the diagonal matrix DD 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 (II,1)(II,1) normalization, we need the transition numbers between different types of MOP normalizations.

The transition numbers are contained in the matrix Y1Y_{1} as follows.

(Interpretation of Y1Y_{1} via transition numbers) Let n\mathbf{n}, m\mathbf{m} with ∣n∣=∣m∣|\mathbf{n}|=|\mathbf{m}| be such that the solvability condition holds. Let DD be the diagonal matrix in Theorem 1.6. Then the off-diagonal entries of the matrix D−1(Y1)n,mDD^{-1}(Y_{1})_{\mathbf{n},\mathbf{m}}D can be expressed as transition numbers between different types of normalizations of MOP. More precisely, the entries of D−1(Y1)n,mDD^{-1}(Y_{1})_{\mathbf{n},\mathbf{m}}D are given as follows:

If 1≤k≤p1\leq k\leq p and 1≤l≤q1\leq l\leq q then the (k,p+l)(k,p+l) entry is tn+ek,m(II,k→I,l)t_{\mathbf{n}+\mathbf{e}_{k},\mathbf{m}}^{(II,k\to I,l)},

If 1≤l≤q1\leq l\leq q and 1≤k≤p1\leq k\leq p then the (p+l,k)(p+l,k) entry is tn,m−el(I,l→II,k)t_{\mathbf{n},\mathbf{m}-\mathbf{e}_{l}}^{(I,l\to II,k)},

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. \hfill□\hfill\square\\

Let us illustrate Proposition 5.4 for the case where p=q=2p=q=2. In this case the proposition asserts that

where the diagonal entries denoted with ∗* are unspecified, and where the diagonal matrix D=diag⁡(1,1,−2πi,−2πi)D=\operatorname{diag}(1,1,-2\pi i,-2\pi i).

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 (II,1)(II,1) 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 p=q=2p=q=2 and k=l=1k=l=1 in the recurrence relations. In a similar way, one can find the recurrence relation for general p,q,k,lp,q,k,l.

(Forward recurrence relations) For any k∈{1,…,p}k\in\{1,\ldots,p\} and l∈{1,…,q}l\in\{1,\ldots,q\}, we have the p+q+1p+q+1 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 w1,kw_{1,k} and w2,lw_{2,l}, not only for Gaussian weights.

We use the terminology ‘off-diagonal’ and ‘diagonal’ recurrence coefficients in analogy with the case of classical orthogonal polynomials p=q=1p=q=1. 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 H=(H)n,mH=(H)_{\mathbf{n},\mathbf{m}} is the Hadamard product (entry-wise product) of the strictly upper triangular part of Y1=(Y1)n,mY_{1}=(Y_{1})_{\mathbf{n},\mathbf{m}} with the transpose of the strictly lower triangular part of Y1Y_{1}. For example, when p=q=2p=q=2 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 Un,mk,l(z)U_{\mathbf{n},\mathbf{m}}^{k,l}(z) in (5.2).) By copying the approach above one finds:

(Backward matrix recurrence relations) Let k∈{1,…,p}k\in\{1,\ldots,p\} and l∈{1,…,q}l\in\{1,\ldots,q\}. Then we have

(Backward recurrence relations) For any k∈{1,…,p}k\in\{1,\ldots,p\} and l∈{1,…,q}l\in\{1,\ldots,q\}, we have the p+q+1p+q+1 term recurrence relation

For example, when p=q=2p=q=2, k=l=1k=l=1 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 pp and qq we consider the weights

We introduce a modification of the RH matrix Y(z)Y(z).

where we used the following functions fjf_{j}, j=1,…,p+qj=1,\ldots,p+q:

The reason for defining the matrix function Ψ\Psi in Definition 5.10 is that it has a constant jump (independent of xx) along the real line. More precisely, it satisfies the following Riemann-Hilbert problem:

where 1p×q1_{p\times q} denotes the p×qp\times q matrix having all entries equal to one;

Since the function Ψ\Psi is defined from YY by the multiplication on the right with an n,m\mathbf{n},\mathbf{m}-independent matrix (recall that NN is assumed to be constant), it satisfies exactly the same recurrence relations as the original RH matrix YY, cf. Section 5.1. Moreover, from the fact that Ψ\Psi 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 z→∞z\to\infty,

By Liouville’s theorem, it then follows that Vn,mV_{\mathbf{n},\mathbf{m}} is a polynomial and hence we obtain from (5.21) that

and where we define C12C_{12} and C21C_{21} by the partitioning of (Y1)n,m(Y_{1})_{\mathbf{n},\mathbf{m}} into blocks:

with the diagonal blocks being of size p×pp\times p and q×qq\times q, respectively. In other words, we have put C11:=[ci,j]i,j=1,…,pC_{11}:=[c_{i,j}]_{i,j=1,\ldots,p}, C12:=[ci,j]i=1,…,p,j=p+1,…,p+qC_{12}:=[c_{i,j}]_{i=1,\ldots,p,j=p+1,\ldots,p+q}, C21:=[ci,j]i=p+1,…,p+q,j=1,…,pC_{21}:=[c_{i,j}]_{i=p+1,\ldots,p+q,j=1,\ldots,p}, and C22:=[ci,j]i,j=p+1,…,p+qC_{22}:=[c_{i,j}]_{i,j=p+1,\ldots,p+q}.

Multiplying both sides of (5.20) on the right with Ψn,m(z)\Psi_{\mathbf{n},\mathbf{m}}(z), we conclude:

(Differential equation for multiple Hermite polynomials) The multiple Hermite polynomials satisfy the matrix differential equation

with Vn,m(z)V_{\mathbf{n},\mathbf{m}}(z) 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 (Y1)n,m(Y_{1})_{\mathbf{n},\mathbf{m}} 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 k∈{1,…,p}k\in\{1,\ldots,p\} and l∈{1,…,q}l\in\{1,\ldots,q\}. The compatibility condition between the differential equation (5.25) and the forward recurrence relation (5.5) is

where the matrix Vn,m(z)V_{\mathbf{n},\mathbf{m}}(z) is given by (5.22), Vn+ek,m+el(z)V_{\mathbf{n}+\mathbf{e}_{k},\mathbf{m}+\mathbf{e}_{l}}(z) is given analogously by

and Un,mk,l(z)U^{k,l}_{\mathbf{n},\mathbf{m}}(z) 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 p×pp\times p, and so on. In the right-hand side of (5.29) we use our convention that ek\mathbf{e}_{k} and el\mathbf{e}_{l} 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 zz, and therefore all terms on the right-hand side involving zz or z2z^{2} 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 [⋅,⋅][\cdot,\cdot] denotes the usual commutator of square matrices. Since diagonal matrices commute with each other, we get

This implies for the (k,k)(k,k) diagonal entry

Evaluating the llth column of this equation, one obtains

Similarly to the case of the (1,2)(1,2) block entry, one can now evaluate the different rows of this equation. This yields

(2,2)(2,2) block of (5.30): This is just the trivial relation 0=00=0.

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 Yw1,n;w2,mY_{\mathbf{w}_{1},\mathbf{n};\mathbf{w}_{2},\mathbf{m}} and Yw2,m;w1,nY_{\mathbf{w}_{2},\mathbf{m};\mathbf{w}_{1},\mathbf{n}}, respectively. Here we use the vectorial notations w1=(w1,1,…,w1,p)\mathbf{w}_{1}=(w_{1,1},\ldots,w_{1,p}) and w2=(w2,1,…,w2,q)\mathbf{w}_{2}=(w_{2,1},\ldots,w_{2,q}).

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 txtx-plane this corresponds to a reflection of the Brownian motions with respect to the vertical line t=1/2t=1/2.

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 Y1Y_{1} in (5.1). The Y1Y_{1}-matrices corresponding to the original and reversed Brownian motions turn out to be related as follows.

denotes a partitioning with diagonal blocks of size p×pp\times p and q×qq\times q, 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 n\mathbf{n} and m\mathbf{m} with ∣n∣=∣m∣|\mathbf{n}|=|\mathbf{m}| be fixed and consider the partitioning (5.24) for the matrix Y1=(Y1)n,mY_{1}=(Y_{1})_{\mathbf{n},\mathbf{m}}. Then we have the relations

proof. If n=0\mathbf{n}=\mathbf{0} and m=0\mathbf{m}=\mathbf{0} then the solution Y0,0Y_{\mathbf{0},\mathbf{0}} of the RH problem (1.20)–(1.22) is upper triangular, so that C21C_{21} is the zero-matrix and the relations (5.47) and (5.48) hold in that case. For arbitrary n\mathbf{n} and m\mathbf{m}, 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). \hfill□\hfill\square\\

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 C12C_{12} and C21C_{21}. 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 C11C_{11} and C22C_{22} in (5.24) in terms of scalar products of the entries in the off-diagonal blocks C12C_{12} and C21C_{21} in (5.24).

Let us illustrate the above scalar product relations for the 4×44\times 4 case (i.e., p=q=2p=q=2). 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 n1n_{1}, n2n_{2} starting from the first and second starting point a1a_{1} and a2a_{2}, respectively, is (up to a common factor t(1−t)/Nt(1-t)/N) directly expressed by the scalar products (5.51), (5.52), while the number of Brownian particles m1m_{1}, m2m_{2} arriving at the first and second endpoints b1b_{1} and b2b_{2}, 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 HH of (5.13). Indeed, they express that the top rightmost 2×22\times 2 block of this matrix, i.e.,

has fixed row sums equal to t(1−t)n1Nt(1-t)\frac{n_{1}}{N}, t(1−t)n2Nt(1-t)\frac{n_{2}}{N}, and fixed column sums equal to t(1−t)m1Nt(1-t)\frac{m_{1}}{N}, t(1−t)m2Nt(1-t)\frac{m_{2}}{N}. 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 pp and qq, we have the following result.

(Row and column sum relations) Let n\mathbf{n} and m\mathbf{m} with ∣n∣=∣m∣|\mathbf{n}|=|\mathbf{m}| be fixed and consider the Hadamard product matrix HH in (5.12). Then the top rightmost p×qp\times q block of the matrix HH, i.e., the submatrix

has fixed row sums equal to t(1−t)nkNt(1-t)\frac{n_{k}}{N}, k=1,…,pk=1,\ldots,p, and fixed column sums equal to t(1−t)mlNt(1-t)\frac{m_{l}}{N}, l=1,…,ql=1,\ldots,q.

proof. These relations are equivalent with the scalar product relations (5.47) and (5.48). \hfill□\hfill\square\\

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 n=∣n∣=∣m∣n=|\mathbf{n}|=|\mathbf{m}|. The zero set of the polynomial Pn,m(ξ,z)P_{\mathbf{n},\mathbf{m}}(\xi,z) in (5.57) defines an algebraic curve (the spectral curve).

For example, when p=q=2p=q=2 we can use (5.22)–(5.24) and (5.57) to see that

The spectral curve Pn,m(ξ,z)=0P_{\mathbf{n},\mathbf{m}}(\xi,z)=0 in (5.57) defines an algebraic curve which is of degree p+qp+q in the variable ξ\xi. 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 (p+q)(p+q)-sheeted Riemann surface where the iith sheet corresponds to the iith solution function ξ(z)=ξi(z)\xi(z)=\xi_{i}(z), i=1,…,p+qi=1,\ldots,p+q.

Now it turns out that an important role in the steepest descent analysis is played by the asymptotic expansions for z→∞z\to\infty of the functions ξi(z)\xi_{i}(z). It was observed for some special cases that the following asymptotic expansions hold.

(Asymptotic expansions of the spectral curve) Let pp and qq be arbitrary. Then when appropriately labeled, the p+qp+q branches ξ(z)=ξi(z)\xi(z)=\xi_{i}(z), i=1,…,p+qi=1,\ldots,p+q of the algebraic curve Pn,m(ξ,z)=0P_{\mathbf{n},\mathbf{m}}(\xi,z)=0 in (5.57) behave as follows:

as z→∞z\to\infty, for any k∈{1,…,p}k\in\{1,\ldots,p\} and l∈{1,…,q}l\in\{1,\ldots,q\}.

Note in particular that the 1/z1/z terms in the z→∞z\to\infty expansion, up to a factor ±1\pm 1, are precisely the fractions of Brownian particles starting from the kkth starting point aka_{k} or arriving in the llth ending point blb_{l}, respectively.

proof. We give the proof for the case p=q=2p=q=2; the proof for general pp and qq is similar. From (5.58), we see that the only way to have Pn,m(ξ,z)=0P_{\mathbf{n},\mathbf{m}}(\xi,z)=0 when z→∞z\to\infty is that one of the diagonal entries in (5.58) vanishes as z→∞z\to\infty. 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 1/z1/z term in (5.60) follows in a similar way from (5.53) and (5.54). \hfill□\hfill\square\\

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 p=1p=1 these relations fully describe the off-diagonal entries of (Y1)n,m(Y_{1})_{\mathbf{n},\mathbf{m}}. Indeed, the block entries C12C_{12} and C21C_{21} 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 ci,jcj,ic_{i,j}c_{j,i}, i<ji<j. With a little bit more work one can also obtain explicit expressions for the individual entries ci,jc_{i,j}; this leads to the expressions in . Similar remarks hold when q=1q=1.

In the case of general pp and qq, however, we are not able to find explicit expressions for the entries of (Y1)n,m(Y_{1})_{\mathbf{n},\mathbf{m}} 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 (Y1)n+ek,m+el(Y_{1})_{\mathbf{n}+\mathbf{e}_{k},\mathbf{m}+\mathbf{e}_{l}} in terms of the off-diagonal entries of (Y1)n,m(Y_{1})_{\mathbf{n},\mathbf{m}}. This yields a recursive scheme for computing the off-diagonal entries of (Y1)n,m(Y_{1})_{\mathbf{n},\mathbf{m}} by induction on ∣n∣=∣m∣|\mathbf{n}|=|\mathbf{m}|. 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 kkth 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 (Y1)n,m(Y_{1})_{\mathbf{n},\mathbf{m}} only, and so it is more convenient than (5.14) which also contains an entry of (Y2)n,m(Y_{2})_{\mathbf{n},\mathbf{m}}. 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 p=q=2p=q=2. 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 c1,2c2,1c_{1,2}c_{2,1} and c3,4c4,3c_{3,4}c_{4,3}

which for the special case n1=m1n_{1}=m_{1} and n2=m2n_{2}=m_{2} reduces to (1.48). This ends the proof of Proposition 1.8. \hfill□\hfill\square\\

References