This paper introduces BC type z-measures as determinantal point processes on the positive real line, computes their correlation kernels explicitly, and links them to limits of Racah polynomial ensembles, advancing harmonic analysis on infinite-dimensional symmetric spaces.
Contribution
It establishes the determinantal nature of BC type z-measures and explicitly computes their correlation kernels, connecting them to Racah polynomial limits and representation theory.
Findings
01
Processes are determinantal with explicit hypergeometric kernels.
02
Special parameter values relate to limits of Racah polynomial ensembles.
03
Advances harmonic analysis for infinite-dimensional symmetric spaces.
Abstract
The (BC type) z-measures are a family of four parameter z,z′,a,b probability measures on the path space of the nonnegative Gelfand-Tsetlin graph with Jacobi-edge multiplicities. We can interpret the z-measures as random point processes Pz,z′,a,b on the punctured positive real line X=R+∖{1}. Our main result is that these random processes are determinantal and moreover we compute their correlation kernels explicitly in terms of hypergeometric functions. For very special values of the parameters z,z′, the processes Pz,z′,a,b on X are essentially scaling limits of Racah orthogonal polynomial ensembles and their correlation kernels can be computed simply from some limits of the Racah polynomials. Thus, in the language of random matrices, we study certain analytic continuations of processes that…
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
BC type Z-measures and determinantal point processes
Cesar Cuenca
Department of Mathematics, MIT, Cambridge, MA, USA
The (BC type) z-measures are a family of four parameter z,z′,a,b probability measures on the path space of the nonnegative Gelfand-Tsetlin graph with Jacobi-edge multiplicities. We can interpret the z-measures as random point processes Pz,z′,a,b on the punctured positive real line X=R>0∖{1}. Our main result is that these random processes are determinantal and moreover we compute their correlation kernels explicitly in terms of hypergeometric functions.
For very special values of the parameters z,z′, the processes Pz,z′,a,b on X are essentially scaling limits of Racah orthogonal polynomial ensembles and their correlation kernels can be computed simply from some limits of the Racah polynomials. Thus, in the language of random matrices, we study certain analytic continuations of processes that are limits of Racah ensembles, and such that they retain the determinantal structure. Another interpretation of our results, and the main motivation of this paper, is the representation theory of big groups. In representation-theoretic terms, this paper solves a natural problem of harmonic analysis for several infinite-dimensional symmetric spaces.
A wide range of probabilistic and statistical mechanics models are integrable in the sense that observables of the system admit closed forms that can be analyzed in different limit regimes. The tools that are used to obtain closed form formulas for the observables, or correlation functions, are typically combinatorial or algebraic in nature and very often they originate from representation theory.
Some notable examples of integrable probability ensembles come from Schur measures, [23, 25]. The first kind of Schur measures that appeared in the literature are known as z-measures and they originated from the problem of harmonic analysis for the infinite symmetric group, see [26] for an introduction. A more sophisticated class of probability measures, known as zw-measures, originated from harmonic analysis of the infinite unitary group; various aspects of the z- and zw-measures were studied in the past decade, see for example [9, 10, 8].
All of the theory we have mentioned above is based on representation theory of type A, that is, the algebraic machinery behind the scenes comes from the symmetric and unitary groups. In this paper we work with the ‘type BC’ analogues of zw-measures that we call BC type z-measures; they come from harmonic analysis of the infinite symplectic, orthogonal groups and other infinite-dimensional symmetric spaces. In a degenerate case, the BC type z-measures are equivalent to a scaling limit of the Racah orthogonal polynomial ensembles, which are at the top of the hierarchy of all discrete orthogonal polynomial ensembles of the classical Askey scheme.
Our analysis of the BC type z-measures is based on a map from the space where they are defined to the space of simple point configurations in R>0∖{1}. Under this map, the BC type z-measures define a four-parameter family of stochastic point processes Pz,z′,a,b, with infinitely many points, in the punctured positive real line. We began a study on these processes in [13], where we constructed a continuous-time Markov chain that preserves the z-measures. In this paper, the random processes themselves are our subject of study: our main result states that they are determinantal point processes and moreover we compute explicit correlation kernels in terms of special functions. The resulting kernel has appeared in the literature before, in [9], and is known as the hypergeometric kernel in view of the fact that it can be expressed in terms of the hypergeometric function 2F1. The previous appearance of the hypergeometric kernel was in the problem of harmonic analysis of the infinite-dimensional unitary group (‘type A’ analogue of our problem), but it is far from obvious that the same kernel should show up in our context; the author cannot offer at this point a conceptual explanation for it.
The principal theme of this paper is the ‘approximation’ of the point processes Pz,z′,a,b on the continuous state space R∖{1} by a sequence {Lz,z′,a,b(N)}N≥1 of point processes, with a finite number of points, on a quadratic lattice. For any fixed N, the point processes Lz,z′,a,b(N) are determinantal and a correlation kernel for it can be expressed in terms of a finite system of orthogonal polynomials on a quadratic lattice, known as the Wilson-Neretin polynomials. In addition, we need to have suitable expressions of the correlation kernels of Lz,z′,a,b(N) for the limit transition N→∞. To obtain such expressions, we make use of a discrete Riemann-Hilbert problem, which has been used before in other problems from asymptotic representation theory. Finally, the expressions that admit a limit as N→∞ are obtained after massive calculations and use of recent formulas [20] that relate several generalized hypergeometric functions 4F3.
Below we give a more detailed account on the results of this paper.
BC type z-measures
Let us fix two real parameters a≥b≥−1/2, and momentarily fix also a positive integer N∈N. In this introduction, we only discuss BC type z-measures of level N (or simply z-measures of level N), which are certain probability measures on the countable space of N-positive signatures GTN+={λ=(λ1,…,λN):λ1≥…≥λN≥0,λi∈Z∀i}. The BC type z-measures depend on a,b and on two additional complex parameters z,z′ subject to certain constraints, see Definition 2.2 below. For example, the reader can think of the case z′=z∈C∖R, or of the degenerate case z=n∈N, z′>n−1 which gives rise to the Racah orthogonal polynomial ensemble. Explicitly, z-measures of level N are
[TABLE]
where we denoted by li=λi+N−i, 1≤i≤N, the shifted coordinates of λ=(λ1,…,λN); also ΔN(l1,…,lN)=∏1≤i<j≤N((li+2a+b+1)2−(lj+2a+b+1)2), the weight function is
[TABLE]
and ZN(z,z′,a,b)>0 is a normalization constant that makes PN a probability measure. Observe that the weight function W(⋅∣z,z′,a,b;N) is not necessarily nonnegative on Z≥0 for all complex values of z,z′, but it is for some special paremeters, for example when z′=z and z=n∈N, z′>n−1 as before.
In what follows, we construct several point processes associated to the z-measures of level N. The reader can refer to [14, 17] for generalities on point processes; see also [1, Sec. 4.2] and [5] for generalities on determinantal point processes.
Point processes in the quadratic half-lattice
Let ϵ=2a+b+1≥0 and Z+ϵ={ϵ2,(1+ϵ)2,(2+ϵ)2,…} be a quadratic half-lattice. Let Conffin(Z+ϵ) be the space of multiplicity-free point configurations on Z+ϵ with finitely many points. The space Conffin(Z+ϵ) has a canonical sigma algebra and a probability measure on it determines a stochastic point process on Z+ϵ.
Under any map P(N):GTN+→Conffin(Z+ϵ), the pushforwards of z-measures of level N yield random point processes P(N)=Pz,z′,a,b(N) on Z+ϵ that depend on the parameters z,z′,a,b, and that we denote by the same letter P(N).
Our goal is to obtain a point process with infinitely many points on the state space R>0∖{1} as a natural scaling limit of the processes P(N) with finitely many points in the quadratic lattice Z+ϵ (the scaling is of order N2).
The most obvious map that we can consider is
[TABLE]
It turns out that the processes O(N) do not have the desired scaling limit as N tends to infinity. The point processes that we need arise from a different map that we now describe.
An N-positive signature λ∈GTN+ can be described uniquely by its Frobenius coordinates. If we let d=d(λ) be the largest positive integer such that λd≥d, then the Frobenius coordinates (p1,…,pd∣q1,…,qd) of λ are given by
[TABLE]
where λi′=∣{n∈Z>0:λn≥i}∣ for all i. It is clear that p1>…>pd≥0 and q1>⋯>qd≥0. Now consider the map L(N):GTN+→Conffin(Z+ϵ) given by
[TABLE]
The point processes L(N) have a natural scaling limit that we describe next.
Point processes on the continuous state space R>0∖{1}
Let X=R>0∖{1}=(0,1)⊔(1,∞) and Conf(X) be the space of multiplicity free point configurations on X, with its canonical σ-algebra. The point processes L(N) described above are probability measures on the space Conffin(Z+ϵ). Consider the composition
[TABLE]
which induces a map jN:Conffin(Z+ϵ)→Conf(X), denoted by the same letter (the normalization by (N+ϵ−21)2 is chosen so that (N+ϵ−1/2)2Z+ϵ⊂X). Denote by P(N) the pushforward of L(N) under the map jN above; then P(N) is a probability measure on Conf(X) and determines a point process on X that we also denote by P(N).
Then the point processes P(N) converge to certain point process P=Pz,z′,a,b in the sense that all the correlation functions of P(N) converge to the corresponding correlation functions of P, as N tends to infinity. The process P is our hero: the main result of this paper is a complete characterization of the stochastic point process P for very general parameters z,z′,a,b.
Let us remark that the point process P has an intrinsic definition, which is independent of the finite point processes P(N). However we are able to thoroughly study P because we can realize it as a scaling limit of the processes P(N), see Section 7 for details.
The main theorem
Let a≥b≥−1/2 and (z,z′)∈C2 be an admissible pair (see Definition 2.2 below, or simply think of the cases z′=z∈C∖R or z=n∈N, z′>n−1 for now). The point processes P=Pz,z′,a,b on X are determinantal. Moreover an explicit correlation kernel KP(x,y) for P is given by the expressions in (\refKernelP) and (\refKernelP2) below. For example, if x,y>1, x=y, then
[TABLE]
where
[TABLE]
The kernel KP:X×X→R is known as the hypergeometric kernel, the reason being that KP can be expressed in terms of the hypergeometric functions 2F1, see [9] for another problem in which this kernel appears. Observe that the expression for KP in (\refeq:kernelintro) is only defined for x=y due to the singularities on the diagonal. However it admits the following analytic continuation:
An infinite symmetric spaceG/K is an inductive limit of Riemannian symmetric spaces G(n)/K(n) of rank n, with respect to a natural chain of maps G(1)→⋯→G(n)→G(n+1)→… that is compatible with the inclusions K(n)⊂G(n). Some examples of such infinite symmetric spaces are the following
(In (2), we wrote n to indicate that the rank of the Riemannian symmetric space in question is ⌊n/2⌋, and n can be either 2n or 2n+1; either one leads to the same G/K, up to isomorphism.)
The natural problem of noncommutative harmonic analysis for finite or compact groups asks for the decomposition of the regular representation into irreducible representations. In this context, the solution is given by the well known Peter-Weyl theorem. In the infinite-dimensional context, it is not even clear what the problem of harmonic analysis should be. The difficulty is that there is no analogue of the Haar measure. The problem of harmonic analysis for the infinite-dimensional unitary group U(∞) was posed by G. Olshanski in [29]. He used certain completion U of U(∞), which admits an analogue of the Haar measure. We hope to explain the representation theoretic picture for the symmetric spaces listed above elsewhere, but for now let us only describe the problem in terms of spherical functions.
A spherical function of the infinite symmetric space G/K is a function ϕ:G→C satisfying
•
ϕ is a K-bi-invariant function, i.e., ϕ(k1gk2)=ϕ(g) for all g∈G, k1,k2∈K.
•
ϕ is normalized by ϕ(I)=1, where I∈G is the unit element.
•
ϕ is positive definite, i.e., for any g1,…,gn∈G, the matrix [ϕ(gigj−1)]i,j=1n is positive definite.
It is clear that the space of spherical functions of G/K is convex. The extreme points of the set of spherical functions are the irreducible (or extreme) spherical functions. The space of irreducible spherical functions for all three spaces (1), (2), (3) above are isomorphic; that space will be denoted by Ω∞. In fact, it was shown in [24] that Ω∞ can be embedded as the subspace of R+∞×R+∞×R+ consisting of triples ω=(α;β;δ) satisfying
[TABLE]
Let us denote by ϕω the irreducible spherical function corresponding to ω∈Ω∞.
In analogy to [29] it is possible, for each of the three infinite symmetric spaces above, to construct a family of natural generalized quasi-regular representations of G/K, each with a distinguished cyclic K-invariant vector. The members of the family of generalized quasi-regular representations {(Tz,vz)}z (we let vz be the distinguished vector of the representation Tz) of G/K are parameterized by complex numbers z satisfying ℜz>−2b, where b=0,−21,21 for (1), (2) and (3), respectively. Each representation Tz is determined completely by its spherical function ϕz defined by ϕz(⋅)=(Tz(⋅)vz,vz). As it turns out, for our three cases of interest, the spherical functions ϕz:G→R admit analytic continuations in the variables z and z′=z to the domain {ℜ(z+z′)>−b}, where b=0,−21,21 for the spaces (1), (2), (3) above. Furthermore, one can write down a spherical function ϕz,z′,a,b:G→R depending on four parameters z,z′,a,b (subject to some constraints) that reduces to the representation-theoretic spherical functions of G/K upon specialization of the parameters a,b as follows:
(1)
(a,b)=(0,0).
2. (2)
(a,b)=(±21,−21).
3. (3)
(a,b)=(21,21).
(In (2), a=−21 if n=2n and a=21 if n=2n+1.)
A general result from functional analysis implies that all spherical functions ϕz,z′,a,b of G/K are mixtures of the irreducible spherical functions {ϕω}ω∈Ω∞, in the sense that there exists a Borel probability measure πz,z′,a,b on Ω∞ such that
[TABLE]
The probability measure πz,z′,a,b on Ω∞ is the z-measure with parameters z,z′,a,b and also known as the spectral measure of ϕz,z′,a,b.
The probability measures πz,z′,a,b describe how the spherical function ϕz,z′,a,b is ‘decomposed’ into irreducible spherical functions. A (far reaching) generalization of the problem of harmonic analysis for the infinite symmetric spaces (1), (2), (3) above is therefore the following:
Problem: Describe the spectral measures πz,z′,a,b on Ω∞ for the most general set of parameters z,z′,a,b possible.
The content of the present article solves the problem just posed. In fact, the pushforwards of the measures πz,z′,a,b under the map
[TABLE]
define the point processes Pz,z′,a,b on X, and our main result is a complete characterization of these processes, see Section 7 below for more details.
In particular, Theorem 8.1 with b=0,−21,21 solves the problem of harmonic analysis, stated above for the infinite symmetric spaces in (1), (2) and (3), respectively.
The reader is referred to [11] for a self-contained survey of the problem of harmonic analysis of the infinite symmetric space (G,K)=(U(∞)×U(∞),U(∞)) and some applications.
Racah orthogonal polynomial ensemble
We have mentioned that BC type z-measures are esentially analytic continuations of scaling limits of Racah orthogonal polynomial ensembles. Let us clarify the meaning of that statement and briefly explain how the main result of this paper can be deduced from limits of Racah polynomials in the degenerate case.
Let z=k∈N and z′>k−1 (similar considerations hold if z′=k and z>k−1). For any N≥1, the corresponding z-measure PN=PN(⋅∣n,z′,a,b) of level N is supported on the set
[TABLE]
The process O(N)=Ok,z′,a,b(N) on Z+ϵ coming from PN lives in the finite space ZN+k−1ϵ=\makebox[0.0pt]\mboxdef{ϵ2,(1+ϵ)2,…,(N+k−1+ϵ)2}. The corresponding z-measure π=πk,z′,a,b is supported on the finite dimensional simplex
[TABLE]
The point process P=Pk,z′,a,b that corresponds to π under the map i given in (\refeqn:mapi) lives in the open interval (0,1). Such process is the scaling limit of the processes Lk,z′,a,b(N), as described previously. In this special case, it will also be the scaling limit of some processes Y(N)=Yk,z′,a,b(N), which come from the pushforwards of O(N) under the maps
[TABLE]
Clearly Y(N) is a point process on Z≤N+k−1ϵ with exactly k points. Simple calculations show that Y(N) is a Racah orthogonal polynomial ensemble associated to the parameters
[TABLE]
In other words, if we denote (y+2a+b+1)2 by y, for any y∈{0,1,…,N+k−1}, then
[TABLE]
where α,β,δ,γ are related to k,z′,a,b via the identification of parameters in (\refeqn:racah). The weight function wR(y(y+a+b+1)∣α,β,γ,δ) on the quadratic lattice {n(n+a+b+1):n∈Z+} corresponds to the classical Racah orthogonal polynomialsRn(y(y+a+b+1)∣α,β,γ,δ), see [16, Ch. 9.2] and [22, Ch. 3]. One deduces that Y(N) is a determinantal process with correlation functions of the form
[TABLE]
where x=x(x+a+b+1), y=y(y+a+b+1), x=(x+(a+b+1)/2)2, y=(y+(a+b+1)/2)2 and Hk−1 is the squared norm of Rk−1=Rk−1(⋅∣α,β,γ,δ).
The point process P=Pk,z′,a,b has exactly k points and is a scaling limit of the processes Y(N), all of which have k points. It is easily justified in this case that P is a determinantal point process and a calculation of its correlation kernel KP would follow from a suitable limit of the Racah polynomials and of the kernel KY(N) above.
Alternatively the same kernel KP can be read from Theorem 8.1 after setting z=k (in that theorem, note ψ>1(x)=0 for z=k∈N, which implies that there is no particles in (1,∞)). The general point processes Pz,z′,a,b that we consider (z,z′ not integers) can be considered as analytic continuations of the limits Pk,z′,a,b of Racah ensembles Y(N), but we need much more work to study them.
Other results
In addition to the main result described above, other results in this article are:
•
The point process O(N) is a discrete orthogonal polynomial ensemble. Moreover we find a correlation kernel KO(N) in terms of the generalized hypergeometric function 4F3(1), see Theorem 3.5.
•
The point process L(N) is an L-ensemble. Moreover we find an explicit correlation kernel KL(N) in terms of the generalized hypergeometric function 4F3(1), see Theorem 6.8.
Organization of the paper
In the next section, we introduce some terminology that is used throughout the paper. In section 2, we introduce the BC type z-measures of level N for a large set of parameters z,z′,a,b, and introduce the point processes O(N), L(N) on the state space Z+ϵ. In section 3, we prove that O(N) is a discrete orthogonal polynomial ensemble and find a correlation kernel. In section 4, we prove that L(N) is an L-ensemble. After recalling the theory of the discrete Riemann-Hilbert problem in section 5, we find a correlation kernel for L(N) in section 6. The point processes L(N) yield a point process P with infinitely many particles in a continuous state space, under a suitable scaling limit. We construct these point processes as scaling limits of the point processes L(N) in section 7. In section 8, we prove the main theorem of this paper, which is an explicit formula for the correlation kernel of P. Finally, the appendix contains several technical proofs of various statements throughout the paper.
Acknowledgments
I would like to thank Alexei Borodin and Grigori Olshanski for many helpful discussions, e-mail correspondence and comments on a draft of this paper.
1. Notation and Terminology
We collect here some of the terminology and notation that is used throughout the paper, for the reader’s convenience.
•
The parameters a,b in this paper are real numbers, and we define
[TABLE]
We assume throughout that a,b satisfy
[TABLE]
which implies ϵ≥0. This restriction allows us to use the main results from [24, 27].
•
In Section 2 below, we define several subsets of C2 from which we take pairs (z,z′) as parameters of the z-measures and for some proofs involving analytic continuations. Some of these sets are the following domains of C2:
[TABLE]
Moreover we have the more complicated set of admissible parameters defined by
[TABLE]
where Z is defined below in (\refdefnZ). The set Uadm is not a domain of C2. The following inclusions hold, see Lemma 2.3 below:
[TABLE]
Given any (z,z′)∈U, we denote Σ=\makebox[0.0pt]\mboxdefz+z′+b. Observe that if (z,z′)∈Uadm, then Σ∈(−1,+∞).
•
We write Z+ and N for the set of nonnegative and positive integers, respectively. We also write
[TABLE]
for the quadratic half-lattice. For any x∈Z, we let
[TABLE]
Very often, starting in Section 3, we shall need the splitting Z+ϵ=Z≥Nϵ⊔Z<Nϵ into the sets Z≥Nϵ=\makebox[0.0pt]\mboxdef{(N+ϵ)2,(N+1+ϵ)2,…} and Z<Nϵ=\makebox[0.0pt]\mboxdef{ϵ2,(1+ϵ)2,…,(N−1+ϵ)2}, for some N∈N.
•
For any N∈N, the set GTN+ of positive signatures of length N (also known as the set of N-positive signatures) is defined as
[TABLE]
To each positive N-signature λ=(λ1≥⋯≥λN)∈GTN+ we can associate the N-tuples l=(l1>⋯>lN)∈Z+N and l=(l1>⋯>lN)∈(Z+ϵ)N via the equations
[TABLE]
Below we shall often be working with a positive signature of length N denoted by λ∈GTN+. We denote its two associated N-tuples given as above by l=(l1>…>lN) and (l1>…>lN).
•
We use the following simplified notation for products of (ratios of) Gamma functions
[TABLE]
•
If x=(x1,…,xN) is any N-tuple of complex numbers, then the Vandermonde determinant is
[TABLE]
2. BC type z-measures
For any N∈N, the set of N-positive signatures is GTN+=\makebox[0.0pt]\mboxdef{λ=(λ1≥…≥λN)∈ZN}. Let us begin by considering the following function on N-positive signatures λ∈GTN+, which depends on certain parameters z,z′∈C, a≥b≥−1/2, and is given by
[TABLE]
where ΔN(l)=∏1≤i<j≤N(li−lj) is the Vandermonde determinant on the variables li=(li+ϵ)2, li=λi+N−i, 1≤i≤N, and
[TABLE]
When there is no risk of confussion, we write w(x∣z,z′,a,b;N) simply as w(x), for simplicity of notation. Observe that the conditions on the real parameters a,b ensure that Γ(x+2ϵ) and Γ(x+a+1) are well defined for all x∈Z+ and therefore PN′(λ∣z,z′,a,b) is well defined for all λ∈GTN+.
The following equality
[TABLE]
where
[TABLE]
was proved in [27] for all z,z′∈{u∈C:ℜu>−2(1+b)} and extended by analytic continuation, in [13], for all pairs (z,z′) in the complex domain
[TABLE]
Define also the subdomain U0⊂U consisting of those pairs (z,z′) for which SN(z,z′,a,b) never vanishes; clearly such set is
[TABLE]
For any pair (z,z′)∈U0, we can therefore define the (complex) measure on GTN+ given by
[TABLE]
From (\refpartitionfunction), the measure PN has finite total measure equal to 1. Next, we find very general conditions on complex pairs (z,z′) which guarantee that {PN(λ∣z,z′,a,b)}λ∈GTN+ is a probability measure on GTN+.
By following common terminology on zw-measures, see for example [9], define the sets
[TABLE]
The subscripts ‘princ’, ‘compl’ and ‘degen’ stand for principal, complementary and degenerate.
The reason why the definitions above are important for us is the following statement.
(Γ(z−k)Γ(z′−k))−1>0 for all k∈Z iff (z,z′)∈Zprinc⊔Zcompl.
•
If (z,z′)∈Zdegen,n, then (Γ(z−k)Γ(z′−k))−1=0 for k∈Z, k≥n and (Γ(z−k)Γ(z′−k))−1>0 for k∈Z, k≤n−1.
From the lemma above, we can define a set of complex pairs (z,z′) such that the numbers PN′(λ∣z,z′,a,b) are nonnegative real values for all positive N-signatures.
Definition 2.2**.**
The admisible domainUadm⊂C2 is defined as the set of complex pairs (z,z′)∈C2 such that ℜ(z+z′+b)>−1 and both (z,z′), (z+2ϵ,z′+2ϵ) belong to Z. A pair (z,z′)∈Uadm is called an admissible pair.
Thus for (z,z′)∈Uadm∩U0, then PN′(λ∣z,z′,a,b)≥0 and not all of them are zero. Then (\refpartitionfunction) shows SN(z,z′,a,b)>0 and therefore the ratios (\refzmeasure) define a probability measure on GTN+. We actually only need to require (z,z′)∈Uadm, which automatically implies (z,z′)∈U0, as the following lemma implies.
Lemma 2.3**.**
The inclusion Uadm⊂U0 holds, where U0 is defined in (\refsubdomain) and Uadm in Definition 2.2.
Proof.
Let (z,z′)∈Uadm. Then ℜ(z+z′+b)>−1, which implies (z,z′)∈U. By the definition of U0, we simply need to show that none of the four complex numbers z,z′,z+b,z′+b is a negative integer. We argue in three cases.
If (z,z′)∈Zprinc, then z,z′∈/R which implies that none of z,z′,z+b,z′+b is a real number.
If (z,z′)∈Zcompl, then there exists n∈Z for which n<z,z′<n+1. Coupled with the conditions b≥−1/2 and ℜ(z+z′+b)>−1, we have n≥−1. Therefore z,z′>−1 and so z,z′ cannot be negative integers. Moreover z+b,z′+b>−1+b≥−3/2, so z+b,z′+b cannot take on integer values less than −2. If z+b=−1, then n=−1 in the analysis above, so −1<z,z′<0. Then z+z′+b=−1+z′<−1, a contradiction. Similarly z′+b=−1 and we are done with this case.
If (z,z′)∈Zdegen,n for some n∈N, then we can assume without loss of generality that z=n and z′>n−1. In particular, z′>z−1=n−1≥0, thus implying that z and z′ are both positive and not negative integers. Moreover z′+b>z+b−1=n+b−1≥1−1/2−1=−1/2, thus implying that z+b and z′+b are both larger than −1/2 and therefore not negative integers.
∎
In view of Lemmas 2.1 and 2.3, it follows that the numbers {PN(λ∣z,z′,a,b):λ∈GTN+} define a probability measure on GTN+, whenever (z,z′)∈Uadm. We call such probability measures the BC type z-measures of level N (associated to the parameters z,z′,a,b). Let Conffin(Z+ϵ) be the space of simple (multiplicity free) finite point configurations on Z+ϵ.
Any map GTN+→Conffin(Z+ϵ) pushforwards the BC type z-measures of level N into point processes on the discrete state space Z+ϵ. We consider two such maps.
The most natural map GTN+→Conffin(Z+ϵ) determines a random point configuration with exactly N points. In fact, consider the map
[TABLE]
where we do not write N in the definition of O for simplicity, and recall that l is one of the N-tuples associated to λ, see Section 1. Under the map above, the pushforward of the z-measure PN is a probability measure on simple N-point configurations in Z+ϵ, therefore determining a point process on Z+ϵ that we denote by O(N).
Next we describe a different map GTN+→Conffin(Z+ϵ) that gives rise to a different point process. Recall that λ∈GTN+ can be described by its Frobenius coordinates. If we let d=d(λ) be the side-length of the largest square that can be inscribed in the Young diagram of λ, then the Frobenius coordinates (p1,…,pd∣q1,…,qd) of λ are defined by
[TABLE]
where λi′ is the cardinality of the set {j∈{0,1,…,N}:λj≥i}, or equivalently the length of the i-th column in the Young diagram of λ. Observe that p1>…>pd≥0 and q1>…>qd≥0. A balanced point configuration in Z+ϵ with respect to Z<Nϵ is a subset of Z+ϵ with an equal number of points in either of the sets
[TABLE]
For example, the empty configuration (the one with no points) is balanced (with respect to Z<Nϵ), and any balanced point configuration in Z+ϵ has at most 2N points. Consider the map
[TABLE]
where, again, we do not write N in the definition of L for simplicity. Evidently L(λ) is a balanced point configuration with d=d(λ) points in each of the sets Z<Nϵ and Z≥Nϵ. The pushforward of the z-measure PN, under the map above, determines a probability measure on balanced point configurations in Z+ϵ that we also denote by L(N).
The connection between the point configurations O(N) and L(N), as well as a summary of our definitions, is given in the following statement.
Definition-Proposition 2.4**.**
Let N∈N, and consider parameters a≥b≥−1/2, (z,z′)∈Uadm. The probability measure PN=PN(⋅∣z,z′,a,b) defined in (\refzmeasure) is called the BC type z-measure of level N (or simply z-measure of level N) associated to the parameters z,z′,a,b.
The pushforwards of PN under the maps O and L, defined in (\refOmap) and (\refLmap) respectively, are point processes on Z+ϵ that we denote by Oz,z′,a,b(N) and Lz,z′,a,b(N), or simply by O(N) and L(N). The process O(N) is an N-point configuration, while L(N) is a balanced configuration on Z+ϵ with respect to Z<Nϵ.
The following relation holds
[TABLE]
for any λ∈GTN+. We denote this relation by
[TABLE]
Proof.
The only statement to prove is (\refsymdifference), for any λ∈GTN+. If λ is the “empty” signature (0N), then evidently O(λ)={ϵ2,(1+ϵ)2,…,(N−1+ϵ)2}=Z<Nϵ, L(λ)=∅, and therefore (\refsymdifference) is evident. Assume otherwise that λ=(0N). Then d=d(λ) can be characterized as the largest integer in {1,2,…,N} such that λd≥d, thus implying that λd+1≤d. In this case, we have that the set {λ1+N−1,…,λd+N−d} is a subset of {N,N+1,…} of size d and also the set {λd+1+N−d−1,λd+2+N−d−2,…,λN} is a subset of {0,1,…,N−1} of size N−d. It is easy to check the equalities of sets
[TABLE]
where (p1,…,pd∣q1,…,qd) are the Frobenius coordinates of λ. From the definitions of the sets O(λ) and L(λ), identity (\refsymdifference) is now obvious.
∎
3. The discrete orthogonal polynomial ensemble O(N)
In this section, we prove that the N-point process O(N) is a discrete orthogonal polynomial ensemble, and therefore a determinantal point process. The main result of this section is Theorem 3.5, where we compute explicitly a correlation kernel KO(N):Z+ϵ×Z+ϵ⟶R for the point process O(N) in terms of generalized hypergeometric functions. As we shall do hereinafter, we consider four parameters z,z′,a,b satisfying a≥b≥−1/2 and (z,z′)∈Uadm.
3.1. The point process O(N) is a discrete orthogonal polynomial ensemble
Define the (two-sided) quadratic lattice
[TABLE]
and the function W(⋅∣z,z′,a,b;N):Zϵ→R≥0 given by
[TABLE]
where x=(x+ϵ)2, for all x∈Z. We may write W(x), instead of W(x∣z,z′,a,b;N) if the parameters z,z′,a,b, and the natural number N are implicit. Observe that the image of the function W is included in R≥0 by our assumption on the parameters z,z′,a,b. Due to the factor Γ(x+1) in the denominator of W(x), it follows that W(−n)=W((−n+ϵ)2)=0 for all n∈N, and therefore we do not lose any information if we restrict W to Z+ϵ⊂Zϵ; thus we can think of W(x) as a weight function on Z+ϵ.
Proposition 3.1**.**
The point process O(N)=Oz,z′,a,b(N) is a discrete orthogonal polynomial ensemble in Z+ϵ, with weight function W(x∣z,z′,a,b;N)=W(x), i.e.,
[TABLE]
for any set {x1,…,xN}⊂Z+ϵ of size N, where ΔN(x1,…,xN)=∏1≤i<j≤N(xi−xj) and “const” is a suitable normalization constant.
Proof.
Assume without loss of generality that x1>…>xN. By the definition of the map O in (\refOmap), the pushforward probability measure PO(N) is defined as
[TABLE]
Thus PO(N) has the right form in (\refdiscretepoly), for const=SN(z,z′,a,b)−1 and because W(x∣z,z′,a,b;N)=w(x∣z,z′,a,b;N).
∎
It follows from well known theory of random matrices [19] that the discrete orthogonal polynomial ensemble O(N) is a determinantal point process, whose correlation kernel KO(N):Z+ϵ×Z+ϵ→R can be expressed in terms of the orthogonal polynomials in Z+ϵ with respect to the weight function W(x). Furthermore, by general theory of orthogonal polynomials on a quadratic lattice [22, Ch. 3], the kernel KO(N) should admit explicit formulas in terms of generalized hypergeometric functions. Next we review some background on the orthogonal polynomials in Z+ϵ with respect to the weight function W(x) and then we prove the main result, Theorem 3.5, in Section 3.4 below.
3.2. Generalized hypergeometric functions
The formulae we obtain below for the correlation kernel KO(N) are in terms of the generalized hypergeometric functionsp+1Fp. These are holomorphic functions on the unit disk that depend on a parameter p∈N, and can be defined by the absolutely convergent series
[TABLE]
where (x)k=\makebox[0.0pt]\mboxdefx(x+1)⋯(x+k−1) if k≥1 and (x)0=\makebox[0.0pt]\mboxdef1. The definition (\refhypergeomdef) makes sense for b1,…,bp∈/Z≤0. When p=1, the function 2F1 is simply referred to as the hypergeometric function.
We shall need the generalized hypergeometric functions evaluated at u=1. In this case, the sum (\refhypergeomdef) converges absolutely if ℜ(∑i=1pbi−∑i=1p+1ai)>0. When some ai is a negative integer, the sum in (\refhypergeomdef) becomes finite and therefore admits an analytic continuation in u to the complex plane. If p=3, a1=−N for some N∈Z+, the argument is u=1, and moreover ∑i=1pbi−∑i=1p+1ai=1, then the generalized hypergeometric function
[TABLE]
is called a terminating Saalschützian 4F3(1) series. For more details and for many identities relating these functions, the reader may consult the classical book [3]; see also the Appendix for some applications of these identities.
3.3. Wilson-Neretin polynomials
We review the theory of the family of orthogonal polynomials in Z+ϵ with respect to the weight function W(x), which was first worked out in [21]. We follow the presentation in [10, Sec. 8] and [13, Sec. 6.3].
Take arbitrary complex numbers a1,a2,a3,a4 and α, and consider the weight function
[TABLE]
Proposition 3.2**.**
The polynomials
[TABLE]
are orthogonal with respect to the weight w(t), and their squared norms are
[TABLE]
Remark 3.3**.**
The orthogonality relation for the polynomials Qn and the closed expression for Hn are valid whenever the infinite sums defining them converge.
Remark 3.4**.**
The polynomials Qn are not monic. Indeed the leading coefficient of Qn is
[TABLE]
The orthogonal polynomials of Proposition 3.2 can be expressed in terms of the well-known Wilson polynomials. In the setting of discrete orthogonal polynomials on a quadratic lattice, they were studied by Neretin, see [21]. We call them the Wilson-Neretin polynomials.
Before moving on, let us mention that, although the classical Wilson polynomials and the Wilson-Neretin polynomials above admit the same explicit formula, there are two important differences between them. First, the Wilson-Neretin polynomials form a finite system of orthogonal polynomials, meaning that only finitely many orthogonal polynomials exist, and the number of them depends on the number of finite moments of the weight function. In contrast, the Wilson polynomials form an infinite system. Second, the Wilson-Neretin polynomials are orthogonal with respect to a weight function on the discrete spaceZ+ϵ, whereas the Wilson polynomials are orthogonal with respect to a weight function on the positive real line.
3.4. An explicit correlation kernel KO(N)
For simplicity of notation in the formulas to follow in this section and in the rest of the paper, let us denote
[TABLE]
The following theorem is the main statement of this section.
Theorem 3.5**.**
A correlation kernel KO(N) for the process O(N) is given by
[TABLE]
where the function W:Z+ϵ⟶R≥0 is defined by the formula in (\refweightW), and
[TABLE]
[TABLE]
[TABLE]
We also have
[TABLE]
where
[TABLE]
Remark 3.6**.**
Like our notation above suggests, pN−1(x),pN(x) are the (N−1)-st and N-th orthogonal polynomials in the quadratic lattice Z+ϵ with respect to the weight W(x), at least when ℜΣ>0. Also hN−1 is the squared norm of pN−1, namely hN−1=∑x∈Z+ϵpN−1(x)2W(x). We obtain the more general orthogonal polynomials pn, n=0,1,…,N, and more general squared norms hn, n=0,1,…,N−1, both in terms of terminating Saalschützian 4F3(1) series, in the proof below.
Remark 3.7**.**
The expression (\refpNfirst) for pN(x) is not well-defined if Σ=0 because of the factor Γ(1−Σ)Γ(1−N−Σ)=(1−N−Σ)(2−N−Σ)⋯(−Σ)1. Therefore the expression for the kernel (\refcorrKtil) is not well-defined in this case, and the formula in (\refcorrKtil2) provides an analytic continuation of KO(N).
Remark 3.8**.**
For any x∈Z+, the functions pN−1(x),pN(x) are analytic on the variables z,z′ on the domain (z,z′)∈U, while pN(x) is analytic on the subdomain (z,z′)∈U∖{Σ=0}. Finally, hN−1 is analytic on (z,z′)∈U, but hN−1=0 only in the subdomain U0.
Proof.
The proof is divided into several steps.
Step 1.
Due to general theory of random matrices, see [19, Sec. 5.2], the discrete orthogonal polynomial ensemble O(N) has kernel KO(N) given by the normalized Christoffel-Darboux kernel
[TABLE]
where p0=1,p1,…,pN−1 are the orthogonal polynomials in Z+ϵ with respect to the weight function W(x) (they come from the Gram-Schmidt orthogonalization in the Hilbert space L2(Z+ϵ,∑x∈Z+ϵW(x)δx), of the basis 1,x,x2,…,xN−1) and hm≡∑t∈Z+ϵ(pm(t))2W(t). If the N-th orthogonal polynomial pN exists, then (\refCDkernel) can be rewritten as
[TABLE]
In this first step, we find out when these orthogonal polynomials pm exist, given the weight W(x). We also find a condition which guarantees hN−1<∞.
From the Gram-Schmidt orthogonalization process, it is easy to see that the m-th polynomial pm exists if the weight function W(x) has finite (2m−1) moments, i.e., if ∑x∈Z+ϵx2m−1W(x)<∞. Thanks to the identity Γ(z)Γ(1−z)=sin(πz)π, we can rewrite W(x) as
[TABLE]
By well-known asymptotics of the Gamma function, we have W(x)∼x1−2(Σ+2N), as x→∞. Therefore ∑x∈Z+ϵx2m−1W(x)<∞ iff ∑x∈Z+x2(2m−1)+1−2(Σ+2N)=∑x∈Z+x−1+4m−2Σ−4N<∞ iff 4m−2ℜΣ−4N<0 iff ℜΣ>2m−2N. In particular, pN−1 exists if ℜΣ>−2 and pN exists if ℜΣ>0.
Finally, the squared norm hm=(pm,pm)L2(Z+ϵ,W⋅μ) is finite if the weight W(x) has a finite (2m)-th moment, i.e., ∑x∈Z+ϵx2mW(x)<∞. By a similar reasoning as above, hm<∞ if ℜΣ>2m−2N+1; in particular, hN−1<∞ whenever ℜΣ>−1.
Step 2. In this step, we prove that equation (\refcorrKtil) is a correlation kernel KO(N) for the determinantal process O(N), under the assumption ℜΣ>0. The idea is to compute the orthogonal polynomials pn(x) in Z+ϵ with respect to the weight W(x), compute the squared norms hn, and then plug them into equation (\refCDkernel2) to find a correlation kernel. Our main tool is Proposition 3.2. Under the identification of variables
[TABLE]
the following equality is clear
[TABLE]
where for simplicity we wrote w(x) instead of w(x∣1−ϵ,b+1−ϵ,z+N+ϵ,z′+N+ϵ;ϵ), as defined in (\refweightneretin). Temporarily we can assume that neither a nor a+b are integers, in order for equation (\refftow) to make sense.
From Step 1, since we are under the assumption ℜΣ>0, all the monic orthogonal polynomials p0=1,p1,…,pN−1,pN with respect to W(x) exist. Thanks to Proposition 3.2, we obtain the equalities
[TABLE]
where the polynomials Qn((x+ϵ)2) is given (\reforthogonalpolys) and the leading coefficients kn are given in Remark 3.4, respectively. The resulting explicit formula is
[TABLE]
This gives the desired formulas (\refpNfirst) and (\refpNfirst1) when n=N−1 and n=N, respectively.
From step 1, hn<∞ for all n≤N−1 because ℜΣ>−1.
To obtain an expression for the squared norm hn, use the relations (\refftow),(\refptoq):
[TABLE]
We point out that W(x)=w(x)=0 for x∈{−1,−2,…}, reason why Hn appears as a semi-infinite sum in this setting and as a two-sided infinite sum in the setting of Proposition 3.2. Plugging in the expression for Hn in Proposition 3.2 (under the identification of parameters given above), and applying the identity Γ(z)Γ(1−z)=sin(πz)π several times, we arrive at
[TABLE]
When n=N−1, (\refhnorm) becomes the formula for HN−1 given in the proposition.
We need to remove the condition that a,a+b∈/Z. All we need to justify is that the orthogonal polynomials pn(x) on Z+ϵ with respect to the weight W(x) are still given by (\reforthpol) and their squared norms hn are still given by (\refhnorm) in the case that a∈Z or a+b∈Z. First of all observe that, for any x∈Z+ϵ, then W(x) is holomorphic in {ℜa,ℜb>−1}, as a function of a,b. The orthogonal polynomials pn(x), n=0,1,…, are determined recursively so that pn(x) is the unique monic polynomial in x that is monic, of degree n, and the following equations are satisfied
[TABLE]
The arguments above show that all equations above are satisfied for parameters a,b in the complex domain {ℜΣ>0}∩{ℜa,ℜb>−1}∩{a∈/Z}∩{a+b∈/Z}. Since the right-hand side of (\reforthpol) is analytic, for all n=0,1,…,N−1, in the larger domain {ℜΣ>0}∩{ℜa,ℜb>−1}, then the identities above extend for any a,b in the larger domain and so (\reforthpol) is the n-th orthogonal polynomial with respect to the weight function W(x) even when a∈Z or a+b∈Z.
By a similar reasoning, we can show that the squared norms hn are given by (\refhnorm) even when a∈Z or a+b∈Z. The key is to treat a and b as complex parameters and use the equation ∑x∈Z+ϵpn(x)2W(x)=hn to do an analytic continuation.
Step 3.
In this step, we prove Theorem 3.5, under the assumption that Σ=0 (and ℜΣ>−1). Observe that step 1 shows that the polynomials pN(x), 0≤n≤N−1, are well-defined. Moreover the squared norms hn, 0≤n≤N−1 are finite. Thus (\refCDkernel) implies that a correlation kernel KO(N) is given by
[TABLE]
The goal is to have a simplified expression for (\refcorkernel1), rather than leaving it as a sum of N generalized hypergeometric functions.
In step 1, see (\refCDkernel2), we mentioned that if the polynomial pn(x) exists, then we have the equality
[TABLE]
In step 1, we also showed that pN exists in the domain {ℜΣ>0}. Thus (\refcokernel2) holds if ℜΣ>0. In step 2, we moreover found an explicit formula for pN(x), see (\reforthpol), which shows that pN(x) admits an analytic continuation on the domain (z,z′)∈U0∖{Σ=0}. Thus, by analytic continuation, (\refcokernel2) is true if we think that pN(x), pN(y) are the explicit expressions in the right-hand side of (\reforthpol). Therefore we have finished the proof of Theorem 3.5 under the assumption that Σ=0.
Step 4.
Finally we prove (\refcorrKtil2), which gives an analytic continuation of Theorem 3.5 and removes the singularities in Σ=0. By use of well known identities involving generalized hypergeometric functions, the expression for pN(x) in (\refpNfirst) is equal to
[TABLE]
Similarly, we have
[TABLE]
Details are spelled out in the Appendix.
By analytic continuation, we are done if we showed the identity
[TABLE]
for any x,y∈Z+ and points (z,z′) where all the functions pN,pN−1,pN are defined, that is in the complex domain (z,z′)∈U0∖{Σ=0}. For this purpose, we use the following identity, which is an easy consequence of the series representation for 4F3:
[TABLE]
The identity above holds as an equality of analytic functions whenever ℜ(∑ibi−∑iai)>0 and b1,b2,b3∈/Z≤0. In particular, for the choice of parameters a1=−N, a2=−N−a, a3=z, a4=z′, b1=Σ, b2=x−N+1, b3=−x−N−a−b, and taking equations (\refalmostpN), (\refalmostpN1), into account, identity (\reftrivial4F3) becomes
[TABLE]
The latter equation immediately implies the desired equation (\refstep5eq), and we are done.
∎
From the proof above, we obtain the following corollary which will be useful below in Section 6.
Corollary 3.9**.**
If ℜΣ>−1, then the orthogonal polynomials p0=1,p1,…,pN−1 with respect to the weight function W:Z+ϵ→R≥0 in (\refweightW) exist. Also, the squared norms h0,h1,…,hN−1 are finite. Moreover 1/h0,…,1/hN−1, as functions of (z,z′), are holomorphic on U0. For any fixed x∈Z+ϵ, all the functions p0(x),…,pN−1(x) are holomorphic on U. Let (z,z′)∈C2 be such that z+z′>−21, {z,z′}∩{…,−2,−23,−1,−21}=∅, and x∈Z+ϵ be fixed, then p0(x),…,pN−1(x) and 1/h0,…,1/hN−1 are all continuous in the real variables a∈(−1,∞) and b in a real neighborhood of −21.
Proof.
The first two statements follow from Step 1 in the proof above. The latter three statements follow from (\reforthpol) and (\refhnorm). The real neighborhood of −21 in the last statement can be taken to be the connected component of R∖((Z−z)∪(Z−z′)) to which −21 belongs.
∎
4. The L-ensemble L(N)
In this section we recall the definition of L-ensembles, a special kind of determinantal point processes. We also prove that L(N) is an L-ensemble. The calculation of the correlation kernel KL(N) is delayed until Section 6 below, after we discuss the discrete Riemann-Hilbert problem.
4.1. L-ensembles
Let X be a countable space, Conffin(X) be the space of simple, finite point configurations on X.
Let L be an operator on the Hilbert space ℓ2(X) and let us denote its matrix L=[L(x,y)]x,y∈X by the same letter. For each X∈Conffin(X), let LX be the submatrix of size ∣X∣×∣X∣ of L consisting of the rows and columns indexed by elements of X. The determinants detLX are the finite principal minors of L. We assume L satisfies:
(a)
L is a trace class operator.
2. (b)
All finite principal minors detLX are nonnegative.
We agree that detL∅=1. The previous assumptions imply
[TABLE]
We can then associate a finite, multiplicity free point process to L given by
[TABLE]
Such processes are called L-ensembles. The matrix L is said to be the L-matrix of the ensemble. It is known that L-ensembles are determinantal processes. The following proposition is proved in [8, Prop. 2.1], see also [12] for a linear-algebraic proof in the case that X is finite.
Proposition 4.1**.**
Let L be an operator on ℓ2(X) that satisfies (a) and (b) above. Then the L-ensemble defined above is a determinantal point process, whose correlation kernel is the matrix of the operator K=L(1+L)−1.
4.2. Relation between orthogonal polynomial ensembles and L-ensembles
Fix N∈N and a locally finite (therefore countable) set X⊂R with a splitting X=XI⊔XII and where XII is finite and of size ∣XII∣=N. Let hI:XI→R, hII:XII→R be two maps satisfying
(i)
hI(x)≥0 for all x∈XI and ∑x∈XI1+x2(hI(x))2<∞.
2. (ii)
hII(x)>0 for all x∈XII.
To the pair of functions (hI,hII), we associate the function f:X→R≥0 by
[TABLE]
Next we associate a discrete orthogonal polynomial ensemble Port to the function f and an L-ensemble PL to the pairs of functions (hI,hII). Later we make a connection between these point processes.
We denote by Port the N-point orthogonal polynomial ensemble on X with weight function f:X→R≥0. Let us check that f indeed defines such an ensemble.
In fact, observe that f is nonnegative and is strictly positive for all points in the set XII of size ∣XII∣=N (and therefore there is at least one set in the ensemble with positive probability). We still need to check that the weight f(x) has a finite (2N−2)-nd moment moment. In fact, ∑x∈Xx2N−2f(x)<∞ if and only if ∑x∈XIx2N−2f(x)<∞ because XII is finite, and by the definition (\reffuncf), the latter inequality is equivalent to ∑x∈XI1+x2(hI(x))2<∞, which is true by the assumption (i).
We now construct an L-ensemble PL associated to (hI,hII). Observe that the splitting X=XI⊔XII allows us to write the Hilbert space decomposition
[TABLE]
We can then define an operator L on ℓ2(X) by giving its matrix in the form
L=[LI,ILII,ILI,IILII,II],
where LI,I is the matrix of an operator from ℓ2(XI) to ℓ2(XI), LI,II is the matrix of an operator from ℓ2(XII) to ℓ2(XI), etc. In this notation, let us consider the operator L whose matrix is given by
[TABLE]
where A∗ is the transpose of A. By condition (i), the columns in A are vectors in ℓ2(XI); together with the fact that A has finitely many columns, the operator A:ℓ2(XII)⟶ℓ2(XI) is of trace class. It then follows that L is of trace class. Since the matrix L is skew-Hermitian, then its finite principal minors are the determinants of skew-Hermitian matrices and therefore nonnegative. Hence we can define the point process PL from the operator L by the general setup of Section 4.1 above.
The following proposition that relates the processes Port and PL follows from a simple computation.
Let (Port)Δ be the simple, finite point process in X such that the probability of X∈Conffin(X) is the probability of XΔXII with respect to the the point process Port, i.e.,
[TABLE]
Then (Port)Δ and PL have the same distribution.
4.3. The point process L(N) is an L-ensemble
Fix N∈N and (z,z′)∈Uadm. Specialize the general setting of the previous section as follows
[TABLE]
The general setting then pushes us to define certain functions hI:XI→R≥0, hII:XII→R>0. Let us change the notation slightly and define functions ψ≥N:Z≥Nϵ→R≥0, ψ<N:Z<Nϵ→R>0, that depend on parameters z,z′,a,b and the positive integer N, as follows
[TABLE]
More explicitly,
[TABLE]
[TABLE]
In the special case here, the functions hI,hII from the general setup are
[TABLE]
Next, by following the general setting, we can define a discrete orthogonal polynomial ensemble Port from the weight function W(x) and an L-ensemble PL from the pair of functions (ψ≥N,ψ<N). It is clear that Port is the process O(N) studied in Section 3. Moreover, thanks to the Propositions 2.4 and 4.2, we deduce that PL is the L-ensemble L(N) which is “complementary” to O(N) with respect to Z<Nϵ. According to the general setup, we can find the L-matrix that corresponds to the L-ensemble L(N). With respect to the splitting Z+ϵ=Z≥Nϵ⊔Z<Nϵ, the L-matrix of L(N) is given by, cf. (\refgeneralLmatrixdef),
[TABLE]
This section is summarized in the following statement.
Proposition 4.3**.**
The point process L(N) is an L-ensemble whose associated L-matrix is LN, defined in (\refLmatrixdef) above. Then a correlation kernel for L(N) is given by KL(N)=LN(1+LN)−1.
Proof.
The first statement follows from the discussion above. The second follows from Proposition 4.1.
∎
5. Discrete Riemann-Hilbert Problem and connection to L-ensembles
In this section, we follow the exposition in [7] faithfully, though the treatment in that paper is more general than ours. Our goal is to lay out a plan, in a more general scenario, on how to compute the entries of the matrix of K=LN(1+LN)−1, where LN is defined in (\refLmatrixdef). We carry out the plan and compute explicit analytic formulas for the entries of K in the next section.
5.1. Discrete Riemann-Hilbert problem
Let S⊂C be a subset of C for which there exists ϵ>0 such that ∣x−y∣>ϵ∀x=y in S, in particular S is locally finite, and the operator
[TABLE]
is well-defined on ℓ2(S) and is a bounded operator.
An operator L on ℓ2(S) is said to be integrable if there exist an integer R∈{2,3,…}, functions f1,g1,…,fR,gR∈ℓ2(S) such that ∑i=1Rfi(x)gi(x)=0∀x∈S, and the matrix of L has the form
[TABLE]
It is implied that L is a bounded operator in ℓ2(S).
Assume we are given a matrix-valued function
[TABLE]
to be called the jump matrix. We denote the space of R×R complex matrices by MR(C). A solution of the discrete Riemann-Hilbert problem111DRHP, for simplicity(S,w) is a holomorphic map
[TABLE]
with simple poles at the points of S that satisfies the following conditions
•
m(ζ) is analytic in C∖S.
•
m(ζ)⟶IR, as ζ⟶∞. Here IR is the identity R×R matrix.
•
Resζ=xm(ζ)=limζ→x(m(ζ)w(x))∀x∈S.
The second bullet above needs to be clarified when S is an infinite set. It means that the convergence holds uniformly in a sequence of expanding contours in the complex plane, say for example in a sequence of circles Ck={ζ∈C:∣ζ∣=rk} whose radii tend to infinity: limk→∞rk=+∞. Moreover we make the requirement that infk≥1dist(S,Ck)>0, i.e., the distance between the contours and the discrete set S is (uniformly) bounded away from [math]. The following statement gives existence and uniqueness of solutions m(ζ) and moreover it provides formulas for the entries of K=L(1+L)−1.
In the setup avoe, let L be an integrable operator on ℓ2(S), such that (1+L) is invertible. Consider the (column) vector-valued functions
[TABLE]
with entries in ℓ2(S) and the jump matrix
[TABLE]
Then there exists a unique solution m(ζ) to the DRHP (S,w), i.e., a function m:C∖S→MR(C) satisfying the three bullets above, where in the second bullet we require uniform convergence in a sequence of expanding contours in C that are uniformly bounded away from S.
Furthermore, the matrix of K=L(1+L)−1 has the form
[TABLE]
where
[TABLE]
5.2. DRHP and L-ensembles
Next we make use of the theory of the DRHP to find explicit formulas for the correlation kernel of the point process PL of Section 4.2; let us recall the setting of that section.
Let N∈N be a positive integer and X⊂R be a locally finite set with a splitting X=XI⊔XII, ∣XII∣=N. Assume moreover there exists ϵ>0 such that ∣x−y∣>ϵ∀x=y in X. Let us additionally assume that the operator T:ℓ2(X)→ℓ2(X) defined in (\refTop) is well-defined and is a bounded operator.
Consider a map hI:XI→R≥0 such that ∑x∈XI1+x2(hI(x))2<∞ and a map hII:XII→R>0. In terms of the direct sum decomposition ℓ2(X)=ℓ2(XI)⊕ℓ2(XII), the matrix
[TABLE]
defines an L-ensemble that we called PL. By virtue of Proposition 4.1, a correlation kernel for PL is given by K=L(1+L)−1. Next we use Proposition 5.1 to find an explicit correlation kernel for PL in terms of analytic functions.
To begin with, let us assume the additional constraint hI∈ℓ2(XI); this is a stronger condition than ∑x∈XI1+x2(hI(x))2<∞. Note that ∣XII∣<∞ implies hII∈ℓ2(XII). The operator L defined above is integrable in the sense of Section 5.1 above. Indeed, if we let
[TABLE]
[TABLE]
then the entries of L in (\refeq:matrixentries) are given by L(x,y)=1{x=y}⋅x−yf1(x)g1(y)+f2(x)g2(y). The corresponding jump matrix w:X→M2(C) is
[TABLE]
Since hI,hII are real-valued, then L∗=−L, which implies that −1 is not in the spectrum of L and (1+L) is invertible. By Proposition 5.1, we then have that the DRHP (X,w) has a unique solution
[TABLE]
Write the coordinates of the matrix-valued function m as
[TABLE]
Being m the solution to the DRHP (X,w) translates in this case to the following points:
•
RI,SI are holomorphic in C∖XII and RII,SII are holomorphic in C∖XI.
•
RI(ζ),RII(ζ)⟶1 and SI(ζ),SII(ζ)⟶0 as ζ⟶∞. Both limits are uniform in a sequence of expanding contours in the complex plane. The contours in question are uniformly bounded away from X.
•
The functions RI,SI,RII,SII have only simple poles.
•
Resζ=xRI(ζ)=(hII(x))2SII(x)∀x∈XII.
•
Resζ=xSI(ζ)=(hII(x))2RII(y)∀x∈XII.
•
Resζ=xRII(ζ)=(hI(x))2SI(x)∀x∈XI.
•
Resζ=xSII(ζ)=(hI(x))2RI(x)∀x∈XI.
Proposition 5.1 can be rewritten in this case as follows.
Proposition 5.2**.**
Assume we are in the setting described above, in particular hI∈ℓ2(XI), and L is defined in (\refeq:matrixentries). Let
[TABLE]
be the unique solution to the DRHP (X,w). Then (1+L) is invertible and the operator K=L(1+L)−1 has matrix entries
[TABLE]
and the indeterminacy on the diagonal x=y is resolved by L’Hôpital’s rule
[TABLE]
In view of Proposition 5.2, our goal is to find explicit formulas for the functions RI,RII,SI,SII. A way to find such expressions is by coming up with four functions that satisfy the seven bullets stated above, that relate the structure of their poles and their asymptotics at infinity. Such expressions are available in this general setting, see [9]. The following result gives such explicit formulas in terms of the orthogonal polynomials {pk(x)}k≥0 on X with respect to the weight function f:X→R≥0 in (\reffuncf). When hI∈ℓ2(XI), then f has finite (2N) moments, so at least the orthogonal polynomials p0,…,pN exist and hn=∑x∈X(pn(x))2f(x)<∞ for all n=0,1,…N.
Under the assumptions above, in particular hI∈ℓ2(XI),
[TABLE]
The following is an immediate consequence of Proposition 5.3. Although the result itself is not used, it was important to guide us in our search of explicit formulas for solutions of a DRHP, see Remark 6.7.
Under the assumptions above, for any x∈XII, we have
[TABLE]
Lastly let us state a theorem which can be applied without the assumption hI∈ℓ2(X), though the result still requires the weaker assumption ∑x∈XI1+x2(hI(x))2<∞.
Assume we are under the assumptions above, including ∑x∈XI1+x2(hI(x))2<∞, L is defined as in (\refeq:matrixentries) and K=L(1+L)−1. Define ϵ:X→{+1,−1} by
[TABLE]
Recall that a function f:X→R≥0 was defined from the pair of functions (hI,hII) in the general setting of Section 4.2. The orthogonal polynomials p0=1,p1,…,pN−1 with respect to the weight function f on X exist, and hn=∑x∈X(pn(x))2f(x)<∞ for n=0,1,…,N−1. Define the map K′:X×X→R by
[TABLE]
Then
[TABLE]
6. Correlation kernel of L(N)
In Section 4, we showed L(N) is an L-ensemble on the state space Z+ϵ. Proposition 4.1 implies that L(N) is determinantal. In this section, our objective is to find a correlation kernel KL(N) of L(N). The real struggle will be to find formulas that are suitable for the limit transition N→∞. Throughout this section, assume as usual that (z,z′)∈Uadm; we do restrict (z,z′) to smaller subsets of C2 in some arguments (or make analytic continuations of (z,z′) to domains of C2 containing U0), but we will point it out when we do. Observe that (z,z′)∈Uadm implies that Σ=z+z′+b∈(−1,+∞).
6.1. Strategy of the computation
As shown in Proposition 4.1, a correlation kernel KL(N) of the L-ensemble L(N), whose L-matrix LN is given in (\refLmatrixdef), is
[TABLE]
In order to give explicit expressions for KL(N), we use the general theory of the DRHP from the previous section. Remember also the specific setting of Section 4.3. The state space is X=Z+ϵ with the splitting into spaces XI=Z≥Nϵ and XII=Z<Nϵ. We defined two functions hI=ψ≥N:Z≥Nϵ→R>0 and hII=ψ<N:Z<Nϵ→R≥0. The entries of the matrix KL(N) can be expressed in terms of the solution of the DRHP (Z+ϵ,wN), where
[TABLE]
is the jump matrix, cf. (\refeqn:jumpmatrix). Proposition 5.2 expresses the entries of KL(N) in terms of four functions which solve the DRHP (Z+ϵ,wN). In this section, we redenote the four functions RI,RII,SI,SII in question by R≥N,R<N,S≥N,S<N, respectively.
In order to apply the DRHP method in the general setting of the previous section, we need the assumption that hI∈ℓ2(XI). In our special case, this assumption is equivalent to ψ≥N∈ℓ1(Z≥Nϵ). By the identity Γ(z)Γ(1−z)=sinπzπ, the formula (\refeqn:psigreaterN) for ψ≥N can be rewritten as
[TABLE]
By well known asymptotics of the Gamma function, we have ψ≥N(x)∼π2sinπzsinπz′x1−2Σ and so ψ≥N∈ℓ1(Z≥Nϵ) if Σ>1.
Another condition that we need in order to apply the theory of the DRHP is that the operator T on ℓ2(Z+ϵ) defined in (\refTop) is well-defined and a bounded operator. Indeed, let us begin by checking that the sum defining the operator T is always absolutely convergent. Given h∈ℓ2(Z+ϵ) and x∈Z+ϵ we have
[TABLE]
where the second inequality holds because ∣x−y∣≥1 whenever x=y are elements of Z+ϵ. Thus the sum defining (Th)(x) is absolutely convergent for any x∈Z+ϵ. By a similar reasoning we can bound
[TABLE]
where the interchange of sums is easily justified and C is 3 times any upper bound for ∑x∈Z+ϵx=y(x−y)21, uniform over x∈Z+ϵ, for example C=6∑n=1∞n21.
Therefore, if (z,z′)∈Uadm∩{Σ>1}, then the general theory of the DRHP applies and we are able to obtain formulas for the analytic functions R≥N,R<N,S≥N,S<N. In fact, Proposition 5.3 expresses these four functions in terms of the orthogonal polynomials pN,pN−1 of weight W(x) that we computed in the proof of Theorem 3.5. However our job is not yet complete at this point because the formulas in that proposition do not allow us to take the limit as N tends to infinity. Most of the difficulty relies in obtaining, via transformations of generalized hypergeometric functions (and massive computations), formulas for R≥N,S≥N,R<N,S<N that are suitable for taking the limit N→∞.
Finally there is the task of extending the results for all (z,z′)∈Uadm by removing the assumption Σ>1. This is done by first showing via different techniques, namely Theorem 5.5, that the formulas involved depend analytically on the parameters z,z′ and then by means of an analytic continuation.
Before carrying out the plan described here, it is very convenient to construct a different discrete Riemann-Hilbert problem whose solution m(ζ) is related to the solution of our desired DRHP m(ζ) via the simple (but non-invertible) change of variables m(ζ)=m((ζ+ϵ)2).
6.2. A modified DRHP
Assume the following conditions
[TABLE]
From Proposition 5.1 and the discussion above, there exists a unique solution m:C∖Z+ϵ⟶M2(C) to the DRHP (Z+ϵ,wN). If we let
[TABLE]
then the following relations hold and uniquely define m, see Section 5.2:
•
R≥N,S≥N are holomorphic in C∖Z<Nϵ and R<N,S<N are holomorphic in C∖Z≥Nϵ.
•
R≥N(ζ),R<N(ζ)⟶1 and S≥N(ζ),S<N(ζ)⟶0 as ζ⟶∞. The convergence is uniform over a sequence of expanding contours in the complex plane. The contours in question are uniformly bounded away from Z+ϵ.
•
The functions R≥N,R<N,S≥N,S<N have only simple poles.
•
Resζ=xR≥N(ζ)=ψ<N(x)S<N(x)∀x∈Z<Nϵ.
•
Resζ=xS≥N(ζ)=ψ<N(x)R<N(x)∀x∈Z<Nϵ.
•
Resζ=xR<N(ζ)=ψ≥N(x)S≥N(x)∀x∈Z≥Nϵ.
•
Resζ=xS<N(ζ)=ψ≥N(x)R≥N(x)∀x∈Z≥Nϵ.
Let us introduce a different DRHP. Define Y as the set
[TABLE]
with the splitting
[TABLE]
Consider the functions ψ≥N:Y≥N→R, ψ<N:Y<N→R∖{0} defined by
[TABLE]
where ψ≥N, ψ<N are the functions in (\refeqn:psigreaterN) and (\refeqn:psismallerN), respectively. Observe that ϵ>0 is important for the definition above, since otherwise ψ<N would not be defined at [math].
Additionally consider the jump matrix wN:Y→M2(C) defined by
[TABLE]
Finally let m:C∖Y⟶M2(C) be the matrix-valued function
[TABLE]
We claim that m is a solution to the DRHP (Y,wN). In fact, m certainly satisfies the conditions regarding the asymptotics at infinity. We need to check the structure of the poles and the formulas for the residues at these poles. Let x0 be a (simple) pole of m(ζ) and Resζ=x0m(ζ)=c−1. The Laurent expansion of m(ζ) around ζ=x0 is therefore of the form
[TABLE]
Since the solution m(ζ) to the DRHP has only poles at Z+ϵ, then the pole x0 must be of the form x0=(y0+ϵ)2 for some y0∈Z+. It follows that
[TABLE]
It follows that m(ζ) has simple poles at points y0∈Z+ and −y0−2ϵ∈Z+−2ϵ; in other words, m(ζ) has simple poles exactly at the points of Y. Observe that we used ϵ>0 again, since otherwise the pole at y0=0 would have been of order 2. From (\refeqn:pole) it also follows that
[TABLE]
From (\refresiduesrelation) and the fact that m(ζ) is the solution to the DRHP (X,wN), it is evident now that m(ζ) is a solution to the DRHP (Y,wN), where Y is as in (\refYdef) and wN:Y→M2(C) is defined in (\refeqn:weightwtilde). We have the following uniqueness result.
Lemma 6.1**.**
In the setting above, there is a unique solution m:C∖Y→M2(C) of the DRHP (Y,wN) and it is m(ζ)=m((ζ+ϵ)2).
Proof.
The discussion above shows that there exists at least one solution m to (Y,wN) given by m(ζ)=m((ζ+ϵ)2). In [7, Lemma 4.7], it is shown that there exists at most one solution to the DRHP (Y,wN) provided that wN(x)2=0 for all x∈Y. In fact, (wN(x))2=0 follows from (\refeqn:weightwtilde), and we are done.
∎
Like we did with m, let us describe the matrix entries of m more explicitly. If we write
[TABLE]
then R≥N(ζ)=R≥N((ζ+ϵ)2), S≥N(ζ)=S≥N((ζ+ϵ)2), R<N(ζ)=R<N((ζ+ϵ)2) and S<N(ζ)=S<N((ζ+ϵ)2). Moreover the following conditions are satisfied and uniquely determine the solution m of the DRHP (Y,wN):
•
R≥N,S≥N are holomorphic in C∖Y<N and R<N,S<N are holomorphic in C∖Y≥N.
•
R≥N(ζ),R<N(ζ)⟶1 and S≥N(ζ),S<N(ζ)⟶0 as ζ⟶∞. The convergence is uniform in a sequence of expanding contours in the complex plane. The distance between the contours in question and Y is uniformly bounded away from [math].
•
The functions R≥N,R<N,S≥N,S<N have only simple poles.
•
Resζ=yR≥N(ζ)=ψ<N(y)S<N(y)∀y∈Y<N.
•
Resζ=yS≥N(ζ)=ψ<N(y)R<N(y)∀y∈Y<N.
•
Resζ=yR<N(ζ)=ψ≥N(y)S≥N(y)∀y∈Y≥N.
•
Resζ=yS<N(ζ)=ψ≥N(y)R≥N(y)∀y∈Y≥N.
6.3. More on generalized hypergeometric functions
We break the discussion momentarily to discuss some terminology and results on generalized hypergeometric functions needed for the formulas in subsequent sections. The very-well-poised 7F6(1) series is defined by222There is a more familiar function W in connection to 7F6(1) generalized hypergeometric series, see [3, Ch. VII], but it is not the one used here
[TABLE]
It is a holomorphic function in the domain defined by ℜ(2+2A−C−D−E−F−G)>0 and A−C,A−D,A−E,A−F,A−G∈/Z<0.
Next we review the functions defined and studied in [20]. For any A,B,C,D,E,F,G∈C such that
[TABLE]
the L-function333The letter L in this context stands for a linear combination of generalized hypergeometric functions and has nothing to do with L-ensembles is the function defined by
[TABLE]
In one-line notation, the function is denoted by L(A,B,C,D;E;F,G). The top and bottom arguments of the L-function above are A,B,C,D and F,G, respectively. Clearly L(A,B,C,D;E;F,G) is symmetric as a function of its top arguments A,B,C,D, and it is also symmetric as a function of its bottom arguments F,G.
As a function of the variables E,F,G,B,C,D (and replacing A=E+F+G−B−C−D−1), the function is analytic in the domain {E∈/Z}. Similar observations hold for the L-function as an analytic function on the variables E and 5 other variables, setting the sixth one using (\refeqn:condition1).
In certain domain, the function L(A,B,C,D;E;F,G) can be expressed as a very-well-poised 7F6(1) series. Explicitly, if ℜ(F−D)>0, E∈/Z, D+G−E∈/Z<0 and (\refeqn:condition1) is satisfied, then [20, (2.3)], [3, (7.5.3)], give
[TABLE]
When A=−n for some n∈N, then the L-function can be written as a multiple of one terminating Saalschützian 4F3(1) series. In fact, Γ(−n)1=0 and (\refLfunction) imply
[TABLE]
Other important identities of the L-function that we shall use are the L-fundamental identities and the L-incoherent relation, see Propositions A.1 and A.2 in the Appendix.
6.4. Solving the modified DRHP
We still assume here that Σ>1, (a,b)=(−21,−21). By following the general setup of Section 5.2, cf. Proposition 5.3, let us define
[TABLE]
where pN−1(x),pN(x) are the (N−1)-st and N-th orthogonal polynomials on Z+ϵ with respect to the weight function W(x), and hN−1 is the squared norm of pN−1 in L2(Z+ϵ,W). They have explicit formulas given in (\refpNfirst), (\refpNfirst1) and (\refhN1), which yield
[TABLE]
[TABLE]
As functions of ζ, the formulas defining R≥N,S≥N are meromorphic with simple poles at the points of Y<N. As functions of (z,z′), R≥N is holomorphic on U0∩{Σ=0} and S≥N is holomorphic on U0.
Next we define the functions R<N,S<N as follows, cf. Proposition 5.3 again,
[TABLE]
It can be shown that both S≥N and R≥N are bounded on Z≥N={N,N+1,…} (see for instance (A1) in the proof of Proposition 6.2 below that shows R≥N(y)→1 as y→∞). As we are assuming Σ>1, then ψ≥N∈ℓ1(Z≥Nϵ), which implies that both of the sums defining R<N, S<N are absolutely convergent and therefore R<N,S<N are holomorphic, as functions of ζ, on the domain C∖Y≥N. As functions of (z,z′), R<N is holomorphic on U0 (just like S≥N) and S<N is holomorphic on U0∩{Σ=0} (just like R≥N).
Proposition 6.2**.**
The function R<N admits the closed form
[TABLE]
whereas if Σ=0, the function S<N admits the closed form
[TABLE]
Remark 6.3**.**
The right-hand side of (\reftildeRsmallerN) is evidently holomorphic, as a function of (z,z′), on the domain U0∩{z−z′∈/Z}, while the right-hand side of (\reftildeSsmallerN) is holomorphic on the domain U0∩{z−z′∈/Z}∩{Σ=0}. The singularities at z−z′∈/Z can, however, be removed by simply checking that the residues of the simple poles of each of the two terms in (\reftildeRsmallerN) and (\reftildeSsmallerN) cancel out each other.
The remaining of this section is devoted to proving Proposition 6.2, but first we need more suitable expressions for R<N(ζ) and S<N(ζ) given in the lemma below. We write hN−1(z,z′) for the formula given in the right-hand side of (\refhN1) and hN(z−1,z′−1) for the same formula with z, z′ and N replaced by z−1, z′−1 and N+1, respectively. Consider also the meromorphic function
[TABLE]
Lemma 6.4**.**
The right-hand side of (\reftildeRsmallerN) (the closed formula of R<N(ζ)) equals
[TABLE]
while the right-hand side of (\reftildeSsmallerN) (the closed formula of S<N(ζ)) equals
[TABLE]
Remark 6.5**.**
By virtue of Γ(z)Γ(1−z)=sinπzπ, the first term of R<N(ζ) (in Lemma 6.4) has the factor
[TABLE]
Then, as a function of ζ, the first term of R<N(ζ) has simple poles at Y≥N∪(−a−Z<0)∪(z+N−Z<0)∪(z′+N−Z<0). The second term of R<N(ζ) has simple poles at {−N−2ϵ,−N−1−2ϵ,…}∪(−a−Z<0)∪(z+N−Z<0)∪(z′+N−Z<0). As it turns out, a consequence of Lemma 6.4 is that the residues of the first term of R<N with respect to each of the simple poles at (−a−Z<0)∪(z+N−Z<0)∪(z′+N−Z<0) are the negatives of the residues of the corresponding poles of the second term of R<N. Then R<N is holomorphic on C∖Y≥N, as it ought to be. A similar remark applies to S<N. One actually has that S<N can be obtained from R<N after the change of variables z↦z−1, z′↦z′−1, N↦N+1 and then multiplying both sides by hN(z−1,z′−1).
The proof of Lemma 6.4 is very technical, and based on several identities involving the L-functions. We relegate the proof to the Appendix, and we proceed here with the proof of Proposition 6.2 assuming Lemma 6.4 has been proved. We shall need the observation that the formulas for R<N(ζ) and S<N(ζ) in Proposition 6.2 are invariant under the involution ζ↦−ζ−2ϵ. Moreover the formulas for R≥N(ζ) and S≥N(ζ) in (\refRlargerN) and (\refSlargerN), respectively, are also invariant under ζ↦−ζ−2ϵ.
Lemma 6.6**.**
R<N(ζ)=R<N(−ζ−2ϵ), S<N(ζ)=S<N(−ζ−2ϵ), R≥N(ζ)=R≥N(−ζ−2ϵ), and S≥N(ζ)=S≥N(−ζ−2ϵ).\hfill□
By the discussion in Section 6.2, especially the uniqueness statement in Lemma 6.1, the functions R<N,R≥N,S<N and S≥N are uniquely defined by the seven conditions at the end of Section 6.2. In the remaining of the proof, we simply have to check that these conditions hold. In other words, we need to study the structure of residues of these four meromorphic functions and their asymptotics at infinity. Let us verify the necessary conditions only for the functions R<N and R≥N, since the analysis for the functions S<N and S≥N is similar. In other words, we need to prove:
(A1) R≥N(ζ) is meromorphic and it has only simple poles at the points of Y<N.
(B1) R≥N(ζ)→1 uniformly as ζ→∞ on expanding contours whose distance from Y is bounded away from [math].
(C1) Resζ=yR≥N(ζ)=ψ<N(y)S<N(y)∀y∈Y<N.
(A2) R<N(ζ) is meromorphic and it has only simple poles at the points of Y≥N.
(B2) R<N(ζ)→1 uniformly as ζ→∞ on expanding contours whose distance from Y is bounded away from [math].
(C2) Resζ=yR<N(ζ)=ψ≥N(y)S≥N(y)∀y∈Y≥N.
From formula (\refRlargerN), it is clear that R≥N is meromorphic as a function of ζ and all its poles are simple and at the points of Y<N, which proves (A1).
To prove (B1), we need an identity for terminating Saalschützian 4F3(1) series, which implies that R≥N(ζ) can be rewritten as
[TABLE]
In fact, the equality between (\refRlargerN) and (\refR1N) is equivalent to the equality (\refpNfirst)=(\refalmostpN), which is proved in the Appendix. In the series above, it is evident that each term, except the first one (corresponding to k=0) converges to [math] as ζ→∞. Therefore limζ→∞R≥N(ζ)=1 and moreover the limit is uniform in any sequence of expanding contours in C. Thus (B1) is proved.
From the definition (\refpsitilde), ψ<N(ζ)=−ψ<N(−ζ−2ϵ); together with Lemma 6.6, we have ψ<N(ζ)S<N(ζ)=−ψ<N(−ζ−2ϵ)S<N(−ζ−2ϵ) and also R≥N(ζ)=R≥N(−ζ−2ϵ). Thus (C1) reduces to prove Resζ=yR≥N(ζ)=ψ<N(y)S<N(y)∀y∈{0,1,…,N−1}. Because of expression (\refRlargerN) for R≥N(ζ) and
[TABLE]
we have that Resζ=yR≥N(ζ) equals
[TABLE]
To prove (C1), we must check that the expression above equals ψ<N(y)S<N(y). To evaluate S<N(y), use Lemma 6.4. Observe that the second sum in the expression for S<N(y) vanishes due to the factor Γ(y+1)/Γ(y−N+1). Moreover G(y)=(−1)N−y+1 follows from the definition (\refGdef) and sinπ(η−M)=(−1)M+1sinπη∀M∈Z. By using also the explicit formula (\refeqn:psismallerN) for ψ<N(y), we can obtain
[TABLE]
We indeed have (\refeq:res1)=(\refeq:res2), since it is equivalent to (\refRlargerN)=(\refR1N), and the latter was already justified.
Now we proceed to prove (A2), (B2) and (C2). The formula in (\reftildeRsmallerN) for R<N(ζ) shows that it is a meromorphic function whose set of poles is Y≥N and they are simple poles. Then (A2) is proved.
To prove (B2), observe that R<N(ζ)=R<N(−ζ−2ϵ) of Lemma 6.6 allows us to reduce the statement to limζ→∞R<N(ζ)=1 for ζ→∞ in an expanding sequence of half-contours in the closed halfspace {z∈C:ℜz≥−ϵ}⊂C (for instance, in a sequence of semicircles whose radii tends to infinity). For the actual asymptotics, we use the expression of Lemma 6.4. Let us begin with the first term of R<N(ζ). First, the terminating Saalschützian 4F3(1) series in that first term tends to 1 as ζ→∞, that is,
[TABLE]
uniformly for ζ in any sequence of expanding in C (this is similar to (B1) above). Second, by using
[TABLE]
the factor before the terminating Saalschützian 4F3(1) series in the first term of R<N(ζ) equals
[TABLE]
From well known asymptotics of Gamma functions, the first line of (\refeqn:firstRsmallerN) is ζ−2(Σ+1)(1+O(ζ−1)), so it converges to [math] as ζ→∞, because Σ>−1. Now let us look at the absolute value of the second line of (\refeqn:firstRsmallerN); it is upper bounded by
[TABLE]
where the constant const does not depend on ζ. It is known that ∣cot(πζ)∣ is uniformly bounded for ζ→∞ in any expanding sequence of contours of C that are uniformly bounded away from Z. It follows that the first term of R<N(ζ) in Lemma 6.4 converges to [math] as ζ→∞ in the sense we want.
Let us now prove that the second term of R<N(ζ) in Lemma 6.4 converges to 1 uniformly as ζ→∞ in a sequence of expanding half-contours of {z∈C:ℜz≥−ϵ}⊂C. Since ϵ>−a−1, then ℜ(ζ+a+1)>0 for all ζ∈{z∈C:ℜz≥−ϵ}. Then we can apply identity (\refeqn:LWidentity) with parameters A=−z−b,B=ζ+1−N−z,C=ζ+N+z′+2ϵ,D=−z,E=1+z′−z,F=ζ+1−z.G=ζ+a+1−z. It follows that the second term of R<N(ζ) in Lemma 6.4 equals
[TABLE]
By well known asymptotics of Gamma functions, the first line of (\refeqn:secondtermR) is asymptotically 1+O(ζ−1). Let vk(ζ) be the k-th term of the 7F6 function in the second line of (\refeqn:secondtermR), for all k∈Z≥0. Clearly v0(ζ)≡1, while for any k>0 we have
[TABLE]
where const is a positive real value not depending on ζ. Then if k is fixed, vk(ζ)→0 uniformly for ζ in any expanding sequence of contours bounded away from {z+z′+Z}∪{z+Z}∪{z′+Z}∪{−2ϵ+Z}. By making some uniform estimates on ∣vk(ζ)∣, that we omit, we can interchange the order between the limit and sum signs, thus obtaining
[TABLE]
in the desired sense. Thus the second term of R<N(ζ) converges to 1 as ζ→∞ in {z∈C:ℜz≥−ϵ} (and therefore in C as explained above), concluding the proof of (B2).
As we did for (C1), we deduce that (C2) reduces to proving Resζ=yR<N(ζ)=ψ≥N(y)S≥N(y),∀y∈{N,N+1,…}. To calculate the left-hand side, use Lemma 6.4. The second term in the expression for R<N(ζ) has no residue at ζ=y, but the first term does because of the factor Γ(N−ζ). By using
[TABLE]
and G(y)=(−1)y−N+1∀y∈Z, we have that Resζ=yR<N(ζ) equals
[TABLE]
We need to show that the expression above is equal to ψ≥N(y)S≥N(y)=2(y+ϵ)ψ≥N(y)S≥N(y); from (\refSlargerN) and (\refeqn:psigreaterN), the latter equals
[TABLE]
The equality (\refeq:residue1)=(\refeq:residue2) is equivalent to the identity (\refRlargerN)=(\refR1N) after the change of variables N↦N−1,z↦z+1,z′↦z′+1. Hence (C2) is proved and we are done.
∎
Remark 6.7**.**
Observe that we proved the formulas for the explicit expressions of R<N(ζ),S<N(ζ) by checking the residues at the points of Z+ϵ and the uniform asymptotics at infinity along expanding contours. However, we did not explain how we came up with these explicit formulas. I owe Alexei Borodin the following suggestion of how to find expressions for R<N,S<N. From his earlier work on the DRHP, see e.g. [4], it is expected that both of these functions satisfy certain second-order difference equations. Due to Corollary 5.4, we know that R<N(x),S<N(x) satisfy the difference equation of Wilson polynomials at points x∈Z<Nϵ. Taking a leap of faith, we assumed that the functions R<N(ζ),S<N(ζ) satisfy the difference equations of Wilson polynomials for a general argument. The paper [30] finds (even in a more general q-setting) two linearly independent solutions to the difference equation of the Wilson polynomials, known as the Wilson polynomials of the first and second kinds. Then we found expressions for R<N and S<N as linear combinations of the Wilson polynomials of the first and second kind, with certain residue and asymptotics at infinity constraints. The expressions found in this way are those in Lemma 6.4. After massive computations, we were able to transform these expressions into those of Proposition 6.2.
6.5. An explicit correlation kernel KL(N)
The culmination of our efforts is the following correlation kernel of L(N).
Theorem 6.8**.**
Let a≥b≥−21, (z,z′)∈Uadm, and L(N) be the point process with associated parameters z,z′,a,b, that was defined in Section 2. The point process L(N) is an L-ensemble. Therefore L(N) is a determinantal point process and KL(N)=LN(1+LN)−1, where LN is the matrix in (\refLmatrixdef), is a correlation kernel for L(N). The matrix element KL(N)(x,y) can be expressed as follows
[TABLE]
where the functions ψ≥N,ψ<N,R≥N,S≥N,R<N and S<N are given in (\refeqn:psigreaterN), (\refeqn:psismallerN), (\refRlargerN), (\refSlargerN), (\reftildeRsmallerN) and (\reftildeSsmallerN), respectively. The indeterminacy in the diagonal x=y is resolved by L’Hôpital’s rule:
[TABLE]
Remark 6.9**.**
The formulas for the functions R≥N,S<N in (\refRlargerN),(\reftildeSsmallerN), are ill-defined if Σ=0. In the proof below, for any x,y∈Z+ϵ, it is shown that KL(N)(x,y), as a function of (z,z′), can be analytically continued to the domain U and therefore the formula above for KL(N)(x,y) has a well-defined value for any (z,z′)∈Uadm, even when Σ=0.
Proof.
The first statements were proved in Proposition 4.3. Next we show that KL(N)(x,y), x,y∈Z+ϵ, is given by (\refeqn:KLN),(\refeqn:KLN2) for Σ=0, and that each of the expressions of the right-hand side of (\refeqn:KLN),(\refeqn:KLN2) can be analytically continued as a function of (z,z′) to the set {Σ=0}.
Assume for now the additional restrictions Σ>1 and (a,b)=(−21,−21). Then the discussion in Section 6.1 and Proposition 5.2 shows how to write the entries KL(N)(x,y) in terms of the unique solution m=(R≥N−S≥N−S<NR<N) to the DRHP (Z+ϵ,wN), where wN is defined in (\refeqn:jumpmatrix). The discussion in Section 6.2, especially Lemma 6.1, shows how m is related to the unique solution m=(R≥N−S≥N−S<NR<N) to the DRHP (Y,wN), where wN is defined in (\refeqn:weightwtilde). Finally, we have explicit formulas available for R≥N,S≥N,R<N and S<N in (\refRlargerN), (\refSlargerN), (\reftildeRsmallerN) and (\reftildeSsmallerN), respectively. All of these four formulas are well-defined for any (z,z′)∈U0∩{Σ=0}, in particular for any (z,z′)∈Uadm∩{Σ>1}. The theorem then follows if Σ>1 and (a,b)=(−21,−21). In the rest of the proof, we get rid of these constraints.
The key to getting rid of the constraints is Theorem 5.5, which gives KL(N)(x,y)=ϵ(x)K′(x,y)ϵ(y), for any x,y∈Z+ϵ, where
[TABLE]
and where W:Z+ϵ→R≥0 is the weight function defined in (\refweightW), p0=1,…,pN−1 are the orthogonal polynomials on Z+ϵ with respect to W, and h0,…,hN−1 are the squared norms of these polynomials.
First let us we get rid of the restriction (a,b)=(−21,−21). Let (z,z′)∈C2 be such that z+z′>23 and {z,z′}∩{…,−23,−1,−21}=∅. From (\refweightW), for any x∈Z+ϵ the function W(x) is continuous in a,b∈(−1,∞). Together with Corollary 3.9, for any x,y∈Z+ϵ it follows that K′(x,y) is continuous in the real variables a∈(−1,∞) and b in some neighborhood Jb′⊂R of −21 (the neighborhood Jb′ is such that b∈Jb′ implies {z+b,z′+b}∩{…,−2,−1}=∅). Then for any x,y∈Z+ϵ, the function KL(N)(x,y)=ϵ(x)K′(x,y)ϵ(y) is also continuous in a∈(−1,∞) and b in the neighborhood Jb′ of −21.
On the other hand, let us look at the continuity of ψ≥N,ψ<N,R≥N,S≥N,R<N and S<N with respect to the real variables a,b. For any x∈Z≥Nϵ, it is clear that ψ≥N(x) is continuous for a,b∈(−1,∞). Now let Ia⊂R, Jb′′⊂Jb′⊂R be neighborhoods of −21 such that a∈Ia, b∈Jb′′ imply {z+a+b+1,z′+a+b+1}∩{…,−2,−1}=∅. With this definition, it is clear that for any x∈Z<Nϵ, the function ψ<N(x) is continuous for a∈Ia and b∈Jb′′. For any x∈Y≥N, the function R≥N(x) is continuous for a,b∈(−1,∞), while S≥N(x) is continuous for a∈(−1,∞) and b∈Jb′ (note the latter is because 1/hN−1 shows up in the definition of S≥N). Let us reduce Jb′′ even further: let Jb⊂Jb′′ be a neighborhood of −21 such that b∈Jb implies Σ=z+z′+b>1. Then for any x∈Y<N, the functions R<N(x) and S<N(x) are continuous for a∈Ia and b∈Jb. Therefore the right-hand side of (\refeqn:KLN) is continuous for a∈Ia, b∈Jb.
Thus we have already proved that both sides of the equality (\refeqn:KLN) are continuous for a∈Ia, b∈Jb and that the equality holds for any a≥b≥−21, (a,b)=(−21,−21) and (z,z′)∈Uadm∩{Σ>1} (note that Uadm depends on b too). By construction, if (z,z′)∈Uadmb=−1/2 is such that z+z′>23 and {z,z′}∩{…,−23,−1,−21}=∅, then any sequence {an}n∈N⊂Ia, {bn}n∈N⊂Jb is such that (z,z′)∈Uadmbn∩{z+z′+bn>1}, where Uadmbn is Uadm defined with bn instead of b. Consider sequences {an}n∈N⊂Ia, {bn}n∈N⊂Jb such that an>bn>−21∀n∈N and limn→∞an=limn→∞bn=−21. We have shown before that equality (\refeqn:KLN) holds if (an,bn) replaces (a,b). Then sending n to infinity, we conclude that (\refeqn:KLN) holds also for (a,b)=(−21,−21). Observe that we assumed that z+z′>23 (or Σ>1 with b=−21), so we still need to remove the constraint Σ>1 for all a≥b≥−21. By a similar reasoning, we can show that (\refeqn:KLN2) holds for (a,b)=(−21,−21) and (z,z′)∈Uadm∩{Σ>1}.
Let us finally get rid of the constraint Σ>1. Consider the domain D=\makebox[0.0pt]\mboxdef{(z,z′)∈U0:{z+2ϵ,z′+2ϵ}∩{…,−3,−2,−1}=∅}. Then clearly Uadm⊂D⊂U0⊂U. Let us look at the holomorphicity of some functions of (z,z′). For any x∈Z≥Nϵ, (\refeqn:psigreaterN) shows that ψ≥N(x) is entire on C2. For any x∈Z<Nϵ, (\refeqn:psismallerN) shows ψ<N(x) is holomorphic on D.
We observed earlier that for any x∈Y≥N, S≥N(x) is holomorphic on U0 and R≥N(x) is holomorphic on U0∩{Σ=0}. For any x∈Y<N, R<N(x) is holomorphic on U0 and S<N(x) is holomorphic on U0∩{Σ=0}. Thus it follows that for any x,y∈Z+ϵ fixed, the corresponding formula on the right-hand side of (\refeqn:KLN) is holomorphic on the domain D∩{Σ=0}. It also follows that the right-hand side of (\refeqn:KLN2) is holomorphic on D∩{Σ=0}.
It is clear, from its explicit formula, that for any x∈Z+ϵ the function W(x) is entire on C2. Along with Corollary 3.9, for any x,y∈Z+ϵ the function K′(x,y) is holomorphic on U; therefore KL(N)(x,y)=ϵ(x)K′(x,y)ϵ(y) admits an analytic continuation to U. Since we showed that the right-hand side of (\refeqn:KLN) gives KL(N)(x,y) for any (z,z′)∈Uadm∩{Σ>1} and also that the right-hand side of (\refeqn:KLN) is holomorphic on D∩{Σ=0}, then it follows that the equality (\refeqn:KLN) holds for all (z,z′)∈D∩{Σ=0}, and in particular for all (z,z′)∈Uadm∩{Σ=0}. Since Uadm⊂D, we have also shown that the formulas on the right of (\refeqn:KLN) admit analytic continuations to the singular set {Σ=0}. One similarly obtains that (\refeqn:KLN2) holds for all (z,z′)∈Uadm∩{Σ=0}, and the right-hand side of (\refeqn:KLN2) has an analytic continuation to {Σ=0}.
∎
7. The continuous point process P on R>0∖{1}
In this section, we describe point processes P=Pz,z′,a,b on the continuous state space
[TABLE]
which will turn out to be a scaling limit of the point processes L(N) on the discrete state space Z+ϵ. We do so in a more general setting, but first we need to introduce several notions and results from [24, 27]; see also the exposition in [13, Sec. 3].
Since a≥b≥−21, in particular a,b>−1, we can define the Jacobi polynomials {Pk(x∣a,b)}k≥0 as the orthogonal polynomials on [−1,1] with respect to the weight (1−x)a(1+x)b. For any N≥1, the multivariate Jacobi polynomials {Pμ(x1,…,xN∣a,b)}μ∈GTN+ are defined by the determinantal formula
[TABLE]
It is known that {Pμ(x1,…,xN∣a,b)}μ∈GTN+ is a basis of the Hilbert space L2([−1,1]N,m(dx)), where m(dx) is the absolutely continuous measure whose density with respect to the Lebesgue measure is ∣Δ(x1,…,xN)∣2∏i=1N((1−xi)a(1+xi)b). For convenience we also set GT0+=\makebox[0.0pt]\mboxdef{∅} and P∅=\makebox[0.0pt]\mboxdef1. For any N≥0, μ∈GTN+, λ∈GTN+1+, define the real numbers ΛNN+1(λ,μ) by the equalities
[TABLE]
The numbers ΛNN+1(λ,μ) generally depend on a,b, but we omit such dependence in the notation, for simplicity. Certain explicit formulas for ΛNN+1(λ,μ) are available, but we will not need them. Moreover ΛNN+1(λ,μ)≥0∀N≥0,μ∈GTN+,λ∈GTN+1+, and ∑μ∈GTN+ΛNN+1(λ,μ)=1∀N≥0,λ∈GTN+1+. Thus the matrix [ΛNN+1(λ,μ)] of format GTN+1+×GTN+ is a stochastic matrix, that we call the matrix of cotransition probabilities of the BC-Gelfand-Tsetlin graph.
If ΛNN+1(λ,μ)=0, then we write μ≺BCλ, see [13, Ch. 3] for an easy combinatorial characterization of the partial ordering ≺BC. The BC-Gelfand-Tsetlin graph is the graph whose set of vertices is
[TABLE]
whose edges connect only signatures of adjacent lengths and μ∈GTN+ is connected to λ∈GTN+1+ if and only if μ≺BCλ. Moreover the BC-Gelfand-Tsetlin graph has edge-multiplicities given by the real numbers ΛNN+1(λ,μ). Observe that the graph therefore depends on the real parameters a,b.
We say that the sequence {PN}N≥0 is a coherent sequence of (resp. probability) measures if each PN is a finite (resp. probability) measure on GTN+, and moreover the following relations hold
[TABLE]
For us, the BC type z-measures are the most important examples of coherent sequences of probability measures, as the following proposition shows.
Proposition 7.1**.**
For any a≥b≥−1/2, (z,z′)∈U0, the sequence {PN}N≥0 of z-measures of finite levels associated to z,z′,a,b is a coherent sequence of measures. If (z,z′)∈Uadm, the sequence {PN}N≥0 of z-measures of finite levels is a coherent sequence of probability measures.
Proof.
The first statement is proved in [13, Proof of Thm. 6.4]. The second statement follows from Lemma 2.1 and the definition of Uadm.
∎
A sequence τ=(τ(0),τ(1),τ(2),…) such that τ(n)∈GTn+, τ(n)≺BCτ(n+1) for all n≥0, is called a path in the BC-Gelfand-Tsetlin graph444Simply a path, for short. The set of all paths is denoted by T. There is an evident inclusion T↪∏n≥0GTn+. Equip the set ∏n≥0GTn+ with the product topology and T with its inherited topology. The topological space T will be called the path-space of the BC-Gelfand-Tsetlin graph.
We equip T with its Borel σ-algebra. The Borel σ-algebra on T can be obtained in the following equivalent way. For any finite path ϕ=(ϕ(0)≺BCϕ(1)≺BC⋯≺BCϕ(n)) in the BC-Gelfand-Tsetlin graph, the cylinder setSϕ is defined by Sϕ=\makebox[0.0pt]\mboxdef{τ∈T:τ(0)=ϕ(0),…,τ(n)=ϕ(n)}. Then the Borel σ-algebra of T is the σ-algebra generated by the cylinder sets Sϕ, where ϕ varies over all finite paths in the BC-Gelfand-Tsetlin graph.
Let P be a finite measure on T, but not necessarily a probability measure. Let λ∈GTN be any signature of positive length N≥1. Consider all the cylinder sets Sϕ, where ϕ=(ϕ(0)≺BCϕ(1)≺BC⋯≺BCϕ(N)) varies over all finite paths of length N with ϕ(N)=λ. We say that P* is a central measure at λ* if P(Sϕ) is proportional to the product of cotransition probabilities ΛN−1N(ϕ(N),ϕ(N−1))⋯Λ01(ϕ(1),ϕ(0)). In other words, conditioned on ϕ(N)=λ, the probability of a cylinder set Sϕ is proportional to the product of cotransition probabilities along the path of ϕ in the BC-Gelfand-Tsetlin graph. A probability measure P on T is said to be a central measure if it is a central measure at λ, for any λ∈GTN+, N≥1.
Next let us make a connection between the objects introduced so far. Let M(T) be the space of signed, finite and central measures on T. It is known to have a natural Banach structure (the norm is given by the total variation of a measure) and therefore a canonical topology. Let Mprob(T)⊂M(T) be the simplex consisting of central probability measures on T. For any P∈Mprob(T), consider its family of pushforward measures with respect to the natural projection maps
[TABLE]
that is, let PN=(ProjN)∗P for each N≥0. Almost by definition, it follows that {PN}N≥0 is a coherent sequence of probability measures. The map
[TABLE]
is a bijection between the set of central probability measures on T and the set of coherent probability measures in the BC-Gelfand-Tsetlin graph. Both sets above are convex, and the map (\refeqn:bijection) is an isomorphism of convex sets.
Since Mprob(T) is a convex set, it is natural to ask for its set of extreme points. We mentioned that Mprob(T) is also a topological space, so we can refine the question by asking for a characterization of the (topological) space of its extreme points. We denote the space of extreme points of Mprob(T) by Ω∞=Ω∞(a,b) and call it the boundary of the BC-Gelfand-Tsetlin graph. The following fundamental result characterizes Ω∞ completely; observe the remarkable fact that Ω∞ is independent of a,b.
The boundary Ω∞ of the BC-Gelfand-Tsetlin graph can be embedded as the subspace
[TABLE]
of triples ω=(α;β;δ) satisfying the inequalities
[TABLE]
We denote elements of Ω∞ by the Greek letter ω. We denote by Pω∈Mprob(T) the extreme measure on T that corresponds to ω∈Ω∞. The following theorem shows that any P∈Mprob(T) is a combination of the extreme probability measures Pω.
Let P be any central probability measure on T. Then there exists a unique probability measure π on Ω∞ such that
[TABLE]
or in other words,
[TABLE]
for any finite path ϕ=(ϕ(0)≺BCϕ(1)≺BC⋯≺BCϕ(n)), where Sϕ is the associated cylinder set. The probability measure π on Ω∞ is said to be the spectral measure of P.
Now the goal is to solve the “spectral problem” for certain measures P. In other words, given certain central probability measure P on T, the question is now to describe its spectral measure π on Ω∞. Since Ω∞ is an infinite-dimensional space, one cannot write down a density function for π. Instead the key to the problem lies in the theory of point processes and correlation functions. To go further, begin by defining the measurable map
[TABLE]
Recall that Conf(X) above stands for the space of simple, locally finite point configurations on X.
Given a probability measure P on T, we now aim to describe its spectral measure π on Ω∞ by studying its pushforward probability measure P=i∗π on Conf(X). The probability measure P defines a point process on X that we denote by the same symbol P. Observe that the map i hides some information about the coordinates i=1,2,… with αi=0, βi=0, βi=1 (namely it hides the number of coordinates k for which αk=0, etc.), and it also hides δ. However, this issue is not very significant for the problem of harmonic analysis that is our main motivation, see for example the discussion in [9, Sec. 9].
The problem now is to compute the correlation functions of the point process P. This is still not an easy question, but we have an strategy to solve it by approximating P by point processes with finite number of points.
For a central probability measure P on T, let {PN}N≥0 be the associated coherent sequence of probability measures, i.e., the image of P under the bijective map (\refeqn:bijection). Then for each N≥0, PN is a probability measure on GTN+. For each N≥1, consider the injective map
[TABLE]
The pushforwards (kN)∗PN are probability measures on Ω∞. By analogy to the “A-type case”, we expect that (kN)∗PN weakly converges to P as N goes to infinity.
Further let P(N) be the pushforward of (kN)∗PN under the map i:Ω∞→Conf(X), that is, P(N)=i∗((kN)∗PN). If we believe in the weak convergence P−limN→∞(kN)∗PN=P, then we also expect that the pushforwards P(N) converge in certain sense to P. In fact, the proposition below shows that the latter convergence holds in the sense that the correlation functions of P(N) converge to those of P as N goes to infinity, in certain special case that will nonetheless be applicable to our situation.
Let us give a different description of the point processes P(N). Recall the maps L(N) defined in Section 2 by
[TABLE]
Let P(N) be the pushforward measures P(N)=(L(N))∗PN. Observe that if PN=PN(⋅∣z,z′,a,b) is the z-measure of level N associated to z,z′,a,b, then the pushforward measure P(N)=(L(N))∗PN(⋅∣z,z′,a,b) is the process Lz,z′,a,b(N) already defined in Section 2.
Also consider the map
[TABLE]
and the induced map jN:Conf(Z+ϵ)→Conf(X) between spaces of point configurations. It is clear that the pushforward of PN under the composition map GTN+L(N)Conf(Z+ϵ)jNConf(X) is the probability measure P(N) on Conf(X) described previously, i.e., P(N)=(jN)∗(L(N))∗PN=(jN)∗P(N).
For the special case dealt with in the statement below, assume that each P(N) is a determinantal process with correlation kernel KP(N) (with respect to the counting measure on Z+ϵ). The pushforwards P(N)=(jN)∗P(N) can be seen as point processes on the discrete space (N+ϵ−21)21Z+ϵ, rather than on the continuous space X. Consider the measure μ on (N+ϵ−21)21Z+ϵ that assigns a mass of 1/N to each point, i.e., μ((N+ϵ−21)2(n+ϵ)2)=N1∀n∈Z+. With respect to this reference measure, the point process P(N) is a determinantal process on (N+ϵ−21)21Z+ϵ with correlation kernel
[TABLE]
Since all processes P(N) are determinantal processes, the “convergence” of P(N) to P that we had in mind leads us to think that P is also determinantal and that the correlation kernels KP(N) must converge to certain function KP:X×X→R, which is a correlation kernel for P.
To state the exact form of the proposition, we need one last piece of notation. For any x∈X, let xN be the point of Z+ϵ that is closest to ((N+ϵ−21)x)2 (if there are two points in Z+ϵ that are at the same distance from ((N+ϵ−21)x)2, then xN is either of them).
Proposition 7.4**.**
Let {P(N)}N≥1 be point processes on Z+ϵ and P a point process on X, as above. Assume that each P(N) is a determinantal process with correlation kernel KP(N) (with respect to the counting measure on Z+ϵ). Let KP:X×X→R be a map such that the following conditions are satisfied:
(1)
The map KP is continuous.
2. (2)
KP(N)Z<Nϵ×Z<Nϵ and KP(N)Z≥Nϵ×Z≥Nϵ are Hermitian symmetric, for each N≥1.
3. (3)
The following limit holds
[TABLE]
uniformly for (x,y) belonging to compact subsets of X×X.
Then the point process P is determinantal and a correlation kernel of P (with respect to the Lebesgue measure on X) is
[TABLE]
We do not provide here a proof of Proposition 7.4. Theorem 9.2. in [9] is the ‘type A’ analogue of the proposition above and its proof in [9, Ch. 9] can be repeated with suitable modifications, but without any new ideas. We therefore leave the proof of Proposition 7.4 as an exercise to the reader. We only mention here why the exact form in (\refeqn:finalkernel) is the correlation kernel of P (the appearance of x1/4 and y1/4 may seem strange at first).
Let k∈N be arbitrary, denote by ρk(N) and ρk the k-th correlation functions of P(N) and P, respectively. The process P(N) is taken to be on the state space X∩(N+ϵ−21)2Z+ϵ and the reference measure for its correlation functions is taken to be μ such that μ((N+ϵ−21)2(n+ϵ)2)=1/N. Consequently the correlation function of P(N) is
[TABLE]
by our assumptions.
The strategy of [9, proof of Thm. 9.2] enables us to show that ρk exists and moreover
[TABLE]
for any continuous, compactly supported function F:Xk→R. By simple algebraic manipulations and change of variables, we have
[TABLE]
and finally det1≤i,j≤k[KP(xi,xj)]=2kx1⋯xkdet1≤i,j≤k[KP(xi,xj)].
To conclude this section, we apply Proposition 7.4 to the coherent sequence of z-measures {PN}N≥1, see Proposition 7.1, to obtain the desired stochastic point processes P on X=R>0∖{1}, depending on parameters z,z′,a,b.
Definition 7.5**.**
Let a≥b≥−21, (z,z′)∈Uadm and {PN(⋅∣z,z′,a,b)}N≥0 be the associated z-measures of finite levels. Let Pz,z′,a,b be the associated element of Mprob(T), given by the bijective map (\refeqn:bijection) above. Denote by πz,z′,a,b to the spectral measures on Ω∞ corresponding to Pz,z′,a,b, and given by Theorem 7.3. Then we define Pz,z′,a,b as the pushforward of πz,z′,a,b with respect to the map i:Ω∞→Conf(X) in (\refeqn:mapi). If z,z′,a,b are implicit in the context, then we denote Pz,z′,a,b simply by P.
In the next section, we show that the assumptions of Proposition 7.4 are satisfied (with P(N) replaced by Lz,z′,a,b(N) and P replaced by Pz,z′,a,b). As a consequence, it will follow that Pz,z′,a,b is determinantal and we are able to compute a correlation kernel of it as a limit of the correlation kernels KL(N).
8. Main result: An explicit correlation kernel for the point process P
8.1. Statement of the main theorem
The main theorem of this paper is the following.
Theorem 8.1**.**
Let a≥b≥−21, (z,z′)∈Uadm, and P=Pz,z′,a,b be the corresponding point process on R>0∖{1}. Then P is determinantal and a correlation kernel KP(x,y) can be explicitly given in terms of hypergeometric functions. Explicitly, in terms of the decomposition R>0∖{1}=X>1⊔X<1,X>1=(1,∞),X<1=(0,1), KP(x,y) can be expressed as
[TABLE]
where ψ>1:(1,∞)→R≥0, ψ<1:(0,1)→R≥0 are defined by
[TABLE]
and R>1,S>1:(1,∞)→C, R<1,S<1:(0,1)→C, are defined as follows
[TABLE]
Observe that the expressions for the kernel KP in (\refKernelP) have poles in the diagonal x=y. The kernel admits the following analytic continuation via L’Hôpital’s rule:
[TABLE]
Remark 8.2**.**
The function R>1 is holomorphic (as function of (z,z′)) on the domain U∩{Σ=0}, whereas R<1 is holomorphic on U0∩{z−z′∈/Z}. The function S>1 is holomorphic on U0, whereas S<1 is holomorphic on U∩{z−z′∈/Z}∩{Σ=0}. Then the functions R>1,R<1,S>1,S<1 (and consequently KP(x,y)) are all holomorphic on U0∩{Σ=0}∩{z−z′∈/Z}. In the proof below, for any x,y∈X, it is shown that KP(x,y) as a function of (z,z′) can be analytically continued to the domain U0 and therefore KP(x,y) has a well-defined value for any (z,z′)∈Uadm, even when Σ=0 and when z−z′∈Z.
Remark 8.3**.**
The kernel KP in Theorem 8.1 is known as the hypergeometric kernel and it appeared first in [9]. We make the exact comparison with the formula of [9] in the next remark. Observe the surprising fact that KP is independent of the parameter a. This phenomenon also occurs in a different context where some natural Markov processes on Ω∞ preserving the z-measures lose the parameter a in a limit transition, see [13].
Remark 8.4**.**
Consider the functions ψ>1(x)=2ψ>1(x), ψ<1(x)=ψ<1(x)/2, R>1=R>1, R<1=R<1, S>1=S>1/2, S<1=2S<1 and the kernel KP defined just like KP, but with the functions ψ>1,… (with a bar over it) instead of the functions ψ>1,…. It is clear that KP(x,y)=KP(x,y)∀x,y∈X.
the formulas for R>1,S>1 have alternative expressions. For example,
[TABLE]
With the new expressions for R>1,S>1, it is clear that the functions ψ>1,ψ<1,R>1,R<1,S>1,S<1 are very similar to the ones appearing in the hypergeometric kernel describing the zw-measures, see [10, Thm. 10.1]. In fact, they are actually the same functions after the formal identification of variables
[TABLE]
A pedrestian explanation for the similarity of the functions R>1,S>1 is that Askey-Lesky polynomials (which come up in the analysis of zw-measures) and Wilson-Neretin polynomials have the same asymptotics in certain limit regime. Moreover the similarity of the functions R<1,S<1, at least when ℜΣ>0, comes from the fact that they can be expressed as certain Stieltjes-like transforms of R>1,S>1 if one takes a suitable limit of the expressions (\refR2S2) and [10, (8.3)].
Another (informal) explanation that we reproduce here is due to Alexei Borodin and Grigori Olshanski. If we consider the kernel KP above as an operator on H=L2(R>0∖{1},dx)=L2((0,1),dx)⊕L2((1,∞),dx), then it is plausible that we can write it in the form KP=L(1+L)−1, for some operator L on H, with matrix of the form
[TABLE]
(See [28] for a proof in an easier model coming from the infinite symmetric group.) Moreover, since KL(N)=LN(1+LN)−1 and KL(N) converges to KP, it is plausible that the desired operator L is a limit of the operators LN, as N tends to infinity. Since the matrix elements of LN involve only elementary functions, such a limit transition is very simple. Similar remarks apply to the ‘type A’ situation, especially the fact that the corresponding matrix elements of LN (in their discrete point processes) involve only elementary functions and they have a simple limit transition. Thus the presence of the hypergeometric kernel in both situations can be attributed to the equality of limits of the LN operators on the corresponding discrete spaces.
8.2. Limit of the kernel KL(N) as N tends to infinity
Given Proposition 7.4 and the expressions for KP(x,y) in the statement of Theorem 8.1, the difficult part is in proving the uniform convergence on compact subsets, limN→∞N⋅KL(N)(xN,yN)=(2x1/4y1/4)⋅KP(x,y), which is the second item of Proposition 7.4.
Let us state three propositions which show that each of the functions ψ≥N,ψ<N,R≥N,R<N,S≥N,S<N converges, under suitable normalization, uniformly on compact subsets to the corresponding functions ψ>1,ψ<1,R>1,R<1,S>1,S<1.
Proposition 8.5**.**
Let (z,z′)∈C2. The following limits
[TABLE]
hold uniformly for x in compact subsets of (1,∞) and (0,1) respectively, where xN is the element of Z+ϵ that is closest to ((N+ϵ−21)x)2 (if there are two elements of Z+ϵ equally close to ((N+ϵ−21)x)2 then xN is either of them). The functions ψ≥N,ψ<N are as defined in (\refeqn:psigreaterN) and (\refeqn:psismallerN).
Proposition 8.6**.**
Let (z,z′)∈U0∩{Σ=0}. Let I⊂(1,∞) be any compact subset. For any δ>0, define
[TABLE]
Then there exists δ0>0 small enough such that for any ζ∈Iδ0, we have
[TABLE]
and the convergence is uniform on Iδ0. The functions R≥N,S≥N are defined in (\refRlargerN) and (\refSlargerN).
Proposition 8.7**.**
Let (z,z′)∈U0∩{Σ=0}∩{z−z′∈/Z}. Let J⊂(0,1) be any compact subset. For any δ>0, define
[TABLE]
Then there exists δ0>0 small enough such that for any ζ∈Jδ0, we have
[TABLE]
and the convergence is uniform on Jδ0. The functions R<N,S<N are given in (\reftildeRsmallerN) and (\reftildeSsmallerN).
Rewrite the expression for ψ≥N(xN), coming from (\refeqn:psigreaterN), as
[TABLE]
Since xN∈Z+, it is clear the constant factor in front of ψ≥N(xN) is sin(πz)sin(πz′)/π2. Finally the result for ψ≥N follows from the following uniform estimates as N tends to infinity, when x>1:
[TABLE]
The expression (\refeqn:psismallerN) for ψ<N(xN) can be rewritten as
[TABLE]
The result for ψ<N then follows from the following uniform estimates as N→∞ when 0<x<1:
[TABLE]
∎
As a preliminary to the proof of Proposition 8.6, we show the following lemma.
Lemma 8.8**.**
Let {AN(1)}N≥1,{BN(1)}N≥1,{BN(2)}N≥1 be sequences of complex numbers and let A(2),A(3),B(3) be complex numbers, independent of N, such that B(3)∈/Z≤0. Assume that the sequences satisfy
[TABLE]
Then
[TABLE]
Moreover the limit above is uniform over sequences {AN(1)},{BN(1)},{BN(2)} such that they satisfy the conditions (\refeq:sequences) above and {BN(1)BN(2)NAN(1)−limN→∞BN(1)BN(2)NAN(1)} converges uniformly to [math] as N tends to infinity.
Proof.
The power series expansion of the generalized hypergeometric function is
[TABLE]
The k-th term in the sum above can be written as
[TABLE]
The conditions (\refeq:sequences) guarantee that limN→∞AN(1)=limN→∞BN(1)=limN→∞BN(2)=∞, so it is clear now that the k-th term above (k does not depend on N) converges to the k-th term of the power series expansion of the hypergeometric function
[TABLE]
To guarantee that the limit can be taken term-by-term, we need to use the dominated convergence theorem. For large enough N, and any 0≤k<N, we have the estimates
[TABLE]
where the inequality between the first and second lines assumes ℜBN(2)>AN(1), the one between lines two and three is obvious, and the inequality in the third line assumes ℜBN(1)>Ns. Therefore we have bounded the absolute value of the k-th term in the sum (\refeq:4F3expansion) above by the k-th term in the following series which does not depend on N:
[TABLE]
Since (\refeq:2F1sum) is convergent, we conclude that we can take the limit of the 4F3 terminating series expansion term-by-term, so the limit in the statement of Lemma 8.8 is proved. To show the uniform convergence, observe that we have bounded the series of absolute values corresponding to (\refeq:4F3expansion) by the same convergent series (\refeq:2F1sum), as long as the sequences {AN(1),BN(1),BN(2)} satisfy the conditions stated in the Lemma. Along with the uniform convergence of {BN(1)BN(2)NAN(1)−limN→∞BN(1)BN(2)NAN(1)}, the final statement is clear.
∎
We need the following new formulas for the functions R≥N and S≥N.
[TABLE]
[TABLE]
The proofs of the formulas above are given in the Appendix. Let us next study the limit of the functions R≥N(Nζ). The Gamma functions are easy to handle: for ℜζ>1 we have
[TABLE]
and all estimates are uniform for ζ belonging to compact subsets of {z∈C:ℜz>1}.
Next we can apply Lemma 8.8 above to the sequences AN(1)=N+Σ+a,BN(1)=Nζ−z′,BN(2)=Nζ+z′+2ϵ and the complex numbers A(2)=z′+b,A(3)=z′,B(3)=Σ to obtain the limit
[TABLE]
The lemma moreover implies that the limit above is uniform for ζ in any compact subset K⊂{z∈C:ℜz>1} since it is clear that the conditions imposed in the lemma are satisfied, say for s=21+infζ∈Kℜζ.
Thus we conclude that limN→∞R≥N(Nζ)=R>1(ζ2), uniformly for ζ∈Iδ0 and any δ0>0. A similar analysis easily shows the second desired limit limN→∞N−2ΣS≥N(Nζ)=S>1(ζ2), uniformly for ζ∈Iδ0 and any δ0>0.
∎
Let us begin with the first limit in the proposition. The prelimit expression R<N(Nζ) is a sum of two terms, and both terms differ from each other by the swap of variables z↔z′, so we only need to deal with one of them. The first term is
[TABLE]
We show that it has a uniform limit to the first term of R<1(ζ2), which is
[TABLE]
By the asymptotics of Gamma functions, we have
[TABLE]
The limits above are all uniform for ζ belonging to Jδ0, for any δ0>0. We are left to prove the uniform limit
[TABLE]
for ζ belonging to Jδ0 and some small δ0>0.
The 4F3 generalized hypergeometric function above can be written as the absolutely convergent power series
[TABLE]
For any k∈N fixed, we have the evident limit
[TABLE]
Therefore, for each k∈N, the k-th term of the series (\refeqn:powerseries4F3) converges to the k-th term of the power series expansion of 2F1(1+z+b,−z′;1+z−z′;1−ζ2). Thus the limit (\refeqn:limithypergeos) holds term-by-term in their power series expansion. To complete the proof, we make use of the dominated convergence theorem, but we need some uniform estimates of the terms in the series (\refeqn:powerseries4F3).
For any i≥0, and using that b+1>0,2ϵ≥0, the absolute value of the i-th term in the product (\refeqn:productk) is bounded by
[TABLE]
for all N large enough, say for N>∣ℜz∣. Let c1>0 and c2>1 be arbitrary real numbers. It is easy to see that there exists N1∈N large enough so that the right-hand side of (\refeqn:bound1) is upper bounded by
[TABLE]
and any δ>0. Let c3>1 be any real number. There exists δ1>0 small enough such that ∣1−ζ∣<c3(1−∣ζ∣) for all ζ∈Jδ1. Therefore we can bound (\refeqn:bound2) by
[TABLE]
Thus for any c1>0, let c2,c3>1 be any real numbers such that d=\makebox[0.0pt]\mboxdefc2c3(1−(1+c1infζ∈J∣ζ∣)2)∈(0,1) and fix them. Let J⊂(0,1) be any compact subset. The estimates above show that there exists N1∈N large enough, δ1>0 small enough such that we have the bound
[TABLE]
For any k≤c1N and N>N1, the estimate above yields the bound
[TABLE]
We need also similar estimates for k>c1N and N large enough. Let us begin by estimating the left-hand side of (\refeqn:bound1) for i≥c1N and large N. We claim that for any c4∈(0,1), there exists N2∈N large enough and δ2>0 small enough such that
[TABLE]
The reader can supply a formal proof, but let us give a sketch. If we let (N+z+b+1+i)(N+z+2ϵ+i)N2ζ2+2Nζϵ+(b+1)(N+z+i+2ϵ)=A+B−1, then inequality (\refeqn:bound3) is equivalent to B2≤(1−c4)A(2−(1+c4)A). We can estimate A∼(N+i)2N2(ℜζ)2+N2(ℑζ)2+(b+1)(N+i) and B∼(N+i)22N2(ℜζ)(ℑζ) when N is very large. Also ℜζ∈J⊂(0,1) and J is compact, so infζ∈Jℜζ,supζ∈Jℑζ∈(0,1). It should then be clear that we can choose δ2>0 very small such that B2≤(1−c4)A(2−(1+c4)A) holds when A and B are replaced by their large N estimates. If we choose N2 large enough, then for N>N2, the inequality itself also holds.
By the same principle, for any c5∈(0,1), we can increase the value of N2∈N if necessary so we can upper bound the last expression of (\refeqn:bound3) by
[TABLE]
Now if k>c1N, we have obtained the following bound
[TABLE]
From (\refeqn:bound4) applied to c1N, we also have that N>N1 implies
[TABLE]
for some constant d∈(0,1). Since dc1N is exponentially decreasing in N and Nc4c5(b+1) has polynomial growth, there exists N3∈N such that N>N3 implies const×Nc4c5(b+1)×dc1N≤1, where const is the same constant as in (\refeqn:bound5). We conclude from (\refeqn:bound5) and (\refeqn:bound6) that
[TABLE]
Finally we estimate the remaining factors in the general k-th term of the power series (\refeqn:powerseries4F3). For large k, we can deduce from the asymptotics of Gamma functions that
[TABLE]
So far, we chose c4,c5∈(0,1) to be arbitrary constants. Let us require them to be any real numbers for which b−1−c4c5(b+1)<−23; this is possible if we pick c4 and c5 to be very close to 1. From the latter estimates (\refeqn:bound7) and (\refeqn:bound8), we have that the absolute value of the k-th term in the power series (\refeqn:powerseries4F3) is upper-bounded by
[TABLE]
Let N0=max{N1,N2,N3} and δ0=min{δ1,δ2}. We have proved above that for N>N0, the absolute value of the k-th term in the power series (\refeqn:powerseries4F3) is upper bounded by the absolute value of the k-th term of the power series of 2F1(1+z+b,−z′;1+z−z′;d), for some d∈(0,1) when k≤c1N and by const×k−3/2 if k>c1N. Since the power series of the hypergeometric function 2F1(1+z+b,−z′;1+z−z′;d) is absolutely convergent and the sum ∑k≥1k−3/2 is convergent, it follows that we can apply the uniform convergence theorem to obtain the desired uniform limit (\refeqn:limithypergeos).
Therefore we are finished proving the first limit in the statement of Proposition 8.7. The second limit limN→∞N−2ΣS<N(Nζ)=S<1(ζ2) can be proved similarly, so we leave it as an exercise to the reader. Notice that the complicated part is to prove an statement analogous to (\refeqn:limithypergeos). Such statement can in fact be deduced from the proof above, since the 4F3 function appearing in S<N(Nζ) can be obtained from the 4F3 function in R<N(Nζ) after the change of variables z↦z−1, z′↦z′−1, N↦N+1. The proof of Proposition 8.7 is now complete.
∎
8.3. Proof of the main theorem
As we have mentioned already, the key is to use Proposition 7.4 to approximate the point process P on X by point processes L(N) on Z+ϵ. Clearly condition (2) always holds by Theorem 6.8.
Now let us assume that (z,z′)∈Uadm is such that Σ=z+z′+b=0 and z−z′∈/Z. Later we remove this restriction. Clearly each of the functions ψ<1,ψ>1,R<1,S<1,R>1,S>1 is continuous on their respective domains. In fact, they are all actually holomorphic on neighborhoods of their respective domains. It follows from (\refKernelP) that KP is holomorphic on a neighborhood of X×X∖{(x,x):x∈X}. From (\refKernelP), we also deduce that KP admits an analytic continuation to the diagonal {(x,x):x∈X} and that continuation is given by (\refKernelP2). In particular, KP is continuous on X×X, thus (1) is satisfied.
Let us verify condition (3). For x,y∈X, let xN,yN be the points in Z+ϵ that are closest to ((N+ϵ−21)x)2 and ((N+ϵ−21)y)2, respectively. Thanks to Propositions 8.5, 8.6 and 8.7, we have the uniform limit
[TABLE]
on compact subsets of X×X. Observe that we made use of the uniform convergence of Propositions 8.6 and 8.7 to deal with the singularities on the diagonal (of KL(N)(xN,xN) and KP(x,x)). The conditions of Proposition 7.4 have been verified, so we can conclude that P is a determinantal process and KP is a correlation kernel for it.
The final task is to remove the restrictions Σ=0 and z−z′∈/Z, by means of analytic continuation. More precisely we show that KP(x,y) admits an analytic continuation to (z,z′)∈U0, and that the uniform limit (\refeqn:uniformlimit) still holds for any (z,z′) in the domain U0 and in particular for any (z,z′)∈Uadm⊂U0.
We observe that the limits of Propositions 8.5, 8.6 and 8.7 are all uniform on compact subsets of (z,z′)∈U0∩{Σ=0}∩{z−z′∈/Z}. Therefore the limit (\refeqn:uniformlimit) holds uniformly on compact subsets of the domain (x,y,(z,z′))∈X×X×(U0∩{Σ=0}∩{z−z′∈/Z}).
It is implied that the functions (2x1/2y1/2)⋅KP(x2,y2), for fixed x,y, are such that any point (z,z′) in one of the singular hyperplanes {Σ=0} or {z−z′=k∈Z} has a neighborhood U⊂U0 such that (2x1/2y1/2)⋅KP(x2,y2) is bounded on U∖({Σ=0}∪{z−z′∈Z}). Thus (2x1/2y1/2)⋅KP(x2,y2) admits an analytic continuation to U0, e.g. see [31, Thm. 8]. Therefore KP(x,y) also has an analytic continuation to U0.
We have mentioned that the limit (\refeqn:uniformlimit) holds uniformly on compact subsets of (x,y,(z,z′))∈X×X×(U0∩{Σ=0}∩{z−z′∈/Z}). Moreover we just showed that KP(x,y), as a function of (z,z′), has an analytic continuation to U0. In the proof of Theorem 6.8 we also showed that KL(N) is holomorphic on U0. Hence the limit (\refeqn:uniformlimit) also holds uniformly on compact subsets of (x,y,(z,z′))∈X×X×U0 (as an application of Cauchy’s integral formula). In particular, if (z,z′)∈Uadm⊂U0 is fixed, the limit (\refeqn:uniformlimit) holds uniformly on compact subsets of X×X, concluding the proof.
Appendix A Identities for generalized hypergeometric functions
For simplicity in notation, denote Sin[a1,a2,…]=sinπa1sinπa2⋯, in addition to the notations of Section 1. In this appendix, we prove several statements left out in the main body of the text. All the proofs here involve long computations with identities involving generalized hypergeometric functions.
Many of the arguments below involve the following well known identities in several places
[TABLE]
Whenever we mention ‘simplifications’ or ‘algebraic manipulations’ below, we mean that we use the identities above, possibly many times.
Proof of equalities (\refpNfirst)=(\refalmostpN) and (\refpNfirst1)=(\refalmostpN1).
Observe that (\refpNfirst1)=(\refalmostpN1) is equivalent to (\refpNfirst)=(\refalmostpN) after the change of variables N↦N−1,z↦z+1,z′↦z′+1, so it suffices to prove (\refpNfirst)=(\refalmostpN).
In [3, Sec. 7], there is a convenient notation for writing fundamental identities for generalized hypergeometric functions 4F3; let us recall here such notation. Given any r1,r2,…,r6∈C and n∈N satisfying ∑iri=0, define
[TABLE]
and the following expression involving a generalized hypergeometric function
[TABLE]
Analogously, we can define S(a,b,c) for any a,b,c∈{1,2,3,4,5,6}. In particular, it is true that S(a,b,c) is symmetric with respect to its arguments a,b,c. Less obvious is [3, Sec. 7.3 (6)], which states
[TABLE]
For n=N and the choice of parameters
[TABLE]
(\ref123456) yields the identity
[TABLE]
Recall that Σ=z+z′+b in equations (\refpNfirst) and (\refalmostpN). Then the identity above yields the equality between (\refpNfirst) and (\refalmostpN), after several algebraic manipulations.
∎
Proof of equalities (\refeq:RgeqN) and (\refeq:SgeqN).
Observe that (\refeq:SgeqN) can be deduced from (\refeq:RgeqN) (and from the formulas (\refSlargerN),(\refRlargerN)) after the change of parameters z↦z+1, z′↦z′+1, N↦N−1. Thus we only prove (\refeq:RgeqN). Use (\refRlargerN) for the definition of R≥N(ζ); by simple cancellations, the equality is equivalent to (use x instead of Nζ):
[TABLE]
As the previous two proofs in the Appendix, the latter equality is a consequence of one of the identities in [3, Sec. 5.3], namely
[TABLE]
For n=N and the choice of parameters
[TABLE]
equality (\ref1234561) yields the desired (\refeqn:appendix1).
∎
For the proof of Lemma 6.4, we shall use several identities of L-functions. For example, it is clear that the function L(A,B,C,D;E;F,G) does not depend on the order of its top arguments A,B,C,D or the order of its bottom arguments F,G; we use such independence on the ordering of the arguments without further mention. We also need the following propositions, which are proved in [20].
The proof consists of putting together several identities for generalized hypergeometric functions and other special functions. We begin with the expression for R<N(ζ) in Lemma 6.4 and after applying several identities, we arrive at the expression for R<N(ζ) in Proposition 6.2.
Because of (\refeqn:4F3L) and the first equality of Proposition A.1 applied to the parameters A=1+z,B=−N+1,C=1+z′,D=−N+1−a,E=ζ−N+2,F=1−ζ−N−a−b,G=z+z′+b+2, we have
[TABLE]
By using the definition of hN−1 in (\refhN1), and several algebraic manipulations, it follows that the first term of R<N(ζ) in Lemma 6.4 equals
[TABLE]
As for the second term of R<N(ζ) in Lemma 6.4, by the evident symmetries of the top arguments of the L-function, it is equal to
[TABLE]
Let us apply the L-incoherent identity, Proposition A.2, to the parameters
[TABLE]
Since F−A=1−N implies sinπ(F−A)=0, in the second term of Proposition A.2 one of the products of six sine functions vanishes. After some simplifications, we deduce the following identity
[TABLE]
Then we can rewrite (\refeqn:secondterm) above by using the L-incoherent relation above (the L-function in (\refeqn:secondterm) and that in the left-hand side of (\refeqn:incoherentapp1) have all the same arguments). It follows that R<N(ζ) is the sum of the following two terms:
[TABLE]
[TABLE]
By using the definition of G(ζ) in (\refGdef), the sum inside brackets of (Term 1) equals
[TABLE]
To simplify the trigonometric expression that appears inside the brackets of equation (\refeqn:insideTerm), use
[TABLE]
valid whenever
[TABLE]
Specifically we can use (\refeq:trigonometric) above for the choice of parameters
[TABLE]
which allows us to simplify the expression inside brackets of (\refeqn:insideTerm) as Sin[ζ+z′+a+b,a]Sin[ζ+a,z′+a+b,ζ−z,Σ] and therefore (\refeqn:insideTerm) simplifies to
[TABLE]
It follows that (Term 1) equals
[TABLE]
From (\refeqn:4F3L) and the first equality of Proposition A.1 applied to the parameters A=1+z,B=−N+1,C=1+z′,D=−N+1−a,E=ζ−N+2,F=Σ+2,G=1−ζ−N−a−b, we have
[TABLE]
By using the same identities, we can obtain
[TABLE]
The 4F3 generalized hypergeometric functions in the identities above have the same parameters, therefore by equating them we obtain the following identity
[TABLE]
By using the identity above (Term 1′) can be rewritten as
[TABLE]
We now make some transformations to (Term 2). We have sin(πΣ)⋅Γ(−Σ)=−Γ(Σ+1)π and sinπ(N+a)=(−1)Nsinπa; if we combine these with one of the fundamental transformation for L-functions, the second equality of Proposition A.1 applied to A=1+z,B=−ζ−N−z′−a−b,C=−ζ+N+z,D=1+z+b,E=1−ζ+z,F=1−ζ−a+z,G=1+z−z′, we find that (Term 2) equals
[TABLE]
Next apply the L-incoherent relation, Proposition A.2, to A=−z′−b,B=1+z,C=−ζ−N−z′−a−b,D=ζ−N+1−z′,E=1+z−z′,F=−N−z′−b+1,G=−N−z′−a−b+1. Again since F−A=1−N, then sinπ(F−A)=0, so in the second term of Proposition A.2 one of the products of six sine functions vanishes. As before, after several algebraic manipulations, we obtain
[TABLE]
By applying the latter identity, we can rewrite (Term 1”) as a linear combination of the two L-functions
[TABLE]
More explicitly, (Term 1”) is the sum of the expressions
[TABLE]
[TABLE]
We have R<N(ζ)=(Term 1)+(Term 2)=(Term 1′)+(Term 2′)=(Term 1′′)+(Term 2′)=(Term a′)+(Term b′)+(Term 2′). We claim that (Term 2′)+(Term b′)=0 and (Term a′) is the expression of R<N(ζ) given in Proposition 6.2. We will be done once we prove this claim.
The fact that (Term a′) is equal to the expression of R<N(ζ) given in Proposition 6.2 follows simply from the definition of the L-function as a sum of two 4F3 generalized hypergeometric functions, (\refLfunction).
Now we check that (Term 2′)+(Term b′)=0. Each of the expressions (Term 2′),(Term b′) is a product of ratios of Gamma and sine functions times an L-function. The L-functions in both terms are exactly the same, thus we simply need to check that the prefactors of these terms (consisting of Gamma and sine functions) are negative to each other. The latter task is a simple exercise.
∎
Bibliography31
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] G. W. Anderson, A. Guionnet, and O. Zeitouni. An introduction to random matrices. Cambridge University Press, Cambridge, UK, 2010.
2[2] G. Andrews, R. Askey, R. Roy. Special functions. Cambridge University Press, Cambridge, UK, 2000.
3[3] W. N. Bailey, Generalized Hypergeometric Series. Cambridge University Press, Cambridge, UK, 1935.
4[4] A. Borodin. Asymptotic representation theory and Riemann-Hilbert problem. Asymptotic Combinatorics with Applications to Mathematical Physics (2003): 3-19. Springer Berlin Heidelberg.
5[5] A. Borodin. Determinantal point processes. The Oxford Handbook of Random Matrix Theory (2011): 231–249. Oxford University Press, Oxford.
6[6] A. Borodin. Harmonic analysis on the infinite symmetric group, and the Whittaker kernel, St. Petersburg Math. J. 12 (2001): 733–759.
7[7] A. Borodin. Riemann-Hilbert problem and the discrete Bessel kernel, Internat. Math. Res. Notices (2000), no. 9, 467–494.
8[8] A. Borodin and G. Olshanski. Distributions on Partitions, Point Processes and the Hypergeometric Kernel. Communications in Mathematical Physics 211.2 (2000): 335-358.