Skip to main content
Springer logoLink to Springer
. 2020 Apr 28;378(2):1203–1278. doi: 10.1007/s00220-019-03657-4

Cusp Universality for Random Matrices I: Local Law and the Complex Hermitian Case

László Erdős 1,, Torben Krüger 2, Dominik Schröder 1,3
PMCID: PMC7426322  PMID: 32831359

Abstract

For complex Wigner-type matrices, i.e. Hermitian random matrices with independent, not necessarily identically distributed entries above the diagonal, we show that at any cusp singularity of the limiting eigenvalue distribution the local eigenvalue statistics are universal and form a Pearcey process. Since the density of states typically exhibits only square root or cubic root cusp singularities, our work complements previous results on the bulk and edge universality and it thus completes the resolution of the Wigner–Dyson–Mehta universality conjecture for the last remaining universality type in the complex Hermitian class. Our analysis holds not only for exact cusps, but approximate cusps as well, where an extended Pearcey process emerges. As a main technical ingredient we prove an optimal local law at the cusp for both symmetry classes. This result is also the key input in the companion paper (Cipolloni et al. in Pure Appl Anal, 2018. arXiv:1811.04055) where the cusp universality for real symmetric Wigner-type matrices is proven. The novel cusp fluctuation mechanism is also essential for the recent results on the spectral radius of non-Hermitian random matrices (Alt et al. in Spectral radius of random matrices with independent entries, 2019. arXiv:1907.13631), and the non-Hermitian edge universality (Cipolloni et al. in Edge universality for non-Hermitian random matrices, 2019. arXiv:1908.00969).

Introduction

The celebrated Wigner–Dyson–Mehta (WDM) conjecture asserts that local eigenvalue statistics of large random matrices are universal: they only depend on the symmetry type of the matrix and are otherwise independent of the details of the distribution of the matrix ensemble. This remarkable spectral robustness was first observed by Wigner in the bulk of the spectrum. The correlation functions are determinantal and they were computed in terms the sine kernel via explicit Gaussian calculations by Dyson, Gaudin and Mehta [59]. Wigner’s vision continues to hold at the spectral edges, where the correct statistics was identified by Tracy and Widom for both symmetry types in terms of the Airy kernel [70, 71]. These universality results have been originally formulated and proven [17, 35, 36, 6769] for traditional Wigner matrices, i.e. Hermitian random matrices with independent, identically distributed (i.i.d.) entries and their diagonal [55, 57] and non-diagonal [51] deformations. More recently they have been extended to Wigner-type ensembles, where the identical distribution is not required, and even to a large class of matrices with general correlated entries [7, 8, 11]. In different directions of generalization, sparse matrices [1, 32, 47, 56], adjacency matrices of regular graphs [14] and band matrices [19, 20, 66] have also been considered. In parallel developments bulk and edge universal statistics have been proven for invariant β-ensembles [12, 15, 17, 18, 29, 30, 52, 61, 62, 64, 65, 73] and even for their discrete analogues [13, 16, 41, 48] but often with very different methods.

A precondition for the Tracy-Widom distribution in all these generalizations of Wigner’s original ensemble is that the density of states vanishes as a square root near the spectral edges. The recent classification of the singularities of the solution to the underlying Dyson equation indeed revealed that at the edges only square root singularities appear [6, 10]. The density of states may also form a cusp-like singularity in the interior of the asymptotic spectrum, i.e. single points of vanishing density with a cubic root growth behaviour on either side. Under very general conditions, no other type of singularity may occur. At the cusp a new local eigenvalue process emerges: the correlation functions are still determinantal but the Pearcey kernel replaces the sine- or the Airy kernel.

The Pearcey process was first established by Brézin and Hikami for the eigenvalues close to a cusp singularity of a deformed complex Gaussian Wigner (GUE) matrix. They considered the model of a GUE matrix plus a deterministic matrix (“external source”) having eigenvalues ±1 with equal multiplicity [21, 22]. The name Pearcey kernel and the corresponding Pearcey process have been coined by [72] in reference to related functions introduced by Pearcey in the context of electromagnetic fields [63]. Similarly to the universal sine and Airy processes, it has later been observed that also the Pearcey process universality extends beyond the realm of random matrices. Pearcey statistics have been established for non-intersecting Brownian bridges [3] and in skew plane partitions [60], always at criticality. We remark, however, that critical cusp-like singularity does not always induce a Pearcey kernel, see e.g. [31].

In random matrix theory there are still only a handful of rather specific models for which the emergence of the Pearcey process has been proven. This has been achieved for deformed GUE matrices [2, 4, 23] and for Gaussian sample covariance matrices [4244] by a contour integration method based upon the Brézin–Hikami formula. Beyond linear deformations, the Riemann-Hilbert method has been used for proving Pearcey statistics for a certain two-matrix model with a special quartic potential with appropriately tuned coefficients [40]. All these previous results concern only specific ensembles with a matrix integral representation. In particular, Wigner-type matrices are out of the scope of this approach.

The main result of the current paper is the proof of the Pearcey universality at the cusps for complex Hermitian Wigner-type matrices under very general conditions. Since the classification theorem excludes any other singularity, this is the third and last universal statistics that emerges from natural generalizations of Wigner’s ensemble.

This third universality class has received somewhat less attention than the other two, presumably because cusps are not present in the classical Wigner ensemble. We also note that the most common invariant β-ensembles do not exhibit the Pearcey statistics as their densities do not feature cubic root cusps but are instead 1/2-Hölder continuous for somewhat regular potentials [28]. The density vanishes either as 2kth or (2k+12)th power with their own local statistics (see [26] also for the persistence of these statistics under small additive GUE perturbations before the critical time). Cusp singularities, hence Pearcey statistics, however, naturally arise within any one-parameter family of Wigner-type ensembles whenever two spectral bands merge as the parameter varies. The classification theorem implies that cusp formation is the only possible way for bands to merge, so in that sense Pearcey universality is ubiquitous as well.

The bulk and edge universality is characterized by the symmetry type alone: up to a natural shift and rescaling there is only one bulk and one edge statistic. In contrast, the cusp universality has a much richer structure: it is naturally embedded in a one-parameter family of universal statistics within each symmetry class. In the complex Hermitian case these are given by the one-parameter family of (extended) Pearcey kernels, see (2.5) later. Thinking in terms of fine-tuning a single parameter in the space of Wigner-type ensembles, the density of states already exhibits a universal local shape right before and right after the cusp formation; it features a tiny gap or a tiny nonzero local minimum, respectively [5, 10]. When the local lengthscale of these almost cusp shapes is comparable with the local eigenvalue spacing δ, then the general Pearcey statistics is expected to emerge whose parameter is determined by the ratio /δ. Thus the full Pearcey universality typically appears in a double scaling limit.

Our proof follows the three step strategy that is the backbone of the recent approach to the WDM universality, see [38] for a pedagogical exposé and for detailed history of the method. The first step in this strategy is a local law that identifies, with very high probability, the empirical eigenvalue distribution on a scale slightly above the typical eigenvalue spacing. The second step is to prove universality for ensembles with a tiny Gaussian component. Finally, in the third step this Gaussian component is removed by perturbation theory. The local law is used for precise apriori bounds in the second and third steps.

The main novelty of the current paper is the proof of the local law at optimal scale near the cusp. To put the precision in proper context, we normalize the N×N real symmetric or complex Hermitian Wigner-type matrix H to have norm of order one. As customary, the local law is formulated in terms of the Green function G(z):=(H-z)-1 with spectral parameter z in the upper half plane. The local law then asserts that G(z) becomes deterministic in the large N limit as long as η:=Iz is much larger than the local eigenvalue spacing around Rz. The deterministic approximant M(z) can be computed as the unique solution of the corresponding Dyson equation (see (2.2) and (3.1) later). Near the cusp the typical eigenvalue spacing is of order N-3/4; compare this with the N-1 spacing in the bulk and N-2/3 spacing near the edges. We remark that a local law at the cusp on the non-optimal scale N-3/5 has already been proven in [8]. In the current paper we improve this result to the optimal scale N-3/4 and this is essential for our universality proof at the cusp.

The main ingredient behind this improvement is an optimal estimate of the error term D (see (3.4) later) in the approximate Dyson equation that G(z) satisfies. The difference M-G is then roughly estimated by B-1(MD), where B is the linear stability operator of the Dyson equation. Previous estimates on D (in averaged sense) were of order ρ/Nη, where ρ is the local density; roughly speaking ρ1 in the bulk, ρN-1/3 at the edge and ρN-1/4 near the cusp. While this estimate cannot be improved in general, our main observation is that, to leading order, we need only the projection of MD in the single unstable direction of B. We found that this projection carries an extra hidden cancellation due to a special local symmetry at the cusp and thus the estimate on D effectively improves to ρ2/Nη. Customary power counting is not sufficient, we need to compute this error term explicitly at least to leading order. We call this subtle mechanism cusp fluctuation averaging since it combines the well established fluctuation averaging procedure with the additional cancellation at the cusp. Similar estimates extend to the vicinity of the exact cusps. We identify a key quantity, denoted by σ(z) (in (3.5b) later), that measures the distance from the cusp in a canonical way: σ(z)=0 characterizes an exact cusp, while σ(z)1 indicates that z is near an almost cusp. Our final estimate on D is of order (ρ+σ)ρ/Nη. Since the error term D is random and we need to control it in high moment sense, we need to lift this idea to a high moment calculation, meticulously extracting the improvement from every single term. This is performed in the technically most involved Sect. 4 where we use a Feynman diagrammatic formalism to bookkeep the contributions of all terms. Originally we have developed this language in [34] to handle random matrices with slow correlation decay, based on the revival of the cumulant expansion technique in [45] after [50]. In the current paper we incorporate the cusp into this analysis. We identify a finite set of Feynman subdiagrams, called σ-cells (Definition 4.10) with value σ that embody the cancellation effect at the cusp. To exploit the full strength of the cusp fluctuation averaging mechanism, we need to trace the fate of the σ-cells along the high moment expansion. The key point is that σ-cells are local objects in the Feynman graphs thus their cancellation effects act simultaneously and the corresponding gains are multiplicative.

Formulated in the jargon of diagrammatic field theory, extracting the deterministic Dyson equation for M from the resolvent equation (H-z)G(z)=1 corresponds to a consistent self-energy renormalization of G. One way or another, such procedure is behind every proof of the optimal local law with high probability. Our σ-cells conceptually correspond to a next order resummation of certain Feynman diagrams carrying a special cancellation.

We remark that we prove the optimal local law only for Wigner-type matrices and not yet for general correlated matrices unlike in [11, 34]. In fact we use the simpler setup only for the estimate on D (Theorem 3.7) the rest of the proof is already formulated for the general case. This simpler setup allows us to present the cusp fluctuation averaging mechanism with the least amount of technicalities. The extension to the correlated case is based on the same mechanism but it requires considerably more involved diagrammatic manipulations which is better to develop in a separate work to contain the length of this paper.

Our cusp fluctuation averaging mechanism has further applications. It is used in [9] to prove an optimal cusp local law for the Hermitization of non-Hermitian random matrices with a variance profile, demonstrating that the technique is also applicable in settings where the flatness assumption is violated. The cusp of the Hermitization corresponds to the edge of the non-Hermitian model via Girko’s formula, thus the optimal cusp local law leads to an optimal bound on the spectral radius [9] and ultimately also to edge universality [25] for non-Hermitian random matrices.

Armed with the optimal local law we then perform the other two steps of the three step analysis. The third step, relying on the Green function comparison theorem, is fairly standard and previous proofs used in the bulk and at the edge need only minor adjustments. The second step, extracting universality from an ensemble with a tiny Gaussian component can be done in two ways: (i) Brézin–Hikami formula with contour integration or (ii) Dyson Brownian Motion (DBM). Both methods require the local law as an input. In the current work we follow (i) mainly because this approach directly yields the Pearcey kernel, at least for the complex Hermitian symmetry class. In the companion work [24] we perform the DBM analysis adapting methods of [37, 53, 54] to the cusp. The main novelty in the current work and in [24] is the rigidity at the cusp on the optimal scale provided below. Once this key input is given, the proof of the edge universality from [53] is modified in [24] to the cusp setting, proving universality for the real symmetric case as well. We remark, however, that, to our best knowledge, the analogue of the Pearcey kernel for the real symmetric case has not yet been explicitly identified.

We now explain some novelty in the contour integration method. We first note that a similar approach was initiated in the fundamental work of Johansson on the bulk universality for Wigner matrices with a large Gaussian component in [49]. This method was generalised later to Wigner matrices with a small Gaussian component in [35] as well as it inspired the proof of bulk universality via the moment matching idea [68] once the necessary local law became available. The double scaling regime has also been studied, where the density is very small but the Gaussian component compensates for it [27]. More recently, the same approach was extended to the cusp for deformed GUE matrices [23, Theorem 1.3] and for sample covariance matrices but only for large Gaussian component [4244]. For our cusp universality, we need to perform a similar analysis but with a small Gaussian component. We represent our matrix H as H^+tU, where U is GUE and H^ is an independent Wigner-type matrix. The contour integration analysis (Sect. 5.1) requires a Gaussian component of size at least tN-1/2.

The input of the analysis in Sect. 5.1 for the correlation kernel of H is a very precise description of the eigenvalues of H^ just above N-3/4, the scale of the typical spacing between eigenvalues—this information is provided by our optimal local law. While in the bulk and in the regime of the regular edge finding an appropriate H^ is a relatively simple matter, in the vicinity of a cusp point the issue is very delicate. The main reason is that the cusp, unlike the bulk or the regular edge, is unstable under small perturbations; in fact it typically disappears and turns into a small positive local minimum if a small GUE component is added. Conversely, a cusp emerges if a small GUE component is added to an ensemble that has a density with a small gap. In particular, even if the density function ρ(τ) of H exhibits an exact cusp, the density ρ^(τ) of H^ will have a small gap: in fact ρ is given by the evolution of the semicircular flow up to time t with initial data ρ^. Unlike in the bulk and edge cases, here one cannot match the density of H and H^ by a simple shift and rescaling. Curiously, the contour integral analysis for the local statistics of H at the cusp relies on an optimal local law of H^ with a small gap far away from the cusp.

Thus we need an additional ingredient: the precise analysis of the semicircular flow ρs:=ρ^ρsc(s) near the cusp up to a relatively long times sN-1/2+ϵ; note that ρt=ρ is the original density with the cusp. Here ρsc(s) is the semicircular density with variance s and indicates the free convolution. In Sects. 5.25.3 we will see that the edges of the support of the density ρs typically move linearly in the time s while the gap closes at a much slower rate. Already sN-3/4 is beyond the simple perturbative regime of the cusp whose natural lengthscale is N-3/4. Thus we need a very careful tuning of the parameters: the analysis of a cusp for H requires constructing a matrix H^ that is far from having a cusp but that after a relatively long time t=N-1/2+ϵ will develop a cusp exactly at the right location. In the estimates we heavily rely on various properties of the solution to the Dyson equation established in the recent paper [10]. These results go well beyond the precision of the previous work [5] and they apply to a very general class of Dyson equations, including a non-commutative von-Neumann algebraic setup.

Notations. We now introduce some custom notations we use throughout the paper. For non-negative functions f(AB), g(AB) we use the notation fAg if there exist constants C(A) such that f(A,B)C(A)g(A,B) for all AB. Similarly, we write fAg if fAg and gAf. We do not indicate the dependence of constants on basic parameters that will be called model parameters later. If the implied constants are universal, we instead write fg and fg. Similarly we write fg if fcg for some tiny absolute constant c>0.

We denote vectors by bold-faced lower case Roman letters x,yCN, and matrices by upper case Roman letters A,BCN×N with entries A=(aij)i,j=1N. The standard scalar product and Euclidean norm on CN will be denoted by x,y:=N-1i[N]xi¯yi and x, while we also write A,B:=N-1TrAB for the scalar product of matrices, and A:=N-1TrA, x:=N-1a[N]xa. We write diagR, diagr for the diagonal vector of a matrix R and the diagonal matrix obtained from a vector r, and SR for the entrywise (Hadamard) product of matrices RS. The usual operator norm induced by the vector norm · will be denoted by A, while the Hilbert-Schmidt (or Frobenius) norm will be denoted by Ahs:=A,A. For integers n we define [n]:={1,,n}.

Main Results

The Dyson equation

Let W=WCN×N be a self-adjoint random matrix and A=diag(a) be a deterministic diagonal matrix with entries a=(ai)i=1NRN. We say that W is of Wigner-type [8] if its entries wij for ij are centred, Ewij=0, independent random variables. We define the variance matrix or self-energy matrix S=(sij)i,j=1N by

sij:=Ewij2. 2.1

This matrix is symmetric with non-negative entries. In [8] it was shown that as N tends to infinity, the resolvent G(z):=(H-z)-1 of the deformed Wigner-type matrix H=A+W entrywise approaches a diagonal matrix

M(z):=diag(m(z)).

The entries m=(m1,,mN):HHN of M have positive imaginary parts and solve the Dyson equation

-1mi(z)=z-ai+j=1Nsijmj(z),zH:={zC|Iz>0},i[N]. 2.2

We call M or m the self-consistent Green’s function. The normalised trace of M is the Stieltjes transform of a unique probability measure on R that approximates the empirical eigenvalue distribution of A+W increasingly well as N, motivating the following definition.

Definition 2.1

(Self-consistent density of states). The unique probability measure ρ on R, defined through

M(z)=1NTrM(z)=ρ(dτ)τ-z,zH,

is called the self-consistent density of states (scDOS). Accordingly, its support suppρ is called self-consistent spectrum.

Cusp universality

We make the following assumptions:

Assumption (A)

(Bounded moments). The entries of the Wigner-type matrix NW have bounded moments and the expectation A is bounded, i.e. there are positive Ck such that

aiC0,EwijkCkN-k/2,kN.

Assumption (B)

(Fullness). If the matrix W=WCN×N belongs to the complex hermitian symmetry class, then we assume

E(Rwij)2E(Rwij)(Iwij)E(Rwij)(Iwij)E(Iwij)2cN12×2, 2.3

as quadratic forms, for some positive constant c>0. If W=WTRN×N belongs to the real symmetric symmetry class, then we assume Ewij2cN.

Assumption (C)

(Bounded self-consistent Green’s function). In a neighbourhood of some fixed spectral parameter τR the self-consistent Green’s function is bounded, i.e. for positive C,κ we have

mi(z)C,zτ+(-κ,κ)+iR+.

We call the constants appearing in Assumptions (A)(C)model parameters. All generic constants C in this paper may implicitly depend on these model parameters. Dependence on further parameters however will be indicated.

Remark 2.2

The boundedness of m in Assumption (C) can be ensured by assuming some regularity of the variance matrix S. For more details we refer to [5, Chapter 6].

From the extensive analysis in [10] we know that the self-consistent density ρ is described by explicit shape functions in the vicinity of local minima with small value of ρ and around small gaps in the support of ρ. The density in such almost cusp regimes is given by precisely one of the following three asymptotics:

  • (i)
    Exact cusp. There is a cusp point cR in the sense that ρ(c)=0 and ρ(c±δ)>0 for 0δ1. In this case the self-consistent density is locally around c given by
    ρ(c±x)=3γ4/32πx1/3[1+Ox1/3],x0 2.4a
    for some γ>0.
  • (ii)
    Small gap. There is a maximal interval [e-,e+] of size 0<Δ:=e+-e-1 such that ρ|[e-,e+]0. In this case the density around e± is, for some γ>0, locally given by
    ρ(e±±x)=3(2γ)4/3Δ1/32πΨedge(x/Δ)1+OΔ1/3Ψedge(x/Δ),x0 2.4b
    where the shape function around the edge is given by
    Ψedge(λ):=λ(1+λ)(1+2λ+2λ(1+λ))2/3+(1+2λ-2λ(1+λ))2/3+1,λ0. 2.4c
  • (iii)
    Non-zero local minimum. There is a local minimum at mR of ρ such that 0<ρ(m)1. In this case there exists some γ>0 such that
    ρ(m+x)=ρ(m)+ρ(m)Ψmin33γ4x2(πρ(m))31+Oρ(m)1/2+xρ(m)3,xR 2.4d
    where the shape function around the local minimum is given by
    Ψmin(λ):=1+λ2(1+λ2+λ)2/3+(1+λ2-λ)2/3-1-1,λR. 2.4e

We note that the parameter γ in (2.4a) is chosen in a way which is convenient for the universality statement. We also note that the choices for γ in (2.4b)–(2.4d) are consistent with (2.4a) in the sense that in the regimes Δx1 and ρ(m)3x1 the respective formulae asymptotically agree. Depending on the three cases (i)–(iii), we define the almost cusp point b as the cusp c in case (i), the midpoint (e-+e+)/2 in case (ii), and the minimum m in case (iii). When the local length scale of the almost cusp shape starts to match the eigenvalue spacing, i.e. if ΔN-3/4 or ρ(m)N-1/4, then we call the local shape a physical cusp. This terminology reflects the fact that the shape becomes indistinguishable from the exact cusp with ρ(c)=0 when resolved with a precision above the eigenvalue spacing. In this case we call b a physical cusp point.

The extended Pearcey kernel with a real parameter α (often denoted by τ in the literature) is given by

Kα(x,y)=1(2πi)2ΞdzΦdwexp(-w4/4+αw2/2-yw+z4/4-αz2/2+xz)w-z, 2.5

where Ξ is a contour consisting of rays from ±eiπ/4 to 0 and rays from 0 to ±e-iπ/4, and Φ is the ray from -i to i. The simple Pearcey kernel with parameter α=0 has been first observed in the context of random matrix theory by [21, 22]. We note that (2.5) is a special case of a more general extended Pearcey kernel defined in [72, Eq. (1.1)].

It is natural to express universality in terms of a rescaled k-point function pk(N) which we define implicitly by

Nk-1{i1,,ik}[N]Ef(λi1,,λik)=Rkf(x1,,xk)pk(N)(x1,,xk)dx1dxk

for test functions f, where the summation is over all subsets of k distinct integers from [N].

Theorem 2.3

Let H be a complex Hermitian Wigner matrix satisfying Assumptions (A)(C). Assume that the self-consistent density ρ within [τ-κ,τ+κ] from Assumption (C) has a physical cusp, i.e. that ρ is locally given by (2.4) for some γ>0 and ρ either (i) has a cusp point c, or (ii) a small gap [e-,e+] of size Δ:=e+-e-N-3/4, or (iii) a local minimum at m of size ρ(m)N-1/4. Then it follows that for any smooth compactly supported test function F:RkR it holds that

RkF(x)Nk/4γkpk(N)b+xγN3/4-det(Kα(xi,xj))i,j=1kdx=ON-c(k),

where

b:=cin case (i),(e++e-)/2in case (ii),min case (iii),α:=0in case (i)3γΔ/42/3N1/2in case (ii),-πρ(m)/γ2N1/2in case (iii), 2.6

x=(x1,,xk), dx=dx1dxk, and c(k)>0 is a small constant only depending on k.

Local law

We emphasise that the proof of Theorem 2.3 requires a very precise a priori control on the fluctuation of the eigenvalues even at singular points of the scDOS. This control is expressed in the form of a local law with an optimal convergence rate down to the typical eigenvalue spacing. We now define the scale on which the eigenvalues are predicted to fluctuate around the spectral parameter τ.

Definition 2.4

(Fluctuation scale). We define the self-consistent fluctuation scale ηf=ηf(τ) through

-ηfηfρ(τ+ω)dω=1N,

if τsuppρ. If τsuppρ, then ηf is defined as the fluctuation scale at a nearby edge. More precisely, let I be the largest (open) interval with τIR\suppρ and set Δ:=min{I,1}. Then we define

ηf:=Δ1/9/N2/3,Δ>1/N3/4,1/N3/4,Δ1/N3/4. 2.7

We will see later (cf. (A.8b)) that (2.7) is the fluctuation of the edge eigenvalue adjacent to a spectral gap of length Δ as predicted by the local behaviour of the scDOS. The control on the fluctuation of eigenvalues is expressed in terms of the following local law.

Theorem 2.5

(Local law). Let H be a deformed Wigner-type matrix of the real symmetric or complex Hermitian symmetry class. Fix any τR. Assuming (A)(C) for any ϵ,ζ>0 and νN the local law holds uniformly for all z=τ+iη with dist(z,suppρ)[Nζηf(τ),N100] in the form

