Abstract
We consider a two-dimensional determinantal point process arising in the random normal matrix model and which is a two-parameter generalization of the complex Ginibre point process. In this paper, we prove that the probability that no points lie on any number of annuli centered at 0 satisfies large n asymptotics of the form
where n is the number of points of the process. We determine the constants explicitly, as well as the oscillatory term which is of order 1. We also allow one annulus to be a disk, and one annulus to be unbounded. For the complex Ginibre point process, we improve on the best known results: (i) when the hole region is a disk, only were previously known, (ii) when the hole region is an unbounded annulus, only were previously known, and (iii) when the hole region is a regular annulus in the bulk, only was previously known. For general values of our parameters, even is new. A main discovery of this work is that is given in terms of the Jacobi theta function. As far as we know this is the first time this function appears in a large gap problem of a two-dimensional point process.
Mathematics Subject Classification: 41A60, 60B20, 60G55
Introduction and statement of results
Consider the probability density function
| 1.1 |
where and is the normalization constant. We are interested in the gap probability
| 1.2 |
where . Thus is the probability that no points lie on g annuli centered at 0 and whose radii are given by . One annulus is a disk if , and one annulus is unbounded if . In this paper we obtain the large n asymptotics of , up to and including the term of order 1.
The particular case and of (1.1) is known as the complex Ginibre point process [40] (or simply Ginibre process, for short) and is the most well-studied two-dimensional determinantal point process of the theory of random matrices. It describes the distribution of the eigenvalues of an random matrix whose entries are independent complex centered Gaussian random variables with variance . For general values of and , (1.1) is the joint eigenvalue density of a normal matrix M taken with respect to the probability measure [58]
| 1.3 |
Here dM denotes the measure induced by the flat Euclidian metric of on the set of normal matrices (see e.g. [20, 32] for details), is the conjugate transpose of M, “" denotes the trace, and is the normalization constant.
The limiting mean density (with respect to ) as of the points is given by [17, 67]
| 1.4 |
and is supported on the disk centered at 0 and of radius . In particular, for , the limiting density is uniform over the unit disk; this is a well-known result of Ginibre [40]. Since the points accumulate on a compact set as , this means that for large n, is the probability of a rare event, namely that there are g “large gaps/holes” in the form of annuli.
The probability to observe a hole on a disk centered at 0 and of radius in the Ginibre process was first studied by Forrester, who obtained [37, eq. (27)]
| 1.5 |
where
and is the complementary error function defined by
| 1.6 |
The constant was also given independently by Jancovici, Lebowitz and Manificat in [48, Eq. (2.7)]. As noticed in [37, Eq. (13)], and also follow from the asymptotic expansion obtained in an equivalent problem considered in the earlier work [44]. The constants have also been obtained in the more recent work [4] using a different method; see also [52, Eq. (49)] for another derivation of . Although Forrester’s result (1.5) is 30 years old, as far as we know it is the most precise result available in the literature prior to this work.
When the hole region is an unbounded annulus centered at 0 and of inner radius , the following third order asymptotics for were obtained by Cunden, Mezzadri and Vivo in [23, Eq. (51)] for the Ginibre process:
| 1.7 |
where , , .
Hole probabilities of more general domains have been considered in [2] for the Ginibre process. In particular, for a large class of open sets U lying in the unit disk, Adhikari and Reddy in [1] proved that
where the constant is given in terms of a certain equilibrium measure related to a problem of potential theory. When U is either a disk, an annulus, an ellipse, a cardioid, an equilateral triangle or a half-disk, has been computed explicitly. Some of these results have then been generalized for a wide class of point processes by Adhikari in [1]. For the point process (1.1) (with arbitrary but ), he obtained
| 1.8 |
as with and fixed, see [1, Theorem 1.2 and eqs (3.5)–(3.6)].
These are the only works which we are aware of and which fall exactly in our setting. There are however several other works that fall just outside. In [69], Shirai considered the infinite Ginibre process, which, as its name suggests, is the limiting point process arising in the bulk of the (finite) Ginibre process. He proved, among other things, that the probability of the hole event behaves as as (see also [47, Proposition 7.2.1] for a different proof). This result can be seen as a less precise analogue of (1.5) for the infinite Ginibre process, and was later generalized for more general shapes of holes in [2] and then for more general point processes in [1]. Hole probabilities for product random matrices have been investigated in [3, 5]. The existing literature on large gap problems in dimension goes beyond random matrix theory. The random zeros of the hyperbolic analytic function — here the ’s are independent standard complex Gaussians — form a determinantal point process [63], and the associated large gap problem on a centered disk has been solved in [63, Corollary 3 (i)]. Another well studied two-dimensional point process is the random zeros of the standard Gaussian entire function. This function is given by , where the ’s are independent standard complex Gaussians. In [70], the probability for this function to have no zeros in a centered disk of radius r was shown to be, for all sufficiently large r, bounded from below by and bounded from above by for some positive constants c and C. This result was later improved by Nishry in [59], who proved that this probability is as . A similar result as in [70] was obtained in [46] for a different kind of random functions with diffusing coefficients. Also, for a d-dimensional process of noninteracting fermions, it is shown in [43] that the hole probability on a spherical domain of radius r behaves as as , and an explicit expression for is also given.
In its full generality, the random normal matrix model is associated with a given confining potential and is defined by a probability measure proportional to , where dM is as in (1.3). The random normal matrix model has been extensively studied over the years, see e.g. [20, 32] for early works, [7, 38, 53, 66] for smooth linear statistics, [9, 17, 30, 36, 65, 74] for non-smooth linear statistics, and [6, 11, 45, 54, 55] for recent investigations on planar orthogonal polynomials. Despite such progress, the problem of determining large gap asymptotics in this model has remained an outstanding problem. In this work we focus on , which is a generalization of the Gaussian potential known as the Mittag–Leffler potential [8].
Let us now explain our results in more detail. We obtain the large n asymptotics of for general values of and in four different cases:
The case is stated in Theorem 1.1,
The case is stated in Theorem 1.4,
The case is stated in Theorem 1.7,
The case is stated in Theorem 1.9.
In other words, we cover the situations where the hole region consists of
g annuli inside the disk of radius (“the bulk"),
annuli in the bulk and one unbounded annulus (),
annuli in the bulk and one disk (),
annuli in the bulk, one unbounded annulus, and one disk ().
For each of these four cases, we prove that
| 1.9 |
as , and we give explicit expressions for the constants .
The quantity fluctuates around 0 as n increases, is of order 1, and is given in terms of the Jacobi theta function (see e.g. [61, Chapter 20])
| 1.10 |
Note that for all and ; in particular is periodic of period 1. To our knowledge, this is the first time the Jacobi theta function appears in a large gap problem of a two-dimensional point process.
The presence of oscillations in these asymptotics can be explained by the following heuristics. It is easy to see (using Bayes’ formula) that is also equal to the partition function (= normalization constant) of the point process (1.1) conditioned on the event that . As is typically the case in the asymptotic analysis of partition functions, an important role is played by the n-tuples which maximize the density of this conditional process. One is then left to understand the configurations of such n-tuples when n is large. To be more concrete, suppose for example that and . Since the support of (1.4) is the centered disk of radius , it is natural to expect that the points in the conditional process will accumulate as on two separated components (namely the centered disk of radius , and an annulus whose small radius is ). The n-tuples maximizing the conditional density may differ from each other by the number of ’s lying on a given component. This, in turn, produces some oscillations in the behavior of . More generally, if the points in the conditional process accumulate on several components (“the multi-component regime"), then one expects some oscillations in the asymptotics of . (There exist several interesting studies on conditional processes in dimension two, see e.g. [42, 60, 68].) In the setting of this paper, there are three cases for which there is no oscillation (i.e. ): when the hole region consists of only one disk (the case of Theorem 1.4), only one unbounded annulus (the case of Theorem 1.7), or one disk and one unbounded annulus (the case of Theorem 1.9). This is consistent with our above discussion since in each of these three cases the points of the conditional process will accumulate on a single connected component.
It has already been observed that the Jacobi theta function (and more generally, the Riemann theta function) typically describes the oscillations in the large gap asymptotics of one-dimensional point processes in “the multi-cut regime”. Indeed, Widom in [76] discovered that the large gap asymptotics of the one-dimensional sine process, when the gaps consist of several intervals, contain oscillations of order 1 given in terms of the solution to a Jacobi inversion problem. These oscillations were then substantially simplified by Deift, Its and Zhou in [26], who expressed them in terms of the Riemann theta function. Since then, there has been other works of this vein, see [16] for -ensembles, [21] for partition functions of random matrix models, [35] for the sine process, [12, 13, 51] for the Airy process, and [14] for the Bessel process. In all these works, the Riemann theta function describes the fluctuations in the asymptotics, thereby suggesting that this function is a universal object related to the multi-cut regime of one-dimensional point processes. Our results show that, perhaps surprisingly, the universality of the Jacobi theta function goes beyond dimension 1.
Another function that plays a predominant role in the description of the large n asymptotics of is the complementary error function (defined in (1.6)). This function already emerges in the constant of Forrester, see (1.5). Interestingly, the constant of Theorem 1.1 involves the same integrals (which are independent of b and ), namely
| 1.11 |
and the constants of Theorems 1.4 and 1.7 involve
| 1.12 |
| 1.13 |
Using the well-known large y asymptotics of [61, 7.12.1]
| 1.14 |
and , it is easy to check that the integrals in (1.11), (1.12) and (1.13) are finite, as it must.
We expect that the estimate for the error term in (1.9) is not optimal and could be reduced to . However, proving this is a very technical task, and we will not pursue that here. We now state our main results, and discuss our method of proof afterwards.
Fig. 1.

This situation is covered by Theorem 1.1 with
Theorem 1.1
(g annuli in the bulk) Let
be fixed parameters. As , we have
| 1.15 |
where
is given by (1.10), and for
| 1.16 |
Remark 1.2
By setting and in Theorem 1.1, we obtain , which agrees with (1.8).
Remark 1.3
The constant has been included in (1.15) to ease the comparison with Theorems 1.4, 1.7 and 1.9 below.
Fig. 2.

This situation is covered by Theorem 1.4 with
Theorem 1.4
( annuli in the bulk and one unbounded annulus) Let
be fixed parameters. As , we have
| 1.17 |
where
Remark 1.5
It is easy to check that the constants of Theorem 1.4, when specialized to , and , are the same as the constants of Cunden, Mezzadri and Vivo in (1.7).
Fig. 3.

This situation is covered by Theorem 1.7 with
The constants appearing in Theorems 1.7 and 1.9 below are notably different than in the previous two theorems, because they involve a new quantity which is defined by
| 1.18 |
where is the Gamma function. Interestingly, this same object also appears in the large gap asymptotics at the hard edge of the Muttalib-Borodin ensemble, see [18, Theorem 1.1] ( here corresponds to in [18]). It was also shown in [18] that if b is a rational, then can be expressed in terms of the Riemann -function and Barnes’ G function, two well-known special functions (see e.g. [61, Chapters 5 and 25]). More precisely, we have the following.
Proposition 1.6
(Taken from [18, Proposition 1.4]) If for some positive integers , then is explicitly given by
We now state our next theorem.
Theorem 1.7
( annuli in the bulk and one disk)
Let
be fixed parameters. As , we have
| 19 |
where
is given by (1.10), is given by (1.16) for , and is given by (1.18).
Remark 1.8
It is easy to check that the constants of Theorem 1.7, when specialized to , and , are the same as Forrester’s constants in (1.5).
Fig. 4.

This situation is covered by Theorem 1.9 with
Theorem 1.9
( annuli in the bulk, one unbounded annulus, and one disk) Let
be fixed parameters. As , we have
| 1.19 |
where
is given by (1.10), is given by (1.16) for , and is given by (1.18).
Method of proof. The problem of determining large gap asymptotics is a notoriously difficult problem in random matrix theory with a long history [39, 41, 50]. There have been several methods that have proven successful to solve large gap problems of one-dimensional point processes, among which: the Deift–Zhou [25] steepest descent method for Riemann–Hilbert problems [10, 18, 19, 22, 24, 27–29, 49], operator theoretical methods [33, 34, 75], the “loop equations" [15, 16, 56, 57], and the Brownian carousel [31, 64, 72, 73].
Our method of proof shows similarities with the method of Forrester in [37]. It relies on the fact that (1.1) is determinantal, rotation-invariant, and combines the uniform asymptotics of the incomplete gamma function with some precise Riemann sum approximations. Our method is less robust with respect to the shape of the hole region than the one of Adhikari and Reddy [1, 2], but allows to give precise asymptotics. We also recently used this method of Riemann sum approximations in [17] to obtain precise asymptotics for the moment generating function of the disk counting statistics of (1.1). However, the problem considered here is more challenging and of a completely different nature than the one considered in [17]; most of the difficulties that we have to overcome here are not present in [17]. These differences will be discussed in more detail in Sect. 3.
Preliminaries
By definition of and (see (1.1) and (1.2)), we have
| 20 |
| 1.20 |
where the weight w is defined by
We will use the following well-known formula to rewrite and in terms of one-fold integrals.
Lemma 2.1
If is rotation invariant (i.e. ) and satisfies
then
The proof of Lemma 2.1 is standard and we omit it, see e.g. [74, 17, Lemma 1.9] and the references therein. The argument relies on the fact that the point process on with density proportional to is determinantal and rotation-invariant.
Using twice Lemma 2.1, with and , we obtain
| 2.1 |
| 2.2 |
where , , we recall that is the Gamma function, and is the incomplete gamma function
By combining (2.3) with (2.4), we obtain
| 2.3 |
This exact formula is the starting point of the proofs of our four theorems. To analyze the large n behavior of , we will use the asymptotics of in various regimes of the parameters a and z. These asymptotics are available in the literature and are summarized in the following lemmas.
Lemma 2.2
[61, formula 8.11.2]. Let be fixed. As ,
Lemma 2.3
[71, Section 11.2.4]. The following hold:
| 2.4 |
where is given by (1.6), ,
| 2.5 |
and the principal branch is used for the roots. In particular, for , while for . Moreover, as , uniformly for ,
| 2.6 |
All coefficients are bounded functions of (i.e. bounded for ), and
| 2.7 |
By combining Lemma 2.3 with the large z asymptotics of given in (1.14), we get the following.
Lemma 2.4
Proof of Theorem 1.1: the case and
In this paper, always denotes the principal branch of the logarithm. Recall from (2.5) that
| 2.8 |
To analyze asymptotically as the sum on the right-hand side, we will split it into several smaller sums, which need to be handled in different ways.
For and , we define
| 2.9 |
Let be a large integer independent of n, and let be a small constant independent of n. Define
| 3.1 |
where denotes the smallest integer , and denotes the largest integer . We take sufficiently small such that
| 3.2 |
A natural quantity that will appear in our analysis is
| 3.3 |
It is easy to check that for each , lies in the interval . For reasons that will be apparent below, we also choose sufficiently small such that
| 3.4 |
Using (2.4) and (3.4), we split the j-sum in (3.1) into sums
| 3.5 |
with
| 3.6 |
| 3.7 |
| 3.8 |
We first show that the sums and are exponentially small as .
Lemma 3.1
There exists such that as .
Proof
Since is fixed, by (3.8) and Lemma 2.2, as we have
Lemma 3.2
Let . There exists such that as .
Proof
The proof is similar to [17, Lemma 2.2]. Let us consider first the case . By (3.2) and (3.3), for and we have
| 3.9 |
For , the left-hand side in (3.11) must be replaced by . Since is fixed, remains in a compact subset of (0, 1) as with and , while remains in a compact subset of as with and . Thus we can use Lemma 2.4 (i)–(ii) with a and replaced by and respectively, where and . This yields
| 3.10 |
as . By (3.2) and (3.11), there exist constants such that , , and hold for all large enough n, all and all . Thus as , which finishes the proof for . Let us now consider the case , which requires a slightly different argument. We infer from Lemma 2.4 (i) that for any there exist such that for all and all , where is given by (2.7). Let us choose and sufficiently large such that holds for all . In a similar way as in (3.12), we obtain
For each , is decreasing as j increases from to , and therefore
for a small enough constant . It follows that as , which finishes the proof for .
Now, we analyze . As it turns out, these are the sums responsible for the oscillations in the large n asymptotics of . There is no such sums in [17], so the analysis done here for is new.
The next lemma makes apparent the terms that are not exponentially small.
Lemma 3.3
Let . There exists such that
| 3.11 |
where
and
| 3.12 |
where is defined in (3.5).
Proof
Note that (3.11) also holds for , which implies in particular that for each , remains bounded away from 0 as and simultaneously . Thus we can use Lemma 2.4 (i)–(ii) with a and replaced by and respectively, where and , and this gives
as uniformly for . In a similar way as (3.11), we derive
for all and , which implies by (3.2) that
is positive and remains bounded away from 0 for all n sufficiently large and for all . In particular,
as uniformly for , which implies
| 3.13 |
and the claim follows after splitting the above sum into two parts.
The reason why we have split the sum in (3.15) into two parts (denoted and ) around the value is the following. As can be seen from the proof of Lemma 3.3, we have
| 3.14 |
| 3.15 |
as uniformly for . The two above right-hand sides are exponentially small. To analyze their sum, it is relevant to know whether or holds. It is easy to check that the function , when viewed as an analytic function of , has a simple zero at . In fact, we have
| 3.16 |
which implies in particular that is positive for and negative for . Note that lies well within the interval for all sufficiently large n by (3.3), (3.5) and (3.6), which implies that the number of terms in each of the sums and is of order n. When j is close to , the two terms (3.16) and (3.17) are of the same order, and this will produce the oscillations in the asymptotics of . We will evaluate and separately using some precise Riemann sum approximations. We first state a general lemma.
Lemma 3.4
Let , be bounded function of , such that
are integers. Assume also that is positive and remains bounded away from 0. Let f be a function independent of n, and which is for all . Then as , we have
| 3.17 |
where, for a given function g continuous on ,
and for , .
Remark 3.5
To analyze the sums and , we will use Lemma 3.4 only with A and B fixed. However, we will also deal with other sums (denoted and in Lemma 3.19 below) that require the use of Lemma 3.4 with varying A and B. So it is worth to emphasize already here that the condition “ for all " allows to handle the situation where, for example, as and but .
Proof
By Taylor’s theorem,
| 3.18 |
for some . Clearly,
Therefore, by isolating the sum in (3.20), we get
| 3.19 |
as . In the same way as (3.21), by replacing f successively by , and , we also obtain
| 3.20 |
| 3.21 |
| 3.22 |
as . After substituting (3.22)–(3.24) in (3.21), we get
| 3.23 |
as . The integral on the right-hand side of (3.21) can be expanded using again Taylor’s theorem; this gives
for some satisfying . The quantities , , can be expanded in a similar way using Taylor’s Theorem. After substituting these expressions in (3.25) and using some elementary primitives, we find the claim.
We introduce here a number of quantities that will appear in the large n asymptotics of and . For , define
| 3.24 |
and for , define
| 3.25 |
| 3.26 |
| 3.27 |
Lemma 3.6
Let . As , we have
Proof
Recall from (3.11) that remains in a compact subset of (0, 1) as uniformly for , and that remains in a compact subset of as uniformly for . Hence, by Lemma 2.4 (i)–(ii), as we have
Since the number of terms in , namely , is of order n as , the above asymptotics can be rewritten as
| 3.28 |
where
where and as uniformly for . The large n asymptotics of , , and can be obtained using Lemma 3.4 with
and with f replaced by , , and respectively. Thus it only remains to obtain the asymptotics of . We can estimate the -part of using (3.18) as follows:
| 3.29 |
where we recall that is a large but fixed constant (independent of n). Thus we have as , where
| 3.30 |
By changing the index of summation in (3.32), and using again (3.18), we get
| 3.31 |
where the error term has been estimated in a similar way as in (3.31), and . To estimate the remaining sum in (3.33), we split it into two parts as follows
For the second part, we have
provided is chosen large enough. For the first part, since is analytic in a neighborhood of 0, as we have
Hence, we have just shown that
| 3.32 |
By substituting (3.34) and the large n asymptotics of , , and in (3.30), we obtain the claim.
The asymptotic analysis of the sums , is similar to that of the sums , , so we omit the proof of the following lemma.
Lemma 3.7
Let . As , we have
where is given in (3.5) and are given in (3.26)–(3.29).
Substituting the asymptotics of Lemmas 3.6 and 3.7 in (3.13), and using the definitions (3.26)–(3.29), after a long computation we get the following result.
Lemma 3.8
Let . As , we have
where
and where is given in (3.5) and are given in (3.26)–(3.29).
We now turn our attention to the sums , . Their analysis is very different from the analysis of . We first make apparent the terms that are not exponentially small.
Lemma 3.9
Let . There exists such that
| 3.33 |
Let . There exists such that
| 3.34 |
Proof
By definition of , and (see (3.2) and (3.3)), for we have
| 3.35 |
Since is fixed, the second part of (3.37) implies that for each , remains bounded away from 0 as uniformly for , and the first part of (3.37) combined with (3.4) implies that for all we have
Thus by (3.10) and Lemma 2.4 (i)–(ii), we have
as for some constant , and the claim follows.
Let . We now split the sums on the right-hand sides of (3.35) and (3.36) into three parts , , , which are defined as follows
| 3.36 |
where
| 3.37 |
With this notation, the asymptotics (3.35) and (3.36) can be rewritten as
| 3.38 |
Define also
so that (formally) we can write
| 3.39 |
The individual sums , and depend on this new parameter M, but their sum does not. Note also that is independent of the other parameter , while and do depend on . The analysis of is very different from the one needed for and . For and , we will approximate several sums of the form for some functions f, while for , we will approximate several sums of the form for some functions h, where . As can be seen from (3.38) and (3.39), the sum involves the j’s for which
| 3.40 |
Let us briefly comment on our choice of M. An essential difficulty in analyzing , , is that all the functions f and h will blow up near certain points. To analyze , it would be simpler to define M as being, for example, of order , but in this case the sums involve some j/n’s that are too close to the poles of f. On the other hand, if M would be of order , then and could be analyzed in essentially the same way as the sums and of Lemmas 3.6 and 3.7 above (and if , then the sums and are even empty sums), but in this case the sums involve some ’s that are too close to the poles of h. Thus we are tight up from both sides: M of order is not large enough, and M of order is too large. The reason why we choose exactly is very technical and will be discussed later.
We also mention that sums of the form were already approximated in [17], so we will be able to recycle some results from there. However, even for these sums, our situation presents an important extra difficulty compared with [17], namely that in [17] the functions h are bounded, while in our case they blow up near either or .
We now introduce some new quantities that will appear in the large n asymptotics of , and . For , define
Clearly, . For what follows, it is useful to note that is decreasing as j increases, and that is of order as .
We start with a general lemma needed for the analysis of .
Lemma 3.10
(Adapted from [17, Lemma 2.7]) Let and . As , we have
| 3.41 |
where, for and , we define .
Remark 3.11
Note that depends on k, although this is not indicated in the notation.
Remark 3.12
If and are bounded, then the error term simplifies to , which agrees with [17, Lemma 2.7].
Proof
This lemma was proved in [17, Lemma 2.7] in the case where and are bounded. The more general case considered here only requires more careful estimates on the various error terms.
Lemma 3.13
Let . As , we have
| 3.42 |
where
| 3.43 |
| 3.44 |
| 3.45 |
and
In the above equation for , the first line reads for and the second line reads for .
Remark 3.14
Note that the error term above is indeed small as , because .
Proof
We only do the proof for k odd (the case of k even is similar). For convenience, in this proof we will use , and in place of , and . From (2.6), (3.38) and (3.41), we see that
| 3.46 |
Recall from (3.42) that for all , we have
Hence, using (3.2) we obtain
| 3.47 |
as uniformly for . By Taylor’s theorem, for each we have
| 3.48 |
for a certain . Using (1.6), and (3.49), we infer that there exists a constant such that
| 3.49 |
holds for all sufficiently large n and all . Similarly, by Taylor’s theorem, for each we have
| 3.50 |
for some . Furthermore, is analytic with respect to (see [71, p. 285]), in particular near (or ), and the expansion (2.8) holds in fact uniformly for for any (see e.g. [62, p. 325]). It then follows from Cauchy’s formula that (2.8) can be differentiated with respect to without increasing the error term. Thus, differentiating twice (2.8) we conclude that there exists such that
| 3.51 |
holds for all sufficiently large n and all . Combining (3.48), (3.49), (3.50), (3.51), (3.52) and (3.53) with (2.8) and (2.9), we obtain after a computation that
| 3.52 |
as . Each of these three sums can be expanded using Lemma 3.10. The errors in these expansions can be estimated as follows. First, note that the function is exponentially small as , and is bounded by a polynomial of degree 1 as . Hence, the functions , and also tend to 0 exponentially fast as , while as they are bounded by polynomials of degree 2, 3 and 6, respectively. The derivatives of , and can be estimated similarly. Using Lemma 3.10, we then find that the fourth term in the large n asymptotics of is
Similarly, the third term in the asymptotics of is , and the second term in the asymptotics of is . All these errors are, in particular, . Hence, by substituting the asymptotics of these three sums in (3.54), we find the claim.
The quantities , and appearing in (3.44) depend quite complicatedly on M. The goal of the following lemma is to find more explicit asymptotics for . We can do that at the cost of introducing a new type of error terms. Indeed, the error of (3.44) is an error that only restrict M to be “not too large”. In Lemma 3.15 below, there is another kind of error term that restrict M to be “not too small".
Lemma 3.15
Let . As , we have
where
Let . As , we have
where
Remark 3.16
With our choice , both errors and are of the same order:
So is the choice that produces the best control of the total error. However this still does not really explain why we chose . Indeed, in the above asymptotics one could have easily computed the next term of order if this was needed. The real reason why we chose is because the sums and , which are analyzed below, also contain a term of order in their asymptotics, and this term is hard to compute explicitly.
Proof
We only do the proof for k odd. As already mentioned in the proof of Lemma 3.13, , and are exponentially small as , and since , this implies that there exists such that
On the other hand, as , we have
| 3.53 |
| 3.54 |
| 3.55 |
Using (3.55)–(3.57) and the definitions (3.45)–(3.47) of , , , we obtain that
as , and the claim follows.
Remark 3.17
From the above proof, we see that as , and therefore will not contribute at all in our final answer. It was however very important to compute explicitly. Indeed, as can be seen from the statement of Lemma 3.13, consists of two parts, and it is easy to check that each of these two parts is of order as . Thus the fact that actually we have (see (3.57)) means that there are great cancellations in the asymptotic behavior of these two parts, and this is not something one could have detected in advance without computing explicitly and .
Now we turn our attention to the sums and . The analogue of these sums in [17] were relatively simple to analyze, see [17, Lemmas 2.5 and 2.6]. In this paper, the sums and are straightforward to analyze (and even simpler than in [17, Lemmas 2.5 and 2.6]). However, the sums and are challenging (their large n asymptotics depend on both and M in a complicated way). We start with the sums and .
Lemma 3.18
Let . As , we have .
Let . As , we have .
Proof
Let . Recall from (3.38) that
and from (3.39) that . We then infer, by (3.2), that there exists a constant such that holds for all large n and . By (2.6), (2.8), (1.14) and , this implies
uniformly for . Since , the claim is proved for k odd. The proof for k even is similar and we omit it.
We now focus on and .
Lemma 3.19
Let . We have
| 3.56 |
where
| 3.57 |
| 3.58 |
and the last expansion holds as uniformly for . We recall that the functions and are defined in (2.9).
Let . We have
| 3.59 |
where
and the last expansion holds as uniformly for .
Proof
This follows from a direct application of Lemma 2.3.
The asymptotic analysis of and is challenging partly because, as can be seen from the statement of Lemma 3.19, there are four types of n-dependent parameters which vary at different speeds. Indeed, as and , the quantities , , j/n and are of orders , , 1 and respectively. In particular, for j close to , is of order , while for j close to , it is of order 1. In the next lemma, we obtain asymptotics for the right-hand sides of (3.58) and (3.61). These asymptotics will then be evaluated more explicitly using Lemma 3.4.
Lemma 3.20
Let . As , we have
| 3.60 |
| 3.61 |
where
| 3.62 |
| 3.63 |
| 3.64 |
| 3.65 |
| 3.66 |
| 3.67 |
| 3.68 |
Let . As , we have
Remark 3.21
Using that , , and each have a pole at , of order 2, 4, 6 and 1 respectively, we can easily show that the sums
are, as , of order , , and , respectively. Since , each of these sums is thus of order greater than 1.
Proof
Let , and define by
By (3.59) we have for all . For each , using Taylor’s theorem, we obtain
for some if and if . The functions are explicitly computable, but since their expressions are rather long we do not write them down (we simply mention that has a simple zero as , while the functions for remain bounded as ). The function satisfies the following: there exist and such that
We thus have
uniformly for . These asymptotics can be rewritten as
| 3.69 |
as uniformly for . Since has a simple zero at , there exist constants such that
| 3.70 |
for all large enough n and all . On the other hand, using (1.14) we obtain
| 3.71 |
as uniformly for in compact subsets of . Combining (3.71), (3.72) and (3.73) (with ), and using that
we find (3.62) after a long but straightforward computation. To prove (3.63), we first use (3.60) to find
| 3.72 |
as uniformly for . Using again (1.14), we obtain
| 3.73 |
uniformly for in compact subsets of . The first ratio on the right-hand side of (3.74) can then be expanded by combining (3.75) (with ) and (3.71). For the second part in (3.74), since the coefficients and are analytic for (the singularity at in (2.9) is removable), we have
| 3.74 |
for some explicit , (which we do not write down) such that and remain of order 1 as uniformly for . After a computation using (3.74), (3.75) and (3.76), we find
as . Since has a simple zero at , we have
and (3.63) follows. The proof for is similar and we omit it.
By applying Lemma 3.4 with f replaced by and , we can obtain the large n asymptotics of the various sums appearing in the above Lemma 3.20. Note that, as already mentioned in Remark 3.21, the functions , , and have poles at . Nevertheless, we can still apply Lemma 3.4 to obtain precise large n asymptotics for
see in particular Remark 3.5. Substituting these asymptotics in Lemma 3.20 and then in Lemma 3.19, and simplifying, we obtain (after a long computation) the following explicit large n asymptotics of and (see the arXiv version arXiv:2110.06908 for more details).
Lemma 3.22
Let . As , we have
Let . As , we have
Recall from (3.40) that
By combining Lemmas 3.15, 3.18 and 3.22 and simplifying, we finally obtain (after another long computation) the large n asymptotics of .
Lemma 3.23
Let . As , we have
where, for , the coefficients , , , , , are given by
while for , the coefficients , , , , are given by
Remark 3.24
Recall that although , and depend on M, the sum is independent of M. As can be seen from the above, all the coefficients , , , , are independent of M, as it must.
For , and , define
| 3.75 |
By shifting the indices of summation, it can be checked that is periodic of period 1. To complete the proof of Theorem 1.1 we will need the following lemma.
Lemma 3.25
We have
where is the Jacobi theta function given by (1.10).
Proof
The statement follows from two remarkable identities of the Jacobi theta function. First, using the Jacobi triple product formula (see e.g. [61, Eq 20.5.3])
| 3.76 |
we obtain
| 3.77 |
The claim then follows from a computation using the following Jacobi imaginary transformation (see e.g. [61, Eq (20.7.32)]): , where .
We now finish the proof of Theorem 1.1.
Proof of Theorem 1.1
Combining (3.7) with Lemmas 3.1, 3.2, 3.8 and 3.23, we obtain
as , for a certain constant . Recall that , so that . Let be the quantities defined in the statement of Theorem 1.1. Using the formulas of Lemmas 3.8 and 3.23, we obtain after a long computation that
It is also readily checked that . From (3.79) and Lemma 3.8, we infer that
Furthermore, by Lemma 3.25, , and ,
where we have also used the fact that . Combining the above two equations yields
| 3.78 |
On the other hand, using Lemmas 3.8 and 3.23, we obtain (after a lot of cancellations)
| 3.79 |
By combining (3.80) and (3.81), we finally obtain
This finishes the proof of Theorem 1.1.
Proof of Theorem 1.4: the case
As in Sect. 3, we start with (2.5), but now we split into 4g parts
| 3.80 |
The sums can be analyzed exactly as in Sect. 3. For the large n asymptotics of these sums, see Lemma 3.1 for , Lemma 3.2 for with , Lemma 3.8 for with , and Lemma 3.23 for with . Thus it only remains to determine the large n asymptotics of in this section. These asymptotics are stated in the following lemma.
Lemma 4.1
Let . As , we have
where
Proof
In the same way as in Lemma 3.3, as we find
The large n asymptotics of can be obtained in a similar (and simpler, because there is no theta functions) way than in Lemma 3.6 using Lemma 3.4. We omit further details.
By substituting the asymptotics of Lemmas 3.1, 3.2, 3.8, 3.23 and 4.1 in (4.1), and then simplifying, we obtain the statement of Theorem 1.4.
Proof of Theorem 1.7: the case
We use again (2.5), but now we split into parts as follows
| 3.81 |
The sums can be analyzed exactly as in Sect. 3. Their large n asymptotics is given by Lemma 3.2 for with , Lemma 3.8 for with , and Lemma 3.23 for with . Thus it only remains to analyze in this section. This analysis is different than in the previous Sects. 3 and 4 and requires the asymptotics of as uniformly for . These asymptotics are not covered by Lemma 2.3, but are also known in the literature, see e.g. [62].
Lemma 5.1
(Taken from [62, Sect. 4]) As and simultaneously , we have
We are now in a position to obtain the large n asymptotics of .
Lemma 5.2
Let . As , we have
where
where is defined in (1.18).
Proof
In a similar way as in Lemma 3.3, as we find
Using Lemma 5.1, we conclude that as ,
| 4.1 |
The second sum on the right-hand side of (5.2) can be expanded explicitly using Lemma 3.4. For the first sum, using as , we obtain
This finishes the proof.
By combining the asymptotics of Lemmas 3.2, 3.8, 3.23 and 4.1 with (5.1), and then simplifying, we obtain the statement of Theorem 1.7.
Proof of Theorem 1.9: the case and
We split into parts
| 5.1 |
The sums can be analyzed exactly as in Sect. 3, can be analyzed as in Sect. 4, and as in Sect. 5. More precisely, their large n asymptotics are given by Lemma 3.2 for with , Lemma 3.8 for with , Lemma 3.23 for with , Lemma 4.1 for , and Lemma 5.2 for . Substituting all these asymptotics in (6.1) and simplifying, we obtain the asymptotic formula of Theorem 1.9.
Acknowledgements
The author is grateful to Oleg Lisovyy and Grégory Schehr for useful remarks. Support is acknowledged from the European Research Council, Grant Agreement No. 682537, the Ruth and Nils-Erik Stenbäck Foundation, and the Novo Nordisk Fonden Project Grant 0064428.
Funding Information
Open access funding provided by Lund University.
Data Availibility Statement
not applicable to this article as no datasets were generated.
Declarations
Conflict of interest
there is no conflict of interest.
Footnotes
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
References
- 1.Adhikari, K.: Hole probabilities for -ensembles and determinantal point processes in the complex plane, Electron. J. Probab. 23, 21 pp (2018)
- 2.Adhikari K, Reddy NK. Hole probabilities for finite and infinite ginibre ensembles. Int. Math. Res. Not. IMRN. 2017;2017(21):6694–6730. [Google Scholar]
- 3.Akemann G, Strahov E. Hole probabilities and overcrowding estimates for products of complex Gaussian matrices. J. Stat. Phys. 2013;151(6):987–1003. [Google Scholar]
- 4.Akemann, G., Phillips, M.J., Shifrin, L.: Gap probabilities in non-Hermitian random matrix theory, J. Math. Phys. 50(6), 063504, 32 pp (2009)
- 5.Akemann, G., Ipsen, J.R., Strahov, E.: Permanental processes from products of complex and quaternionic induced Ginibre ensembles, Random Matrices Theory Appl. 3,(4), 1450014, 54 pp (2014)
- 6.Ameur Y, Cronvall J. Szegö type asymptotics for the reproducing kernel in spaces of full-plane weighted polynomials. Commun. Math. Phys. 2002 doi: 10.1007/s00220-022-04539-y. [DOI] [Google Scholar]
- 7.Ameur Y, Hedenmalm H, Makarov N. Fluctuations of eigenvalues of random normal matrices. Duke Math. J. 2011;159:31–81. [Google Scholar]
- 8.Ameur Y, Kang N-G. On a problem for Ward’s equation with a Mittag–Leffler potential. Bull. Sci. Math. 2013;137(7):968–975. [Google Scholar]
- 9.Ameur Y, Kang N-G, Seo S-M. The random normal matrix model: insertion of a point charge. Potential Anal. 2023;58(2):331–372. [Google Scholar]
- 10.Baik J, Buckingham R, DiFranco J. Asymptotics of Tracy-Widom distributions and the total integral of a Painlevé II function. Comm. Math. Phys. 2008;280:463–497. [Google Scholar]
- 11.Balogh F, Bertola M, Lee S-Y, McLaughlin KT-R. Strong asymptotics of the orthogonal polynomials with respect to a measure supported on the plane. Comm. Pure Appl. Math. 2015;68(1):112–172. [Google Scholar]
- 12.Blackstone E, Charlier C, Lenells J. Oscillatory asymptotics for Airy kernel determinants on two intervals. Int. Math. Res. Not. IMRN. 2022;2022(4):2636–2687. [Google Scholar]
- 13.Blackstone, E., Charlier, C., Lenells, J.: Gap probabilities in the bulk of the Airy process, Random Matrices Theory Appl. 11(2), Paper No. 2250022, 30 pp (2022)
- 14.Blackstone, E., Charlier, C., Lenells, J.: The Bessel kernel determinant on large intervals and Birkhoff’s ergodic theorem, to appear in Comm. Pure Appl. Math. arXiv:2101.09216
- 15.Borot G, Guionnet A. Asymptotic expansion of -matrix models in the one-cut regime. Comm. Math. Phys. 2013;317(2):447–483. [Google Scholar]
- 16.Borot, G., Guionnet, A.: Asymptotic expansion of beta matrix models in the multi-cut regime. arXiv:1303.1045
- 17.Charlier, C.: Asymptotics of determinants with a rotation-invariant weight and discontinuities along circles, Adv. Math. 408, Paper No. 108600 (2022)
- 18.Charlier C, Lenells J, Mauersberger J. Higher order large gap asymptotics at the hard edge for Muttalib–Borodin ensembles. Comm. Math. Phys. 2021;384(2):829–907. doi: 10.1007/s00220-021-04059-1. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 19.Charlier C, Lenells J, Mauersberger J. Large gap asymptotics for the Meijer- point process. Nonlinearity. 2021;34(5):2837–2877. [Google Scholar]
- 20.Chau L-L, Zaboronsky O. On the structure of correlation functions in the normal matrix model. Comm. Math. Phys. 1998;196(1):203–247. [Google Scholar]
- 21.Claeys T, Grava T, McLaughlin KT-R. Asymptotics for the partition function in two-cut random matrix models. Comm. Math. Phys. 2015;339(2):513–587. [Google Scholar]
- 22.Claeys T, Girotti M, Stivigny D. Large gap asymptotics at the hard edge for product random matrices and Muttalib–Borodin ensembles. Int. Math. Res. Not. 2019;2019:2800–2847. [Google Scholar]
- 23.Cunden FD, Mezzadri F, Vivo P. Large deviations of radial statistics in the two-dimensional one-component plasma. J. Stat. Phys. 2016;164(5):1062–1081. [Google Scholar]
- 24.Dai D, Xu S-X, Zhang L. Asymptotics of Fredholm determinant associated with the Pearcey kernel. Comm. Math. Phys. 2021;382(3):1769–1809. [Google Scholar]
- 25.Deift P, Zhou X. A steepest descent method for oscillatory Riemann-Hilbert problems. Asymptotics for the MKdV equation. Ann. Math. 1993;137:295–368. [Google Scholar]
- 26.Deift P, Its A, Zhou X. A Riemann-Hilbert approach to asymptotic problems arising in the theory of random matrix models, and also in the theory of integrable statistical mechanics. Ann. Math. (2) 1997;146(1):149–235. [Google Scholar]
- 27.Deift P, Its A, Krasovsky I, Zhou X. The Widom–Dyson constant and related questions of the asymptotic analysis of Toeplitz determinants. J. Comput. Appl. Math. 2007;202:26–47. [Google Scholar]
- 28.Deift P, Its A, Krasovsky I. Asymptotics for the Airy-kernel determinant. Comm. Math. Phys. 2008;278:643–678. [Google Scholar]
- 29.Deift P, Krasovsky I, Vasilevska J. Asymptotics for a determinant with a confluent hypergeometric kernel. Int. Math. Res. Not. 2011;9:2117–2160. [Google Scholar]
- 30.Deaño A, Simm N. Characteristic polynomials of complex random matrices and Painlevé transcendents. Int. Math. Res. Not. IMRN. 2022;2022(1):210–264. [Google Scholar]
- 31.Dumaz L, Virág B. The right tail exponent of the Tracy–Widom distribution. Ann. Inst. Henri Poincaré Probab. Stat. 2013;49:915–933. [Google Scholar]
- 32.Elbau P, Felder G. Density of eigenvalues of random normal matrices. Comm. Math. Phys. 2005;259(2):433–450. [Google Scholar]
- 33.Ehrhardt T. Dyson’s constant in the asymptotics of the Fredholm determinant of the sine kernel. Comm. Math. Phys. 2006;262(2):317–341. [Google Scholar]
- 34.Ehrhardt T. The asymptotics of a Bessel-kernel determinant which arises in random matrix theory. Adv. Math. 2010;225(6):3088–3133. [Google Scholar]
- 35.Fahs, B., Krasovsky, I.: Sine-kernel determinant on two large intervals. arXiv:2003.08136
- 36.Fenzl M, Lambert G. Precise deviations for disk counting statistics of invariant determinantal processes. Int. Math. Res. Not. IMRN. 2022;2022(10):7420–7494. [Google Scholar]
- 37.Forrester PJ. Some statistical properties of the eigenvalues of complex random matrices. Phys. Lett. A. 1992;169(1–2):21–24. [Google Scholar]
- 38.Forrester PJ. Fluctuation formula for complex random matrices. J. Phys. A. 1999;32:159–163. [Google Scholar]
- 39.Forrester PJ. Asymptotics of spacing distributions 50 years later. MSRI Publ. 2014;65:199–222. [Google Scholar]
- 40.Ginibre J. Statistical ensembles of complex, quaternion, and real matrices. J. Math. Phys. 1965;6:440–449. [Google Scholar]
- 41.Ghosh S, Nishry A. Point processes, hole events, and large deviations: random complex zeros and coulomb gases. Constr. Approx. 2018;48(1):101–136. [Google Scholar]
- 42.Ghosh S, Nishry A. Gaussian complex zeros on the hole event: the emergence of a forbidden region. Comm. Pure Appl. Math. 2019;72(1):3–62. [Google Scholar]
- 43.Gouraud, G., Le Doussal, P., Schehr, G.: Hole probability for noninteracting fermions in a d-dimensional trap. arXiv:2104.08574
- 44.Grobe R, Haake F, Sommers H-J. Quantum distinction of regular and chaotic dissipative motion. Phys. Rev. Lett. 1988;61(17):1899–1902. doi: 10.1103/PhysRevLett.61.1899. [DOI] [PubMed] [Google Scholar]
- 45.Hedenmalm H, Wennman A. Planar orthogonal polynomials and boundary universality in the random normal matrix model. Acta Math. 2021;227(2):309–406. [Google Scholar]
- 46.Hough, J.B.: Large deviations for the zero set of an analytic function with diffusing coefficients (2005). arXiv: 0510237
- 47.Hough JB, Krishnapur M, Peres Y, Virág B. Zeros of Gaussian analytic functions and determinantal point processes, University Lecture Series. Providence: American Mathematical Society; 2009. [Google Scholar]
- 48.Jancovici B, Lebowitz J, Manificat G. Large charge fluctuations in classical Coulomb systems. J. Statist. Phys. 1993;72(3–4):773–787. [Google Scholar]
- 49.Krasovsky I. Gap probability in the spectrum of random matrices and asymptotics of polynomials orthogonal on an arc of the unit circle. Int. Math. Res. Not. 2004;2004:1249–1272. [Google Scholar]
- 50.Krasovsky, I.: Large gap asymptotics for random matrices, in New Trends in Mathematical Physics. XVth International Congress on Mathematical Physics, Springer, Dordrecht (2009)
- 51.Krasovsky, I., Maroudas, T.-H.: Airy-kernel determinant on two large intervals. arXiv:2108.04495
- 52.Lacroix-A-Chez-Toine B, et al. Intermediate deviation regime for the full eigenvalue statistics in the complex Ginibre ensemble. Phys. Rev. E. 2019;100:012137. doi: 10.1103/PhysRevE.100.012137. [DOI] [PubMed] [Google Scholar]
- 53.Leblé T, Serfaty S. Fluctuations of two dimensional Coulomb gases. Geom. Funct. Anal. 2018;28(2):443–508. [Google Scholar]
- 54.Lee S-Y, Yang M. Discontinuity in the asymptotic behavior of planar orthogonal polynomials under a perturbation of the Gaussian weight. Comm. Math. Phys. 2017;355(1):303–338. [Google Scholar]
- 55.Lee, S.-Y., Yang, M.: Strong Asymptotics of Planar Orthogonal Polynomials: Gaussian Weight Perturbed by Finite Number of Point Charges. arXiv:2003.04401
- 56.Marchal O. Asymptotic expansions of some Toeplitz determinants via the topological recursion. Lett. Math. Phys. 2020;110(2):211–258. [Google Scholar]
- 57.Marchal, O.: Asymptotic expansion of Toeplitz determinants of an indicator function with discrete rotational symmetry and powers of random unitary matrices. arXiv:2112.01306
- 58.Mehta, M.L.: Random matrices. Pure and Applied Mathematics (Amsterdam), Vol. 142, 3rd ed., Elsevier/Academic Press, Amsterdam (2004)
- 59.Nishry A. Asymptotics of the hole probability for zeros of random entire functions. Int. Math. Res. Not. 2010;2010(15):2925–2946. [Google Scholar]
- 60.Nishry, A., Wennman, A.: The forbidden region for random zeros: appearance of quadrature domains. arXiv:2009.08774
- 61.Olver, F.W.J., Olde Daalhuis, A.B., Lozier, D.W., Schneider, B.I., Boisvert, R.F., Clark, C.W., Miller, B.R., Saunders, B.V.: NIST Digital Library of Mathematical Functions. http://dlmf.nist.gov/. Release 1.0.13 of 2016-09-16
- 62.Paris RB. A uniform asymptotic expansion for the incomplete gamma function. J. Comput. Appl. Math. 2002;148(2):323–339. [Google Scholar]
- 63.Peres Y, Virág B. Zeros of the i.i.d. Gaussian power series: a conformally invariant determinantal process. Acta Math. 2005;194(1):1–35. [Google Scholar]
- 64.Ramírez JA, Rider B, Zeitouni O. Hard edge tail asymptotics. Electron. Commun. Probab. 2011;16:741–752. [Google Scholar]
- 65.Rider B. Deviations from the circular law. Probab. Theory Related Fields. 2004;130(3):337–367. [Google Scholar]
- 66.Rider, B., Virag, B.: The noise in the circular law and the Gaussian free field, Int. Math. Res. Not, 2 (2007)
- 67.Saff EB, Totik V. Logarithmic Potentials with External Fields. Berlin: Springer; 1997. [Google Scholar]
- 68.Seo S-M. Edge behavior of two-dimensional Coulomb gases near a hard wall. Ann. Henri Poincaré. 2022;23(6):2247–2275. [Google Scholar]
- 69.Shirai T. Large deviations for the fermion point process associated with the exponential kernel. J. Stat. Phys. 2006;123:615–629. [Google Scholar]
- 70.Sodin M, Tsirelson B. Random complex zeroes, III, decay of the hole probability. Israel J. Math. 2005;147(1):371–379. [Google Scholar]
- 71.Temme, N.M.: Special functions: an introduction to the classical functions of mathematical physics, John Wiley & Sons (1996)
- 72.Valkó, B., Virág: Continuum limits of random matrices and the Brownian carousel, Invent. Math. 177(3), 463–508 (2009)
- 73.Valkó B, Virág B. Large gaps between random eigenvalues. Ann. Probab. 2010;38(3):1263–1279. [Google Scholar]
- 74.Webb C, Wong MD. On the moments of the characteristic polynomial of a Ginibre random matrix. Proc. Lond. Math. Soc. (3) 2019;118(5):1017–1056. [Google Scholar]
- 75.Widom H. The strong Szegő limit theorem for circular arcs. Indiana Univ. Math. J. 1971;21:277–283. [Google Scholar]
- 76.Widom H. Asymptotics for the Fredholm determinant of the sine kernel on a union of intervals. Comm. Math. Phys. 1995;171(1):159–180. [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Data Availability Statement
not applicable to this article as no datasets were generated.
