Bulk Universality of General $β$-Ensembles with Non-convex Potential
Paul Bourgade, Laszlo Erdos, Horng-Tzer Yau
Introduction and the main results
The universality conjecture asserts that the eigenvalue gap distributions in the bulk depend only on and are independent of the potential . For classical ensembles, the eigenvalue correlation functions can be explicitly expressed in terms of polynomials orthogonal to the measure . Thus the analysis of the correlation functions relies heavily on the asymptotic properties of the corresponding orthogonal polynomials. This approach, initiated by Dyson, Gaudin and Mehta (see [Meh1991] for a review) was the starting point for all results on classical universality. Precise analysis on orthogonal polynomials for general class of weight functions was made possible by the Riemann-Hilbert approach [BleIts1999, DeiKriMcLVenZho1999I, DeiKriMcLVenZho1999II]. There are also methods independent of the Riemann-Hilbert approach, see, e.g., [PasShc1997, PasShc2008, Lub2009]. The universality for was proved for very general potential. For [DeiGio2009, KriShc2011, Shc2011] it was proved for analytic with some additional conditions. A summary of recent developments can be found in [AndGuiZei2010, Dei1999, DeiGio2009, PasShc2011].
For non-classical values of , i.e., , there is no simple expression of the correlation functions in terms of orthogonal polynomials. In [BouErdYau2011], we initiated a new approach to prove bulk universality for all and strictly convex . The method was based on estimating correlation functions by local Dirichlet form and the main ingredients consist of the following two steps:
Step 1. Rigidity of eigenvalues. This establishes that the location of the eigenvalues are not too far from their classical locations determined by the equilibrium density .
Step 2. Uniqueness of local Gibbs measures with logarithmic interactions. With the precision of eigenvalue location estimates from Step 1 as an input, the eigenvalue gap distributions are shown to be given by the corresponding Gaussian ones. (We will take the uniqueness of the gap distributions as our definition of the uniqueness of Gibbs state.)
Our goal is to extend this result to the non-convex case. It was emphasized in [BouErdYau2011] that the convexity of the potential was used only in Step 1. So in order to apply this method, it suffices to prove the rigidity estimate which we now introduce.
for some , if is large enough. It is known [BouPasShc1995] that under these (in fact, even weaker) conditions the measure is normalizable, . Moreover, the averaged density of the empirical spectral measure, defined as
converges weakly to a continuous function , the equilibrium density, with compact support. We additionally assume that is supported on a single interval , and that is regular in the sense of [KuiMcL2000]. We recall that is regular if its equilibrium density is positive on and vanishes like a square rootThis is not a strong constraint: [KuiMcL2000] proves that the regular potentials are a dense and open subset of the potentials for the topology induced by the distance where . at each of the endpoints of , that is
In this paper, we are interested in the usual -point correlation functions, generalizing , and defined by
where , with .
It is known that the particles are rigid, i.e. they cannot be far from their classical locations For eigenvalues in the bulk, (1.7) follows from the large deviations for the empirical spectral measure with speed [BenGui1997, AndGuiZei2010], and for the extreme eigenvalues the large deviations principle with speed was proved in [AndGuiZei2010], Theorem 2.6.6, up to a condition on the partition function that follows from Theorem 1 (iii) in [Shc2011].: for any there are positive constants , such that, for all ,
The main technical result of this paper is to prove that rigidity holds for the measure at the optimal scale in the bulk in the following sense. This theorem extends our rigidity result in [BouErdYau2011] to non-convex potential .
Let be real analytic, regular with equilibrium density supported on a single interval , and satisfy (1.2), (1.3). Take any and . Then there are constants such that for any and ,
Our main result on the universality is the following theorem:
Let be real analytic, regular with equilibrium density supported on a single interval , and satisfy (1.2), (1.3). Then for any the bulk universality holds for the -ensemble . More precisely, for any and , for any smooth test functions with compact support and for any , we have, with , that
Here is the Wigner semicircle law and are the correlation functions of the Gaussian -ensemble, i.e. with .
Theorem 1.2 follows immediately from the rigidity estimates, (1.7), (1.8), and the uniqueness of local Gibbs measure, i.e., Theorem 2.1 and Corollary 2.2 in [BouErdYau2011]. We note that the proof of the latter results in Section 4 of [BouErdYau2011] uses only the rigidity estimate, given in Theorem 3.1 of [BouErdYau2011], as an input. Once the rigidity estimate is proven, the rest of the argument is identical and we will not repeat it here.
The rest of this paper is devoted to the proof of Theorem 1.1. After some initial estimates concerning the large deviations regime and global smooth linear statistics (Section 2), the proof consists in the following steps. First we compare to some convexified measures (Section 3); the Hamiltonian of differs from that of mainly by some properly chosen linear statistics of the ’s, allowing to be convex. Despite this change in convexity, we will prove that the two measures and have the same subexponentially small probability events. This step is the main extra ingredient allowing one to generalize the rigidity estimate obtained in [BouErdYau2011]. Then by a self-improving method, this measure (together with ) is proved to have rigidity till the optimal scale, thanks to comparisons with locally constrained versions of (Section 4).
Preliminary results
if , and otherwise. Moreover, if one assumes that is supported on a single interval and regular in the sense of the previous section, has the following properties:
In order to have the density supported strictly in a compact interval, for given , define the following variant of conditioned to have all particles in :
In this paper we will choose to be small. This choice differs from [BouErdYau2011] where, instead of , we restricted the particles to for a very large . The smaller interval is needed here because we need to be positive on the support of in the proof of Lemma 2.2. Unlike in the case of convex where is known to have no real zero at all, for the non-convex regular case we only know that is nonzero in the interval . By continuity, it is also nonzero in for some small .
Let denote the correlation functions of the measure . Then Lemma 1 in [BouPasShc1995] states that under condition (1.3), for some large enough there exists some , depending only on , such that for any , we have
and for , ,
The estimates (2.5) and (2.6) actually also hold for arbitrarily small fixed thanks to the large deviations estimates (1.7).
2 Linear statistics
The following lemma was essentially proven in [Shc2011] (for the variance of linear statistics).
For any function with , there is a constant depending only on and (one can choose ) such that, for any and ,
Proof. Without loss of generality, we can assume that is compactly supported (thanks to large deviation estimates such as (2.6)). We know from Shcherbina, equation (2.22) in [Shc2011], that for the Stieltjes transforms, i.e. , there is a constant depending only on and (one can choose ) such that, for any ,
where is obtained by replacing by in the definition of , and is for example any -independent smooth compactly supported function. We will now prove that this implies that (2.7) actually holds when replacing by any smooth compactly supported , for example by a Helffer-Sjöstrand type argument, similar to Lemma 2.3. We can now apply formula (B.13) in [ErdRamSchYau2010] for the signed measure , with Stieltjes transform , where is the one-point correlation function of . We obtain
Following now Lemma 1 in [Shc2011], consider
Then obviously , so
so using (2.7) we get that , from which Lemma 2.1 easily follows.
3 Analysis of the loop equation
This section analyzes the loop equation (2.10) in the following Lemma 2.2. Its proof is very similar to [BouErdYau2011] except that, instead of the logarithmic Sobolev inequality which was valid only for convex , we will use Lemma 2.1. Furthermore, since the support of the restricted measure has changed, the integration contours in (2.16) are chosen slightly differently from those in [BouErdYau2011].
In the form presented here, we follow closely the proof in [Shc2011]. We now introduce some notations needed in the proof.
is the Stieltjes transform of , evaluated at some with , and its limit:
, where the square root is defined such that
finally, , where
The loop equation (see [Joh1998, Eyn2003, Shc2011] for various proofs) is
In the regime where is small, we can neglect the quadratic term. The term is the same order as and is difficult to treat. As observed in [AlbPasShc2001, Shc2011], for analytic (hence analytic ), this term vanishes when we perform a contour integration. So we have roughly the relation
where we dropped the less important error involving due to the extra factor. With no convexity assumption on , the difficulty will be to estimate the above variance to immediately obtain an estimate on ; this is the reason why we will introduce a convexified version of the measure in the next Section 3. To quantify more precisely (2.11) we will use the following result, already proved in [BouErdYau2011] for convex .
as uniformly in for some . Then there are constants such that for any , ,
Proof. First, for technical contour integration reasons, it will be easier to consider the measure (2.4) instead of here. More precisely, define
Then it is a direct consequence of (2.5) and (2.6) that for any there is a constant such that uniformly on (or any power of ),
Note that the above expression makes sense for large enough , because then has no zero on . Using (2.14), this implies, for ,
Now, as and are supported on , and are uniformly in the vertical segments of . Consequently, from the above equation
As and are analytic inside , for outside we get
Remember we define uniquely by as . Moreover, as because and are compactly supported:
Consequently, the function is as . Moreover, it is analytic outside , so the Cauchy integral formula yields
Consider now the following rectangular contours, defined by their vertices:
In particular, note that all the zeros of are strictly outside . For inside and , by the Cauchy formula, equation (2.15) implies that
In the above expression, if now is on , , and on is separated away from zero by a positive universal constant. Moreover, can be bounded in the following way. For any , there is a smooth function supported on which coincides with on , Moreover, this choice can be made such that are uniformly bounded in . Then
where the last equality follows from (2.5). Now, from Lemma 2.1, this last variance is uniformly bounded by , with uniformly bounded in . This proves that is , uniformly on the contour . Moreover, , so finally is uniformly on and (2.17) implies
Moreover, from the maximum principle for analytic functions, , so the previous equation implies
We know that converges weakly to (see [AndGuiZei2010]), so by (2.5) and (2.6) converges weakly to . On , is at distance at least from the support of both and so, on , converges uniformly to . Together with the above equation, this implies that
By the maximum principle the same estimate holds outside , in particular on , so equation (2.17) implies that for inside
for some constant . We used the well-known fact that is uniformly bounded on the upper half planeThis follows for example from properties of the Cauchy operator, see p 183 in [Dei1999].. On the set and , we have . Therefore (2.18) takes the form
From the hypothesis (2.12), if and , then
The same conclusion remains when substituting (resp. ) by (resp. ) thanks to (2.5) and (2.6).
To prove rigidity results for , the above Lemma 2.2 will be combined with the following Helffer-Sjöstrand estimate, already proved in the following form in [BouErdYau2011].
Then for some constant , independent of and , we have
Convexification
The Hamiltonian of the measure is given by
is not convex, but its Hessian is bounded from below, . We will modify this Hamiltonian by an additional term
Compared with defined in (1.6), there is a small shift in the definition which makes a technical step (Lemma 3.3) easier in this section. In all estimates involving this small shift plays no role since . In particular the crude large deviation bound (1.7) holds for ’s as well:
The normalization in the definition of is chosen such that the vector
where we used a simple Schwarz inequality
such that for typical point configuration \mbox{\boldmath\lambda}=(\lambda_{1},\lambda_{2},\ldots,\lambda_{N}) we have
2 Slow modes analysis
Let be sufficiently small, depending only on . Define
Then there is a constant depending only on such that for any there is a constant (depending on and ) such that for any and
The relation between and is dictated by the requirement that
Proof. Recall that is the support of , on and has a square-root singularity at the two endpoints, i.e. it vanishes as as and as with some positive .
From the large deviations of the extreme eigenvalues (included in (1.7)), we know that for any there is a such that
Fix a positive number . Then there is a , depending only on , such that
Let with a small positive constant . Suppose that ; if is near the upper edge, the argument is similar. Since
with some positive constants , depending only on . Subtracting the first and second relations and using (3.3), we obtain that for any fixed
apart from an event of exponentially small probability (i.e. of type ).
Additionally, assume now that . Under (3.15) we easily see that , since both and are of the order which is larger than if is large enough (depending only on ). Then (3.13) and (3.15) imply
with exponentially high probability and with a constant depending only on .
Now we consider the case. Using (3.12) with and (3.14), we have (apart from an event of exponentially small probability)
Finally, still when , i.e. then (3.15) implies that with a large , i.e.
still apart from an event of exponentially small probability. Summarizing all cases, we obtain that
since either or is larger than and smaller than , say , and then is at least of order in the neighborhood of . If , then we have the trivial bound . Combining these,
holds for any . Furthermore, clearly from (3.16), so we have proved that
with overwhelming probability and for any . In other words, there is a constant (depending only on ) such that for any sufficiently small and for some we have for any and
The proof of Lemma 3.1 will therefore be complete if we can prove that
We use the matrix in the previous lemma instead of bounds of type because it is related to , a circulant matrix, allowing to derive its eigenvalues and eigenvectors in an explicit way.
In particular, for any given there is a sufficiently small such that for large enough we have . Moreover, for any given and there is some depending only on and such that for any
Proof. The first assertions, about the eigenvalues and eigenvectors, is a general fact about circulant matrices and can be obtained by Fourier transform in .
Concerning the distribution of eigenvalues, note that
We therefore have, for sufficiently small , for large enough . We now write
where was defined in (3.5) with coefficients defined in (3.11).
we just need to prove that the operator inequality
3 The locally constrained measures
In this section some arbitrary are fixed. Let be a continuous nonnegative function with on $\theta^{\prime\prime}\geq 1|x|>1\theta(x)=(x-1)^{2}\mathds{1}_{x>1}+(x+1)^{2}\mathds{1}_{x<-1}$ in the following.
the function was defined in Lemma 3.3;
;
;
, where was defined in Lemma 3.1.
4 Equivalence of the measures ν𝜈\nu and μ𝜇\mu
We say that a sequence of events is exponentially small for a sequence of probability measures if there are constants such that for any we have
Proof. First note that , so . We claim that the following inequality holds:
To prove it, by Jensen’s inequality we have
Let be now a sequence of events exponentially small for . By (3.23) we have
so is also exponentially small for .
Assume now that is exponentially small for : there are constants such that for any we have
where we used . Choosing makes the second term exponentially small, and the first one as well by using as previously Lemma 2.1, Lemma 3.1 and (3.3).
From the previously proved equivalence of the measures and , we can easily obtain rigidity of the particles at scale ,
For any , there are constants such that for any and ,
Proof. From Lemma 3.5 about the convexity of , we get by the classical Bakry-Émery criterion [BakEme1983] that satisfies a logarithmic Sobolev inequality with constant of order , so by Herbst’s lemma concentration at scale holds for individual particles for : there is a constant such that for any , and ,
By Lemma 3.6, this implies that for some constants ,
The proof will be complete if we can prove that for any and , for large enough we have
By Lemma 2.2, for , because on this domain , as concentration at scale holds for . So using Lemma 2.3 we finally get that (3.26) holds, finishing the proof.
The multiscale analysis
The purpose of this paragraph is to prove the following proposition: if rigidity holds at scale , it holds also at scale . The argument very closely follows Section 3.3 of [BouErdYau2011] and we will just explain the modifications.
Assume that for some the following property holds: for any , there are constants such that for any and ,
Then the same property holds also replacing by : for any , there are constants such that for any and , we have
Proof of Theorem 1.1. This is an immediate consequence of the initial estimate, Proposition 3.7, and iterations of Proposition 4.1.
As in Section 3.3 of [BouErdYau2011], two steps are required in the proof of the above Proposition 4.1. First we will prove that concentration holds at the smaller scale .
Assume that (4.1) holds. Then for any and , there are constants such that for any and ,
After the better concentration from this proposition, the rigidity can be improved to the scale .
Assume that (4.1) holds. Then for any and , there is a constant such that for any and ,
where is defined in (3.25).
Propositions 4.2 and 4.3 are the equivalent versions of Propositions 3.12 and 3.13 of [BouErdYau2011] with no convexity assumption on . Proposition 4.1 can be proved exactly in the same way as Proposition 3.11 [BouErdYau2011] by using Propositions 4.2 and 4.3. Notice that this argument does not use the convexity of . We now explain the proof of Propositions 4.2 and 4.3.
For the proof of Proposition 4.3, we can follow the proof of Proposition 3.13 in [BouErdYau2011] line by line. At a single place, in estimating the second term on the r.h.s. of (3.51) in [BouErdYau2011], the spectral gap inequality for (Eq. (3.12) in [BouErdYau2011]) was used, but the necessary estimate immediately follows from Proposition 3.7.