P[u,(G(z)-M(z))vNϵρ(z)Nηuv]CNν, 2.8a

for any u,vCN and

P[B(G(z)-M(z)NϵBNdist(z,suppρ)]CNν, 2.8b

for any BCN×N. Here ρ(z):=IM(z)/π denotes the harmonic extension of the scDOS to the complex upper half plane. The constants C>0 in (2.8) only depends on ϵ,ζ,ν and the model parameters.

We remark that later we will prove the local law also in a form which is uniform in τ[-N100,N100] and η[N-1+ζ,N100], albeit with a more complicated error term, see Proposition 3.11. The local law Theorem 2.5 implies a large deviation result for the fluctuation of eigenvalues on the optimal scale uniformly for all singularity types.

Corollary 2.6

(Uniform rigidity). Let H be a deformed Wigner-type matrix of the real symmetric or complex Hermitian symmetry class satisfying Assumptions (A)(C) for τint(suppρ). Then

P[λk(τ)-τNϵηf(τ)]CNν

for any ϵ>0 and νN and some C=C(ϵ,ν), where we defined the (self-consistent) eigenvalue index k(τ):=Nρ((-,τ)), and where x=min{kZ|kx}.

In particular, the fluctuation of the eigenvalue whose expected position is closest to the cusp location does not exceed N-3/4+ϵ for any ϵ>0 with very high probability. The following corollary specialises Corollary 2.6 to the neighbourhood of a cusp.

Corollary 2.7

(Cusp rigidity). Let H be a deformed Wigner-type matrix of the real symmetric or complex Hermitian symmetry class satisfying Assumptions (A)(C) and τ=c the location of an exact cusp. Then Nρ((-,c))=kc for some kc[N], that we call the cusp eigenvalue index. For any ϵ>0, νN and k[N] with k-kccN we have

P[λk-γkNϵ(1+k-kc)1/4N3/4]CNν,

where C=C(ϵ,ν) and γk are the self-consistent eigenvalue locations, defined through Nρ((-,γk))=k.

We remark that a variant of Corollary 2.7 holds more generally for almost cusp points. It is another consequence of Corollary 2.6 that with high probability there are no eigenvalues much further than the fluctuation scale ηf away from the spectrum. We note that the following corollary generalises [11, Corollary 2.3] by also covering internal gaps of size 1.

Corollary 2.8

(No eigenvalues outside the support of the self-consistent density). Let τsuppρ. Under the assumptions of Theorem 2.5 we have

P[λSpecH[τ-c,τ+c],dist(λ,suppρ)Nϵηf(τ)]CN-ν,

for any ϵ,ν>0, where c and C are positive constants, depending on model parameters. The latter also depends on ϵ and ν.

Remark 2.9

Theorem 2.5 and its consequences, Corollaries 2.62.7 and 2.8 also hold for both symmetry classes if Assumption (B) is replaced by the condition that there exists an LN and c>0 such that mini,j(SL)ijc/N. A variance profile S satisfying this condition is called uniformly primitive (cf. [6, Eq. (2.5)] and [5, Eq. (2.11)]). Note that uniform primitivity is weaker than condition (B) on two accounts. First, it involves only the variance matrix Ewij2 unlike (2.3) in the complex Hermitian case that also involves Ewij2. Second, uniform primitivity allows certain matrix elements of W to vanish. The proof under these more general assumptions follows the same strategy but requires minor modifications within the stability analysis.1

Local Law

In order to directly appeal to recent results on the shape of solution to Matrix Dyson Equation (MDE) from [10] and the flexible diagrammatic cumulant expansion from [34], we first reformulate the Dyson equation (2.2) for N-vectors m into a matrix equation that will approximately be satisfied by the resolvent G. This viewpoint also allows us to treat diagonal and off-diagonal elements of G on the same footing. In fact, (2.2) is a special case of

1+(z-A+S[M])M=0, 3.1

for a matrix M=M(z)CN×N with positive definite imaginary part, IM=(M-M)/2i>0. The uniqueness of the solution M with IM>0 was shown in [46]. Here the linear (self-energy) operator S:CN×NCN×N is defined as S[R]:=EWRW and it preserves the cone of positive definite matrices. Definition 2.1 of the scDOS and its harmonic extension ρ(z) (cf. Theorem 2.5) directly generalises to the solution to (3.1), see [10, Definition 2.2].

In the special case of Wigner-type matrices the self-energy operator is given by

S[R]=diag(Sr)+TRt, 3.2

where r:=(rii)i=1N, S was defined in (2.1), T=(tij)i,j=1NCN×N with tij=Ewij21(ij) and denotes the entrywise Hadamard product. The solution to (3.1) is then given by M=diag(m), where m solves (2.2). Note that the action of S on diagonal matrices is independent of T, hence the Dyson equation (2.2) for Wigner-type matrices is solely determined by the matrix S, the matrix T plays no role. However, T plays a role in analyzing the error matrix D, see (3.4) below.

The proof of the local law consists of three largely separate arguments. The first part concerns the analysis of the stability operator

B:=1-MS[·]M 3.3

and shape analysis of the solution M to (3.1). The second part is proving that the resolvent G is indeed an approximate solution to (3.1) in the sense that the error matrix

D:=1+(z-A+S[G])G=WG+S[G]G 3.4

is small. In previous works [8, 11, 34] it was sufficient to establish smallness of D in an isotropic form x,Dy and averaged form BD with general bounded vectors/matrices x,y,B. In the vicinity of a cusp, however, it becomes necessary to establish an additional cancellation when D is averaged against the unstable direction of the stability operator B. We call this new effect cusp fluctuation averaging. Finally, the third part of the proof consists of a bootstrap argument starting far away from the real axis and iteratively lowering the imaginary part η=Iz of the spectral parameter while maintaining the desired bound on G-M.

Remark 3.1

We remark that the proofs of Theorem 2.5, and Corollaries 2.6 and 2.8 use the independence assumption on the entries of W only very locally. In fact, only the proof of a specific bound on D (see (3.15) later), which follows directly from the main result of the diagrammatic cumulant expansion, Theorem 3.7, uses the vector structure and the specific form of S in (3.2) at all. Therefore, assuming (3.15) as an input, our proof of Theorem 2.5 remains valid also in the correlated setting of [11, 34], as long as S is flat (see (3.6) below), and Assumption (C) is replaced by the corresponding assumption on the boundedness of M.

For brevity we will carry out the proof of Theorem 2.5 only in the vicinity of almost cusps as the local law in all other regimes was already proven in [8, 11] to optimality. Therefore, within this section we will always assume that z=τ+iη=τ0+ω+iηH lies inside a small neighbourhood

Dcusp:={zH|z-τ0c},

of the location τ0 of a local minimum of the scDOS within the self-consistent spectrum suppρ. Here c is a sufficiently small constant depending only on the model parameters. We will further assume that either (i) ρ(τ0)0 is sufficiently small and τ0 is the location of a cusp or internal minimum, or (ii) ρ(τ0)=0 and τ0 is an edge adjacent to a sufficiently small gap of length Δ>0. The results from [10] guarantee that these are the only possibilities for the shape of ρ, see (2.4). In other words, we assume that τ0suppρ is a local minimum of ρ with a shape close to a cusp (cf. (2.4)). For concreteness we will also assume that if τ0 is an edge, then it is a right edge (with a gap of length Δ>0 to the right) and ω(-c,Δ2]. The case when τ0 is a left edge has the same proof.

We now introduce a quantity that will play an important role in the cusp fluctuation averaging mechanism. We define

graphic file with name 220_2019_3657_Equ18_HTML.gif 3.5a

where RM:=(M+M)/2 is the real part of M=M(z). It was proven in [10, Lemma 5.5] that σ(z) extends to the real line as a 1/3-Hölder continuous function wherever the scDOS ρ is smaller than some threshold c1, i.e. ρc. In the specific case of S as in (3.2) the definition simplifies to

σ(z):=pf3=1Ni=1N(Imi(z))3sgnRmi(z)ρ(z)3mi(z)3,f:=Imρm,p:=sgnRm, 3.5b

since M=diag(m) is diagonal, where multiplication and division of vectors are understood entrywise. When evaluated at the location τ0 the scalar σ(τ0) provides a measure of how far the shape of the singularity at τ0 is from an exact cusp. In fact, if σ(τ0)=0 and ρ(τ0)=0, then τ0 is a cusp location. To see the relationship between the emergence of a cusp and the limit σ(τ0)0, we refer to [10, Theorem 7.7 and Lemma 6.3]. The analogues of the quantities f,p and σ in (3.5b) are denoted by fu,s and σ in [10], respectively. The significance of σ for the classification of singularity types in Wigner-type ensembles was first realised in [5]. Although in this paper we will use only [10] and will not rely on [5], we remark that the definition of σ in [5, Eq. (8.11)] differs slightly from the definition (3.5b). However, both definitions equally fulfil the purpose of classifying singularity types, since the ensuing scalar quantities σ are comparable inside the self-consistent spectrum. For the interested reader, we briefly relate our notations to the respective conventions in [10] and [5]. The quantity denoted by f in both [10] and [5] is the normalized eigendirection of the saturated self-energy operator F in the respective settings and is related to f from (3.5b) via f=f/f+Oη/ρ. Moreover, σ in [5] is defined as f3sgnRm, justifying the comparability to σ from (3.5b).

Stability and shape analysis

From (3.1) and (3.4) we obtain the quadratic stability equation

B[G-M]=-MD+MS[G-M](G-M),

for the difference G-M. In order to apply the results of [10] to the stability operator B, we first have to check that the flatness condition [10, Eq. (3.10)] is satisfied for the self-energy operator S. We claim that S is flat, i.e.

S[R]R1=1N(TrR)1, 3.6

as quadratic forms for any positive semidefinite RCN×N. We remark that in the earlier paper [8] in the Wigner-type case only the upper bound sijC/N defined the concept of flatness. Here with the definition (3.6) we follow the convention of the more recent works [10, 11, 34] which is more conceptual. We also warn the reader, that in the complex Hermitian Wigner-type case the condition c/NsijC/N implies (3.6) only if tij is bounded away from -sij.

However, the flatness (3.6) is an immediate consequence of the fullness Assumption (B). Indeed, (B) is equivalent to the condition that the covariance operator Σ of all entries above and on the diagonal, defined as Σab,cd:=Ewabwcd, is uniformly strictly positive definite. This implies that ΣcΣG for some constant c1, where ΣG is the covariance operator of a GUE or GOE matrix, depending on the symmetry class we consider. This means that S can be split into S=S0+cSG, where SG and S0 are the self-energy operators corresponding to ΣG and Σ-cΣG, respectively. It is now an easy exercise to check that SG and thus S is flat.

In particular, [10, Proposition 3.5 and Lemma 4.8] are applicable implying that [10, Assumption 4.5] is satisfied. Thus, according to [10, Lemma 5.1] for spectral parameters z in a neighbourhood of τ0 the operator B has a unique isolated eigenvalue β of smallest modulus and associated right B[Vr]=βVr and left B[Vl]=β¯Vl eigendirections normalised such that Vrhs=Vl,Vr=1. We denote the spectral projections to Vr and to its complement by P:=Vl,·Vr and Q:=1-P. For convenience of the reader we now collect some important quantitative information about the stability operator and its unstable direction from [10].

Proposition 3.2

(Properties of the MDE and its solution). The following statements hold true uniformly in z=τ0+ω+iηDcusp assuming flatness as in (3.6) and the uniform boundedness of M for zτ0+(-κ,κ)+iR+,

  • (i)
    The eigendirections Vl,Vr are norm-bounded and the operator B-1 is bounded on the complement to its unstable direction, i.e.
    B-1Qhshs+Vr+Vl1. 3.7a
  • (ii)
    The density ρ is comparable with the explicit function ρ(τ0+ω+iη)ρ~(τ0+ω+iη) given by
    ρ~:=ρ(τ0)+(ω+η)1/3,in cases (i),(iii) ifτ0=m,c,(ω+η)1/2(Δ+ω+η)-1/6,in case (ii) ifτ0=e-,ω[-c,0]η(Δ+ω+η)-1/6(ω+η)-1/2,in case (ii) ifτ0=e-,ω[0,Δ/2]. 3.7b
  • (iii)
    The eigenvalue β of smallest modulus satisfies
    βηρ+ρ(ρ+σ), 3.7c
    and we have the comparison relations
    Vl,MS[Vr]Vrρ+σ,Vl,MS[Vr]B-1Q[MS[Vr]Vr]+MSB-1Q[MS[Vr]Vr]Vr1. 3.7d
  • (iv)
    The quantities η/ρ+ρ(ρ+σ) and ρ+σ in (3.7c)–(3.7d) can be replaced by the following more explicit auxiliary quantities
    ξ~1(τ0+ω+iη):=(ω+η)1/2(ω+η+Δ)1/6,(ρ(τ0)+(ω+η)1/3)2,ξ~2(τ0+ω+iη):=(ω+η+Δ)1/3,ifτ0=e-,ρ(τ0)+(ω+η)1/3,ifτ0=m,c. 3.7e
    which are monotonically increasing in η. More precisely, it holds that η/ρ+ρ(ρ+σ)ξ~1 and, in the case where τ0=c,m is a cusp or a non-zero local minimum, we also have that ρ+σξ~2. For the case when τ0=e- is a right edge next to a gap of size Δ there exists a constant c such that ρ+σξ~2 in the regime ω[-c,cΔ] and ρ+σξ~2 in the regime ω[cΔ,Δ/2].

Proof

We first explain how to translate the notations from the present paper to the notations in [10]: The operators S,B,Q are simply denoted by SBQ in [10]; the matrices Vl,Vr here are denoted by l/l,b,b there. The bound on B-1Q in (3.7a) follows directly from [10, Eq. (5.15)]. The bounds on Vl,Vr in (3.7a) follow from the definition of the stability operator (3.3) together with the fact that M1 (by Assumption (C)) and Shs·1, following from the upper bound in flatness (3.6). The asymptotic expansion of ρ in (3.7b) follows from [10, Remark 7.3] and [5, Corollary A.1]. The claims in (iii) follow directly from [10, Proposition 6.1]. Finally, the claims in (iv) follow directly from [10, Remark 10.4].

The following lemma establishes simplified lower bounds on ξ~1,ξ~2 whenever η is much larger than the fluctuation scale ηf. We defer the proof of the technical lemma which differentiates various regimes to the Appendix.

Lemma 3.3

Under the assumptions of Proposition 3.2 we have uniformly in z=τ0+ω+iηDcusp with ηηf that

ξ~21Nη+(ρNη)1/2,ξ~1ξ~2(ρ+1Nη).

We now define an appropriate matrix norm in which we will measure the distance between G and M. The ·-norm is defined exactly as in [11] and similar to the one first introduced in [34]. It is a norm comparing matrix elements on a large but finite set of vectors with a hierarchical structure. To define this set we introduce some notations. For second order cumulants of matrix elements κ(wab,wcd):=Ewabwcd we use the short-hand notation κ(ab,cd). We also use the short-hand notation κ(xb,cd) for the x=(xa)a[N]-weighted linear combination axaκ(ab,cd) of such cumulants. We use the notation that replacing an index in a scalar quantity by a dot (·) refers to the corresponding vector, e.g. Aa· is a short-hand notation for the vector (Aab)b[N]. Matrices Rxy with vector subscripts x,y are understood as short-hand notations for x,Ry, and matrices Rxa with mixed vector and index subscripts are understood as x,Rea with ea being the ath normalized ea=1 standard basis vector. We fix two vectors x,y and some large integer K and define the sets of vectors

I0:={x,y}{δa·,(Vl)a·|a[N]},Ik+1:=Ik{Mu|uIk}{κc((Mu)a,b·),κd((Mu)a,·b)|uIk,a,b[N]}.

Here the cross and the direct part κc,κd of the 2-cumulants κ(·,·) refer to the natural splitting dictated by the Hermitian symmetry. In the specific case of (3.2) we simply have κc(ab,cd)=δadδbcsab and κd(ab,cd)=δacδbdtab. Then the ·-norm is given by

R=RK,x,y:=0k<KN-k/2KRIk+N-1/2maxuIKR·uu,RI:=maxu,vIRuvuv.

We remark that the set Ik hence also · depend on z via M=M(z). We omit this dependence from the notation as it plays no role in the estimates.

In terms of this norm we obtain the following estimate on G-M in terms of its projection Θ=Vl,G-M onto the unstable direction of the stability operator B. It is a direct consequence of a general expansion of approximate quadratic matrix equations whose linear stability operators have a single eigenvalue close to 0, as given in Lemma A.1.

Proposition 3.4

(Cubic equation for Θ). Fix KN, x,yCN and use ·=·K,x,y. For fixed zDcusp and on the event that G-M+DN-10/K the difference G-M admits the expansion

G-M=ΘVr-B-1Q[MD]+Θ2B-1Q[MS[Vr]Vr]+E,EN5/K(Θ3+ΘD+D2), 3.8a

with an error matrix E and the scalar Θ:=Vl,G-M that satisfies the approximate cubic equation

Θ3+ξ2Θ2+ξ1Θ=ϵ. 3.8b

Here, the error ϵ satisfies the upper bound

ϵN20/K(D3+R,D3/2)+Vl,MD+Vl,M(SB-1Q[MD])(B-1Q[MD]), 3.8c

where R is a deterministic matrix with R1 and the coefficients of the cubic equation satisfy the comparison relations

ξ1ηρ+ρ(ρ+σ),ξ2ρ+σ. 3.8d

Proof

We first establish some important bounds involving the ·-norm. We claim that for any matrices R,R1,R2

MS[R1]R2N1/2KR1R2,MRN1/2KR,Q1,B-1Q1,Vl,RR. 3.9

The proof of (3.9) follows verbatim as in [11, Lemma 3.4] with (3.7a) as an input. Moreover, the bound on Vl,· follows directly from the bound on Q. Obviously, we also have ·2·.

Next, we apply Lemma A.1 from the Appendix with the choices

A[R1,R2]:=MS[R1]R2,X:=MD,Y:=G-M.

The operator B in Lemma A.1 is chosen as the stability operator (3.3). Then (A.1) is satisfied with λ:=N1/2K according to (3.9) and (3.7a). With δ:=N-25/4K we verify (3.8a) directly from (A.5), where Θ=Vl,G-M satisfies

μ3Θ3+μ2Θ2-βΘ=-μ0+R,DΘ+ON-1/4KΘ3+N20/KD3. 3.10

Here we used ΘG-MN-10/K and MDN1/2KD. The coefficients μ0,μ2,μ3 are defined through (A.4) and R is given by

R:=M(B-1Q)[S[MVlVr]+S[Vr]MVl].

Now we bound R,DΘN-1/4KΘ3+N1/8KR,D3/2 by Young’s inequality, absorb the error terms bounded by Inline graphic into the cubic term, μ3Θ3+O(N-1/4KΘ3)=μ~3Θ3, by introducing a modified coefficient μ~3 and use that μ3μ~31 for any zDcusp. Finally, we safely divide (3.10) by μ~3 to verify (3.8b) with ξ1:=-β/μ~3 and ξ2:=μ2/μ~3. For the fact μ31 on Dcusp and the comparison relations (3.8d) we refer to (3.7c)–(3.7d).

Probabilistic bound

We now collect bounds on the error matrix D from [34, Theorem 4.1] and Sect. 4. We first introduce the notion of stochastic domination.

Definition 3.5

(Stochastic domination). Let X=X(N),Y=Y(N) be sequences of non-negative random variables. We say that X is stochastically dominated by Y (and use the notation XY) if

P[X>NϵY]C(ϵ,ν)N-ν,NN,

for any ϵ>0,νN and some family of positive constants C(ϵ,ν) that is uniform in N and other underlying parameters (e.g. the spectral parameter z in the domain under consideration).

It can be checked (see [33, Lemma 4.4]) that satisfies the usual arithmetic properties, e.g. if X1Y1 and X2Y2, then also X1+X2Y1+Y2 and X1X2Y1Y2. Furthermore, to formulate bounds on a random matrix R compactly, we introduce the notations

graphic file with name 220_2019_3657_Equ291_HTML.gif

for random matrices R and a deterministic control parameter Λ=Λ(z). We also introduce high moment norms

Xp:=(EXp)1/p,Rp:=supx,yx,Rypxy

for p1, scalar valued random variables X and random matrices R. To translate high moment bounds into high probability bounds and vice versa we have the following easy lemma [11, Lemma 3.7].

Lemma 3.6

Let R be a random matrix, Φ a deterministic control parameter such that ΦN-C and RNC for some C>0, and let KN be a fixed integer. Then we have the equivalences

RK,x,yΦuniformly inx,yRΦRpp,ϵNϵΦfor allϵ>0,p1.

Expressed in terms of the ·p-norm we have the following high-moment bounds on the error matrix D. The bounds (3.11a)–(3.11b) have already been established in [34, Theorem 4.1]; we just list them for completeness. The bounds (3.11c)–(3.11d), however, are new and they capture the additional cancellation at the cusp and are the core novelty of the present paper. The additional smallness comes from averaging against specific weights p,f from (3.5b).

Theorem 3.7

(High moment bound on D with cusp fluctuation averaging). Under the assumptions of Theorem 2.5 for any compact set D{zC|IzN-1} there exists a constant C such that for any p1,ϵ>0, zD and matrices/vectors B,x,y it holds that

x,Dypϵ,pxyNϵψq(1+Gq)C(1+GqN)Cp, 3.11a
BDpϵ,pBNϵ[ψq]2(1+Gq)C(1+GqN)Cp. 3.11b

Moreover, for the specific weight matrix B=diag(pf) we have the improved bound

diag(pf)Dpϵ,pNϵσq[ψ+ψq]2(1+Gq)C(1+GqN)Cp, 3.11c

and the improved bound on the off-diagonal component

diag(pf)[TGt]Gpϵ,pNϵσq[ψ+ψq]2(1+Gq)C(1+GqN)Cp, 3.11d

where we defined the following z-dependent quantities

ψ:=ρNη,ψq:=IGqNη,ψq:=G-Mq,σq:=σ+ρ+ψ+η/ρ+ψq+ψq

and q=Cp3/ϵ.

Theorem 3.7 will be proved in Sect. 4. We now translate the high moment bounds of Theorem 3.7 into high probability bounds via Lemma 3.6 and use those to establish bounds on G-M and the error in the cubic equation for Θ. To simplify the expressions we formulate the bounds in the domain

Dζ:={zDcusp|IzN-1+ζ}. 3.12

Lemma 3.8

(High probability error bounds). Fix ζ,c>0 sufficiently small and suppose that G-MΛ, I(G-M)Ξ and Θθ hold at fixed zDζ, and assume that the deterministic control parameters Λ,Ξ,θ satisfy Λ+Ξ+θN-c. Then for any sufficiently small ϵ>0 it holds that

Θ3+ξ2Θ2+ξ1ΘN2ϵ(ρ+σ+η1/2ρ1/2+(ρ+ΞNη)1/2)ρ+ΞNη+N-ϵθ3, 3.13a

as well as

G-Mθ+ρ+ΞNη,G-Mavθ+ρ+ΞNη, 3.13b

where the coefficients ξ1,ξ2 are those from Proposition 3.4, and we recall that Θ=Vl,G-M.

Proof

We translate the high moment bounds (3.11a)–(3.11b) into high probability bounds using Lemma 3.6 and GM+Λ1 to find

Dρ+ΞNη,Davρ+ΞNη. 3.14

In particular, these bounds together with the assumed bounds on G-M guarantee the applicability of Proposition 3.4. Now we use (3.14) and (3.9) in (3.8a) to get (3.13b). Here we used (3.9), translated ·p-bounds into -bounds on · and vice versa via Lemma 3.6, and absorbed the N1/K factors into by using that K can be chosen arbitrarily large. It remains to verify (3.13a). In order to do so, we first claim that

Vl,MD+Vl,M(SB-1Q[MD])(B-1Q[MD])Nϵ(σ+ρ+η1/2ρ1/2+Λ+(ρ+ΞNη)1/2)ρ+ΞNη+θ2(N-ϵΛ+(ρ+ΞNη)1/2) 3.15

for any sufficiently small ϵ>0.

Proof of (3.15)

We first collect two additional ingredients from [10] specific to the vector case.

  1. The imaginary part Im of the solution m is comparable ImIm=πρ to its average in the sense cImImiCIm for all i and some c,C>0, and, in particular, m=Rm+Oρ.

  2. The eigendirections Vl,Vr are diagonal and are approximately given by
    Vl=cdiag(f/m)+Oρ+η/ρ,Vr=cdiag(fm)+Oρ+η/ρ 3.16
    for some constants c,c1.

Indeed, (a) follows directly from [10, Proposition 3.5] and the approximations in (3.16) follow directly from [10, Corollary 5.2]. The fact that Vl,Vr are diagonal follows from simplicity of the eigendirections in the matrix case, and the fact that M=diag(m) is diagonal and that B preserves the space of diagonal matrices as well as the space of off-diagonal matrices. On the latter B acts stably as 1+Ohshs(N-1). Thus the unstable directions lie inside the space of diagonal matrices.

We now turn to the proof of (3.15) and first note that, according to (a) and (b) we have

M=diag(pm)+Oρ,Vl=cdiag(f/m)+Oρ+η/ρ 3.17

with errors in ·-norm-sense, for some constant c1 to see

Vl,MD=cdiag(pf)D+Oρ+η/ρdiag(w1)D,

where w1CN is a deterministic vector with uniformly bounded entries. Since diag(w1)D(ρ+Ξ)/Nη by (3.14), the bound on the first term in (3.15) follows together with (3.11c) via Lemma 3.6. Now we consider the second term in (3.15). We split D=Dd+Do into its diagonal and off-diagonal components. Since B and S preserve the space of diagonal and the space of off-diagonal matrices we find

Vl,M(SB-1Q[MD])(B-1Q[MD])=1N2i,juijdiidjj+Vl,M(SB-1Q[MDo])(B-1Q[MDo]), 3.18

with an appropriate deterministic matrix uij having bounded entries. In particular, the cross terms vanish and the first term is bounded by

graphic file with name 220_2019_3657_Equ44_HTML.gif 3.19

according to (3.14). By taking the off-diagonal part of (3.8a) and using the fact that M and Vr and therefore also B-1Q[MS[Vr]Vr] are diagonal (cf. (b) above) we have

B-1Q[MDo]+Goθ3+θ(ρ+ΞNη)1/2+ρ+ΞNηN-ϵθ2+Nϵρ+ΞNη

for any ϵ such that θN-ϵ by Young’s inequality in the last step. Together with (3.17), (3.14) and the assumption that Go=(G-M)oΛ we then compute

Vl,M(SB-1Q[MDo])(B-1Q[MDo])=cdiag(pf)(SB-1Q[MDo])(B-1Q[MDo])+O(ρ+ηρ)ρ+ΞNη=cdiag(pf)S[Go]Go+O(ρ+ηρ)ρ+ΞNη+((ρ+ΞNη)1/2+Λ)[N-ϵθ2+Nϵρ+ΞNη].

Thus the bound on the second term on the lhs. in (3.15) follows together with (3.18)–(3.19) by S[Go]=TGt and (3.11d) via Lemma 3.6. This completes the proof of (3.15).

With (3.14) and (3.15) the upper bound (3.8c) on the error ϵ of the cubic equation (3.8b) takes the same form as the rhs. of (3.15) if K is sufficiently large depending on ϵ. By the first estimate in (3.13b) we can redefine the control parameter Λ on G-M as Λ:=θ+((ρ+Ξ)/Nη)1/2 and the claim (3.13a) follows directly with (3.15), thus completing the proof of Lemma 3.8.

Bootstrapping

Now we will show that the difference G-M converges to zero uniformly for all spectral parameters zDζ as defined in (3.12). For convenience we refer to existing bounds on G-M far away from the real line to establish a rough bound on G-M in, say, D1. We then iteratively lower the threshold on η by appealing to Proposition 3.4 and Lemma 3.8 until we establish the rough bound in all of Dζ. As a second step we then improve the rough bound iteratively until we obtain Theorem 2.5.

Lemma 3.9

(Rough bound). For any ζ>0 there exists a constant c>0 such that on the domain Dζ we have the rough bound

G-MN-c. 3.20

Proof

The rough bound (3.20) in a neighbourhood of a cusp has first been established for Wigner-type random matrices in [8]. For the convenience of the reader we present a streamlined proof that is adapted to the current setting. The lemma is an immediate consequence of the following statement. Let ζs>0 be a sufficiently small step size, depending on ζ. Then for any N0k1/ζs on the domain Dmax{1-kζs,ζ} we have

G-MN-4-kζ. 3.21

We prove (3.21) by induction over k. For sufficiently small ζ the induction start k=0 holds due to the local law away from the self-consistent spectrum, e.g. [34, Theorem 2.1].

Now as induction hypothesis suppose that (3.21) holds on D~k:=Dmax{1-kζs,ζ}, and in particular, G1, Gpϵ,pNϵ for any ϵ,p according to Lemma 3.6. The monotonicity of the function ηηG(τ+iη)p (see e.g. [34, proof of Prop. 5.5]) implies Gpϵ,pNϵ+ζsN2ζs and therefore, according to Lemma 3.6, that GN2ζs on D~k+1. This, in turn, implies DN-ζ/3 on D~k+1 by (3.11a) and Lemma 3.6, provided ζs is chosen small enough. We now fix x,y and a large integer K as the parameters of ·=·x,y,K for the rest of the proof and omit them from the notation but we stress that all estimates will be uniform in x,y. We find supzD~k+1D(z)N-ζ/3, by using a simple union bound and zDNC for some C>0. Thus, for K large enough, we can use (3.8a), (3.8b), (3.8c) and (3.9) to infer

Θ3+ξ2Θ2+ξ1ΘN1/2KDN1/2K-ζ/3,G-MΘ+N1/KDΘ+N1/K-ζ/3, 3.22

on the event G-M+DN-10/K, and on D~k+1. Now we use the following lemma [10, Lemma 10.3] to translate the first estimate in (3.22) into a bound on Θ. For the rest of the proof we keep τ=Rz fixed and consider the coefficients ξ1,ξ2 and Θ as functions of η.

Lemma 3.10

(Bootstrapping cubic inequality). For 0<η<η< let ξ1,ξ2:[η,η]C be complex valued functions and ξ~1,ξ~2,d:[η,η]R+ be continuous functions such that at least one of the following holds true:

  • (i)

    ξ1ξ~1, ξ2ξ~2, and ξ~23/d,ξ~13/d2,ξ~12/dξ~2 are monotonically increasing, and d2/ξ~13+dξ~2/ξ~121 at η,

  • (ii)

    ξ1ξ~1, ξ2ξ~11/2, and ξ~13/d2 is monotonically increasing.

Then any continuous function Θ:[η,η]C that satisfies the cubic inequality Inline graphic on [η,η], has the property

IfΘmin{d1/3,d1/2ξ~21/2,dξ~1}atη,thenΘmin{d1/3,d1/2ξ~21/2,dξ~1}on[η,η]. 3.23

With direct arithmetics we can now verify that the coefficients ξ1,ξ2 in (3.8b) and the auxiliary coefficients ξ~1,ξ~2 defined in (3.7e) satisfy the assumptions in Lemma 3.10 with the choice of the constant function d=N-4-kζ+δ for any δ>0, by using only the information on ξ1,ξ2 given by the comparison relations (3.8d). As an example, in the regime where τ0 is a right edge and ωΔ, we have ξ~1(η+Δ)2/3 and ξ~2(η+Δ)1/3 and both functions are monotonically increasing in η. Then Assumption (ii) of Lemma 3.10 is satisfied. All other regimes are handled similarly.

We now set η:=N-kζs and

η:=infη[N-(k+1)ζs,η]|supηηG(τ+iη)-M(τ+iη)N-10/K/2.

By the induction hypothesis we have Θ(η)dmin{d1/3,d1/2ξ~2-1/2,dξ~1-1} with overwhelming probability, so that the condition in (3.23) holds, and conclude Θ(η)d1/3=N-(4-kζ-δ)/3 for η[η,η]. For small enough δ>0 the second bound in (3.22) implies G-MN-4k+1ζ. By continuity and the definition of η we conclude η=N-(k+1)ζs, finishing the proof of (3.21).

Proof of Theorem 2.5

The bounds within the proof hold true uniformly for zDζ, unless explicitly specified otherwise. We therefore suppress this qualifier in the following statements. First we apply Lemma 3.8 with the choice Ξ=Λ, i.e. we do not treat the imaginary part of the resolvent separately. With this choice the first inequality in (3.13b) becomes self-improving and after iteration shows that

G-Mθ+ρNη+1Nη, 3.24

and, in other words, (3.13a) holds with Ξ=θ+(ρ/Nη)1/2+1/Nη. This implies that if ΘθN-c for some arbitrarily small c>0, then

Θ3+ξ2Θ2+ξ1ΘN5ϵ~d+N-ϵ~(θ3+ξ~2θ2) 3.25

holds for all sufficiently small ϵ~ with overwhelming probability, where we defined

d:=ξ~2(ρ~Nη+1(Nη)2)+1(Nη)3+(ρ~Nη)3/2. 3.26

For this conclusion we used the comparison relations (3.8d), Proposition 3.2(iv) as well as (3.7b), and the bound η/ρη/ρ~ξ~2.

The bound (3.25) is a self-improving estimate on Θ in the following sense. For kN and lN{} let

dk:=max{N-kϵ~,N6ϵ~d},θl:=min{dl1/3,dl1/2ξ~21/2,dlξ~1}.

Then (3.25) with Θθk implies that Θ3+ξ2Θ2+ξ1ΘN-ϵ~dk. Applying Lemma 3.10 with d=N-ϵ~dk, η1, η=Nζ-1 yields the improvement Θθk+1. Here we needed to check the condition in (3.23) but at η1 we have ξ~11, so ΘN-ϵ~dkdk+1θk+1. After a k-step iteration until N-kϵ~ becomes smaller than N6ϵ~d, we find Θθ, where we used that ϵ~ can be chosen arbitrarily small. We are now ready to prove the following bound which we, for convenience, record as a proposition.

Proposition 3.11

For any ζ>0 we have the bounds

G-Mθ+ρNη+1Nη,G-Mavθ+ρNη+1(Nη)2inDζ, 3.27

where θ:=min{d1/3,d1/2/ξ~21/2,d/ξ~1}, and d,ρ~,ξ~1,ξ~2 are given in (3.26), (3.7b) and (3.7e), respectively.

Proof

Using Θθ proven above, we apply (3.24) with θ=θ to conclude the first inequality in (3.27). For the second inequality in (3.27) we use the estimate on G-Mav from (3.13b) with θ=θ and Ξ=(ρ/Nη)1/2+1/Nη.

The bound on G-M from (3.27) implies a complete delocalisation of eigenvectors uniformly at singularities of the scDOS. The following corollary was established already in [8, Corollary 1.14] and, given (3.27), the proof follows the same line of reasoning.

Corollary 3.12

(Eigenvector delocalisation). Let uCN be an eigenvector of H corresponding to an eigenvalue λτ0+(-c,c) for some sufficiently small positive constant c1. Then for any deterministic xCN we have

u,x1Nux.

The bounds (3.27) simplify in the regime ηNζηf above the typical eigenvalue spacing to

G-MρNη+1Nη,G-Mav1Nη,forηNζηf 3.28

using Lemma 3.3 which implies θd/ξ~11/Nη. The bound on G-Mav is further improved in the case when τ0=e- is an edge and, in addition to ηNζηf, we assume NδηωΔ/2 for some δ>0, i.e. if ω is well inside a gap of size ΔNδ+ζηf. Then we find Δ>N-3/4 by the definition of ηf=Δ1/9/N2/3 in (2.7) and use Lemma 3.3 and (3.7b), (3.7e) to conclude

θ+ρ~Nη+1(Nη)2ξ~2ξ~1(ρ~Nη+1(Nη)2)Δ1/6ω1/2(ηΔ1/6ω1/2+1Nη)1NηN-δ/2Nη. 3.29

In the last bound we used 1/NωN-δ/Nη and Δ1/6/(Nηω1/2)N-δ/2. Using (3.29) in (3.27) yields the improvement

G-MavN-δ/2Nη,forτ=e-+ω,Δ/2ωNδηNζ+δηf. 3.30

The bounds on G-Mav from (3.28) and (3.30), inside and outside the self-consistent spectrum, allow us to show the uniform rigidity, Corollary 2.6. We postpone these arguments until after we finish the proof of Theorem 2.5. The uniform rigidity implies that for dist(z,suppρ)Nζηf we can estimate the imaginary part of the resolvent via

Ix,Gx=ληuλ,x2η2+(τ0+ω-λ)2η+1Nλ-τ0cηη2+(τ0+ω-λ)2ρ(z), 3.31

for any normalised xCN, where uλ denotes the normalised eigenvector corresponding to λ. For the first inequality in (3.31) we used Corollary 3.12 and for the second we applied Corollary 2.6 that allows us to replace the Riemann sum with an integral as [η2+(τ0+ω-λ)2]1/2=z-λNζηf.

Using with (3.31), we apply Lemma 3.8, repeating the strategy from the beginning of the proof. But this time we can choose the control parameter Ξ=ρ. In this way we find

G-Mθ#+ρNη,G-Mavθ#+ρNη,fordist(z,suppρ)Nζηf, 3.32

where we defined

θ#:=min{d#ξ~1,d#1/2ξ~21/2,d#1/3},d#:=ξ~2ρ~Nη+(ρ~Nη)3/2.

Note that the estimates in (3.32) are simpler than those in (3.27). The reason is that the additional terms 1/Nη, 1/(Nη)2 and 1/(Nη)3 in (3.27) are a consequence of the presence of Ξ in (3.13a), (3.13b). With Ξ=ρ these are immediately absorbed into ρ and not present any more. The second term in the definition of d# can be dropped since we still have ξ~2(ρ/Nη)1/2 (this follows from Lemma 3.3 if ηNζηf, and directly from (3.7b), (3.7e) if ωNζηf). This implies θ#d#1/2/ξ~21/2(ρ/Nη)1/2, so the first bound in (3.32) proves (2.8a).

Now we turn to the proof of (2.8b). Given the second bound in (3.28), it is sufficient to consider the case when τ=e-+ω and ηωΔ/2 with ωNζηf. In this case Proposition 3.2 yields ξ~2ρ~/ξ~1+ρ~η/ωη/dist(z,suppρ). Thus we have

θ#+ρNηd#ξ~1+ρ~Nη1Ndist(z,suppρ)

and therefore the second bound in (3.32) implies (2.8b). This completes the proof of Theorem 2.5.

Rigidity and absence of eigenvalues

The proofs of Corollaries 2.6 and 2.8 rely on the bounds on G-Mav from (3.28) and (3.30). As before, we may restrict ourselves to the neighbourhood of a local minimum τ0suppρ of the scDOS which is either an internal minimum with a small value of ρ(τ0)>0, a cusp location or a right edge adjacent to a small gap of length Δ>0. All other cases, namely the bulk regime and regular edges adjacent to large gaps, have been treated prior to this work [8, 11].

Proof of Corollary 2.8

Let us denote the empirical eigenvalue distribution of H by ρH=1Ni=1Nδλi and consider the case when τ0=e- is a right edge, ΔNδηf for any δ>0 and ηf=ηf(e-)Δ1/9N-2/3. Then we show that there are no eigenvalues in e-+[Nδηf,Δ/2] with overwhelming probability. We apply [8, Lemma 5.1] with the choices

ν1:=ρ,ν2:=ρH,η1:=η2:=ϵ:=Nζηf,τ1:=e-+ω,τ2:=e-+ω+Nζηf,

for any ω[Nδηf,Δ/2] and some ζ(0,δ/4). We use (3.30) to estimate the error terms J1,J2 and J3 from [8, Eq. (5.2)] by N2ζ-δ/2-1 and see that (ρH-ρ)([τ1,τ2])=ρH([τ1,τ2])N2ζ-δ/2-1, showing that with overwhelming probability the interval [τ1,τ2] does not contain any eigenvalues. A simple union bound finishes the proof of Corollary 2.8.

Proof of Corollary 2.6

Now we establish Corollary 2.6 around a local minimum τ0suppρ of the scDOS. Its proof has two ingredients. First we follow the strategy of the proof of [8, Corollary 1.10] to see that

(ρ-ρH)((-,τ0+ω])1N, 3.33

for any ωc, i.e. we have a very precise control on ρH. In contrast to the statement in that corollary we have a local law (3.28) with uniform 1/Nη error and thus the bound (3.33) does not deteriorate close to τ0. We warn the reader that the standard argument inside the proof of [8, Corollary 1.10] has to be adjusted slightly to arrive at (3.33). In fact, when inside that proof the auxiliary result [8, Lemma 5.1] is used with the choice τ1=-10, τ2=τ, η1=η2=Nζ-1 for some ζ>0, this choice should be changed to τ1=-C, τ2=τ, η1=Nζ-1 and η2=Nζηf(τ), where C>0 is chosen sufficiently large such that τ1 lies far to the left of the self-consistent spectrum.

The control (3.33) suffices to prove Corollary 2.6 for all τ=τ0+ω except for the case when τ0=e- is an edge at a gap of length ΔNζηf and ω[-Nζηf,0] for some fixed ζ>0 and ηf=ηf(e-)Δ1/9/N2/3, i.e. except for some Nζ eigenvalues close to the edge with arbitrarily small ζ>0. In all other cases, the proof follows the same argument as the proof of [8, Corollary 1.11] using the uniform 1/N-bound from (3.33) and we omit the details here.

The reason for having to treat the eigenvalues very close to the edge e- separately is that (3.33) does not give information on which side of the gap these Nζ eigenvalues are found. To get this information requires the second ingredient, the band rigidity,

P[ρ((-,e-+ω])=ρH((-,e-+ω])]1-N-ν, 3.34

for any νN, ΔωNζηf and large enough N. The combination of (3.34) and (3.33) finishes the proof of Corollary 2.6.

Band rigidity has been shown in case Δ is bounded from below in [11] as part of the proof of Corollary 2.5. We will now adapt this proof to the case of small gap sizes ΔNζ-3/4. Since by Corollary 2.8 with overwhelming probability there are no eigenvalues in e-+[Nζηf,Δ/2], it suffices to show (3.34) for ω=Δ/2. As in the proof of [11, Corollary 2.5] we consider the interpolation

Ht:=1-tW+A-tSM(τ),t[0,1],

between the original random matrix H=H0 and the deterministic matrix H1=A-SM(τ), for τ=e-+Δ/2. The interpolation is designed such that the solution Mt of the MDE corresponding to Ht is constant at spectral parameter τ, i.e. Mt(τ)=M(τ). Let ρt denote the scDOS of Ht. Exactly as in the proof from [11] it suffices to show that no eigenvalue crosses the gap along the interpolation with overwhelming probability, i.e. that for any νN we have

P[atSpec(Ht)for somet[0,1]]C(ν)Nν. 3.35

Here tatR\suppρt is some spectral parameter inside the gap, continuously depending on t, such that a0=τ. In [11] at was chosen independent of t, but the argument remains valid with any other choice of at. We call It the connected component of R\suppρt that contains at and denote Δt=It the gap length. In particular, Δ0=Δ and τIt for all t[0,1] by [10, Lemma 8.1(ii)]. For concreteness we choose at to be the spectral parameter lying exactly in the middle of It. The 1/3-Hölder continuity of ρt, hence It and at in t follows from [10, Proposition 10.1(a)]. Via a simple union bound it suffices to show that for any fixed t[0,1] we have no eigenvalue in at+[-N-100,N-100].

Since W1 with overwhelming probability, in the regime t1-ϵ for some small constant ϵ>0, the matrix Ht is a small perturbation of the deterministic matrix H1 whose resolvent (H1-τ)-1=M(τ) at spectral parameter τ is bounded by Assumption (C), in particular Δ11. By 1/3-Hölder continuity hence Δt1, and Spec(Ht)Spec(H1)+[-Cϵ1/3,Cϵ1/3] for some C1 in this regime with very high probability. Since Spec(H1)suppρt+[-Cϵ1/3,Cϵ1/3] by [10, Proposition 10.1(a)] there are no eigenvalues of Ht in a neighbourhood of at, proving (3.35) for t1-ϵ.

For t[ϵ,1-ϵ] we will now show that Δtϵ1 for any ϵ>0. In fact, we have dist(τ,suppρt)ϵ1. This is a consequence of [10, Lemma D.1]. More precisely, we use the equivalence of (iii) and (v) of that lemma. We check (iii) and conclude the uniform distance to the self-consistent spectrum by (v). Since Mt(τ)=M(τ) and M(τ)1 we only need to check that the stability operator Bt=t+(1-t)B of Ht has a bounded inverse. We write Bt=C(1-(1-t)C~F)C-1 in terms of the saturated self-energy operator F=CSC, where C[R]:=M(τ)1/2RM(τ)1/2 and C~[R]:=(sgnM(τ))R(sgnM(τ)). Afterwards we use that Fhshs1 (cf. [7, Eq. (4.24)]) and C~hshs=1 to first show the uniform bound Bthshs1/t and then improve the bound to Bt1/t using the trick of expanding in a geometric series from [7, Eqs. (4.60)–(4.63)]. This completes the argument that Δtϵ1. Now we apply [34, Corollary 2.3] to see that there are no eigenvalues of Ht around at as long as t is bounded away from zero and one, proving (3.35) for this regime.

Finally, we are left with the regime t[0,ϵ] for some sufficiently small ϵ>0. By [10, Proposition 10.1(a)] the self-consistent Green’s function Mt corresponding to Ht is bounded even in a neighbourhood of τ, whose size only depends on model parameters. In particular, Assumptions (A)(C) are satisfied for Ht and Corollary 2.8, which was already proved above, is applicable. Thus it suffices to show that the size Δt of the gap in suppρt containing τ is bounded from below by ΔtNζ-3/4 for some ζ>0. The size of the gap can be read off from the following relationship between the norm of the saturated self-energy operator and the size of the gap: Let H be a random matrix satisfying (A)(C) and τ be well inside the interior of the gap of length Δ[0,c] in the self-consistent spectrum for a sufficiently small c1. Then

1-F(τ)hshslimη0ηρ(τ+iη)(Δ+dist(τ,suppρ))1/6dist(τ,suppρ)1/2Δ2/3, 3.36

where in the first step we used [7, Eqs. (4.23)–(4.25)], in the second step (3.7b), and in the last step that dist(τ,suppρ)Δ. Applying the analogue of (3.36) for Ht with Ft(τ) and using that dist(τ,ρt)Δt, we obtain 1-Ft(τ)hshsΔt2/3. Combining this inequality with (3.36) and using that Ft(τ)=(1-t)F(τ) for t[0,c], we have Δt3/2t+(1-t)Δ2/3, i.e. Δtt3/2+Δ. In particular, the gap size Δt never drops below cΔNζ-3/4. This completes the proof of the last regime in (3.35).

Cusp Fluctuation Averaging and Proof of Theorem 3.7

We will use the graphical multivariate cumulant expansion from [34] which automatically exploits the self-energy renormalization of D to highest order. Since the final formal statement requires some custom notations, we first give a simple motivating example to illustrate the type of expansion and its graphical representation. If W is Gaussian, then integration by parts shows that

ED2=α,βκ(α,β)EΔαGΔβG+α1,β1κ(α1,β1)α2,β2κ(α2,β2)EΔα1GΔβ2GΔα2GΔβ1G, 4.1

where we recall that κ(α,β):=κ(wα,wβ) is the second cumulant of the matrix entries wα,wβ index by double indices α=(a,b), β=(a,b), and Δ(a,b) denotes the matrix of all zeros except for an 1 in the (ab)th entry. Since for non-Gaussian W or higher powers of D the expansion analogous to (4.1) consists of much more complicated polynomials in resolvent entries, we represent them concisely as the values of certain graphs. As an example, the rhs. of (4.1) is represented simply by

graphic file with name 220_2019_3657_Equ63_HTML.gif 4.2

The graphs retain only the relevant information of the complicated expansion terms and chains of estimates can be transcribed into simple graph surgeries. Graphs also help identify critical terms that have to be estimated more precisely in order to obtain the improved high moment bound on D. For example, the key cancellation mechanism behind the cusp fluctuation averaging is encoded in a small distinguished part of the expansion that can conveniently be identified as certain subgraphs, called the σ-cells, see Definition 4.10 later. It is easy to count, estimate and manipulate σ-cells as part of a large graph, while following the same operations on the level of formulas would be almost intractable.

First we review some of the basic nomenclature from [34]. We consider random matrices H=A+W with diagonal expectation A and complex Hermitian or real symmetric zero mean random component W indexed by some abstract set J of size J=N. We recall that Greek letters α,β, stand for labels, i.e. double-indices from I=J×J, whereas Roman letters a,b, stand for single indices. If α=(a,b), then we set αt:=(b,a) for its transpose. Underlined Greek letters stand for multisets of labels, whereas bold-faced Greek letters stand for tuples of labels with the counting combinatorics being their—for our purposes—only relevant difference.

According to [34, Proposition 4.4] with N(α)={α,αt} it follows from the assumed independence that for general (conjugate) linear functionals Λ(k), of bounded norm Λ(k)=O1

Ek[p]Λ(k)(D)=El[p](1+αl,βl(l))k[p]Λαk,β_k(k)ifαkΛβ_<kk,β_>kk(k)else+ON-p, 4.3a

where we recall that

graphic file with name 220_2019_3657_Equ65_HTML.gif 4.3b

and that

Λα1,,αk:=-(-1)kΛ(Δα1GΔαkG),Λ{α1,,αm}:=σSmΛασ(1),,ασ(m),Λα,{α1,,αm}:=σSmΛα,ασ(1),,ασ(m),Λα_,β_:=αα_Λα,α_β_\{α},β_<kk:=j<kβ_jk,β_>kk:=j>kβ_jk. 4.3c

Some notations in (4.3) require further explanation. The qualifier “if αk” is satisfied for those terms in which αk is a summation variable when the brackets in the product j(1+) are opened. The notation indicates the union of multisets.

For even p we apply (4.3) with Λ(k)(D):=diag(fp)D for kp/2 and Λ(k)(D):=diag(fp)D¯ for k>p/2. This is obviously a special case of Λ(k)(D)=BD which was considered in the so-called averaged case of [34] with arbitrary B of bounded operator norm since diag(fp)=fpC. It was proved in [34] that

diag(fp)DρNη,

which is not good enough at the cusp. We can nevertheless use the graphical language developed in [34] to estimate the complicated right hand side of (4.3).

Graphical representation via double index graphs

The graphs (or Feynman diagrams) introduced in [34] encode the structure of all terms in (4.3). Their (directed) edges correspond to resolvents G, while vertices correspond to Δ’s. Loop edges are allowed while parallel edges are not. Resolvents G and their Hermitian conjugates G are distinguished by different types of edges. Each vertex v carries a label αv and we need to sum up for all labels. Some labels are independently summed up, these are the α-labels in (4.3), while the β-labels are strongly restricted; in the independent case they can only be of the type α or αt. These graphs will be called “double indexed” graphs since the vertices are naturally equipped with labels (double indices). Here we introduced the terminology “double indexed” for the graphs in [34] to distinguish them from the “single indexed” graphs to be introduced later in this paper.

To be more precise, the graphs in [34] were vertex-coloured graphs. The colours encoded a resummation of the terms in (4.3): vertices whose labels (or their transpose) appeared in one of the cumulants in (4.3) received the same colour. We then first summed up the colours and only afterwards we summed up all labels compatible with the given colouring. According to [34, Proposition 4.4] and the expansion of the main term [34, Eq. (49)] for every even p it holds that

Ediag(fp)Dp=ΓGav(p,6p)Val(Γ)+ON-p, 4.4a

where Gav(p,6p) is a certain finite collection of vertex coloured directed graphs with p connected components, and Val(Γ), the value of the graph Γ, will be recalled below. According to [34] each graph ΓGav(p,6p) fulfils the following properties:

Proposition 4.1

(Properties of double index graphs). There exists a finite set Gav(p,6p) of double index graphs Γ such that (4.4) hold. Each Γ fulfils the following properties.

  1. There exist exactly p connected components, all of which are oriented cycles. Each vertex has one incoming and one outgoing edge.

  2. Each connected component contains at least one vertex and one edge. Single vertices with a looped edge are in particular legal connected components.

  3. Each colour colours at least two and at most 6p vertices.

  4. If a colour colours exactly two vertices, then these vertices are in different connected components.

  5. The edges represent the resolvent matrix G or its adjoint G. Within each component either all edges represent G or all edges represent G. Accordingly we call the components either G or G-cycles.

  6. Within each cycle there is one designated edge which is represented as a wiggled line in the graph. The designated edge represents the matrix Gdiag(pf) in a G-cycle and the matrix diag(pf)G in a G-cycle.

  7. For each colour there exists at least one component in which a vertex of that colour is connected to the matrix diag(fp). According to (f) this means that if the relevant vertex is in a G-cycle, then the designated (wiggled) edge is its incoming edge. If the relevant vertex is in a G-cycle, then the designated edge is its outgoing edge.

If V is the vertex set of Γ and for each colour cC, Vc denotes the c-coloured vertices then we recall that

Val(Γ)=(-1)V(cCvVcαvκ({αv}vVc)(Vc-1)!)×ECyc(v1,,vk)ΓGdiag(fp)Δαv1GGΔαvkΔαvkGGΔαv1diag(fp)G 4.4b

where the ultimate product is the product over all p of the cycles in the graph. By the notation Cyc(v1,,vk) we indicate a directed cycle with vertices v1,,vk. Depending upon whether a given cycle is a G-cycle or G-cycle, it then contributes with one of the factors indicated after the last curly bracket in (4.4b) with the vertex order chosen in such a way that the designated edge represents the Gdiag(fp) or diag(fp)G matrix. As an example illustrating (4.4b) we have

graphic file with name 220_2019_3657_Equ69_HTML.gif 4.5

Actually in [34] the graphical representation of the graph Γ is simplified, it does not contain all information encoded in the graph. First, the direction of the edges are not indicated. In the picture both cycles should be oriented in a clockwise orientation. Secondly, the type of edges are not indicated, apart from the wiggled line. In fact, the edges in the second subgraph stand for G, while those in the first subgraph stand for G. To translate the pictorial representation directly let the striped vertices in the first and second cycle be associated with α1,β1 and the dotted vertices with α2,β2. Accordingly, the wiggled edge in the first cycle stands for Gdiag(fp), while the wiggled edge in the second cycle stands for diag(fp)G. The reason why these details were omitted in the graphical representation of a double index graph is that they do not influence the basic power counting estimate of its value used in [34].

Single index graphs

In [34] we operated with double index graphs that are structurally simple and appropriate for bookkeeping complicated correlation structures, but they are not suitable for detecting the additional smallness we need at the cusp. The contribution of the graphs in [34] were estimated by a relatively simple power counting argument where only the number of (typically off-diagonal) resolvent elements were recorded. In fact, for many subleading graphs this procedure already gave a very good bound that is sufficient at the cusps as well. The graphs carrying the leading contribution, however, have now to be computed to a higher accuracy and this leads to the concept of “single index graphs”. These are obtained by a certain refinement and reorganization of the double index graphs via a procedure we will call graph resolution to be defined later. The main idea is to restructure the double index graph in such a way that instead of labels (double indices) α=(a,b) its vertices naturally represent single indices a and b. Every double indexed graph will give rise to a finite number of resolved single index graphs. The double index graphs that require a more precise analysis compared with [34] will be resolved to single index graphs. After we explain the structure of the single index graphs and the graph resolution procedure, double index graphs will not be used in this paper any more. Thus, unless explicitly stated otherwise, by graph we will mean single index graph in the rest of this paper.

We now define the set G of single index graphs we will use in this paper. They are directed graphs, where parallel edges and loops are allowed. Let the graph be denoted by Γ with vertex set V(Γ) and edge set E(Γ). We will assign a value to each Γ which comprises weights assigned to the vertices and specific values assigned to the edges. Since an edge may represent different objects, we will introduce different types of edges that will be graphically distinguished by different line style. We now describe these ingredients precisely.

Vertices.

Each vertex vV(Γ) is equipped with an associated index avJ. Graphically the vertices are represented by small sunlabelled bullets Inline graphic , i.e. in the graphical representation the actual index is not indicated. It is understood that all indices will be independently summed up over the entire index set J when we compute the value of the graph.

Vertex weights.

Each vertex vV(Γ) carries some weight vector w(v)CJ which is evaluated wav(v) at the index av associated with the vertex. We generally assume these weights to be uniformly bounded in N, i.e. supNw(v)<. Visually we indicate vertex weights by incoming arrows as in Inline graphic . Vertices without explicitly indicated weight may carry an arbitrary bounded weight vector. We also use the notation Inline graphic to indicate the constant 1 vector as the weight, this corresponds to summing up the corresponding index unweighted

G-edges.

The set of G-edges is denoted by GE(Γ)E(Γ). These edges describe resolvents and there are four types of G-edges. First of all, there are directed edges corresponding to G and G in the sense that a directed G or G-edge e=(v,u)E initiating from the vertex v=i(e) and terminating in the vertex u=t(e) represents the matrix elements Gavau or respectively Gavau evaluated in the indices av,au associated with the vertices v and u. Besides these two there are also edges representing G-M and (G-M). Distinguishing between G and G-M, for practical purposes, is only important if it occurs in a loop. Indeed, (G-M)aa is typically much smaller than Gaa, while (G-M)ab basically acts just like Gab when ab are summed independently. Graphically we will denote the four types of G-edges by graphic file with name 220_2019_3657_Figd_HTML.jpg

where all these edges can also be loops. The convention is that continuous lines represent G, dashed lines correspond to G, while the diamond on both types of edges indicates the subtraction of M or M. An edge eGE(Γ) carries its type as its attribute, so as a short hand notation we can simply write Ge for Gai(e),at(e), Gai(e),at(e), (G-M)ai(e),at(e) and (G-M)ai(e),at(e) depending on which type of G-edge e represents. Due to their special role in the later estimates, we will separately bookkeep those G-M or G-M edges that appear looped. We thus define the subset GEg-mGE as the set of G-edges eGE(Γ) of type G-M or G-M such that i(e)=t(e). We write g-m to refer to the fact that looped edges are evaluated on the diagonal (g-m)av of (G-M)avav.

(G-)edge degree.

For any vertex v we define its in-degree deg-(v) and out-degree deg+(v) as the number of incoming and outgoing G-edges. Looped edges (vv) are counted for both in- and out-degree. We denote the total degree by deg(v)=deg-(v)+deg+(v).

Interaction edges.

Besides the G-edges we also have interaction edges, IE(Γ), representing the cumulants κ. A directed interaction edge e=(u,v) represents the matrix R(e)=(rab(e))a,bJ given by the cumulant

rab(u,v)=1(deg(u)-1)!κ(ab,,abdeg-(u)times,ba,,badeg+(u)times)=1(deg(v)-1)!κ(ab,,abdeg+(v)times,ba,,badeg-(v)times). 4.6

For all graphs ΓG and all interaction edges e=(u,v) we have the symmetries deg-(u)=deg+(v) and deg-(v)=deg+(u). Thus (4.6) is compatible with exchanging the roles of u and v. For the important case when deg(u)=deg(v)=2 it follows that the interaction from u to v is given by S if u has one incoming and one outgoing G-edge and T if u has two incoming G-edges, i.e.

sab=κ(ab,ba)tab=κ(ab,ab).

Visually we will represent interaction edges as graphic file with name 220_2019_3657_Fige_HTML.jpg

Although the interaction matrix R(e) is completely determined by the in- and out-degrees of the adjacent vertices i(e), t(e) we still write out the specific S and T names because these will play a special role in the latter part of the proof. As a short hand notation we shall frequently use Re:=Rai(e),at(e)(e) to denote the matrix element selected by the indices ai(e),at(e) associated with the initial and terminal vertex of e. We also note that we do not indicate the direction of edges associated with S as the matrix S is symmetric.

Generic weighted edges.

Besides the specific G-edges and interaction edges, additionally we also allow for generic edges reminiscent of the generic vertex weights introduced above. They will be called generic weighted edges, or weighted edges for short. To every weighted edge e we assign a weight matrix K(e)=(kab(e))a,bJ which is evaluated as kai(e),at(e)(e) when we compute the value of the graph by summing up all indices. To simplify the presentation we will not indicate the precise form of the weight matrix K(e) but only its entry-wise scaling as a function of N. A weighted edge presented as Inline graphic represents an arbitrary weight matrix K(e) whose entries scale like Inline graphic. We denote the set of weighted edges by WE(Γ). For a given weighted edge eWE we record the entry-wise scaling of K(e) in an exponent l(e)0 in such a way that we always have Inline graphic.

Graph value.

For graphs ΓG we define their value

Val(Γ):=(-1)GE(Γ)(vV(Γ)avJwav(v))(eIE(Γ)rai(e),at(e)(e))(eWE(Γ)kai(e),at(e)(e))×E(eGE(Γ)Ge), 4.7

which differs slightly from that in (4.4b) because it applies to a different class of graphs.

Single index resolution

There is a natural mapping from double indexed graphs to a collection of single indexed graphs that encodes the rearranging of the terms in (4.4b) when the summation over labels αv is reorganized into summation over single indices. Now we describe this procedure.

Definition 4.2

(Single index resolution). By the single index resolution of a double vertex graph we mean the collection of single index graphs obtained through the following procedure.

  • (i)

    For each colour, the identically coloured vertices of the double index graph are mapped into a pair of vertices of the single index graph.

  • (ii)

    The pair of vertices in the single index graph stemming from a fixed colour is connected by an interaction edge in the single index graph.

  • (iii)

    Every (directed) edge of the double index graph is naturally mapped to a G-edge of the single index graph. While mapping equally coloured vertices x1,,xk in the double index graph to vertices uv connected by an interaction edge e=(u,v) there are k-1 binary choices of whether we map the incoming edge of xj to an incoming edge of u and the outgoing edge of xj to an outgoing edge of v or vice versa. In this process we are free to consider the mapping of x1 (or any other vertex, for that matter) as fixed by symmetry of uv.

  • (iv)

    If a wiggled G-edge is mapped to an edge from u to v, then v is equipped with a weight of pf. If a wiggled G-edge is mapped to an edge from u to v, then u is equipped with a weight of pf. All vertices with no weight specified in this process are equipped with the constant weight 1.

We define the set G(p)G as the set of all graphs obtained from the double index graphs Gav(p,6p) via the single index resolution procedure.

Remark 4.3

  • (i)

    We note some ingredients described in Sect. 4.2 for a typical graph in G will be absent for graphs ΓG(p)G. For example, WE(Γ)=GEg-m(Γ)= for all ΓG(p).

  • (ii)

    We also remark that loops in double index graphs are never mapped into loops in single index graphs along the single index resolution. Indeed, double index loops are always mapped to edges parallel to the interaction edge of the corresponding vertex.

A few simple facts immediately follow from the the single index construction in Definition 4.2. From (i) it is clear that the number of vertices in the single index graph is twice the number of colours of the double index graph. From (ii) it follows that the number of interaction edges in the single index graph equals the number of colours of the double index graph. Finally, from (iii) it is obvious that if for some colour c there are k=k(c) vertices in the double index graph with colour c, then the resolution of this colour gives rise to 2k(c)-1 single indexed graph. Since these resolutions are done independently for each colour, we obtain that the number of single index graphs originating from one double index graph is

c2k(c)-1

Since the number of double index graph in Gav(p,6p) is finite, so is the number of graphs in G(p).

Let us present an example of single index resolution applied to the graph from (4.5) where we, for the sake of transparency, label all vertices and edges. Γ is a graph consisting of one 2-cycle on the vertices x1,y2 and one 2-cycle on the vertices x2,y1 as in

graphic file with name 220_2019_3657_Equ72_HTML.gif 4.8

with x1,y1 and x2,y2 being of equal colour (i.e. being associated to labels connected through cumulants). In order to explain steps (i)–(iii) of the construction we first neglect that some edges may be wiggled, but we restore the orientation of the edges in the picture. We then fix the mapping of xi to pairs of vertices (ui,vi) for i=1,2 in such a way that the incoming edges of xi are incoming at ui and the outgoing edges from xi are outgoing from vi. It remains to map yi to (ui,vi) and for each i there are two choices of doing so that we obtain the four possibilities graphic file with name 220_2019_3657_Figg_HTML.jpg

which translates to

graphic file with name 220_2019_3657_Equ73_HTML.gif 4.9

in the language of single index graphs where the ST assignment agrees with (4.6). Finally we want to visualize step (iv) in the single index resolution in our example. Suppose that in (4.8) the edges e1 and e2 are G-edges while e3 and e4 are G edges with e2 and e4 being wiggled (in agreement with (4.5)). According to (iv) it follows that the terminal vertex of e2 and the initial vertex of e4 are equipped with a weight of pf while the remaining vertices are equipped with a weight of 1. The first graph in (4.9) would thus be equipped with the weights graphic file with name 220_2019_3657_Figh_HTML.jpg

Single index graph expansion.

With the value definition in (4.7) it follows from Definition 4.2 that

Ediag(fp)Dp=N-pΓG(p)Val(Γ)+ON-p. 4.10

We note that in contrast to the value definition for double index graphs (4.4), where each average in (4.4b) contains an 1/N prefactor, the single index graph value (4.7) does not include the N-p prefactor. We chose this convention in this paper mainly because the exponent p in the prefactor N-p cannot be easily read off from the single index graph itself, whereas in the double index graph p is simply the number of connected components.

We now collect some simple facts about the structure of these graphs in G(p) which directly follow from the corresponding properties of the double index graphs listed in Proposition 4.1.

Fact 1

The interaction edges IE(Γ) form a perfect matching of Γ, in particular V=2IE. Moreover, 1IE(Γ)p and therefore the number of vertices in the graph is even and satisfies 2V(Γ)2p. Finally, since for (u,v)IE we have deg-(u)=deg+(v) and deg-(v)=deg+(u), consequently also deg(e):=deg(u)=deg(v). The degree furthermore satisfies the bounds 2deg(e)6p for each eIE(Γ).

Fact 2

The weights associated with the vertices are some non-negative powers of fp in such a way that the total power of all fp’s is exactly p. The trivial zeroth power, i.e. the constant weight 1 is allowed. Furthermore, the fp weights are distributed in such a way that at least one non-trivial fp weight is associated with each interacting edge (u,v)=eIE(Γ).

Examples of graphs

We now turn to some examples explaining the relation of the double index graphs from [34] and single index graphs. We note that the single index graphs actually contain more information because they specify edge direction, specify weights explicitly and differentiate between G and G edges. These information were not necessary for the power counting arguments used in [34], but for the improved estimates they will be crucial.

We start with the graphs representing the following simple equality following from κ(α,β)=Ewαwβ

N2Eα,βκ(α,β)diag(fp)ΔαGGΔβdiag(fp)=a,bsab(pf)a2EGbaGab+a,btab(pf)a(pf)bEGbaGba

which can be represented as graphic file with name 220_2019_3657_Figi_HTML.jpg

We now turn to the complete graphical representation for the second moment in the case of Gaussian entries,

graphic file with name 220_2019_3657_Equ75_HTML.gif 4.11

where we again stress that the double index graphs hide the specific weights and the fact that one of the connected components actually contains G edges. In terms of single index graphs, the rhs. of (4.11) can be represented as the sum over the values of the six graphs

graphic file with name 220_2019_3657_Equ76_HTML.gif 4.12

The first two graphs were already explained above. The additional four graphs come from the second term in the rhs. of (4.11). Since κ(α1,β1) is non-zero only if α1=β1 or α1=β1t, there are four possible choices of relations among the α and β labels in the two kappa factors. For example, the first graph in the second line of (4.12) corresponds to the choice α1t=β1, α2t=β2. Written out explicitly with summation over single indices, this value is given by

a1,b1a2,b2(pf)a1(pf)b2sa1b1sa2b2EGa2a1Gb1b2Ga1a2Gb2b1

where in the picture the left index corresponds to a1, the top index to b2, the right one to a2 and the bottom one to b1.

We conclude this section by providing an example of a graph with some degree higher than two which only occurs in the non-Gaussian situation and might contain looped edges. For example, in the expansion of N2Ediag(fp)D2 in the non-Gaussian setup there is the term graphic file with name 220_2019_3657_Figj_HTML.jpg

where rab=κ(ab,ba,ba)/2 and sab=κ(ab,ba), in accordance with (4.6).

Simple estimates on Val(Γ)

In most cases we aim only at estimating the value of a graph instead of precisely computing it. The simplest power counting estimate on (4.7) uses that the matrix elements of G and those of the generic weight matrix K are bounded by an O1 constant, while the matrix elements of R(e) are bounded by N-deg(e)/2. Thus the naive estimate on (4.7) is

Val(Γ)(vV(Γ)N)(eIE(Γ)N-deg(e)/2)=eIE(Γ)N2-deg(e)/2eIE(Γ)NNp 4.13

where we used that the interaction edges form a perfect matching and that deg(e)2, IE(Γ)p. The somewhat informal notation in (4.13) hides a technical subtlety. The resolvent entries Gab are indeed bounded by an O1 constant in the sense of very high moments but not almost surely. We will make bounds like the one in (4.13) rigorous in a high moments sense in Lemma 4.8.

The estimate (4.13) ignores the fact that typically only the diagonal resolvent matrix elements of G are of O1, the off-diagonal matrix elements are much smaller. This is manifested in the Ward-identity

aJGab2=(GG)bb=(G-G)bb2iη=IGbbη. 4.14a

Thus the sum of off-diagonal resolvent elements Gab is usually smaller than its naive size of order N, at least in the regime ηN-1. This is quantified by the so called Ward estimates

aJGab2=NIGbbNηNψ2,aJGabNψ,ψ:=ρNη1/2. 4.14b

Similarly to (4.13) the inequalities in (4.14b) are meant in a power counting sense ignoring that the entries of IG might not be bounded by ρ almost surely but only in some high moment sense.

As a consequence of (4.14b) we can gain a factor of ψ for each off-diagonal (that is, connecting two separate vertices) G-factor, but clearly only for at most two G-edges per adjacent vertex. Moreover, this gain can obviously only be used once for each edge and not twice, separately when summing up the indices at both adjacent vertices. As a consequence a careful counting of the total number of ψ-gains is necessary, see [34, Section 4.3] for details.

Ward bounds for the example graphs from Sect. 4.4. From the single index graphs drawn in (4.12) we can easily obtain the known bound Ediag(fp)D2ψ4. Indeed, the last four graphs contribute a combinatorial factor of N4 from the summations over four single indices and a scaling factor of N-2 from the size of ST. Furthermore, we can gain a factor of ψ for each G-edge through Ward estimates and the bound follows. Similarly, the first two graphs contribute a factor of N=N2-1 from summation and S/T and a factor of ψ2 from the Ward estimates, which overall gives N-1ψ2ψ4. As this example shows, the bookkeeping of available Ward-estimates is important and we will do so systematically in the following sections.

Improved estimates on Val(Γ): Wardable edges

For the sake of transparency we briefly recall the combinatorial argument used in [34], which also provides the starting point for the refined estimate in the present paper. Compared to [34], however, we phrase the counting argument directly in the language of the single index graphs. We only aim to gain from the G-edges adjacent to vertices of degree two or three; for vertices of higher degree the most naive estimate Gab1 is already sufficient as demonstrated in [34]. We collect the vertices of degree two and three in the set V2,3 and collect the G-edges adjacent to V2,3 in the set E2,3. In [34, Section 4.3] a specific marking procedure on the G-edges of the graph is introduced that has the following properties. For each vV2,3 we put a mark on at most two adjacent G-edges in such a way that those edges can be estimated via (4.14b) while performing the av summation. In this case we say that the mark comes from the v-perspective. An edge may have two marks coming from the perspective of each of its adjacent vertices. Later, marked edges will be estimated via (4.14b) while summing up av. After doing this for all of V2,3 we call an edge in E2,3marked effectively if it either (i) has two marks, or (ii) has one mark and is adjacent to only one vertex from V2,3. While subsequently using (4.14b) in the summation of av for vV2,3 (in no particular order) on the marked edges (and estimating the remaining edges adjacent to v trivially) we can gain at least as many factors of ψ as there are effectively marked edges. Indeed, this follows simply from the fact that effectively marked edges are never estimated trivially during the procedure just described, no matter the order of vertex summation.

Fact 3

For each ΓG(p) there is a marking of edges adjacent to vertices of degree at most 3 such that there are at least eIE(Γ)(4-deg(e))+ effectively marked edges.

Proof

On the one hand we find from Fact 1 (more specifically, from the equality deg(e)=deg(u)=deg(v) for (u,v)=eIE(Γ)) that

E2,3vV2,312deg(v)=eIE(Γ),deg(e){2,3}deg(e). 4.15

On the other hand it can be checked that for every pair (u,v)=eIE(Γ) with deg(e)=2 all G-edges adjacent to u or v can be marked from the uv-perspective. Indeed, this is a direct consequence of Proposition 4.1(d): Because the two vertices in the double index graph being resolved to (uv) cannot be part of the same cycle it follows that all of the (two, three or four) G-edges adjacent to the vertices with index u or v are not loops (i.e. do not represent diagonal resolvent elements). Therefore they can be bounded by using (4.14b). Similarly, it can be checked that for every edge (u,v)=eIE(Γ) with deg(e)=3 at most two G-edges adjacent to u or v can remain unmarked from the uv-perspective. By combining these two observations it follows that at most

eIE(Γ),deg(e){2,3}(2deg(e)-4) 4.16

edges in E2,3 are ineffectively marked since those are counted as unmarked from the perspective of one of its vertices. Subtracting (4.16) from (4.15) it follows that in total at least

eIE(Γ)(4-deg(e))+=eIE(Γ),deg(e){2,3}(4-deg(e))

edges are marked effectively, just as claimed.

In [34] it was sufficient to estimate the value of each graph in G(p) by subsequently estimating all effectively marked edges using (4.14b). For the purpose of improving the local law at the cusp, however, we need to introduce certain operations on the graphs of G(p) which allow to estimate the graph value to a higher accuracy. It is essential that during those operations we keep track of the number of edges we estimate using (4.14b). Therefore we now introduce a more flexible way of recording these edges. We first recall a basic definition [58] from graph theory.

Definition 4.4

For k1 a graph Γ=(V,E) is called k-degenerate if any induced subgraph has minimal degree at most k.

It is well known that being k-degenerate is equivalent to the following sequential property.2 We provide a short proof for convenience.

Lemma 4.5

A graph Γ=(V,E) is k-degenerate if and only if there exists an ordering of vertices {v1,,vn}=V such that for each m[n]:={1,,n} it holds that

degΓ[{v1,,vm}](vm)k 4.17

where for VV, Γ[V] denotes the induced subgraph on the vertex set V.

Proof

Suppose the graph is k-degenerate and let n:=V. Then there exists some vertex vnV such that deg(vn)k by definition. We now consider the subgraph induced by V:=V\{vn} and, by definition, again find some vertex vn-1V of degree degΓ[V](vn-1)k. Continuing inductively we find a vertex ordering with the desired property.

Conversely, assume there exists a vertex ordering such that (4.17) holds for each m. Let VV be an arbitrary subset and let m:=max{l[n]|vlV}. Then it holds that

degΓ[V](vm)degΓ[{v1,,vm}](vm)k

and the proof is complete.

The reason for introducing this graph theoretical notion is that it is equivalent to the possibility of estimating edges effectively using (4.14b). A subset GE of G-edges in ΓG can be fully estimated using (4.14b) if and only if there exists a vertex ordering such that we can subsequently remove vertices in such a way that in each step at most two edges from GE are removed. Due to Lemma 4.5 this is the case if and only if Γ=(V,GE) is 2-degenerate. For example, the graph Γeff=(V,GEeff) induced by the effectively marked G-edges GEeff is a 2-degenerate graph. Indeed, each effectively marked edge is adjacent to at least one vertex which has degree at most 2 in Γeff: Vertices of degree 2 in (V,GE) are trivially at most of degree 2 in Γeff, and vertices of degree 3 in (V,GE) are also at most of degree 2 in Γeff as they can only be adjacent to 2 effectively marked edges. Consequently any induced subgraph of Γeff has to contain some vertex of degree at most 2 and thereby Γeff is 2-degenerate.

Definition 4.6

For a graph Γ=(V,GEIEWE)G we call a subset of G-edges GEWGEWardable if the subgraph (V,GEW) is 2-degenerate.

Lemma 4.7

For each ΓG(p) there exists a Wardable subset GEWGE of size

GEW=eIE(4-deg(e))+. 4.18

Proof

This follows immediately from Fact 3, the observation that (V,GEeff) is 2-degenerate and the fact that sub-graphs of 2-degenerate graphs remain 2-degenerate.

For each ΓG(p) we choose a Wardable subset GEW(Γ)GE(Γ) satisfying (4.18). At least one such set is guaranteed to exist by the lemma. For graphs with several possible such sets, we arbitrarily choose one, and consider it permanently assigned to Γ. Later we will introduce certain operations on graphs ΓG(p) which produce families of derived graphs ΓGG(p). During those operations the chosen Wardable subset GEW(Γ) will be modified in order to produce eligible sets of Wardable edges GEW(Γ) and we will select one among those to define the Wardable subset of Γ. We stress that the relation (4.18) on the Wardable set is required only for ΓG(p) but not for the derived graphs Γ.

We now give a precise meaning to the vague bounds of (4.13), (4.14b). We define the N-exponent, n(Γ), of a graph Γ=(V,GEIEWE) as the effective N-exponent in its value-definition, i.e. as

n(Γ):=V-eIEdeg(e)2-eWEl(e).

We defer the proof of the following technical lemma to the Appendix.

Lemma 4.8

For any c>0 there exists some C>0 such that the following holds. Let Γ=(V,GEIEWE)G be a graph with Wardable edge set GEWGE and at most Vcp vertices and at most GEcp2G-edges. Then for each 0<ϵ<1 it holds that

Val(Γ)ϵNϵp(1+Gq)Cp2W-Est(Γ), 4.19a

where

W-Est(Γ):=Nn(Γ)(ψ+ψq)GEW(ψ+ψq+ψq)GEg-m,q:=Cp3/ϵ. 4.19b

Remark 4.9

  • (i)

    We consider ϵ and p as fixed within the proof of Theorem 3.7 and therefore do not explicitly carry the dependence of them in quantities like W-Est.

  • (ii)

    We recall that the factors involving GEg-m and WE do not play any role for graphs ΓG(p) as those sets are empty in this restricted class of graphs (see Remark 4.3).

  • (iii)
    Ignoring the difference between ψ and ψq, ψq and the irrelevant order ONpϵ factor in (4.19), the reader should think of (4.19) as the heuristic inequality
    Val(Γ)Nn(Γ)ψGEW+GEg-m.
    Using Lemma 4.7, N-1/2ψ1, V=2IE2p and deg(e)2 (from Fact 1) we thus find
    N-pVal(Γ)NIE-peIEN1-deg(e)/2ψ(4-deg(e))+ψ2IE-2peIEψdeg(e)-2+(4-deg(e))+ψ2p 4.20
    for any Γ=(V,GEIE)G(p).

Improved estimates on Val(Γ) at the cusp: σ-cells

Definition 4.10

For ΓG we call an interaction edge (u,v)=eIE(Γ) a σ-cell if the following four properties hold: (i) deg(e)=2, (ii) there are no G-loops adjacent to u or v, (iii) precisely one of uv carries a weight of pf while the other carries a weight of 1, and (iv), e is not adjacent to any other non GE-edges. Pictorially, possible σ-cells are given by graphic file with name 220_2019_3657_Figk_HTML.jpg

For ΓG we denote the number of σ-cells in Γ by σ(Γ).

Next, we state a simple lemma, estimating W-Est(Γ) of the graphs in the restricted class ΓG(p).

Lemma 4.11

For each Γ=(V,IEGE)G(p) it holds that

N-pW-Est(Γ)p(η/ρ)p-σ(Γ)(ψ+ψq)2peIEdeg(e)4N2-deg(e)/2.

Proof

We introduce the short-hand notations IEk:={eIE|deg(e)=k} and IEk:=lkIEl. Starting from (4.19b) and Lemma 4.7 we find

N-pW-Est(Γ)N-(p-IE)(eIE2(ψ+ψq)2)(eIE3ψ+ψqN)(eIE41N)(eIE4N2-deg(e)/2).

Using N-1/2=ψη/ρCψ it then follows that

N-pW-Est(Γ)p[ηρψ2]p-IE(eIE2(ψ+ψq)2)(eIE3ηρ(ψ+ψq)2)(eIE4N2-deg(e)/2). 4.21

It remains to relate (4.21) to the number σ(Γ) of σ-cells in Γ. Since each interaction edge of degree two which is not a σ-cell has an additional weight pf attached to it, it follows from Fact 2 that IE2-σ(Γ)p-IE. Therefore, from (4.21) and η/ρC we have that

N-pW-Est(Γ)p[η/ρ(ψ+ψq)2]p-IE+IE3+IE2-σ(Γ)[(ψ+ψq)2]σ(Γ)(eIE4N2-deg(e)/2),

proving the claim.

Using Lemma 4.8 and η/ρσq, the estimate in Lemma 4.11 has improved the previous bound (4.20) by a factor σqp-σ(Γ) (ignoring the irrelevant factors). In order to prove (3.11c), we thus need to remove the -σ(Γ) from this exponent, in other words, we need to show that from each σ-cell we can multiplicatively gain a factor of σq. This is the content of the following proposition.

Proposition 4.12

Let c>0 be any constant and ΓG be a single index graph with at most cp vertices and cp2 edges with a σ-cell (u,v)=eIE(Γ). Then there exists a finite collection of graphs {Γσ}GΓ with at most one additional vertex and at most 6p additional G-edges such that

Val(Γ)=σVal(Γσ)+ΓGΓVal(Γ)+ON-p,W-Est(Γσ)=W-Est(Γ),W-Est(Γ)pσqW-Est(Γ),ΓGΓ 4.22

and all graphs Γσ and ΓGΓ have exactly one σ-cell less than Γ.

Using Lemmas 4.8 and 4.11 together with the repeated application of Proposition 4.12 we are ready to present the proof of Theorem 3.7.

Proof of Theorem 3.7

We remark that the isotropic local law (3.11a) and the averaged local law (3.11b) are verbatim as in [34, Theorem 4.1]. We therefore only prove the improved bound (3.11c)–(3.11d) in the remainder of the section. We recall (4.10) and partition the set of graphs G(p)=G0(p)G1(p) into those graphs G0(p) with no σ-cells and those graphs G1(p) with at least one σ-cell. For the latter group we then use Proposition 4.12 for some σ-cell to find

Ediag(pf)Dp=N-pΓG0(p)Val(Γ)+ON-2p+N-pΓG1(p)σVal(Γσ)+ΓGΓVal(Γ), 4.23

where the number of σ-cells is reduced by 1 for Γσ and each ΓGΓ as compared to Γ. We note that the Ward-estimate W-Est(Γ) from Lemma 4.11 together with Lemma 4.8 is already sufficient for the graphs in G0(p). For those graphs G1(p) with exactly one σ-cell the expansion in (4.23) is sufficient because σσq and, according to (4.22), each ΓGΓ has a Ward estimate which is already improved by σq. For the other graphs we iterate the expansion from Proposition 4.12 until no sigma cells are left.

It only remains to count the number of G-edges and vertices in the successively derived graphs to make sure that Lemma 4.8 and Proposition 4.12 are applicable and that the last two factors in (3.11c) come out as claimed. Since every of the σ(Γ)p applications of Proposition 4.12 creates at most 6p additional G-edges and one additional vertex, it follows that GE(Γ)Cp2, VCp also in any successively derived graph. Finally, it follows from the last factor in Lemma 4.11 that for each eIE with deg(e)5 we gain additional factors of N-1/2. Since IEp, we easily conclude that if there are more than 4p G-edges, then each of them comes with an additional gain of N-1/2. Now (3.11c) follows immediately after taking the pth root.

We turn to the proof of (3.11d). We first write out

diag(pf)[TGt]G=1Na,b(pf)atabGbaGba

and therefore can, for even p, write the pth moment as the value

Ediag(pf)[TGt]Gp=N-pVal(Γ0)

of the graph Γ0=(V,GEIE)G which is given by p disjoint 2-cycles as graphic file with name 220_2019_3657_Figl_HTML.jpg

where there are p/2 cycles of G-edges and p/2 cycles of G edges. It is clear that (V,GE) is 2-degenerate and since GE=2p it follows that

W-Est(Γ0)Np(ψ+ψq)2p.

On the other hand each of the p interaction edges in Γ0 is a σ-cell and we can use Proposition 4.12p times to obtain (3.11d) just as in the proof of (3.11c).

Proof of Proposition 4.12

It follows from the MDE that

G=M-MS[M]G-MWG=M-GS[M]M-GWM,

which we use to locally expand a term of the form GxaGay for fixed axy further. To make the computation local we allow for an arbitrary random function f=f(W), which in practice encodes the remaining G-edges in the graph. A simple cumulant expansion shows

bBabEGxbGbyf=EMxaGayf-k=26pbβIkκ(ba,β_)maEβ[GxbGayf]+ON-p+bsbamaE[Gxa(g-m)bGay+Gxb(g-m)¯aGby-GxbGayab]f+btbamaE[Gxb(G-M)abGay+GxbGabGay-GxbGayba]f 4.24

where α:=wα and introduced the stability operator B:=1-diag(m2)S. The stability operator B appears from rearranging the equation obtained from the cumulant expansion to express the quantity EGxbGbyf. In our graphical representation, the stability operator is a special edge that we can also express as

graphic file with name 220_2019_3657_Equ91_HTML.gif 4.25

An equality like (4.25) is meant locally in the sense that the pictures only represent subgraphs of the whole graph with the empty, labelled vertices symbolizing those vertices which connect the subgraph to its complement. Thus (4.25) holds true for every fixed graph extending xy consistently in all three graphs. The doubly drawn edge in (4.25) means that the external vertices xy are identified with each other and the associated indices are set equal via a δax,ay function. Thus (4.25) should be understood as the equality

graphic file with name 220_2019_3657_Equ92_HTML.gif 4.26

where the outside edges incident at the merged vertices xy are reconnected to one common vertex in the middle graph. For example, in the picture (4.26) the vertex x is connected to the rest of the graph by two edges, and the vertex y by one.

In order to represent (4.24) in terms of graphs we have to define a notion of differential edge. First, we define a targeted differential edge represented by an interaction edge with a red -sign written on top and a red-coloured target G-edge to denote the collection of graphs

graphic file with name 220_2019_3657_Equ93_HTML.gif 4.27

The second picture in (4.27) shows that the target G-edge may be a loop; the definition remains the same. This definition extends naturally to G edges and is exactly the same for G-M edges (note that this is compatible with the usual notion of derivative as M does not depend on W). Graphs with the differential signs should be viewed only as an intermediate simplifying picture but they really mean the collection of graphs indicated in the right hand side of (4.27). They represent the identities

ακ(uv,α)uvGxy=-suvGxvGuy-tuvGxuGvy,ακ(uv,α)uvGxx=-suvGxvGux-tuvGxuGvx

In other words we introduced these graphs only to temporary encode expressions with derivatives (e.g. second term in the rhs. of (4.24)) before the differentiation is actually performed. We can then further define the action of an untargeted differential edge according the Leibniz rule as the collection of graphs with the differential edge being targeted on all G-edges of the graph one by one (in particular not only those in the displayed subgraph), i.e. for example

graphic file with name 220_2019_3657_Equ94_HTML.gif 4.28

Here the union is a union in the sense of multisets, i.e. allows for repetitions in the resulting set (note that also this is compatible with the usual action of derivative operations). The symbol on the rhs. of (4.28) indicates that the targeted edge cycles through all G-edges in the graph, not only the ones in the subgraph. For example, if there are k G-edges in the graph, then the picture (4.28) represents a collection of 2k graphs arising from performing the differentiation

ακ(uv,α)uv[GxyGyzf]=ακ(uv,α)[uvGxy]Gyzf+ακ(uv,α)Gxy[uvGyz]f+ακ(uv,α)GxyGyz[uvf]=-suv[GxvGuyGyzf+GxyGyvGuzf+GxyGyz(vuf)]-tuv[GxuGvyGyzf+GxyGyuGvzf+GxyGyz(uvf)],

where f=f(W) represents the value of the G-edges outside the displayed subgraph.

Finally we introduce the notation that a differential edge which is targeted on all G-vertices except for those in the displayed subgraph. This differential edge targeted on the outside will be denoted by ^.

Regarding the value of the graph, we define the value of a collection of graphs as the sum of their values. We note that this definition is for the collection of graphs encoded by the differential edges also consistent with the usual differentiation.

Written in a graphical form (4.24) reads

graphic file with name 220_2019_3657_Equ95_HTML.gif 4.29

where the ultimate graph encodes the ultimate terms in the last two lines of (4.24).

We worked out the example for the resolution of the quantity EGxaGayf, but very similar formulas hold if the order of the fixed indices (xy) and the summation index a changes in the resolvents, as well as for other combinations of the complex conjugates. In graphical language this corresponds to changing the arrows of the two G-edges adjacent to a, as well as their types. In other words, equalities like the one in (4.29) hold true for other any degree two vertex but the stability operator changes slightly: In total there are 16 possibilities, four for whether the two edges are incoming or outgoing at a and another four for whether the edges are of type G or of type G. The general form for the stability operator is

B:=1-diag(m#1m#2)R, 4.30

where R=S if there is one incoming and one outgoing edge, R=T if there are two outgoing edges and R=Tt otherwise, and where #1,#2 represent complex conjugations if the corresponding edges are of G type. Thus for, for example, the stability operator in a for GxaGya is 1-diag(m¯2)Tt. Note that the stability operator at vertex with degree two is exclusively determined by the type and orientation of the two G-edges adjacent to a. In the sequel the letter B will refer to the appropriate stability operator, we will not distinguish their 9 possibilities (R=S,T,Tt and m#1m#2=m2,m2,m¯2) in the notation.

Lemma 4.13

Let c>0 be any constant, ΓG be a single index graph with at most cp vertices and cp2 edges and let aV(Γ) be a vertex of degree deg(a)=2 not adjacent to a G-loop. The insertion of the stability operator B (4.30) at a as in (4.29) produces a finite set of graphs with at most one additional vertex and 6p additional edges, denoted by GΓ, such that

Val(Γ)=ΓGΓValΓ+ON-p,

and all of them have a Ward estimate

W-Est(Γ)p(ρ+ψ+η/ρ+ψq+ψq)W-Est(Γ)pσqW-Est(Γ),ΓGΓ.

Moreover all σ-cells in Γ, except possibly a σ-cell adjacent to a, remain σ-cells also in each Γ.

Proof

As the proofs for all of the 9 cases of B-operators are almost identical we prove the lemma for the case (4.29) for definiteness. Now we compare the value of the graph graphic file with name 220_2019_3657_Figm_HTML.jpg

with the graph in the lhs. of (4.29), i.e. when the stability operator B is attached to the vertex a. We remind the reader that the displayed graphs only show a certain subgraph of the whole graph. The goal is to show that W-EstΓ(ρ+ψ+η/ρ+ψq+ψq)W-Est(Γ) for each graph Γ occurring on the rhs. of (4.29). The forthcoming reasoning is based on comparing the quantities V, GEW, GEg-m and eIEdeg(e)/2 defining the Ward estimate W-Est from (4.19b) of the graph Γ and the various graphs Γ occurring on the rhs. of (4.29).

  1. We begin with the first graph and claim that graphic file with name 220_2019_3657_Fign_HTML.jpg Due to the double edge which identifies the x and a vertices it follows that V(Γ)=V(Γ)-1. The degrees of all interaction edges remain unchanged when going from Γ to Γ. As the 2-degenerate set of Wardable edges GEW(Γ) we choose GEW(Γ)\N(a), i.e. the 2-degenerate edge set in the original graph except for the edge-neighbourhood N(a) of a, i.e. those edges adjacent to a. As a subgraph of (V,GEW(Γ)) it follows that (V\{a},GEW(Γ)) is again 2-degenerate. Thus GEW(Γ)GEW(Γ)GEW(Γ)-2 and the claimed bound follows since GEg-m(Γ)=GEg-m(Γ) and
    W-Est(Γ)W-Est(Γ)=1N(ψ+ψq)GEW(Γ)-GEW(Γ)1Nψ2.
  2. Next, we consider the third and fourth graph and claim that graphic file with name 220_2019_3657_Figo_HTML.jpg Here there is one more vertex (corresponding to an additional summation index), V(Γ)=V(Γ)+1, whose effect in (4.19b) is compensated by one additional interaction edge e of degree 2. Hence the N-exponent n(Γ) remains unchanged. In the first graph we can simply choose GEW(Γ)=GEW(Γ), whereas in the second graph we choose GEW(Γ)=GEW(Γ)\{(x,a),(a,y)}{(x,b),(b,y)} which is 2-degenerate as a subgraph of a 2-degenerate graph together with an additional vertex of degree 2. Thus in both cases we can choose GEW(Γ) (if necessary, by removing excess edges from GEW(Γ) again) in such a way that GEW(Γ)=GEW(Γ) but the number of (g-m)-loops is increased by 1, i.e. GEg-m(Γ)=GEg-m(Γ)+1.

  3. Similarly, we claim for the fifth and sixth graph that graphic file with name 220_2019_3657_Figp_HTML.jpg There is one more vertex whose effect in (4.19b) is compensated by one more interaction edge of degree 2, whence the number N-exponent remains unchanged. The number of Wardable edges can be increased by one by setting GEW(Γ) to be a suitable subset of GEW(Γ)\{(x,a),(a,y)}{(x,b),(a,b),(a,y)} which is 2-degenerate as the subset of a 2-degenerate graph together with two vertices of degree 2. The number of (g-m)-loops remains unchanged.

  4. For the last graph in (4.29), i.e. where the derivative targets an outside edge, we claim that graphic file with name 220_2019_3657_Figq_HTML.jpg Here the argument on the lhs., Γ, stands for a whole collection of graphs but we essentially only have to consider two types: The derivative edge either hits a G-edge or a (g-m)-loop, i.e. graphic file with name 220_2019_3657_Figr_HTML.jpg which encodes the graphs graphic file with name 220_2019_3657_Figs_HTML.jpg as well as the corresponding transpositions (as in (4.27)). In both cases the N-size of W-Est remains constant since the additional vertex is balanced by the additional degree two interaction edge. In both cases all four displayed edges can be included in GEW(Γ). So GEW can be increased by 1 in the first case and by 2 in the second case while the number of (g-m)-loops remains constant in the first case is decreased by 1 in the second case. The claim follows directly in the first case and from
    W-Est(Γ)W-Est(Γ)=(ψ+ψq)2ψ+ψq+ψqψ+ψq+ψq
    in the second case.
  5. It remains to consider the second graph in the rhs. of (4.29) with the higher derivative edge. We claim that for each k2 it holds that graphic file with name 220_2019_3657_Figt_HTML.jpg We prove the claim by induction on k starting from k=2. For any k2 we write k=k-1. For the action of the last derivative we distinguish three cases: (i) action on an edge adjacent to the derivative edge, (ii) action on a non-adjacent G-edge and (iii) an action on a non-adjacent (g-m)-loop. Graphically this means
    graphic file with name 220_2019_3657_Equ97_HTML.gif 4.31
    We ignored the case where the derivative acts on (ay) since it is estimated identically to the first graph. We also neglected the possibility that the derivative acts on a g-loop, as this is estimated exactly as the last graph and the result is even better since no (g-m)-loop is destroyed. After performing the last derivative in (4.31) we obtain the following graphs Γ
    graphic file with name 220_2019_3657_Equ98_HTML.gif 4.32
    where we neglected the transposition of the third graph with uv exchanged because this is equivalent with regard to the counting argument. First, we handle the second, third and fourth graphs in (4.32). In all these cases the set GEW(Γ) is defined simply by adding all edges drawn in (4.32) to the set GEW(Γ)\{(x,a),(a,y)}. The new set remains 2-degenerate since all these new edges are adjacent to vertices of degree 2. Compared to the original graph, Γ, we thus have increased GEW+GEg-m by at least 1.
    We now continue with the first graph in (4.32), where we explicitly expand the action of another derivative (notice that this is the only graph where k2 is essentially used). We distinguish four cases, depending on whether the derivative acts on (i) the b-loop, (ii) an adjacent edge, (iii) a non-adjacent edge or (iv) a non-adjacent (g-m)-loop, i.e. graphically we have
    graphic file with name 220_2019_3657_Equ99_HTML.gif 4.33
    After performing the indicated derivative, the encoded graphs Γ are
    graphic file with name 220_2019_3657_Equ100_HTML.gif 4.34
    where we again neglected the version of the third graph with uv exchanged. We note that both the first and the second graph in (4.33) produce the first graph in (4.34). Now we define how to get the set GEW(Γ) from GEW(Γ)\{(x,a),(a,y)} for each case. In the first graph of (4.34) we add all three non-loop edges to GEW(Γ), in the second graph we add both non-loop edges, in the third and fourth graph we add the non-looped edge adjacent to b as well as any two non-looped edges adjacent to a. Thus, compared to the original graph the number GEW+GEg-m is at least preserved. On the other hand the N-power counting is improved by N-1/2. Indeed, there is one additional vertex b, yielding a factor N, which is compensated by the scaling factor N-3/2 from the interaction edge of degree 3.
       To conclude the inductive step we note that additional derivatives (i.e. the action of k-2) can only decrease the Ward-value of a graph. Indeed, any single derivative can at most decrease the number GEW(Γ)+GEg-m by 1 by either differentiating a (g-m)-loop or differentiating an edge from GEW. Thus the number GEW+GEg-m is decreased by at most k-2 while the number GEg-m is not increased. In particular, by choosing a suitable subset of Wardable edges, we can define GEW(Γ) in such a way that GEW+GEg-m is decreased by exactly k-2. But at the same time each derivative provides a gain of cN-1/2ψψ+ψq since the degree of the interaction edge is increased by one. Thus we have
    W-Est(Γ)W-Est(Γ)p(ψ+ψq)k-1+GEW(Γ)+GEg-m(Γ)-GEW(Γ)-GEg-m(Γ)=ψ+ψq,
    just as claimed.

Lemma 4.13 shows that the insertion of the B-operator reduces the Ward-estimate by at least ρ. However, this insertion does not come for free since the inverse

B-1=(1-diag(m#1m#2)R)-1

is generally not a uniformly bounded operator. For example, it follows from (2.2) that

Im=ηm2+m2SIm

and therefore (1-diag(m2)S)-1 is singular for small η with Im being the unstable direction. It turns out, however, that B is invertible on the subspace complementary to some bad direction b(B). At this point we distinguish two cases. If B has a uniformly bounded inverse, i.e. if B-1C for some constant C>0, then we set PB:=0. Otherwise we define PB as the spectral projection operator onto the eigenvector b(B) of B corresponding to the eigenvalue β with smallest modulus:

PB:=l(B),·l(B),b(B)b(B),QB:=1-PB, 4.35

where v,w:=N-1ava¯wa denotes the normalized inner product and l(B) is the corresponding left eigenvector, (B-β)l(B)=0.

Lemma 4.14

For all 9 possible B-operators in (4.30) it holds that

B-1QBC< 4.36

for some constant C>0, depending only on model parameters.

Proof

First we remark that it is sufficient to prove the bound (4.36) on B-1QB as an operator on CN with the Euclidean norm, i.e. B-1QBC. For this insight we refer to [5, Proof of (5.28) and (5.40a)]. Recall that R=S, R=T or R=Tt, depending on which stability operator we consider (cf. (4.30)). We begin by considering the complex hermitian symmetry class and the cases R=T and R=Tt. We will now see that in this case B has a bounded inverse and thus QB=1. Indeed, we have

B-111-F(R),

where F(R)w:=mR(mw). The fullness Assumption (B) in (2.3) implies that tij(1-c)sij for some constant c>0 and thus F(R)(1-c)F(S)1-c for R=T,Tt. Here we used F(S)1, a general property of the saturated self-energy matrix F(S) that was first established in [6, Lemma 4.3] (see also [7, Eq. (4.24)] and [10, Eq. (4.5)]). Now we turn to the case R=S for both the real symmetric and complex hermitian symmetry classes. In this case B is the restriction to diagonal matrices of an operator T:CN×NCN×N, where T{Id-MS[·]M,Id-MS[·]M,Id-MS[·]M}. All of these operators were covered in [10, Lemma 5.1] and thus (4.36) is a consequence of that lemma. Recall that the flatness (3.6) of S ensured the applicability of the lemma.

We will insert the identity 1=PB+BB-1QB, and we will perform an explicit calculation for the PB component, while using the boundedness of B-1QB in the other component. We are thus left with studying the effect of inserting B-operators and suitable projections into a σ-cell. To include all possible cases with regard to edge-direction and edge-type (i.e. G or G), in the pictures below we neither indicate directions of the G-edges nor their type but implicitly allow all possible assignments. We recall that both the R-interaction edge as well as the relevant B-operators (cf. (4.30)) are completely determined by the type of the four G-edges as well as their directions. To record the type of the inserted B, PB, QB operators we call those inserted on the rhs. of the R-edge B, PB and QB in the following graphical representations. Pictorially we first decompose the σ-cell subgraph of some graph Γ as

graphic file with name 220_2019_3657_Equ103_HTML.gif 4.37

where we allow the vertices xy to agree with z or w. With formulas, the insertion in (4.37) means the following identity

ab(pf)aGyaGxaRabGbwGbz=abc(pf)cGyaGxa(Pac+Qac)RcbGbwGbz

since Pac+Qac=δac. We first consider with the second graph in (4.37), whose treatment is independent of the specific weights, so we already removed the weight information. We insert the B operator as graphic file with name 220_2019_3657_Figu_HTML.jpg

and notice that due to Lemma 4.14 the matrix K=(B-1)tQBtR, assigned to the weighted edge in the last graph, is entry-wise kabcN-1 bounded (the transpositions compensate for the opposite orientation of the participating edges). It follows from Lemma 4.13 that

graphic file with name 220_2019_3657_Equ104_HTML.gif 4.38

where all ΓGΓ satisfy W-Est(Γ)pσqW-Est(Γ) and all σ-cells in Γ except for the currently expanded one remain σ-cells in Γ. We note that it is legitimate to compare the Ward estimate of Γ with that of Γ because with respect to the Ward-estimate there is no difference between Γ and the modification of Γ in which the R-edge is replaced by a generic N-1-weighted edge.

We now consider the first graph in (4.37) and repeat the process of inserting projections PB+QB to the other side of the R-edge to find

graphic file with name 220_2019_3657_Equ105_HTML.gif 4.39

where we already neglected those weights which are of no importance to the bound. The argument for the second graph in (4.39) is identical to the one we used in (4.38) and we find another finite collection of graphs GΓ such that

graphic file with name 220_2019_3657_Equ106_HTML.gif 4.40

where the weighted edge carries the weight matrix K=PBtRQBB-1, which is according to Lemma 4.14 indeed scales like kabcN-1. The graphs ΓGΓ also satisfy W-Est(Γ)pσqW-Est(Γ) and all σ-cells in Γ except for the currently expanded one remain σ-cells in Γ.

It remains to consider the first graph in (4.39) in the situation where B does not have a bounded inverse. We compute the weight matrix of the PBtRPB interaction edge as

PBtdiag(pf)RPB=b(B)¯,·b(B)¯,l(B)¯l(B)¯diag(pf)Rl(B),·l(B),b(B)b(B)=b(B)pf(Rb(B))b(B)¯,l(B)¯l(B),·l(B)¯l(B),b(B)

which we separate into the scalar factor

b(B)pf(Rb(B))l(B),l(B)¯b(B)¯,l(B)¯l(B),b(B)

and the weighted edge

K=l(B),·l(B)¯l(B),l(B)¯ 4.41

which scales like kabcN-1 since l is 2-normalised and delocalised. Thus we can write

graphic file with name 220_2019_3657_Equ108_HTML.gif 4.42

Note that the B and B operators are not completely independent: According to Fact 1 it follows that for an interaction edge e=(u,v) associated with the matrix R the number of incoming G-edges in u is the same as the number of outgoing G-edges from v, and vice versa. Thus, according to (4.30), the B-operator at u comes with an S if and only if the B-operator at v comes also with an S. Furthermore, if the B-operator comes with an T, then the B-operator comes with an Tt, and vice versa. The distribution of the conjugation operators to B,B in (4.30), however, can be arbitrary. We now use the fact that the scalar factor in (4.42) can be estimated by σ+ρ+η/ρ (cf. Lemma A.2). Summarising the above arguments, from (4.37)–(4.42), the proof of Proposition 4.12 is complete.

Cusp Universality

The goal of this section is the proof of cusp universality in the sense of Theorem 2.3. Let H be the original Wigner-type random matrix with expectation A:=EH and variance matrix S=(sij) with sij:=Ehij-aij2 and T=(tij) with tij:=E(hij-aij)2. We consider the Ornstein Uhlenbeck process {H~t|t0} starting from H~0=H, i.e.

dH~t=-12(H~t-A)dt+Σ1/2[dBt],Σ[R]:=EWTr(WR) 5.1

which preserves expectation and variance. In our setting of deformed Wigner-type matrices the covariance operator Σ:CN×NCN×N is given by

Σ[R]:=SR+TRt.

The OU process effectively adds a small Gaussian component to H~t along the flow in the sense that H~t=A+e-t/2(H-A)+U~t in distribution with U~t being and independent centred Gaussian matrix with covariance Cov(U~)=(1-e-t/2)Σ. Due to the fullness Assumption (B) there exist small c,t such that U~t can be decomposed as U~t=ctU+Ut with UGUE and Ut Gaussian and independent of U for tt. Thus there exists a Wigner-type matrix Ht such that

H~t=Ht+ctU,St=S-ctSGUE,EHt=A,UGUE,SGUE[R]:=R=1NTrR 5.2

with U independent of Ht. Note that we do not define Ht as a stochastic process and we will use the representation (5.2) only for one carefully chosen t=N-1/2+ϵ. We note that Ht satisfies the assumption of our local law from Theorem 2.5. It thus follows that Gt:=(Ht-z)-1 is well approximated by the solution Mt=diag(Mt) to the MDE

-Mt-1=z-A+St[Mt].ρt(E):=limη0IMt(E+iη)π.

In particular, by setting t=0, M0 well approximates the resolvent of the original matrix H and ρ0=ρ is its self-consistent density. Note that the Dyson equation of H~t and hence its solution as well are independent of t, since they are entirely determined by the first and second moments of H~t that are the same A and S for any t. Thus the resolvent of H~t is well approximated by the same M0 and the self-consistent density of H~t is given by ρ0=ρ for any t. While H and H~t have identical self-consistent data, structurally they differ in a key point: H~t has a small Gaussian component. Thus the correlation kernel of the local eigenvalue statistics has a contour integral representation using a version of the Brézin–Hikami formulas, see Sect. 5.2.

The contour integration analysis requires a Gaussian component of size at least ctN-1/2 and a very precise description of the eigenvalues of Ht just above the scale of the eigenvalue spacing. This information will come from the optimal rigidity, Corollary 2.6, and the precise shape of the self-consistent density of states of Ht. The latter will be analysed in Sect. 5.1 where we describe the evolution of the density near the cusp under an additive GUE perturbation sU. We need to construct Ht with a small gap carefully so that after a relatively long time s=ct the matrix Ht+ctU develops a cusp exactly at the right location. In fact, we the process has two scales in the shifted variable ν=s-ct that indicates the time relative to the cusp formation. It turns out that the locations of the edges typically move linearly with ν, while the length of the gap itself scales like (-ν)+3/2, i.e. it varies much slower and we need to fine-tune the evolution of both.

To understand this tuning process, we fix t=N-1/2+ϵ and we consider the matrix flow sHt(s):=Ht+sU for any s0 and not just for s=ct. It is well known that the corresponding self-consistent densities are given by the semicircular flow. Equivalently, these densities can be described by the free convolution of ρt with a scaled semicircular distribution ρsc. In short, the self-consistent density of Ht(s) is given by ρsfc:=ρtsρsc, where we omitted t from the notation ρsfc since we consider t fixed. In particular we have ρ0fc=ρt, the density of Ht and ρctfc=ρ, the density of H~t=Ht+ctU as well as that of H. Hence, as a preparation to the contour integration, in Sect. 5.1 we need to describe the cusp formation along the semicircular flow. Before going into details, we describe the strategy.

Since in the sequel the densities ρsfc and their local minima and gaps will play an important role, we introduce the convention that properties of the original density ρ will always carry ρ as a superscript for the remainder of Sect. 5. In particular, the points c,e±,m and the gap size Δ from (2.4) and Theorem 2.3 will from now on be denoted by cρ,e±ρ,mρ and Δρ. In particular a superscript of ρ never denotes a power.

Proof strategy

First we consider case (i) when ρ, the self-consistent density associated with H, has an exact cusp at the point cρR. Note that cρ is also a cusp point of the self-consistent density of H~t for any t.

We set t:=N-1/2+ϵ. Define the functions

Δ(ν):=(2γ)2(ν/3)3/2andρmin(ν):=γ2ν/π

for any ν0. For s<ct denote the gap in the support of ρsfc close to cρ by [es-,es+] and its length by Δs:=es+-es-. In Sect. 5.1 we will prove that if ρ has an exact cusp in cρ as in (2.4a), then ρsfc has a gap of size ΔsΔ(ct-s), and, in particular, ρt=ρ0fc has a gap of size Δ0Δ(ct)t3/2, only depending on ct and γ. The distance of cρ from the gap is const·t. This overall shift will be relatively easy to handle, but notice that it must be tracked very precisely since the gap changes much slower than its location. For s>ct with s-ct=O1 we will similarly prove that ρsfc has no gap anymore close to cρ but a unique local minimum in ms of size ρsfc(ms)ρmin(s-ct).

Now we consider the case where ρ has no exact cusp but a small gap of size Δρ>0. We parametrize this gap length via a parameter tρ>0 defined by Δρ=Δ(tρ). It follows from the associativity (5.3b) of the free convolution that ρt has a gap of size Δ0Δ(ct+tρ).

Finally, the third case is where ρ has a local minimum of size ρ(mρ). We parametrize it as ρ(mρ)=ρmin(tρ) with 0<tρ<ct then it follows that ρt has a gap of size Δ0Δ(ct-tρ).

Note that these conclusions follow purely from the considerations in Sect. 5.1 for exact cusps and the associativity of the free convolution. We note that in both almost cusp cases tρ should be interpreted as a time (or reverse time) to the cusp formation.

In the final part of the proof in Sects. 5.25.3 we will write the correlation kernel of Ht+ctU as a contour integral purely in terms of the mesoscopic shape parameter γ and the gap size Δ0 of the density ρt associated with Ht. If Δ0Δ(ct), then the gap closes after time sct and we obtain a Pearcey kernel with parameter α=0. If Δ0Δ(ct+tρ) and tρN-1/2, then the gap does not quite close at time s=ct and we obtain a Pearcey kernel with α>0, while for Δ0Δ(ct-tρ) with tρN-1/2 the gap after time s=ct is transformed into a tiny local minimum and we obtain a Pearcey kernel with α<0. The precise value of α in terms of Δρ and ρ(mρ) are given in (2.6). Note that as an input to the contour integral analysis, in all three cases we use the local law only for Ht, i.e. in a situation when there is a small gap in the support of ρt, given by Δ0 defined as above in each case.

Free convolution near the cusp

In this section we quantitatively investigate the free semi-circular flow before and after the formation of cusp. We first establish the exact rate at which a gap closes to form a cusp, and the rate at which the cusp is transformed into a non-zero local minimum. We now suppose that ρ is a general density with a small spectral gap [e-,e+] whose Stieltjes transform m can be obtained from solving a Dyson equation. Let ρsc(x):=(4-x2)+/2π be the density of the semicircular distribution and let s0 be a time parameter. The free semicircular convolution ρsfc of ρ with sρsc is then defined implicitly via its Stieltjes transform

msfc(z)=m(ξs(z))=m(z+smsfc(z)),ξs(z):=z+smsfc(z),z,msfc(z)H. 5.3a

It follows directly from the definition that smsfc is associative in the sense that

ms+sfc(z)=ms(z+sms+sfc(z)),s,s0. 5.3b

Figure 1a illustrates the quantities in the following lemma. We state the lemma for scDOSs from arbitrary data pairs (A,S) satisfying the conditions in [10], i.e.

AC,cRS[R]CR 5.4

for any self-adjoint R=R and some constants c,C>0.

Fig. 1.

Fig. 1

(a) illustrates the evolution of ρsfc along the semicircular flow at two times 0<s<t<s before and after the cusp. We recall that ρ=ρ0fc and ρ=ρtfc. (b) shows the points ξs(es±) as well as their distances to the edges e0±

Lemma 5.1

Let ρ be the density of a Stieltjes transform m=M associated with some Dyson equation

-1=(z-A+S[M])M,

with (A,S) satisfying (5.4). Then there exists a small constant c, depending only on the constants in Assumptions (5.4) such that the following statements hold true. Suppose that ρ has an initial gap [e-,e+] of size Δ=e+-e-c. Then there exists some critical time t(Δ)2/3 such that mtfc has exactly one exact cusp in some point c with Inline graphic, and that ρtfc is locally around c given by (2.4a) for some γ>0. Considering the time evolution [0,2t]smsfc we then have the following asymptotics.

  • (i)
    After the cusp. For t<s2t, ρsfc has a unique non-zero local minimum in some point ms such that
    ρsfc(ms)=s-tγ2π[1+O[0](s-t)1/2],ms-c+(s-t)Rmsfc(ms)(s-t)3/2+1/4. 5.5a
    Furthermore, ms can approximately be found by solving a simple equation, namely there exists m~s such that
    graphic file with name 220_2019_3657_Equ115_HTML.gif 5.5b
  • (ii)
    Before the cusp. For 0s<t, the support of ρsfc has a spectral gap [es-,es+] of size Δs:=es+-es- near c which satisfies
    Δs=(2γ)2(t-s3)3/2[1+O[0](t-s)1/3]. 5.5c
    In particular we find that the initial gap Δ=Δ0 is related to t via Δ=(2γ)2(t/3)3/2[1+O[0](t-s)1/3].

Proof

Within the proof of the lemma we rely on the extensive shape analysis from [10]. We are doing so not only for the density ρ=ρ0fc and its Stieltjes transform, but also for ρsfc and its Stieltjes transform msfc for 0s2t. The results from [10] also apply here since msfc(z)=M(ξs(z)) can also be realized as the solution

-M(ξs(z))-1=z+sM(ξs(z))-A+S[M(ξs(z))]=z-A+(S+sSGUE)[M(ξs(z))]

to the Dyson equation with perturbed self-energy S+sSGUE. Since t1 it follows that the shape analysis from [10] also applies to ρsfc for any s[0,2t].

We begin with part (i). Set ν:=s-t, then for 0νt we want to find xν such that Imsfc has a local minimum in ms:=c+xν near c, i.e.

xν:=argminxImsfc(c+x),xνν.

First we show that xν with these properties exists and is unique by using the extensive shape analysis in [10]. Uniqueness directly follows from [10, Theorem 7.2(ii)]. For the existence, we set

aν(x):=Imfcs(c+x),bν(x):=Rmsfc(c+x),aν:=aν(xν),bν:=bν(xν).

Set δ:=Kν with a large constant K. Since a0(x)=Imt(c+x)x1/3, we have a0(±δ)δ1/3 and a0(0)=0. Recall from [10, Proposition 10.1(a)] that the map smsfc is 1/3-Hölder continuous. It then follows that aν(±δ)δ1/3+Oν1/3, while aν(0)ν1/3. Thus aν necessarily has a local minimum in (-δ,δ) if K is sufficiently large. This shows the existence of a local minimum with xνKνν.

We now study the function fν(x)=x+νbν(x) in a small neighbourhood around 0. From [10, Eqs. (7.62),(5.43)–(5.45)] it follows that

bν(x)=Rc1(x)+Oaν(x)-ic2(x)aν(x)+aν(x)2+Oaν(x)3+O1=c1(x)c2(x)2+aν(x)2+O1c2(x)+aν(x) 5.6

whenever aν(x)1, with appropriate real functions3c1(x)1 and c2(x)0. Moreover, c2(0)1 since c is an almost cusp point for msfc for any s[0,2t]. Thus it follows that bν(x)>0 whenever aν(x)+c2(x)1. Due to the 1/3-Hölder continuity4 of both aν(x) and c2(x) and aν(0)+c2(0)1, it follows that bν(x)>0 whenever x1. We can thus conclude that fν satisfies fν1 in some O1-neighbourhood of 0. As fν(0)ν we can conclude that there exists a root x~ν, fν(x~ν)=0 of size Inline graphic. With m~s:=c+x~ν we have thus shown the first equality in (5.5b).

Using (2.4a), we now expand the defining equation

aν(x)=Imtfc(c+x+νbν(x)+iνaν(x))

for the free convolution in the regime for those x sufficiently close to x~ν such that Inline graphic to find

aν(x)=3γ4/32πνaν(x)Rλ1/3+Oλ2/3(λ-x-νbν(x))2+(νaν(x))2dλ=3γ4/32πR(νaν(x))1/3λ1/3(λ-[x+νbν(x)]/νaν(x))2+1dλ+O(νaν(x))2/3=(νaν(x))1/3γ4/31+19x+νbν(x)νaν(x)2+Ox+νbν(x)νaν(x)4+(νaν(x))1/3,

i.e.

aν(x)=ν1/2γ21+19x+νbν(x)νaν(x)2+Ox+νbν(x)νaν(x)4+(νaν(x))1/33/2. 5.7

Note that (5.7) implies that νaν(x~ν)ν3/2, i.e. the last claim in (5.5b). We now pick some large K and note that from (5.7) it follows that aν(x~ν±Kν7/4)>aν(x~ν). Thus the interval [x~ν-Kν7/4,x~ν+Kν7/4] contains a local minimum of aν(x), but by the uniqueness this must then be xν. We thus have Inline graphic, proving the second claim in (5.5b). By 1/3-Hölder continuity of aν(x) and by aν(x~ν)ν1/2 from (5.7), we conclude that aν=aν(xν)ν1/2 as well. Using that x~ν+νbν(x~ν)=0 and bν1/ν from (5.6) and aν(x)ν, we conclude that xν+νbν(xν)ν7/4, i.e. the second claim in (5.5a). Plugging this information back into (5.7), we thus find aν=γ2ν(1+Oν1/2) and have also proven the first claim in (5.5a).

We now turn to part (5.5). It follows from the analysis in [10] that ρsfc exhibits either a small gap, a cusp or a small local minimum close to c. It follows from (i) that a cusp is transformed into a local minimum, and a local minimum cannot be transformed into a cusp along the semicircular flow. Therefore it follows that the support of ρsfc has a gap of size Δs=es+-es- between the edges es±. Evidently et-=et+=c, e0+-e0-=Δ0, e0±=e± and for s>0 we differentiate (5.3a) to obtain

(msfc)(z)1+s(msfc)(z)=m(z+smsfc(z))and concludem(ξs(es±))=1/s 5.8

by considering the zes± limit and the fact that ρsfc has a square root at edge (for s<t) hence (msfc) blows up at this point. Denoting the d/ds derivative by dot, from

ddsmsfc(es±)=m(ξs(es±))e˙s±+msfc(es±)+sddsmsfc(es±)=e˙s±+msfc(es±)s+ddsmsfc(es±)

we can thus conclude that e˙s±=-msfc(es±). This implies that the gap as a whole moves with linear speed (for non-zero msfc(es±)), and, in particular, the distance of the gap of ρ to c is an order of magnitude larger than the size of the gap. It follows that the size Δs:=es+-es- of the gap of ρsfc satisfies

Δ˙s=msfc(es-)-msfc(es+)=R[1x-es--1x-es+]ρsfc(x)dx=-ΔsRρsfc(x)(x-es-)(x-es+)dx.

We now use the precise shape of ρsfc close to es± according to (2.4b) which is given by

ρsfc(es±±x)=3(2γ)4/3Δs1/32π(1+O[0](t-t)1/3)Ψedge(x/Δs)+OΔs1/3Ψedge2(x/Δs), 5.9

where Ψedge defined in (2.4c) exhibits the limiting behaviour

limΔ0Δ1/3Ψedge(x/Δ)=x1/3/24/3.

Using (5.9), we compute

Δ˙s=-(1+O[0](t-s)1/3)3(2γ)4/3Δs1/3π0Ψedge(x)x(1+x)dx=-γ4/3(2Δs)1/31+O[0](t-s)1/3+Δs1/3, 5.10

where the (1+O[0](t-s)1/3) factor in (5.9) encapsulates two error terms; both are due to the fact that the shape factor γs of ρsfc from (2.4b) is not exactly the same as γ, i.e. the one for s=t. To track this error in γ we go back to [10]. First, σ in [10, Eq. (7.5a)] is of size (t-s)1/3 by the fact that σ vanishes at s=t and is 1/3-Hölder continuous according to [10, Lemma 10.5]. Secondly, according to [10, Lemma 10.5] the shape factor Γ (which is directly related to γ in the present context) is also 1/3-Hölder continuous and therefore we know that the shape factors of ρ at e0± are at most multiplicatively perturbed by a factor of (1+O[0](t-s)1/3). By solving the differential equation (5.10) with the initial condition Δt=0, the claim (5.5c) follows.

Besides the asymptotic expansion for gap size and local minimum we also require some quantitative control on the location of ξt(c), as defined in (5.3a), and some slight perturbations thereof within the spectral gap [e-,e+] of ρ. We remark the the point ξ:=ξt(c) plays a critical role for the contour integration in Sect. 5.2 since it will be the critical point of the phase function. From (5.5c) we recall that the gap size scales as t3/2 which makes it natural to compare distances on that scale. In the regime where tt all of the following estimates thus identify points very close to the centre of the initial gap.

Lemma 5.2

Suppose that we are in the setting of Lemma 5.1. We then find that ξt(c) is very close to the centre of [e-,e+] in the sense that

graphic file with name 220_2019_3657_Equ122_HTML.gif 5.11a

Furthermore, for 0tt we have that

graphic file with name 220_2019_3657_Equ123_HTML.gif 5.11b

Proof

We begin with proving (5.11a). For s<t we denote the distance of ξs(es±) to the edges e0± by Ds±:=±(e0±-ξs(es±)), cf. Fig. 1b. We have, by differentiating m(ξs(es±))=1/s from (5.8) that

D˙s±=ddsξs(es±),-1s2=m(ξs(es±))ddsξs(es±) 5.12

and by differentiating (5.3a),

(msfc)=m(ξs)ξs,ξs(msfc)=m(ξs)(ξs)3+(msfc)ξs,m(ξs)=(msfc)(1+s(msfc))3.

We now consider z=es±+iη with η0 and compute from (5.9), for any s<t,

limη0η(msfc)(z)=limη0ηRρsfc(x)(x-z)2dx=limη03η(2γ)4/3Δs1/32π0Ψedge(x/Δs)(x-iη)2dx=(2γ)4/323Δs1/6π0x1/2(x-i)2dx=(2γ)4/3i43Δs1/6

and

limη0η3/2(msfc)(z)=limη0η3/22Rρsfc(x)(x-z)3dx=limη03η3/2(2γ)4/3Δs1/3π0Ψedge(x/Δs)(x-iη)3dx=(2γ)4/33Δs1/6π0x1/2(x-i)3dx=(2γ)4/3i3/283Δs1/6.

Here we used that fact that the error terms in (5.9) become irrelevant in the η0 limit. We conclude, together with (5.12), that

m(ξs(es±))=±3(2Δs)1/3s3γ8/3,D˙s±=±(s2m(ξs(es±)))-1=sγ8/33(2Δs)1/3=sγ223t-s[1+O[0]t1/3].

Since D0-=D0+=0 and D˙s-D˙s+ it follows that, to leading order, Ds+Ds- and more precisely

Ds±=γ22t3/2-st-s-2tt-s33/2[1+O[0]t1/3].

In particular it follows that e0±-ξt(c)=[1+O[0]t1/3]2γ2t3/2/33/2. Together with the s=0 case from (5.5c) we thus find

graphic file with name 220_2019_3657_Equ292_HTML.gif

proving (5.11a).

We now turn to the proof of (5.11b) where we treat the small gap and small non-zero minimum separately. We start with the first inequality. We observe that (5.11a) in the setting where (ρ,t) are replaced by (ρt-tfc,t) implies

graphic file with name 220_2019_3657_Equ125_HTML.gif 5.13

Furthermore, we infer from the definition of ξ and the associativity (5.3b) of the free convolution that

ξt-t(c+tmtfc(c))=c+tmtfc(c)+(t-t)mt-tfc(c+tmtfc(c))=ξt(c)

and can therefore estimate

graphic file with name 220_2019_3657_Equ293_HTML.gif

just as claimed. In the last step we used (5.13) and the fact that

ξs(a)-ξs(b)a-b+sa-b1/3, 5.14

which directly follows from the definition of ξ and the 1/3-Hölder continuity of msfc.

Finally, we address the second inequality in (5.11b) and appeal to Lemma 5.1(i) to establish the existence of m~t+t such that

c-m~t+t=tRmt+tfc(m~t+t). 5.15

It thus follows from (5.5b) that Inline graphic and therefore from (5.14) that

graphic file with name 220_2019_3657_Equ294_HTML.gif

Using (5.15) twice, as well as the associativity (5.3b) of the free convolution and Imtfc(c)=0 we then further compute

ξt+t(m~t+t)-ξt(c)=m~t+t+(t+t)mt+tfc(m~t+t)-c-tmtfc(c)=tR[mtfc(c+itImt+tfc(m~t+t))-mtfc(c)]+i(t+t)Imt+tfc(m~t+t). 5.16

By Hölder continuity we can, together with (5.11a) and Imt+t(m~t+t)(t)1/2 from (5.5b), conclude that

graphic file with name 220_2019_3657_Equ295_HTML.gif

In the first term we used (5.14) and the second estimate of (5.5b). In the second term we used (5.16) together with Imt+t(m~t+t)(t)1/2 from (5.5b) and 1/3-Hölder continuity of mtfc. Finally, the last term was already estimated in the exact cusp case, i.e. in (5.11a).

Correlation kernel as contour integral

We denote the eigenvalues of Ht by λ1,,λN. Following the work of Brézin and Hikami (see e.g. [22, Eq. (2.14)] or [35, Eq. (3.13)] for the precise version used in the present context) the correlation kernel of H~t=Ht+ctU can be written as

K^Nt(u,v):=N(2πi)2ctΥdzΓdwexpNw2-2vw+v2-z2+2zu-u2/2ctw-ziw-λiz-λi,

where Υ is any contour around all λi, and Γ is any vertical line not intersecting Υ. With this notation, the k-point correlation function of the eigenvalues of H~t is given by

pk(N)(x1,,xk)=det(1NK^Nt(xi,xj))i,j[k].

Due to the determinantal structure we can freely conjugate KN with veN(ξv-v2/2)/ct for ξ:=ξct(b) to redefine the correlation kernel as

KNt(u,v):=N(2πi)2ctΥdzΓdwexpNw2-2v(w-ξ)-z2+2u(z-ξ)/2ctw-ziw-λiz-λi.

This redefinition KNt does not agree point-wise with the previous definition K^Nt, but gives rise to the same determinant, and in particular to the same k-point correlation function. Here b is the base point chosen in Theorem 2.3. The central result concerning the correlation kernel is the following proposition.

Proposition 5.3

Under the assumptions of Theorem 2.3, the rescaled correlation kernel

K~Nt(x,y):=1N3/4γKNtb+xN3/4γ,b+yN3/4γ 5.17

around the base point b chosen in (2.6) converges uniformly to the Pearcey kernel from (2.5) in the sense that

K~Nt(x,y)-Kα(x,y)CN-c

for x,y[-R,R]. Here R is an arbitrary large threshold, c>0 is some universal constant, C>0 is a constant depending only on the model parameters and R, and α is chosen according to (2.6).

Proof

We now split the contour Υ into two parts, one encircling all eigenvalues λi to the left of ξ=b+ctM(b), and the other one encircling all eigenvalues λi to the right of ξ, which does not change the value of KNt. We then move the vertical Γ contour so that it crosses the real axis in ξ. This does also not change the value KNt as the only pole is the one in z for which the residue reads

N(2πi)2ctΥdzexpNctγ(u-v)(z-ξ)=0.

We now perform a linear change of variables zξ+Δ0z, wξ+Δ0w in (5.17) to transform the contours Υ,Γ into contours

Γ^:=(Γ-ξ)/Δ0,Υ^:=(Υ-ξ)/Δ0 5.18

to obtain

K~Nt(x,y)=N1/4Δ0(2πi)2ctγΥ^dzΓ^dwexpΔ0N1/4(xz-yw)/ctγ+NΔ02[f~(w)-f~(z)]/ctw-z, 5.19

where

f~(z):=z22-ctΔ02ξξ+Δ0zGt(u)-Mt(ξ)du.

Here Δ0:=e0+-e0- indicates the length of the gap [e0-,e0+] in the support of ρt. From Lemma 5.1 with ρ=ρt and t=ct we infer Δ0t3/2N-3/4+3ϵ/2. In order to obtain (5.19) we used the relation ξ-b=ctmctfc(b)=ctMt(b+ctmctfc(b))=ctMt(ξ).

We begin by analysing the deterministic variant of f~(z),

f(z):=z22-ctΔ02ξξ+Δ0zMt(u)-Mt(ξ)du.

We separately analyse the large- and small-scale behaviour of f(z). On the one hand, using the 1/3-Hölder continuity of uMt(u), eq. (5.5c) and

ctΔ02ξξ+Δ0zMt(u)-Mt(ξ)dut(Δ0z)4/3Δ02z4/3.

we conclude the large-scale asymptotics

f(z)=z22+Oz4/3,z1. 5.20

We now turn to the small-scale z1 asymptotics. We first specialize Lemmas 5.1 and 5.2 to ρ=ρt and collect the necessary conclusions in the following Lemma.

Lemma 5.4

Under the assumptions of Theorem 2.3 it follows that ρt has a spectral gap [e0-,e0+] of size

Δ0=e0+-e0-=Δ(ct±tρ)1+Ot1/3,where±tρ:=0in case (i)3(Δρ)2/3/(2γ)4/3in case (ii)-π2ρ(mρ)2/γ4in case (iii). 5.21a

Furthermore, in all three cases we have that ξ is is very close to the centre of the gap in the support of ρt in the sense that

ξ-e0++e0-2=Ot3/2N-ϵ/2. 5.21b

Proof

We prove (5.21a)–(5.21b) separately in cases (i), (ii) and (iii).

  • (i)

    Here (5.21a) follows directly from (5.5c) with ρ=ρt, t=ct, s=0 and c=cρ. Furthermore (5.21b) follows from (5.11a) with ρ=ρt, t=ct and c=cρ.

  • (ii)

    We apply (5.5c) with ρ=ρ=ρctfc, t=tρ, s=0 to conclude that Δρ=(2γ)2(tρ/3)3/2[1+O[0](tρ)1/3], and that ρct+tρfc has an exact cusp in some point c. Thus (5.21a) follows from another application of (5.5c) with ρ=ρt, t=ct+tρ, s=0 and c=c. Furthermore, (5.21b) follows again from (5.11b) but this time with ρ=ρt, t=ct+tρ, t=tρ and et-t±=e±ρ, and using that t1/9N-ϵ/2 for sufficiently small ϵ.

  • (iii)

    From (5.5a) with ρ=ρt, t=ct-tρ, s=ct to conclude ρ(mρ)=[1+O[0](tρ)1/2]γ2tρ/π, and that ρct-tρ has an exact cusp in some point c. Finally, (5.21b) follows again from (5.11b) but with ρ=ρt, t=ct-tρ, t=tρ and mt+t=mρ, and using t/ttρ/ctN-ϵ and t1/12N-ϵ/2 for sufficiently small ϵ.

Equipped with Lemma 5.4 we can now turn to the small scale analysis of f(z) and write out the Stieltjes transform to find

f(z)=z22-ctΔ02Rξξ+Δ0zu-ξ(x-u)(x-ξ)ρt(x)dudx=z22-ctΔ0R0zu(x-u)xρt(ξ+Δ0x)dudx.

Note that these integrals are not singular since ρt(ξ+Δ0x) vanishes for x1/2. We now perform the u integration to find

f(z)=z22-ctΔ0Rlogx-log(x-z)-zxρt(ξ+Δ0x)dx. 5.22

By using the precise shape (5.9) (with s=0) of ρt close to the edges e0±, and recalling the gap size from (5.21a) and location of ξ from (5.21b) we can then write

f(z)=(1+O[0]t1/3)g~(z)+Oz2t1/3 5.23

with

g~(z):=z22-332π(1±tρ/ct)Rlogx-log(x-z)-zxΨedge(x-1/2)1x1/2dx

being the leading order contribution. Here ± indicates that the formula holds for all three cases (i), (ii) and (iii) simultaneously, where tρ=0 in case (i). The contribution of the error term in (5.9) to the integral in (5.22) is of order O[0]z2t1/2 using that logx-log(x-z)-z/x=O[0]z/x2 and that x1/2 on the support of ρt(ξ+Δ0x). By the explicit integrals

332π0Ψedge(x)(x+1/2)2dx=12,332π0Ψedge(x)(x+1/2)4dx=827

and a Taylor expansion of the logarithm log(x-z) we find that the quadratic term z2/2 almost cancels and we conclude the small-scale asymptotics

g~(z)=±tρctz22-4z427(1+Otρ/t)+Oz5,z1. 5.24

Contour deformations

We now argue that we can deform the contours Υ,Γ and thereby via (5.18) the derived contours Υ^,Γ^, in a way which bounds the sign of Rg away from zero along the contours. Here g(z) is the N-independent variant of g~(z) given by

graphic file with name 220_2019_3657_Equ138_HTML.gif 5.25

The topological aspect of our argument is inspired by the approach in [4244].

Lemma 5.5

For all sufficiently small δ>0 there exists K=K(δ) such that the following holds true. The contours Υ,Γ then can be deformed, without touching (suppρt+[-1,1])\{ξ} or each other, in such a way that the rescaled contours Υ^,Γ^ defined in (5.18) satisfy RgK on Υ^{z>δ} and Rg-K on Γ^{z>δ}. Furthermore, locally around 0 the contours can be chosen in such a way that

Γ^{zC|zδ}=(-iδ,iδ),Υ^{zC|zδ}=(-δeiπ/4,δeiπ/4)(-δe-iπ/4,δe-iπ/4). 5.26

Proof

Just as in (5.24) we have the expansion

g(z)=-4z427+Oz5,z1. 5.27

It thus follows that for some small δ>0, and

graphic file with name 220_2019_3657_Equ296_HTML.gif

we have Ω±1<,Ω±3<Ω+:={Rg>0} and Ω0<,Ω±2<,Ω4<Ω-:={Rg<0} in agreement with Fig. 2c. For large z, however, it also follows from (5.20) together with (5.25) and (5.23) that for some large R, and

Ωk>:={zC|z>R,(k-1)π4+δ<argz<(k+1)π4+δ}

we have Ω0>,Ω4>Ω+ and Ω±2>Ω-, in agreement with Fig. 2a. We denote the connected component of Ω± containing some set A by cc(A).

  • Claim 1cc(Ω0>),cc(Ω4>) are the only two unbounded connected components of Ω+ Suppose there was another unbounded connected component A of Ω+. Since Ω±2>Ω- we would be able to find some z0A with arbitrarily large Rz0. If Rz0>0, then we note that the map xRg(z0+x) is increasing, and otherwise we note that the map xRg(z0-x) is increasing. Thus it follows in both cases that the connected component A actually coincides with cc(Ω0>) or with cc(Ω4>), respectively.

  • Claim 2cc(Ω±2>)are the only two unbounded connected components of Ω- This follows very similarly to Claim 1.

  • Claim 3cc(Ω±1<),cc(Ω±2<),cc(Ω±3<)are unbounded We note that the map zRg(z) is harmonic on C\([1/2,)(-,-1/2]) and subharmonic on C. Therefore it follows that cc(Ω±1<),cc(Ω±3<)Ω+ are unbounded. Since these sets are moreover symmetric with respect to the real axis it then also follows that cc(Ω±2)((-,-1/2][1/2,))=. This implies that Rg(z) is harmonic on cc(Ω±2<) and consequently also that cc(Ω±2<) are unbounded.

  • Claim 4cc(Ω1<)=cc(Ω-1<)=cc(Ω0>)and cc(Ω3<)=cc(Ω-3<)=cc(Ω4>) This follows from Claims 1–3.

  • Claim 5cc(Ω2<)=cc(Ω2>)and cc(Ω-2<)=cc(Ω-2>) This also follows from Claims 1–3.

Fig. 2.

Fig. 2

Representative cusp analysis. (a) and (c) show the level set Rg(z)=0. On a small scale g(z)z4, while on a large scale g(z)z2. (b) shows the final deformed and rescaled contours Υ^ and Γ^. (c) furthermore shows the cone sections Ωk> and Ωk<, where we for clarity do not indicate the precise area thresholds given by δ and R. We also do not specifically indicate Ωk< for k=±1,±2,±3 as then cc(Ωk<)=cc(Ωk>), cf. Claims 4–5 in the proof of Lemma 5.5

The claimed bounds on Rg now follow from Claims 4–5 and compactness. The claimed small scale shape (5.26) follows by construction of the sets Ωk<.

From Lemmas 5.5 and 2.8 it follows that KNt and thereby also K~Nt remain, with overwhelming probability, invariant under the chosen contour deformation. Indeed, KNt only has poles where z=w or z=λi for some i. Due to self-adjointness and Lemma 5.5, z=λi can only occur if λi=ξ or dist(λi,suppρt)>1. Both probabilities are exponentially small as a consequence of Lemma 2.8, since for the former we have ηf(ξ)N-3/4+ϵ/6 according to (2.7), while dist(ξ,suppρt)N-3/4+3ϵ/2.

For zΓ^Υ^ it follows from (5.26) that we can estimate

graphic file with name 220_2019_3657_Equ141_HTML.gif 5.28

Indeed, for (5.28) we used (5.26) to obtain dist(Ru,suppρt)t3/2, so that Inline graphic follows from the local law from (2.8b).

We now distinguish three regimes: zN-ϵ/2, N-ϵ/2z1 and finally z1 which we call microscopic, mesoscopic and macroscopic. We first consider the latter two regimes as they only contribute small error terms.

Macroscopic regime.

If either zδ or wδ, it follows from Lemma 5.5 that Rg(w)-K and/or Rg(z)K, and therefore together with (5.23),(5.25) and (5.28) that Rf~(w)-K and/or Rf~(z)K with overwhelming probability. Using Δ0N-3/4+3ϵ/2 from (5.21a), we find that NΔ02/ctN2ϵ and Δ0N1/4/ctγNϵ/2, so that the integrand in (5.19) in the considered regime is exponentially small.

Mesoscopic regime.

If either δzN-ϵ/2 or δwN-ϵ/2, then Rg(w)-w4-N-2ϵ and/or Rg(z)z4N-2ϵ from (5.27). Thus it follows from (5.23) and (5.25) that also Rf(w)-N-2ϵ and/or Rf(z)N-2ϵ and by (5.28) that with overwhelming probability Rf~(w)-N-2ϵ and/or Rf~(z)N-2ϵ. Since 1/w-z is integrable over the contours it thus follows that the contribution to K~Nt(x,y), as in (5.19), from zw with either zN-ϵ/2 or wN-ϵ/2 is negligible.

Microscopic regime.

We can now concentrate on the important regime where z+wN-ϵ/2 and to do so perform another change of variables zctγz/Δ0N1/4N-ϵ/2z, wctγw/Δ0N1/4N-ϵ/2w which gives rise to two new contours

Γ^:=Δ0N1/4ctγΓ^,Υ^:=Δ0N1/4ctγΥ^,

as depicted in Fig. 2B, and the kernel

K~Nt(x,y)=1(2πi)2Υ^dzΓ^dwexpxz-yw+NΔ02ct[f~(ctγwΔ0N1/4)-f~(ctγzΔ0N1/4)]w-z. 5.29

We only have to consider wz with w+z1 in (5.29) since t/Δ0N1/4N-ϵ/2 and the other regime has already been covered in the previous paragraph before the change of variables.

We now separately estimate the errors stemming from replacing f~(z) first by f(z), then by g~(z) and finally by ±tρz2/2ct-4z4/27. We recall that Δ0t3/2=N-3/4+3ϵ/2 from (5.21a), tρN-1/2 from the definition of tρ in (5.21a), and that t=N-1/2+ϵ which will be used repeatedly in the following estimates. According to (5.28), we have

NΔ02ctf~(ctγzΔ0N1/4)-f(ctγzΔ0N1/4)NΔ02ttΔ0N1/4N-2ϵzN-ϵ/2. 5.30a

Next, from (5.23) we have

NΔ02ctf(ctγzΔ0N1/4)-g~(ctγzΔ0N1/4)t1/3ctγzΔ0N1/42NΔ02ct+t1/3NΔ02ctN-1/6+7ϵ/3. 5.30b

Finally, we have to estimate the error from replacing g~(z) by its Taylor expansion with (5.24) and find

NΔ02ctg~(ctγzΔ0N1/4)-±tρ2ct(ctγzΔ0N1/4)2+427(ctγzΔ0N1/4)4N-ϵ/2. 5.30c

Finally, from (5.21a) and the definition of α from (2.6) we obtain that

NΔ02ct±tρ2ctctγzΔ0N1/42-427ctγzΔ0N1/44=αz22-z44[1+O[0]t1/3]. 5.30d

From (5.30) and the integrability of 1/z-w for small zw along the contours we can thus conclude

K~Nt(x,y)=(1+ON-c)1(2πi)2Υ^dzΓ~dwexz-yw+z4/4-αz2/2-w4/4+αw2/2w-z. 5.31

Furthermore, it follows from (5.26) that, as N, the contours Υ^,Γ^ are those depicted in Fig. 2b, i.e.

Υ^=(-eiπ/4,eiπ/4)(-e-iπ/4,e-iπ/4),Γ^:=(-i,i).

We recognize (5.31) as the extended Pearcey kernel from (2.5).

It is easy to see that all error terms along the contour integration are uniform in xy running over any fixed compact set. This proves that K~Nt(x,y) converges to Kα(x,y) uniformly in xy in a compact set. This completes the proof of Proposition 5.3.

Green function comparison

We will now complete the proof of Theorem 2.3 by demonstrating that the local k-point correlation function at the common physical cusp location τ0 of the matrices H~t does not change along the flow (5.1). Together with Proposition 5.3 this completes the proof of Theorem 2.3. A version of this continuity of the matrix Ornstein-Uhlenbeck process with respect to the local correlation functions that is valid in the bulk or at regular edges is the third step in the well known three step approach to universality [38]. We will present this argument in the more general setup of correlated random matrices, i.e. in the setting of [34]. In particular, we assume that the cumulants of the matrix elements wab satisfy the decay conditions [34, Assumptions (C,D)], an assumption that is obviously fulfilled for deformed Wigner-type matrices.

We claim that the k-point correlation function pk(N) of H=H~0 and the corresponding k-point correlation function p~k,t(N) of H~t stay close along the OU-flow in the sense that

RkF(x)Nk/4pk(N)b+xγN3/4-p~k,t(N)b+xγN3/4dx1dxk=ON-c, 5.32

for ϵ>0, tN-1/4-ϵ, smooth functions F and some constant c=c(k,ϵ), where b is the physical cusp point. The proof of (5.32) follows the standard arguments of computing t-derivatives of products of traces of resolvents G~(t)=(H~t-z) at spectral parameters z just below the fluctuation scale of eigenvalues, i.e. for IzN-ζηf(Rz). Since the procedure detailed e.g. in [38, Chapter 15] is well established and not specific to the cusp scaling, we keep our explanations brief.

The only cusp-specific part of the argument is estimating products of random variables

Xt=Xt(x):=N1/4IG~(t)(b+γ-1N-3/4x+iN-3/4-ζ)

and we claim that

E[j=1kXt(xj)-j=1kX0(xj)]N-c 5.33

as long as tN-1/4-ϵ for some c=c(k,ϵ,ζ). For simplicity we first consider k=1 and find from Itô’s Lemma that

EdXtdt=E[-12αwααXt+12α,βκ(α,β)αβXt], 5.34

which we further compute using a standard cumulant expansion, as already done in the bulk regime in [34, Proof of Corollary 2.6] and in the edge regime in [11, Section 4.2]. We recall that κ(α,β), and more generally κ(α,β1,,βk) denote the joint cumulants of the random variables wα,wβ and wα,wβ1,,wβk, respectively, which accordingly scale like N-1 and N-(k+1)/2. Here greek letters α,β[N]2 are double indices. After cumulant expansion, the leading term in (5.34) cancels, and the next order contribution is

α,β1,β2κ(α,β1,β2)E[αβ1β2Xt],

with N-3/2 being the size of the cumulant κ(α,β1,β2). With α=(a,b) and βi=(ai,bi) we then estimate

N-3/4a,b,ca1,b1,a2,b2κ(ab,a1b1,a2b2)EG~ca(t)G~ba1(t)G~b1a2(t)G~b2c(t)N-3/4-3/2+2+3/4+ζIG~(t)3G~(t)32,

where we used the Ward-identity and that maxαβ1,β2κ(α,β1,β2)N-3/2. We now use that according to [34, Proof of Prop. 5.5], ηηG~(t)p and similarly ηηIG~(t)p are monotonically increasing with η=N-3/4+ζ to find IG~(t)ppN3ζ-1/4 and G~(t)ppN3ζ from the local law from Theorem 2.5 and the scaling of ρ at η. Since all other error terms can be handled similarly and give an even smaller contribution it follows that

EdXtdtN1/4+Cζand similarly, but more generally,Eddtj=1kXt(xj)N1/4+Ckζ, 5.35

for some constant C>0. Now (5.33) and therefore (5.32) follow from (5.35) as in [38, Theorem 15.3] using the choice t=N-1/2+ϵN-1/4-ϵ and choosing ζ sufficiently small.

Acknowledgements

Open access funding provided by Institute of Science and Technology (IST Austria). The authors are very grateful to Johannes Alt for numerous discussions on the Dyson equation and for his invaluable help in adjusting [10] to the needs of the present work.

Appendix A. Technical lemmata

Lemma A.1

Let CN×N be equipped with a norm ·. Let A:CN×N×CN×NCN×N be a bilinear form and let B:CN×NCN×N a linear operator with a non-degenerate isolated eigenvalue β. Denote the spectral projection corresponding to β by P and by Q the one corresponding to the spectral complement of β, i.e.

P:=-limϵ012πiBϵ(β)dωB-ω=Vl,·Vr,Q:=1-P,

where Vr is the eigenmatrix corresponding to β and Vl,· a linear functional. Assume that for some positive constant λ>1 the bounds

A+B-1Q+Vl,·+Vrλ, A.1

are satisfied, where we denote the induced norms on linear operators, linear functionals and bilinear forms on CN×N by the same symbol ·. Then there exists a universal constant c>0 such that for any δ(0,1) and any Y,XCN×N with Y+Xcλ-4 that satisfies the quadratic equation

B[Y]-A[Y,Y]+X=0, A.2

the following holds: The scalar quantity

Θ:=Vl,Y,

fulfils the cubic equation

μ3Θ3+μ2Θ2+μ1Θ+μ0=λ12OδΘ3+Θ4+δ-2X3, A.3

with coefficients

μ3=Vl,A[Vr,B-1QA[Vr,Vr]]+A[B-1QA[Vr,Vr],Vr]μ2=Vl,A[Vr,Vr]μ1=-Vl,A[B-1Q[X],Vr]+A[Vr,B-1Q[X]]-βμ0=Vl,A[B-1Q[X],B-1Q[X]]-X. A.4

Furthermore,

Y=ΘVr-B-1Q[X]+Θ2B-1QA[Vr,Vr]+λ7OΘ3+ΘX+X2. A.5

Here, the constants implicit in the O-notation depend on c only.

Proof

We decompose Y as

Y=Y1+Y2,Y1=ΘVr-B-1Q[X],Y2=Q[Y]+B-1Q[X].

Then (A.2) takes the form

ΘβVr+P[X]+BQ[Y2]=A[Y,Y]. A.6

We project both sides with Q, invert B and take the norm to conclude

Y2=λ2O(Y12+Y22),

Then we use the smallness of Y2 by properly choosing δ and the definition of Y1 to infer Y2=λ4O2, where we introduced the notation

Ok=O(Θk+Xk).

Inserting this information back into (A.6) and using Θ+X=O(λ-3) reveals

Y2=B-1QA[Y1,Y1]+λ7O3. A.7

In particular, (A.5) follows. Plugging (A.7) into (A.6) and applying the projection P yields

ΘβVr+P[X]=P[A[Y1,Y1]+A[Y1,Y2]+A[Y2,Y1]]+λ11O4=P[A[Y1,Y1]+A[Y1,B-1QA[Y1,Y1]]+A[B-1QA[Y1,Y1],Y1]]+λ11O4.

For a linear operator K1 and a bilinear form K2 with K1+K21 we use the general bounds

ΘK2[R,R]δΘ3+δ-1/2R3,Θ2K1[R]δΘ3+δ-2R3,

for any RCN×N and δ>0 to find

ΘβVr+P[X]=P[A[ΘVr-B-1Q[X],ΘVr-B-1Q[X]]+Θ3A[Vr,B-1QA[Vr,Vr]]+Θ3A[B-1QA[Vr,Vr],Vr]]+λ8O(δΘ3+λ3Θ4+δ-2X3),

which proves (A.3).

Proof of Lemma 3.3

Due to the asymptotics Ψedgemin{λ1/2,λ1/3} and Ψminmin{λ2,λ1/3} and the classification of singularities in (2.4), we can infer the following behaviour of the self-consistent fluctuation scale from Definition 2.4. There exists a constant c>0 only depending on the model parameters such that we have the following asymptotics. First of all, in the spectral bulk we trivially have that ηf(τ)N-1 as long as τ is at least a distance of c>0 away from local minima of ρ. In the remaining cases we use the explicit shape formulae from (2.4) to compute ηf directly from Definition 2.4.

  1. Non-zero local minimum or cusp. Let τ be the location of a non-zero local minimum ρ(τ)=ρ0>0 or a cusp ρ(τ)=ρ0=0. Then
    ηf(τ+ω)1/(Nmax{ρ0,ω1/3}),max{ρ0,ω1/3}>N-1/4,N-3/4,max{ρ0,ω1/3}N-1/4, A.8a
    for ω(-c,c).
  2. Edge. Let τ=e± be the position of a left/right edge at a gap in suppρ(e±-κ,e±+κ) of size Δ(0,κ] (cf. (2.4b)). Then
    ηf(e±±ω)N-3/4,ωΔN-3/4,Δ1/6/ω1/2N,Δ1/9/N2/3<ωΔ,Δ1/9/N2/3,ωΔ1/9/N2/3,Δ>N-3/4,N-3/4,Δ<ωN-3/4,1/ω1/3N,ωN-3/4,ω>Δ, A.8b
    for ω[0,c).

The claimed bounds in Lemma 3.3 now follow directly from (3.7e) and (A.8) by distinguishing the respective regimes.

Proof of Lemma 4.8

We start from (4.7) and estimate all vertex weights w(v), interaction matrices R(e) and weight matrices K(e) trivially by

graphic file with name 220_2019_3657_Equ297_HTML.gif

to obtain

Val(Γ)CV+IE+WENn(Γ)-V(vVavJ)eGEGe1.

We now choose the vertex ordering V={v1,,vm} as in Lemma 4.5. In the first step we partition the set of G-edges into three parts GE=E1E2E3: the edges not adjacent to vm, E1=GE\N(vm), the non-Wardable edges adjacent to vm, E2=GEN(vm)\GEW and the Wardable edges adjacent to vm, E3=GEWN(vm). By the choice of ordering it holds that E32. We introduce the shorthand notation GEi=eEiGe and use the general Hölder inequality for any collection of random variables {XA} and {YA} indexed by some arbitrary index set A

AAXAYAqAAXAq1A1/q2maxAAYAq2,1q=1q1+1q2

to compute

av1,,avm-1GE1avmGE2GE3qN(m-1)/q2av1,,avm-1GE1q1maxa1,,avm-1(avmGE32q2N1/2q2maxavmGE22q2),

where we choose 1/q=1/q1+1/q2 in such a way that q2p/cϵ. Since E32 we can use (4.14a) to estimate

avmGE32q2N(ψ2q2)E3N(ψ+ψ2q2)E3

and it thus follows from

GE22q2eE2Ge2E2q2=G-M2E2q2E2GEg-mG2E2q2E2\GEg-m

that

av1,,avm-1GE1avmGE2GE3qNϵ/cav1,,avm-1GE1q1N(ψ+ψq)E3(ψ+ψq+ψq)E2GEg-m(1+Gq)E2 A.9

for q2q2GE. By using (A.9) inductively m=Vcp times it thus follows that

(vVavJ)eGEGe1NpϵNV(ψ+ψq)GEW(ψ+ψq+ψq)GEg-m(1+Gq)GE,

proving the lemma.

Lemma A.2

For the coefficient in (4.42) we have the expansion

b(B)pf(Rb(B))l(B),l(B)¯b(B)¯,l(B)¯l(B),b(B)=cσFm-2f2+O(ρ+η/ρ), A.10

for some c1, provided B-1C for some large enough constant C>0.

Proof

Recall from the explanation after (4.42) that R=S,T,Tt if R=S,Tt,T, respectively. As we saw in the proof of Lemma 4.14, in the case R=T,Tt in the complex Hermitian symmetry class, the operator B as well as B has a bounded inverse. Since we assume that B-1 is large, we have R=R=S, which also includes the real symmetric symmetry class. In particular, we also have (B)-1C and all subsequent statements hold simultaneously for B and B. We call f(S) the normalised eigenvector corresponding to the eigenvalue with largest modulus of F(S):=MSM, recalling M=diag(m). Since B=M(1-F(S)+O(ρ))M-1 we can use perturbation theory of F(S) to analyse spectral properties of B. In particular, we find

b(B)=Mf(S)+O(ρ),l(B)=M-1f(S)+O(ρ),B-1QB=M(1-F(S))-1(1-Pf(S))M-1+O(ρ), A.11

where Pf(S) is the orthogonal projection onto the f(S) direction. The error terms are measured in ·-norm. For the expansions (A.11) we used that F has a spectral gap in the sense that

Spec(F(S)/F(S))[-1+c,1-c]{1},

for some constant c>0, depending only on model parameters. By using (A.11) we see that the lhs. of (A.10) becomes ±(f(S))2pfF(S)m-2(f(S))2+Oρ. To complete the proof of the Lemma we note that f(S)=f/f+Oη/ρ according to [10, Eq. (5.10)].

Footnotes

1

See Appendix B of arXiv:1809.03971v2 for details.

2

This equivalent property is commonly known as having a colouring number of at most k+1, see e.g.  [39].

3

We have c1=π/ψ, c2=2σ/ψ with the notations ψ,σ in [10], where ψ1 and σ1 near the almost cusp, but we refrain from using these letters in the present context to avoid confusions.

4

See [10, Lemma 5.5] for the 1/3-Hölder continuity of quantities ψ,σ in the definition of c2.

L. Erdős: Partially supported by ERC Advanced Grant No. 338804.

T. Krüger: Partially supported by the Hausdorff Center for Mathematics.

D. Schröder: Partially supported by the IST Austria Excellence Scholarship.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

László Erdős, Email: lerdos@ist.ac.at.

Torben Krüger, Email: torben-krueger@uni-bonn.de.

Dominik Schröder, Email: dschroed@ist.ac.at, Email: dschroeder@ethz.ch.

References

  • 1.Adlam, B., Che, Z.: Spectral statistics of sparse random graphs with a general degree distribution. Preprint (2015). arXiv:1509.03368
  • 2.Adler M, Cafasso M, van Moerbeke P. From the Pearcey to the Airy process. Electron. J. Probab. 2011;16(36):1048–1064. [Google Scholar]
  • 3.Adler M, Ferrari PL, van Moerbeke P. Airy processes with wanderers and new universality classes. Ann. Probab. 2010;38:714–769. [Google Scholar]
  • 4.Adler M, van Moerbeke P. PDEs for the Gaussian ensemble with external source and the Pearcey distribution. Commun. Pure Appl. Math. 2007;60:1261–1292. [Google Scholar]
  • 5.Ajanki, O.H., Erdős, L., Krüger, T.: Quadratic vector equations on complex upperhalf-plane. Mem. Amer. Math. Soc. 261(1261), v+133 (2019)
  • 6.Ajanki OH, Erdős L, Krüger T. Singularities of solutions to quadratic vector equations on the complex upper half-plane. Commun. Pure Appl. Math. 2017;70:1672–1705. [Google Scholar]
  • 7.Ajanki OH, Erdős L, Krüger T. Stability of the matrix Dyson equation and random matrices with correlations. Probab. Theory Relat. Fields. 2019;173:293–373. [Google Scholar]
  • 8.Ajanki OH, Erdős L, Krüger T. Universality for general Wigner-type matrices. Probab. Theory Relat. Fields. 2017;169:667–727. [Google Scholar]
  • 9.Alt, J., Erdős, L., Krüger, T.: Spectral radius of random matrices with independent entries. Preprint (2019). arXiv:1907.13631
  • 10.Alt, J., Erdős, L., Krüger, T.: The Dyson equation with linear self-energy: spectral bands, edges and cusps. Preprint (2018). arXiv:1804.07752
  • 11.Alt, J., Erdős, L., Krüger, T., Schröder, D.: Correlated random matrices: Band rigidity and edge universality. Ann. Probab. (2018). arXiv:1804.07744 (to appear)
  • 12.Anderson PW. Absence of diffusion in certain random lattices. Phys. Rev. 1958;109:1492–1505. [Google Scholar]
  • 13.Baik, J., Kriecherbauer, T., McLaughlin, K.T.-R., Miller, P.D.: Discrete Orthogonal Polynomials, vol. 64. Annals of Mathematics Studies, Asymptotics and Applications, pp . viii+170. Princeton University Press, Princeton, NJ (2007)
  • 14.Bauerschmidt R, Huang J, Knowles A, Yau H-T. Bulk eigenvalue statistics for random regular graphs. Ann. Probab. 2017;45:3626–3663. [Google Scholar]
  • 15.Bekerman F, Figalli A, Guionnet A. Transport maps for β-matrix models and universality. Commun. Math. Phys. 2015;338:589–619. [Google Scholar]
  • 16.Borodin A, Okounkov A, Olshanski G. Asymptotics of Plancherel measures for symmetric groups. J. Am. Math. Soc. 2000;13:481–515. [Google Scholar]
  • 17.Bourgade P, Erdős L, Yau H-T. Edge universality of beta ensembles. Commun. Math. Phys. 2014;332:261–353. [Google Scholar]
  • 18.Bourgade P, Erdős L, Yau H-T. Universality of general β-ensembles. Duke Math. J. 2014;163:1127–1190. [Google Scholar]
  • 19.Bourgade P, Erdős L, Yau H-T, Yin J. Universality for a class of random band matrices. Adv. Theor. Math. Phys. 2017;21:739–800. [Google Scholar]
  • 20.Bourgade, P., Yau, H.-T., Yin, J.: Random band matrices in the delocalized phase, I: quantum unique ergodicity and universality. Preprint (2018). arXiv:1807.01559
  • 21.Brézin E, Hikami S. Level spacing of random matrices in an external source. Phys. Rev. E. 1998;3(58):7176–7185. [Google Scholar]
  • 22.Brézin E, Hikami S. Universal singularity at the closure of a gap in a random matrix theory. Phys. Rev. E. 1998;3(57):4140–4149. [Google Scholar]
  • 23.Capitaine M, Péché S. Fluctuations at the edges of the spectrum of the full rank deformed GUE. Probab. Theory Relat. Fields. 2016;165:117–161. [Google Scholar]
  • 24.Cipolloni G, Erdős L, Krüger T, Schröder D. Cusp universality for random matrices II: the real symmetric case. Pure Appl. Anal. 2019;1(4):615–707. [Google Scholar]
  • 25.Cipolloni, G., Erdős, L., Schröder, D.: Edge universality for non-Hermitian random matrices. Preprint (2019). arXiv:1908.00969 [DOI] [PMC free article] [PubMed]
  • 26.Claeys T, Kuijlaars ABJ, Liechty K, Wang D. Propagation of singular behavior for Gaussian perturbations of random matrices. Commun. Math. Phys. 2018;362:1–54. [Google Scholar]
  • 27.Claeys T, Neuschel T, Venker M. Boundaries of sine kernel universality for Gaussian perturbations of Hermitian matrices. Random Matrices Theory Appl. 2019;8:1950011, 50. [Google Scholar]
  • 28.Deift P, Kriecherbauer T, McLaughlin KT-R. New results on the equilibrium measure for logarithmic potentials in the presence of an external field. J. Approx. Theory. 1998;95:388–475. [Google Scholar]
  • 29.Deift P, Kriecherbauer T, McLaughlin KT-R, Venakides S, Zhou X. Uniform asymptotics for polynomials orthogonal with respect to varying exponential weights and applications to universality questions in random matrix theory. Commun. Pure Appl. Math. 1999;52:1335–1425. [Google Scholar]
  • 30.Deift P, Gioev D. Universality at the edge of the spectrum for unitary, orthogonal, and symplectic ensembles of random matrices. Commun. Pure Appl. Math. 2007;60:867–910. [Google Scholar]
  • 31.Duse E, Johansson K, Metcalfe A. The cusp-Airy process. Electron. J. Probab. 2016;21:50. [Google Scholar]
  • 32.Erdős L, Knowles A, Yau H-T, Yin J. Spectral statistics of Erdős–Renyi graphs II: eigenvalue spacing and the extreme eigenvalues. Commun. Math. Phys. 2012;314:587–640. [Google Scholar]
  • 33.Erdős L, Knowles A, Yau H-T, Yin J. The local semicircle law for a general class of random matrices. Electron. J. Probab. 2013;18(59):58. [Google Scholar]
  • 34.Erdős L, Krüger T, Schröder D. Random matrices with slow correlation decay. Forum Math. Sigma. 2019;7:e8, 89. [Google Scholar]
  • 35.Erdős L, Péché S, Ramírez JA, Schlein B, Yau H-T. Bulk universality for Wigner matrices. Commun. Pure Appl. Math. 2010;63:895–925. [Google Scholar]
  • 36.Erdős L, Schlein B, Yau H-T. Universality of random matrices and local relaxation flow. Invent. Math. 2011;185:75–119. [Google Scholar]
  • 37.Erdős L, Schnelli K. Universality for random matrix flows with time-dependent density. Ann. Inst. Henri Poincaré Probab. Stat. 2017;53:1606–1656. [Google Scholar]
  • 38.Erdős, L., Yau, H.-T.: A Dynamical Approach to Random Matrix Theory, Vol. 28, Courant Lecture Notes in Mathematics, Courant Institute of Mathematical Sciences, pp. ix+226. American Mathematical Society, Providence, RI (2017)
  • 39.Erdős P, Hajnal A. On chromatic number of graphs and set-systems. Acta Math. Acad. Sci. Hung. 1966;17:61–99. [Google Scholar]
  • 40.Geudens, D., Zhang, L.: Transitions between critical kernels: from the tacnode kernel and critical kernel in the two-matrix model to the Pearcey kernel. International Mathematics Research Notices IMRN 5733–5782 (2015)
  • 41.Guionnet A, Huang J. Rigidity and edge universality of discrete β-ensembles. Comm. Pure Appl. Math. 2019;72(9):1875–1982. [Google Scholar]
  • 42.Hachem, W., Hardy, A., Najim, J.: A survey on the eigenvalues local behavior of large complex correlated Wishart matrices. In: Modelisation Aleatoire et Statistique—Journées MAS 2014, vol. 51, ESAIM Proceedings Surveys, EDP Sciences, Les Ulis, pp. 150–174 (2015)
  • 43.Hachem W, Hardy A, Najim J. Large complex correlated Wishart matrices: fluctuations and asymptotic independence at the edges. Ann. Probab. 2016;44:2264–2348. [Google Scholar]
  • 44.Hachem W, Hardy A, Najim J. Large complex correlated Wishart matrices: the Vearcey kernel and expansion at the hard edge. Electron. J. Probab. 2016;21:36. [Google Scholar]
  • 45.He Y, Knowles A. Mesoscopic eigenvalue statistics of Wigner matrices. Ann. Appl. Probab. 2017;27:1510–1550. [Google Scholar]
  • 46.Helton, J. W., Rashidi Far, R., Speicher, R.: Operator-valued semicircular elements: solving a quadratic matrix equation with positivity constraints. International Mathematics Research Notices IMRN, Art. ID rnm086, 15 (2007)
  • 47.Huang J, Landon B, Yau H-T. Bulk universality of sparse random matrices. J. Math. Phys. 2015;56:123301, 19. [Google Scholar]
  • 48.Johansson K. Discrete orthogonal polynomial ensembles and the Plancherel measure. Ann. Math. (2) 2001;153:259–296. [Google Scholar]
  • 49.Johansson K. Universality of the local spacing distribution in certain ensembles of Hermitian Wigner matrices. Commun. Math. Phys. 2001;215:683–705. [Google Scholar]
  • 50.Khorunzhy AM, Khoruzhenko BA, Pastur LA. Asymptotic properties of large random matrices with independent entries. J. Math. Phys. 1996;37:5033–5060. [Google Scholar]
  • 51.Knowles A, Yin J. Anisotropic local laws for random matrices. Probab. Theory Relat. Fields. 2017;169:257–352. [Google Scholar]
  • 52.Krishnapur M, Rider B, Virág B. Universality of the stochastic Airy operator. Commun. Pure Appl. Math. 2016;69:145–199. [Google Scholar]
  • 53.Landon B, Yau H-T. Convergence of local statistics of Dyson Brownian motion. Commun. Math. Phys. 2017;355:949–1000. [Google Scholar]
  • 54.Landon, B., Yau, H.-T.: Edge statistics of Dyson Brownian motion. Preprint (2017). arXiv:1712.03881
  • 55.Lee JO, Schnelli K. Edge universality for deformed Wigner matrices. Rev. Math. Phys. 2015;27:1550018, 94. [Google Scholar]
  • 56.Lee JO, Schnelli K. Local law and Tracy-Widom limit for sparse random matrices. Probab. Theory Relat. Fields. 2018;171:543–616. [Google Scholar]
  • 57.Lee JO, Schnelli K, Stetler B, Yau H-T. Bulk universality for deformed Wigner matrices. Ann. Probab. 2016;44:2349–2425. [Google Scholar]
  • 58.Lick DR, White AT. k-degenerate graphs. Can. J. Math. 1970;22:1082–1096. [Google Scholar]
  • 59.Mehta ML. Random Matrices and the Statistical Theory of Energy Levels. New York: Academic Press; 1967. p. x+259. [Google Scholar]
  • 60.Okounkov A, Reshetikhin N. Random skew plane partitions and the Vearcey process. Commun. Math. Phys. 2007;269:571–609. [Google Scholar]
  • 61.Pastur L, Shcherbina M. Bulk universality and related properties of Hermitian matrix models. J. Stat. Phys. 2008;130:205–250. [Google Scholar]
  • 62.Pastur L, Shcherbina M. On the edge universality of the local eigenvalue statistics of matrix models. Mat. Fiz. Anal. Geom. 2003;10:335–365. [Google Scholar]
  • 63.Pearcey T. The structure of an electromagnetic field in the neighbourhood of a cusp of a caustic. Philos. Mag. 1946;7(37):311–317. [Google Scholar]
  • 64.Shcherbina M. Change of variables as a method to study general β-models: bulk universality. J. Math. Phys. 2014;55:043504, 23. [Google Scholar]
  • 65.Shcherbina M. Edge universality for orthogonal ensembles of random matrices. J. Stat. Phys. 2009;136:35–50. [Google Scholar]
  • 66.Sodin S. The spectral edge of some random band matrices. Ann. Math. (2) 2010;172:2223–2251. [Google Scholar]
  • 67.Soshnikov A. Universality at the edge of the spectrum in Wigner random matrices. Commun. Math. Phys. 1999;207:697–733. [Google Scholar]
  • 68.Tao T, Vu V. Random matrices: universality of local eigenvalue statistics. Acta Math. 2011;206:127–204. [Google Scholar]
  • 69.Tao T, Vu V. Random matrices: universality of local eigenvalue statistics up to the edge. Commun. Math. Phys. 2010;298:549–572. [Google Scholar]
  • 70.Tracy CA, Widom H. Level-spacing distributions and the Airy kernel. Commun. Math. Phys. 1994;159:151–174. [Google Scholar]
  • 71.Tracy CA, Widom H. On orthogonal and symplectic matrix ensembles. Commun. Math. Phys. 1996;177:727–754. [Google Scholar]
  • 72.Tracy CA, Widom H. The Pearcey process. Commun. Math. Phys. 2006;263:381–400. [Google Scholar]
  • 73.Valkó B, Virág B. Continuum limits of random matrices and the Brownian carousel. Invent. Math. 2009;177:463–508. [Google Scholar]

Articles from Communications in Mathematical Physics are provided here courtesy of Springer

RESOURCES