Limits of spiked random matrices II

Alex Bloemendal, Bálint Virág

Introduction

Johnstone (2001) proposed the spiked population model for simple trends in high dimensional data. One takes a data matrix XX whose columns are i.i.d. vectors with (population) covariance a fixed rank perturbation of the identity, and studies the behaviour of the largest eigenvalues of the sample covariance matrix XX∗XX^{*} when both the dimension and the size of the sample are large. Baik, Ben Arous and Péché (2005) (hereafter BBP) discovered a very interesting phase transition phenomenon in the complex Gaussian setting. Small spikes do not affect the asymptotic behaviour of the top eigenvalues, which display the usual Tracy–Widom fluctuations around the upper edge of the Marchenko–Pastur law; large spikes, however, lead to outliers with Gaussian fluctuations. New structure emerges near the transition point with near-critical spikes deforming the soft edge limit. Understanding this transition regime in the real case remained open for some time. There is a parallel development for fixed rank additive perturbations of Wigner matrices.

In Bloemendal and Virág (2013) (hereafter Part I), we considered rank one spiked real/complex/quaternion Wishart matrices and additive rank one perturbations of the Gaussian orthogonal, unitary and symplectic ensembles. Our approach is based on the continuum operator limit at the general beta soft edge developed in Ramírez, Rider and Virág (2011) (hereafter RRV). We introduced general β\beta analogues of the rank one spiked models, modifying the tridiagonal ensembles of Dumitriu and Edelman (2002) and extended the RRV technology to describe the soft-edge scaling limit in terms of the stochastic Airy operator

We went on to characterize the limit laws in terms of the diffusion from RRV and in terms of an associated second-order linear parabolic PDE. We further showed that at β=2,4\beta=2,4 the PDE is related to known Painlevé II representations originating in Baik and Rains (2000) and gave new proofs of these, finally recovering those of the undeformed Tracy–Widom laws.

Even the existence of limiting distributions in the critical regime was in general new for β≠2\beta\neq 2, though see the prior work of Wang (2008) on the rank one β=4\beta=4 case at w=0w=0, as well as the subsequent work of Mo (2012) offering a more standard treatment of the rank one β=1\beta=1 case. Forrester (2013) comments on all three works and gives an alternative interpretation and construction of our general β\beta rank one spiked model.

Here, we deal with rr “spikes”, or general bounded-rank perturbations of Gaussian and Wishart matrices. To do so, we introduce a new “canonical form for perturbations in a fixed subspace”, a (2r+1)(2r+1)-diagonal band form that has a purely algebraic interpretation. It generalizes the Dumitriu–Edelman forms and is able to handle rank rr perturbations. We then develop a generalization of the methods of RRV and Part I to a matrix-valued setting: block tridiagonal matrices converge to a half-line Schrödinger operator with matrix-valued potential, the spikes once again appearing in the boundary condition. We treat the real, complex and quaternion (β=1,2,4\beta=1,2,4) cases simultaneously. Once again, even the existence of a near-critical soft-edge limit is new off β=2\beta=2. Unlike in Part I, however, we do not define a general β\beta version of either matrix model, nor of the limiting operator; in Section 2, we will see that the higher rank versions of these objects do not readily admit a β\beta-generalization.

Dyson’s Brownian motion makes a surprise appearance, providing nice SDE and PDE characterizations of the limit laws—new rr parameter deformations of Tracy–Widom(β\beta)—in which β\beta reappears as a simple parameter. The derivation makes use of the matrix-valued version of classical Sturm oscillation theory and the Riccati transformation. In a short final section, we report on preliminary evidence that at β=2\beta=2 the PDE can be connected with a Painlevé II representation of Baik (2006) for these distributions (which appeared originally in BBP in the form of Fredholm determinants).

We highlight two more features of our approach beyond the novelty of bypassing formulas for joint eigenvalue densities and handling β=1,2,4\beta=1,2,4 together. First, we treat the perturbation as a parameter. By this, we mean that all perturbations in a fixed subspace are considered jointly (on the same probability space); this picture is carried through to the limit, which is therefore a family of point processes parameterized by an r×rr\times r matrix. Second, we allow more general scalings than those considered in BBP. Most importantly, in the Wishart case we do not require the two dimensional parameters n,pn,p to have a positive limiting ratio but rather allow them to tend to infinity together arbitrarily.

To state our results, we introduce some objects and notation that will be used throughout the paper.

The result is a (2r+1)(2r+1)-diagonal matrix with positive outer diagonals. For Gaussian and null Wishart ensembles, the change of basis interacts well with the Gaussian structure; this observation goes back to Trotter (1984) in the r=1r=1 case. In the GO/U/SE case, we take v1,…,vrv_{1},\ldots,v_{r} to be the initial coordinate basis vectors, while in the Wishart case we use the initial rows of the data matrix XX. As in Part I, the key observation is then that the perturbations commute with the change of basis.

For the (unperturbed) Gaussian ensembles, the band form looks like

In Section 4, we apply this result to the band forms just described, proving a process central limit theorem for the potential and verifying the required tightness assumptions. The limiting operator turns out to be a multidimensional version of the stochastic Airy operator, which we now describe.

where Bx′B^{\prime}_{x} is “standard matrix white noise”, the derivative of a standard matrix Brownian motion, and rxrx is scalar. (Here, again β\beta is restricted to the classical values, as the noise term lacks a straightforward β\beta-generalization.) The potential is thus the derivative of a continuous matrix-valued function; rigorous definitions will appear in Section 3 in a more general setting.

For now it is enough to know that, together with a general self-adjoint boundary condition

For concreteness, we record that the eigenvalues Λ0≤Λ1≤…\Lambda_{0}\leq\Lambda_{1}\leq\dots and corresponding eigenfunctions f0,f1,…f_{0},f_{1},\dots of Hβ,W\mathcal{H}_{\beta,W} are given, respectively, by the minimum and any minimizer in the recursive variational problem

Here, candidates ff are only considered if the first integral and boundary term are finite; the stochastic integral can then be defined pathwise via integration by parts. The eigenvalues and eigenfunctions are thus jointly defined random processes indexed over WW.

We note one important property of the eigenvalue processes, namely the pathwise monotonicity of Λk\Lambda_{k} in WW with respect to the usual matrix partial order. This is immediate from the variational characterization and the fact that the objective functional is monotone in WW. (For the higher eigenvalues, it is most apparent from the standard min–max formulation of the variational problem.)

then, jointly for k=1,2,…k=1,2,\dots in the sense of finite-dimensional distributions,

where Λ0≤Λ1≤…\Lambda_{0}\leq\Lambda_{1}\leq\dots are the eigenvalues of Hβ,W\mathcal{H}_{\beta,W}. Convergence holds jointly over {Pn},W\{P_{n}\},W satisfying the condition.

then, jointly for k=1,2,…k=1,2,\dots in the sense of finite-dimensional distributions,

where Λ0≤Λ1≤…\Lambda_{0}\leq\Lambda_{1}\leq\dots are the eigenvalues of Hβ,W\mathcal{H}_{\beta,W}. Convergence holds jointly over {Σn,p},W\{\Sigma_{n,p}\},W satisfying the condition.

for k=0,1,….k=0,1,\ldots. Write simply Fβ=Fβ0F_{\beta}=F_{\beta}^{0} for the ground state distribution (limiting largest eigenvalue law). Once again, the generalization from Part I is not straightforward. The proofs are contained in Section 5.

Let P⁡x0,(w1,…,wr)\operatorname{\mathbf{P}}_{x_{0},(w_{1},\ldots,w_{r})} be the measure on paths (p1,…,pr):[x0,∞)→(−∞,∞]r(p_{1},\ldots,p_{r}):[x_{0},\infty)\to(-\infty,\infty]^{r} determined by the coupled diffusions

with initial conditions pi(x0)=wip_{i}(x_{0})=w_{i} and entering into {p1<⋯<pr}\{p_{1}<\cdots<p_{r}\}, where b1,…,brb_{1},\ldots,b_{r} are independent standard Brownian motions; particles pip_{i} may explode to −∞-\infty in finite time whereupon they are restarted at +∞+\infty. Then

We describe the diffusion more carefully in Section 5, asserting that it determines a law on paths valued in an appropriate space. Probabilistic arguments lead to the following reformulation in terms of its generator.

Furthermore, FβF_{\beta} is “continuous to the boundary” as one or several wi→+∞w_{i}\to+\infty. For subsequent eigenvalue laws Fβk(x;w1,…,wr)F_{\beta}^{k}(x;w_{1},\ldots,w_{r}), (8) is replaced with the recursive boundary condition

At β=2\beta=2, these distributions were obtained in BBP in the form of Fredholm determinants of finite-rank perturbations of the Airy kernel. Baik (2006) derived Painlevé II formulas, and by a symbolic computation with a computer algebra system we were able to verify that the latter satisfy the PDE (6) for r=2,3,4,5r=2,3,4,5; details are described in Section 6. A pencil-and-paper proof for all rr was found since the initial posting [Bloemendal and Baik (2013)].

We make two final remarks. From the finite nn matrix models it is clear that the “rank rr deformed” limiting distributions Fβ,r(x;w1,…,wr)F_{\beta,r}(x;w_{1},\ldots,w_{r}) reduce to those for a lower rank r0<rr_{0}<r in the following way:

Unfortunately, this reduction relation is not readily apparent from any of our characterizations (operator, SDE or PDE).

Lastly, the SDE and PDE characterizations seem to make sense for all β>0\beta>0 (although one has to be careful for β<1\beta<1). It would be interesting to find natural “general β\beta multi-spiked models” at finite nn, interpolating between those studied here at β=1,2,4\beta=1,2,4 and generalizing those introduced in Part I for r=1r=1. At β=2\beta=2, perhaps one could discover a relationship with formulas of Baik and Wang (2013).

A canonical form for perturbation in a fixed subspace

In Part I, we observed that the tridiagonal models of Gaussian and Wishart matrices were amenable to rank one perturbation. In this section, we introduce a banded (also block tridiagonal) generalization amenable to higher-rank perturbation. We first describe it as a natural object of pure linear algebra; we then show how it interacts with the structure of Gaussian and Wishart random matrices to produce the band forms displayed in the \hyperref[sec1]Introduction.

We begin with a geometric, coordinate-free formulation.

Proof of Theorem 2.1 We give an explicit inductive construction. Along the way, we will see that the uniqueness condition holds precisely when the choice is forced at each step.

It is convenient to restate the properties of the orthonormal basis in the theorem in the following equivalent way: for r+1≤i≤nr+1\leq i\leq n, we have ⟨vi,Tvi−r⟩≥0\langle v_{i},Tv_{i-r}\rangle\geq 0 and Tvi−r∈span⁡{v1,…,vi}Tv_{i-r}\in\operatorname{span}\{v_{1},\ldots,v_{i}\}. Suppose inductively thatv1,…,vk−1v_{1},\ldots,v_{k-1} have been obtained for some r+1≤k≤nr+1\leq k\leq n, satisfying the preceding conditions for r+1≤i≤k−1r+1\leq i\leq k-1. Let w=Tvk−rw=Tv_{k-r}; we must choose vkv_{k} so that ⟨vk,w⟩≥0\langle v_{k},w\rangle\geq 0 and w∈span⁡{v1,…,vk}w\in\operatorname{span}\{v_{1},\ldots,v_{k}\}. There are two cases to consider. If w∉span⁡{v1,…,vk−1}w\notin\operatorname{span}\{v_{1},\ldots,v_{k-1}\} then vkv_{k} must be a multiple of w′=w−∑i=1k−1⟨vi,w⟩viw^{\prime}=w-\sum_{i=1}^{k-1}\langle v_{i},w\rangle v_{i}; the positivity condition further forces vk=w′/∣w′∣v_{k}=w^{\prime}/|w^{\prime}|, which gives ⟨vk,w⟩=∣w′∣>0\langle v_{k},w\rangle=|w^{\prime}|>0. If w∈span⁡{v1,…,vk−1}w\in\operatorname{span}\{v_{1},\ldots,v_{k-1}\}, then any vk∈{v1,…,vk−1}⊥v_{k}\in\{v_{1},\ldots,v_{k-1}\}^{\perp} will do, and in this case ⟨vk,w⟩=0\langle v_{k},w\rangle=0.

When uniqueness holds, as is generically the case, the basis may also be obtained by applying the Gram–Schmidt process to the first nn vectors of the sequence

We now state and prove a concrete matrix formulation in which the first rr coordinate vectors play the role of v1,…,vrv_{1},\ldots,v_{r}. The point of the second proof is that it emphasizes the resulting band matrix rather than the change of basis; the algorithm will be used in the next subsection.

Furthermore, if strict positivity holds in (11) then UU and BB as such are unique.

Proof of Theorem 2.3 We prove existence by giving an explicit algorithm; it generalizes the Lanczos algorithm, which applies in the case r=1r=1.

Stop when k=n−rk=n-r. Let U=Un−r⋯U1U=U_{n-r}\cdots U_{1} and B=Bn−r=UAU†B=B_{n-r}=UAU^{\dagger}.

2 Perturbed Gaussian and spiked Wishart models

The change of basis described above interacts very nicely with the Gaussian structure in Gaussian and Wishart random matrices. The r=1r=1 case of this observation is due to Trotter (1984), who described the tridiagonal forms explicitly. His forms fall into the framework of Theorem 2.1 by taking the initial vector to be fixed in the Gaussian case, and taking it to be the top row of the data matrix in the Wishart case. As we observed in Part I, the change of basis commutes with rank one additive perturbations for the Gaussian case and with rank one spiking for the Wishart case. We now extend the story to the r>1r>1 setting.

In the Gaussian case, we will be perturbing in a fixed (nonrandom) subspace; without loss of generality this may be taken as the initial rr-dimensional coordinate subspace, and so we take the basis of Theorem 2.1 that begins with the first rr standard basis vectors. We can therefore obtain the band form by a direct application of the algorithm from the proof of Theorem 2.3. The Wishart case is a little more complicated; here we want to perturb in the random subspace spanned by the first rr rows of the data matrix. Our new basis will begin with the Gram–Schmidt orthogonalization of these initial rows. As in the r=1r=1 case, it is most transparent to construct a lower band form of the data matrix first, afterward realizing the band Jacobi form as its multiplicative symmetrization. In both the Gaussian and the Wishart cases, we will see that the uniqueness condition of Theorem 2.1 holds almost surely.

Let AA be an n×nn\times n GOE matrix. Applying the algorithm from the proof of Theorem 2.3 while keeping track of the distribution of the matrix BkB_{k} at each step—the key of course being the unitary invariance of standard Gaussian vectors—yields the following band Jacobi random matrix G=UAU†G=UAU^{\dagger}:

As expected the perturbation shows up undisturbed in the upper-left r×rr\times r corner of GG.

Continue in this way until the rows and columns both run out (stop alternating if one runs out before the other).

The resulting L=Vn∧(p−r)⋯V1XU1⋯Un∧pL=V_{n\wedge(p-r)}\cdots V_{1}XU_{1}\cdots U_{n\wedge p} has n∧pn\wedge p nonzero columns and (n+r)∧p(n+r)\wedge p nonzero rows, which can be described as follows:

where we have ignored the issue of truncation in the final rr rows and columns (g′sg^{\prime}s and χ′s\chi^{\prime}s with indices beyond the allowed range should simply be zero). The change of basis is thus U1⋯Un∧pU_{1}\cdots U_{n\wedge p}; a little thought shows that, as claimed earlier, the new basis begins with the orthogonalization of the first rr rows of XX. Since the form (16) satisfies the uniqueness condition of Theorem 2.1 a.s., the basis is indeed the one given by the theorem.

where L=VXUL=VXU and L0=VX0UL_{0}=VX_{0}U. The point is that same change of basis works in the rank rr spiked case, and by the lower band structure of L0L_{0}, the perturbation shows up in the upper-left r×rr\times r corner:

Viewed in terms of the algorithm used to produce LL, the point is that the first rr rows of XX are never “mixed” together or with the lower rows, but only “rotated” within themselves.

Limits of block tridiagonal matrices

The banded forms of Section 2 may also be considered as block tridiagonal matrices with r×rr\times r blocks. In this section, we give general conditions under which such random matrices, appropriately scaled, converge at the soft spectral edge to a random Schrödinger operator on the half-line with r×rr\times r matrix-valued potential and general self-adjoint boundary condition at the origin. In Section 4, we verify these assumptions for the two specific matrix models we consider.

Proposition 3.7 establishes that the limiting operator is a.s. bounded below with purely discrete spectrum via a variational principle. The main result is Theorem 3.9, which asserts that the low-lying states of the discrete models converge to those of the operator limit.

The scalar r=1r=1 case of Part I, based in turn on RRV, serves as a prototype. Care is required throughout to adapt the arguments to the matrix-valued setting, and we give a self-contained treatment.

respectively; the sub-diagonal process is of course the conjugate transpose of the super-diagonal process. (We could have absorbed WnW_{n} into Yn,1Y_{n,1} as an additive constant, but keep it separate for reasons that will soon be clear. Note also that the upper-left block has mn2m_{n}^{2} rather than 2mn22m_{n}^{2}.) We refer to HnH_{n} as a rank rr block tri-diagonal ensemble.

As in RRV and Part I, convergence rests on a few key assumptions on the potential and boundary terms just introduced. By choice, no additional scaling will be required. The role of the convergence in the first and third assumption below will be clear as soon as we define the continuum limit. The growth and oscillation bounds of the second assumption (and the lower bound implied by the third) ensure tightness of the low-lying states; in particular, they guarantee that the spectrum remains discrete and bounded below in the limit.

with respect to the compact-uniform topology (defined using any matrix norm).

(so △nYn,i=ηn,i+△nωn,i\triangle_{n}Y_{n,i}=\eta_{n,i}+\triangle_{n}\omega_{n,i}) with ηn,i;j≥0\eta_{n,i;j}\geq 0 (as matrices), such that for some deterministic scalar continuous nondecreasing unbounded functions η‾(x)>0\overline{\eta}(x)>0, ζ(x)≥1\zeta(x)\geq 1 not depending on nn, and random constants κn≥1\kappa_{n}\geq 1 defined on the same probability spaces, the following hold: the κn\kappa_{n} are tight in distribution, and for each nn we have almost surely

2 Reduction to deterministic setting

In the next subsection, we will define a limiting object in terms of Y(x)Y(x) and WW; we want to prove that the discrete models converge to this continuum limit in law. We reduce the problem to a deterministic convergence statement as follows. First, select any subsequence. It will be convenient to extract a further subsequence so that certain additional tight sequences converge jointly in law; Skorokhod’s representation theorem [see Ethier and Kurtz (1986)] says this convergence can be realized almost surely on a single probability space. We may then proceed pathwise.

In detail, consider (1)–(25). Note in particular that nonnegativity of the ηn,i\eta_{n,i} and the upper bound of (23) give that for i=1,2i=1,2 the piecewise linear process {∫0xηn,i}x≥0\{\int_{0}^{x}\eta_{n,i}\}_{x\geq 0} is tight in distribution, pointwise with respect to the spectral norm and in fact compact-uniformly. Given a subsequence, we pass to a further subsequence so that the following distributional limits exist jointly:

for i=1,2i=1,2, where convergence in the first two lines is in the compact-uniform topology. We realize (3.2) pathwise a.s. on some probability space and continue in this deterministic setting.

We will assume this subsequential pathwise coupling for the remainder of the section.

3 Limiting object and variational characterization

Formally, the limiting object is the eigenvalue problem

We thus have a completely general homogeneous linear self-adjoint boundary condition. We refer to span⁡{ui:i>r0}\operatorname{span}\{u_{i}:i>r_{0}\} as the Dirichlet subspace and the corresponding fif_{i} as Dirichlet components; they will require special treatment in what follows.

where the Dirichlet part of the last term is interpreted as zero. Formally, the form H(⋅,⋅)\mathcal{H}(\cdot,\cdot) is just the usual one ⟨⋅,H⋅⟩\langle\cdot,\mathcal{H}\cdot\rangle associated with the operator H\mathcal{H}; the potential term has been integrated by parts and the boundary condition “built in”. See also Remark 3.5 below.

The regularity and decay conditions naturally associated with this form are given by the following weighted Sobolev norm:

where the positive part of WW is defined as W+=∑i=1rwi+uiui†W^{+}=\sum_{i=1}^{r}w_{i}^{+}u_{i}u_{i}^{\dagger} with w+=w∨0w^{+}=w\vee 0. [Define the negative part similarly with wi−=−(w∧0)w_{i}^{-}=-(w\wedge 0), so that W=W+−W−W=W^{+}-W^{-}.] We refer to ∥⋅∥∗\|\cdot\|_{*} as the L∗L^{*} norm and define an associated Hilbert space L∗L^{*} as the closure of C0∞C_{0}^{\infty} under this norm. (The formal Dirichlet terms are again interpreted to be zero, but they can also be thought of as imposing the Dirichlet condition.) We record some basic facts about L∗L^{*}.

Any f∈L∗f\in L^{*} is uniformly \mboxHo¨lder(1/2)\mbox{H\"{o}lder}(1/2)-continuous and satisfies ∣f(x)∣2≤2∥f′∥∥f∥|f(x)|^{2}\leq 2\|f^{\prime}\|\|f\| ≤∥f∥∗2\leq\|f\|_{*}^{2} for all xx; furthermore, fi(0)=0f_{i}(0)=0 for i>r0i>r_{0}.

We have ∣f(y)−f(x)∣=∣∫xyf′∣≤∥f′∥∣y−x∣1/2|f(y)-f(x)|=|\int_{x}^{y}f^{\prime}|\leq\|f^{\prime}\||y-x|^{1/2}. For f∈C0∞f\in C_{0}^{\infty} we have ∣f(x)∣2=−∫x∞2Re⁡f†f′≤2∥f∥∥f′∥≤∥f∥∗2|f(x)|^{2}=-\int_{x}^{\infty}2\operatorname{Re}f^{\dagger}f^{\prime}\leq 2\|f\|\|f^{\prime}\|\leq\|f\|_{*}^{2}; an L∗L^{*}-bounded sequence in C0∞C_{0}^{\infty}, therefore, has a compact-uniformly convergent subsequence, so we can extend this bound to f∈L∗f\in L^{*} and also conclude the behaviour in the Dirichlet components.

Every L∗L^{*}-bounded sequence has a subsequence converging in the following modes: (i) weakly in L∗L^{*}, (ii) derivatives weakly in L2L^{2}, (iii) uniformly on compacts and (iv) in L2L^{2}.

(i) and (ii) are just Banach–Alaoglu; (iii) is the previous fact and Arzelà–Ascoli again; (iii) implies L2L^{2} convergence locally, while the uniform bound on ∫η‾∣fn∣2\int\overline{\eta}|f_{n}|^{2} produces the uniform integrability required for (iv). Note that the weak limit in (ii) really is the derivative of the limit function, as one can see by integrating against functions 1[0,x]\mathbf{1}_{[0,x]} and using pointwise convergence.

By the bound in Fact 3.1 with x=0x=0, the boundary term in (32) could be done away with. It is natural to include the term, however, when considering all WW simultaneously and viewing the Dirichlet case as a limiting case. More importantly, it clarifies the role of the boundary terms in the following key bound.

For every 0<c<1/κ0<c<1/\kappa there is a C>0C>0 such that, for each b>0b>0, the following holds for all W≥−bW\geq-b and all f∈C0∞f\in C_{0}^{\infty}:

In particular, H(⋅,⋅)\mathcal{H}(\cdot,\cdot) extends uniquely to a continuous symmetric bilinear form on L∗×L∗L^{*}\times L^{*}.

For the first three terms of (31), we use the decomposition Y=∫η+ωY=\int\eta+\omega from the previous subsection. Integrating the ∫η\int\eta term by parts, (27) easily yields

Break up the ω\omega term as follows. The moving average ω‾x=∫xx+1ω\overline{\omega}_{x}=\int_{x}^{x+1}\omega is differentiable with ω‾x′=ωx+1−ωx\overline{\omega}_{x}^{\prime}=\omega_{x+1}-\omega_{x}; writing ω=ω‾+(ω−ω‾)\omega=\overline{\omega}+(\omega-\overline{\omega}), we have

By (28), max⁡(∣ωξ−ωx∣,∣ωξ−ωx∣2)≤Cε+εη‾(x)\max(|\omega_{\xi}-\omega_{x}|,|\omega_{\xi}-\omega_{x}|^{2})\leq C_{\varepsilon}+\varepsilon\overline{\eta}(x) for ∣ξ−x∣≤1|\xi-x|\leq 1, where ε\varepsilon can be made small. In particular, the first term above is bounded absolutely by ε∥f∥∗2+Cε∥f∥2\varepsilon\|f\|_{*}^{2}+C_{\varepsilon}\|f\|^{2}. Averaging, we also get ∣ω‾x−ωx∣≤(Cε+εη‾(x))1/2|\overline{\omega}_{x}-\omega_{x}|\leq(C_{\varepsilon}+\varepsilon\overline{\eta}(x))^{1/2}; Cauchy–Schwarz then bounds the second term absolutely by ε∫0∞∣f′∣2+1ε∫0∞(Cε+εη‾)∣f∣2\sqrt{\varepsilon}\int_{0}^{\infty}|f^{\prime}|^{2}+\frac{1}{\sqrt{\varepsilon}}\int_{0}^{\infty}{(C_{\varepsilon}+\varepsilon\overline{\eta})|f|^{2}} and thus by ε∥f∥∗2+Cε′∥f∥2\sqrt{\varepsilon}\|f\|_{*}^{2}+C_{\varepsilon}^{\prime}\|f\|^{2}. Now combine all the terms and set ε\varepsilon small to obtain a version of (33) with the boundary terms omitted (from both the form and the norm).

We break the boundary term in (31) into its positive and negative parts. For the negative part, Fact 3.2 gives ∣f(0)∣2≤(ε/b)∥f′∥2+(b/ε)∥f∥2|f(0)|^{2}\leq(\varepsilon/b)\|f^{\prime}\|^{2}+(b/\varepsilon)\|f\|^{2}; W−≤bW^{-}\leq b then implies that

which may be subtracted from the inequality already obtained. For the positive part f(0)†W+f(0)f(0)^{\dagger}W^{+}f(0), use the fact that c≤1≤Cc\leq 1\leq C to simply add it in. We thus arrive at (33).

For the L∗L^{*} bilinear form bound, begin with the quadratic form bound ∣H(f,f)∣≤Cc,b∥f∥∗2|\mathcal{H}(f,f)|\leq C_{c,b}\|f\|^{2}_{*}; it is a standard Hilbert space fact that it may be polarized to a bilinear form bound [see, e.g., Section 18 of Halmos (1951)].

We say f∈L∗f\in L^{*} is an eigenfunction with eigenvalue Λ\Lambda if f≠0f\neq 0 and for all φ∈C0∞\varphi\in C_{0}^{\infty} we have

Note that (34) then automatically holds for all φ∈L∗\varphi\in L^{*}, by L∗L^{*}-continuity of both sides.

This definition represents a weak or distributional version of the problem (3.3). As further justification, integrate by parts to write the definition

(For a Dirichlet component fif_{i} the restriction on test functions implies that ⟨φi′,1⟩=0\langle\varphi^{\prime}_{i},1\rangle=0, so the first boundary term on the right-hand side is replaced with an arbitrary constant.) Now (35) shows that f′f^{\prime} has a continuous version, and the equation may be taken to hold everywhere. In particular, ff satisfies the boundary condition of (3.3) classically. [For a Dirichlet component, we just find that the arbitrary constant is fi′(0)f_{i}^{\prime}(0).] One can also view (35) as a straightforward integrated version of the eigenvalue equation in which the potential term has been interpreted via integration by parts. This equation will be useful in Lemma 3.6 below and is the starting point for the development in Section 5.

We now characterize the eigenvalues and eigenfunctions variationally. As usual, it follows from the symmetry of the form that eigenvalues are real (and eigenfunctions with distinct eigenvalues are L2L^{2}-orthogonal). The L2L^{2} part of the lower bound in (33) says the spectrum is bounded below. The rest of (33) implies that there are only finitely many eigenvalues below any given level: a sequence of normalized eigenfunctions with bounded eigenvalues must have an L2L^{2}-convergent subsequence by Fact 3.2. At a given level, more is true.

By linearity, it suffices to show a solution of (35) with f′(0)=f(0)=0f^{\prime}(0)=f(0)=0 must vanish identically. Integrate by parts to write

which implies that ∣f′(x)∣≤C(x)∫0x∣f′∣|f^{\prime}(x)|\leq C(x)\int_{0}^{x}|f^{\prime}| with some C(x)<∞C(x)<\infty increasing in xx. Gronwall’s lemma then gives ∣f′(x)∣=0|f^{\prime}(x)|=0 for all x≥0x\geq 0.

There is a well-defined (k+1)(k+1)st lowest eigenvalue Λk\Lambda_{k}, counting with multiplicity. The eigenvalues Λ0≤Λ1≤…\Lambda_{0}\leq\Lambda_{1}\leq\ldots together with an orthonormal sequence of corresponding eigenvectors f0,f1,…f_{0},f_{1},\ldots are given recursively by the variational problem

in which the minimum is attained and we set fkf_{k} to be any minimizer.

Since we must have Λk→∞\Lambda_{k}\to\infty, {Λ0,Λ1,…}\{\Lambda_{0},\Lambda_{1},\ldots\} exhausts the spectrum and the resolvent operator is compact. We do not make this statement precise.

Proceed inductively, minimizing now over the orthocomplement {f∈L∗:∥f∥=1,f⊥f0,…,fk−1}\{f\in L^{*}:\|f\|=1,f\perp f_{0},\ldots,f_{k-1}\}. Again, L2L^{2}-convergence of a minimizing sequence guarantees that the limit remains admissible; as before, the limit is in fact a minimizer; conclude by applying the arguments of the previous paragraph with φ,g\varphi,g also restricted to the orthocomplement.

4 Statement

Let HnH_{n} be a rank rr block tr-diagonal ensemble as in (19) satisfying Assumptions 1–3, and let λn,k\lambda_{n,k} be its (k+1)(k+1)st lowest eigenvalue. Define the associated form H\mathcal{H} as in (31) and let Λk\Lambda_{k} be its a.s. defined (k+1)(k+1)st lowest eigenvalue. In the deterministic setting of subsequential pathwise coupling, λn,k→Λk\lambda_{n,k}\to\Lambda_{k} for each k=0,1,….k=0,1,\ldots. Furthermore, a sequence of normalized eigenvectors corresponding to λn,k\lambda_{n,k} is precompact in L2L^{2} norm, and every subsequential limit is an eigenfunction corresponding to Λk\Lambda_{k}. Finally, convergence holds uniformly over possible Wn,W≥−b>−∞W_{n},W\geq-b>-\infty. One recovers the corresponding distributional tightness and convergence statements for the full sequence, jointly for k=0,1,…k=0,1,\ldots in the sense of finite-dimensional distributions and jointly over Wn,WW_{n},W.

The proof will be given over the course of the next two subsections.

5 Tightness

with the nonnegative part Wn+W_{n}^{+} defined as before.

When considering just a single Wn,WW_{n},W, the boundary term in (3.5) is really only required when the limit includes Dirichlet terms; it is simpler, however, not to distinguish the two cases here. More importantly, including this term clarifies the role of the boundary term in the following key bound. Note that the original case considered in RRV has Wn=mnW_{n}=m_{n} in our notation. (The HnH_{n} form and Ln∗L^{*}_{n} norm there contained a term mn∣v0∣2m_{n}|v_{0}|^{2}, though it is hidden in the fact that, in our notation, they use △n\triangle_{n} in place of DnD_{n}.)

The potential term ⟨v,Vv⟩=∫0∞v†Vv\langle v,Vv\rangle=\int_{0}^{\infty}v^{\dagger}Vv, defined in (18), is analyzed according to (22):

Together with ∣Dnv∣2|D_{n}v|^{2}, the η\eta-terms provide the structure of the bound as we now show. Afterward we will control the ω\omega-terms and lastly deal with the boundary term.

Recall (23) and that ηi≥0\eta_{i}\geq 0. For an upper bound, rearrange (v−Tv)†η2(v−Tv)≥0(v-Tv)^{\dagger}\eta_{2}(v-Tv)\geq 0 to

Now ∫η‾∣Tv∣2=∫(T†η‾)∣v∣2≤∫η‾∣v∣2\int\overline{\eta}|Tv|^{2}=\int(T^{\dagger}\overline{\eta})|v|^{2}\leq\int\overline{\eta}|v|^{2} since η‾\overline{\eta} is nondecreasing, and we obtain

Toward a lower bound, we use the slightly tricky rearrangement 0≤(12v+Tv)†η2(12v+Tv)=3Re⁡v†η2Tv+(Tv−v)†η2(Tv−v)−34v†η2v0\leq(\frac{1}{2}v+Tv)^{\dagger}\eta_{2}(\frac{1}{2}v+Tv)=3\operatorname{Re}v^{\dagger}\eta_{2}Tv+(Tv-v)^{\dagger}\eta_{2}(Tv-v)-\frac{3}{4}v^{\dagger}\eta_{2}v. With (24), we get

We handle the ω\omega-terms with a discrete analogue of the decomposition used in the continuum proof. Consider the moving average

which has △ω‾i=(m/⌊m⌋)(T⌊m⌋−1)ωi\triangle\overline{\omega}_{i}=(m/\lfloor m\rfloor)(T^{\lfloor m\rfloor}-1)\omega_{i}; it is convenient to extend ωi(x)=ωi(⌈n/r⌉/mn)\omega_{i}(x)=\omega_{i}(\lceil n/r\rceil/m_{n}) for x>⌈n/r⌉/mnx>\lceil n/r\rceil/m_{n}. Decompose ωi=ω‾i+(ωi−ω‾i)\omega_{i}=\overline{\omega}_{i}+(\omega_{i}-\overline{\omega}_{i}). For the ω1\omega_{1}-term,

By (25) and Cauchy–Schwarz, the first term is bounded absolutely by (Cε+εη‾)∣v∣2(C_{\varepsilon}+\varepsilon\overline{\eta})|v|^{2} and its integral by ε∥v∥∗2+Cε∥v∥2\varepsilon\|v\|_{*}^{2}+C_{\varepsilon}\|v\|^{2}. The second term calls for a summation by parts:

The averaged bound ∣ω‾1−ω1∣≤(Cε+εη‾)1/2|\overline{\omega}_{1}-\omega_{1}|\leq(C_{\varepsilon}+\varepsilon\overline{\eta})^{1/2} and Cauchy–Schwarz bound the integrand

and its integral by ε∥v∥∗2+Cε′∥v∥2\sqrt{\varepsilon}\|v\|_{*}^{2}+C_{\varepsilon}^{\prime}\|v\|^{2}. One thus obtains a similar bound on ∣⟨v,(△ω1)v⟩∣|\langle v,(\triangle\omega_{1})v\rangle|.

There are corresponding bounds for the ω2\omega_{2}-terms. For the ω‾2\overline{\omega}_{2}-term, use 2∣v∣∣Tv∣≤∣v∣2+∣Tv∣22|v||Tv|\leq|v|^{2}+|Tv|^{2}. For the (ω2−ω‾2)(\omega_{2}-\overline{\omega}_{2})-term, modify the summation by parts:

Incorporating all the ω\omega-terms into (39), (40) and setting ε\varepsilon small, we obtain (37) but with the boundary terms omitted (from both the form and the norm).

We break the boundary term in (38) into its positive and negative parts. A discrete analogue of a bound from Fact 3.1 will be useful:

It gives ∣v(0)∣2≤(ε/b)∥Dv∥2+(b/ε)∥v∥2|v(0)|^{2}\leq(\varepsilon/b)\|Dv\|^{2}+(b/\varepsilon)\|v\|^{2}, and then W−≤bW^{-}\leq b implies that

which may be subtracted from the inequality already obtained. The positive part may simply be added in using that c≤1≤Cc\leq 1\leq C. We thus arrive at (37).

If the WnW_{n} are not bounded below then the lower bound in (37) breaks down: in fact, the bottom eigenvalue of HnH_{n} really goes to −∞-\infty like minus the square of the bottom eigenvalue of WnW_{n}. This is the supercritical regime.

6 Convergence

We begin with a simple lemma, a discrete-to-continuous version of Fact 3.2.

Let fn→ff_{n}\to f be as in the hypothesis and conclusion of Lemma 3.15. Then for all φ∈C0∞\varphi\in C_{0}^{\infty} we have ⟨φ,Hnfn⟩→H(φ,f)\langle\varphi,H_{n}f_{n}\rangle\to\mathcal{H}(\varphi,f). In particular, Pnφ→φ\mathcal{P}_{n}\varphi\to\varphi in this way and so

Since φ\varphi is compactly supported, we have Rnφ=φR_{n}\varphi=\varphi for nn large and the RnR_{n}s may be dropped. By assumption DnfnD_{n}f_{n} is L2L^{2} bounded and Dnfn→f′D_{n}f_{n}\to f^{\prime} weakly in L2L^{2}, so by the preceding observations Dnφ→L2φ′D_{n}\varphi\to_{L^{2}}\varphi^{\prime} and

For the potential term, we must verify that

converges to −⟨φ′,Yf⟩−⟨φ,Yf′⟩-\langle\varphi^{\prime},Yf\rangle-\langle\varphi,Yf^{\prime}\rangle. Recall by Assumption 1 (1) and (3.2) that Yn,i→YiY_{n,i}\to Y_{i} compact-uniformly (i=1,2i=1,2) and Y=Y1+12(Y2+Y2†)Y=Y_{1}+\frac{1}{2}(Y_{2}+Y_{2}^{\dagger}). Writing Yn=Yn,1+12(Yn,2+Yn,2†)→YY_{n}=Y_{n,1}+\frac{1}{2}(Y_{n,2}+Y^{\dagger}_{n,2})\to Y (and disregarding the notational collision with YiY_{i}), we first approximate VnV_{n} by △Yn\triangle Y_{n}:

which converges to the desired limit by the observations preceding the lemma together with the assumptions on fnf_{n} and the fact that Tnφ→L2φT_{n}\varphi\to_{L^{2}}\varphi in L2L^{2} since mn∥Tnφ−φ∥=∥Dnφ∥m_{n}\|T_{n}\varphi-\varphi\|=\|D_{n}\varphi\| is bounded. The error in the above approximation comes as a sum of TnT_{n} and Tn†T_{n}^{\dagger} terms. Consider twice the TnT_{n} term:

Finally, for the boundary terms Assumption 3 gives

where in the Dirichlet case i>r0i>r_{0} the left-hand side vanishes for nn large because φi\varphi_{i} is supported away from 0.

Turning to the second statement, we must verify that Pnφ→φ\mathcal{P}_{n}\varphi\to\varphi as in Lemma 3.15. The uniform Ln∗L^{*}_{n} bound on Pnφ\mathcal{P}_{n}\varphi follows from the following observations: ∥(Pnφ)1+η‾∥=∥Pnφ1+η‾∥≤∥φ1+η‾∥\|(\mathcal{P}_{n}\varphi){\sqrt{1+\overline{\eta}}}\|=\|\mathcal{P}_{n}\varphi{\sqrt{1+\overline{\eta}}}\|\leq\|\varphi{\sqrt{1+\overline{\eta}}}\|; for nn large enough that Rnφ=φR_{n}\varphi=\varphi we have ∥DnPnφ∥=∥PnDnφ∥≤∥Dnφ∥≤∥φ′∥\|D_{n}\mathcal{P}_{n}\varphi\|=\|\mathcal{P}_{n}D_{n}\varphi\|\leq\|D_{n}\varphi\|\leq\|\varphi^{\prime}\| (Young’s inequality); for the boundary term note that (Pnφ)i(0)(\mathcal{P}_{n}\varphi)_{i}(0) is bounded if i≤r0i\leq r_{0} and in fact vanishes for nn large if i>r0i>r_{0}. The convergence is easy: Pnφ→φ\mathcal{P}_{n}\varphi\to\varphi compact-uniformly and in L2L^{2}, and for g∈L2g\in L^{2} we have ⟨g,DnPnφ⟩=⟨Png,Dnφ⟩→⟨g,φ′⟩\langle g,D_{n}\mathcal{P}_{n}\varphi\rangle=\langle\mathcal{P}_{n}g,D_{n}\varphi\rangle\to\langle g,\varphi^{\prime}\rangle.

We finish by recalling the argument to put all the pieces together. A technical point: unlike in previous treatments we do not assume that the eigenvalues are simple.

Proof of Theorem 3.9 We first show that for all kk we have λ‾k=lim inf⁡λn,k≥Λk\underline{\lambda}_{k}=\liminf\lambda_{n,k}\geq\Lambda_{k}. Assume that λ‾k<∞\underline{\lambda}_{k}<\infty. The eigenvalues of HnH_{n} are uniformly bounded below by Lemma 3.13, so there is a subsequence along which (λn,1,…,λn,k)→(ξ1,…,ξk=λ‾k)(\lambda_{n,1},\ldots,\lambda_{n,k})\to(\xi_{1},\ldots,\xi_{k}=\underline{\lambda}_{k}). By the same lemma, corresponding orthonormal eigenvector sequences have Ln∗L^{*}_{n}-norm uniformly bounded. Pass to a further subsequence so that they all converge as in Lemma 3.15. The limit functions are orthonormal; by Lemma 3.16 they are eigenfunctions with eigenvalues ξj≤λ‾k\xi_{j}\leq\underline{\lambda}_{k} and we are done.

We proceed by induction, assuming the conclusion of the theorem up to k−1k-1. For j=0,…,k−1j=0,\ldots,k-1 let vn,jv_{n,j} be orthonormal eigenvectors corresponding to λn,j\lambda_{n,j}; for any subsequence we can pass to a further subsequence such that vn,j→L2fjv_{n,j}\to_{L^{2}}f_{j}, eigenfunctions corresponding to Λj\Lambda_{j}. Take an orthogonal eigenfunction fkf_{k} corresponding to Λk\Lambda_{k} and find fkε∈C0∞f_{k}^{\varepsilon}\in C_{0}^{\infty} with ∥fkε−fk∥∗<ε\|f_{k}^{\varepsilon}-f_{k}\|_{*}<\varepsilon. Consider the vector

The Ln∗L^{*}_{n}-norm of the sum term is uniformly bounded by CεC\varepsilon: indeed, the ∥vn,j∥∗n\|v_{n,j}\|_{*n} are uniformly bounded by Lemma 3.13, while the coefficients satisfy ∣⟨vn,j,fkε⟩∣≤∥fkε−fk∥+∥vn,j−fj∥<2ε|\langle v_{n,j},f_{k}^{\varepsilon}\rangle|\leq\|f_{k}^{\varepsilon}-f_{k}\|+\|v_{n,j}-f_{j}\|<2\varepsilon for large nn. By the variational characterization in finite dimensions and the uniform Ln∗L^{*}_{n} form bound on ⟨⋅,Hn⋅⟩\langle\cdot,H_{n}\cdot\rangle (by Lemma 3.13) together with the uniform bound on ∥Pnfkε∥∗n\|\mathcal{P}_{n}f_{k}^{\varepsilon}\|_{*n} (by Lemma 3.16), we then have

where oε(1)→0o_{\varepsilon}(1)\to 0 as ε→0\varepsilon\to 0. But (41) of Lemma 3.16 provides lim⁡⟨Pnfkε,\breakHnPnfkε⟩=H(fkε,fkε)\lim\langle\mathcal{P}_{n}f_{k}^{\varepsilon},\break H_{n}\mathcal{P}_{n}f_{k}^{\varepsilon}\rangle=\mathcal{H}(f_{k}^{\varepsilon},f_{k}^{\varepsilon}), so the right-hand side of (3.6) is

Now letting ε→0\varepsilon\to 0, we conclude lim sup⁡λn,k≤Λk\limsup\lambda_{n,k}\leq\Lambda_{k}.

Thus, λn,k→Λk\lambda_{n,k}\to\Lambda_{k}; Lemmas 3.13 and 3.15 imply that any subsequence of the vn,kv_{n,k} has a further subsequence converging in L2L^{2} to some f∈L∗f\in L^{*}; Lemma 3.16 then implies that ff is an eigenfunction corresponding to Λk\Lambda_{k}. Finally, convergence is uniform over Wn,W≥−bW_{n},W\geq-b since the bound 3.13 is.

CLT and tightness for Gaussian and Wishart models

We now verify Assumptions 1–3 of Section 3 for the band Jacobi forms of Section 2, and thus prove Theorems 1.2 and 1.3 via Theorem 3.9.

The technical tool we use to establish (1) is a functional central limit theorem for convergence of discrete time processes with independent increments of given mean and variance (and controlled fourth moments) to Brownian motion plus a nice drift. Appearing as Corollary 6.1 in RRV, it is just a tailored version of a much more general result given as Theorem 7.4.1 in Ethier and Kurtz (1986). We record it here.

uniformly for j/mnj/m_{n} on compact sets as n→∞n\to\infty. Then yn(x)=yn,⌊mnx⌋y_{n}(x)=y_{n,\lfloor m_{n}x\rfloor} converges in law, with respect to the compact-uniform topology, to the process h(x)+abxh(x)+ab_{x} where bxb_{x} is a standard Brownian motion.

Since the limit is a.s. continuous, Skorokhod convergence (the topology used in the references) implies uniform convergence on compact intervals [see Theorem 3.10.2 in Ethier and Kurtz (1986)] and we may as well speak in terms of the latter.

As usual, this soft-edge scaling can be predicted as follows. Centering GnG_{n} by 2n2\sqrt{n} gives, to first order, n\sqrt{n} times the discrete Laplacian on blocks of size rr. With space scaled down by mnm_{n}, the Laplacian must be scaled up by mn2m_{n}^{2} to converge to the second derivative. Finally, the scaling mn=n1/3m_{n}=n^{1/3} is determined by convergence of the next order terms to the noise and drift parts of the limiting potential.

Decompose HnH_{n} as in (19), (3.1). The upper-left block is

we want the boundary term WnW_{n} to absorb the “extra” mn2m_{n}^{2} (the 2 in the right-hand side “should be” a 1) and the perturbation in order to make Yn,1;0Y_{n,1;0} small just like the subsequent increments of Yn,iY_{n,i}. We therefore set

With this choice Assumption 3 is an immediate consequence of the hypotheses of Theorem 1.2. The processes Yn,1,Yn,2Y_{n,1},Y_{n,2} are determined and it remains to verify Assumptions 1 and 2.

Proof of (1), Gaussian case Define scalar processes yk,ly_{k,l} for 1≤l≤r1\leq l\leq r and l≤k≤l+rl\leq k\leq l+r by

Note that the yk,ly_{k,l} are independent increment processes that are mutually independent of one another. With the usual embedding j=⌊n1/3x⌋j=\lfloor n^{1/3}x\rfloor, Proposition 4.1 together with standard moment computations for Gaussian and Gamma random variables—in particular

for α\alpha large [valid since we consider j=O(n1/3)j=O(n^{1/3}) here]—leads to the convergence of processes

Noting that the two Brownian motions in each entry are independent and that the entries on and below the diagonal are independent of each other, we conclude that this limiting matrix process is distributed as Y(x)Y(x) in (\refYSA)(\ref{YSA}).

We turn to Assumption 2. Here, we need bounds over the full range 0≤j≤⌈n/r⌉−10\leq j\leq\lceil n/r\rceil-1. Recall that we can extend the Yn,iY_{n,i} processes beyond the end of the matrix arbitrarily (RnR_{n} takes care of the truncation), and it is convenient to “continue the pattern” for an extra block or two by setting χα=0\chi_{\alpha}=0 for α<0\alpha<0. For the decomposition (22), we simply take ηn,i\eta_{n,i} to be the expectation of △Yn,i\triangle Y_{n,i} and △ωn,i\triangle\omega_{n,i} to be its centered version; the components of ηn,i\eta_{n,i} are then easily estimated and those of ωn,i\omega_{n,i} become independent increment martingales. We further set η‾(x)=rx\overline{\eta}(x)=rx.

Proof of (23)–(25), Gaussian case From (46), we have ηn,1;j=0\eta_{n,1;j}=0 and

for some fixed cc, which yields the matrix inequalities

and verifies (23) with η‾(x)=rx\overline{\eta}(x)=rx. Separately, we have the upper bound (24):

are tight over nn. Squaring, bounding the outer supremum by the corresponding sum, and then taking expectations gives

where we have used the LpL^{p} maximum inequality for martingales [see, e.g., Proposition 2.2.16 of Ethier and Kurtz (1986)]. To bound the latter expectation, expand the fourth power to obtain O(mn2)O(m_{n}^{2}) nonzero terms that are O(mn−2)O(m_{n}^{-2}) with constants independent of xx and nn. It follows that the entire sum is uniformly bounded over nn, as required.

2 The Wishart case

See Part I for detailed heuristics behind the scaling; written in this way, it allows that p,n→∞p,n\to\infty together arbitrarily, that is, only n∧p→∞n\wedge p\to\infty. It is useful to note that

Decompose Hn,pH_{n,p} as in (19), (3.1). The upper-left block is

Once again, Assumption 3 follows immediately from the hypotheses of Theorem 1.3.

We must still deal with the perturbed term in Y1;0Y_{1;0} and show that

in probability. We defer this to the end of the proof of Assumption 1, to which we now turn. As in the Gaussian case, YY is given by (43).

Proof of (1), Wishart case By the preceding paragraph it suffices to treat the null case Σ=I\Sigma=I and afterward check (50). Define processes yk,ly_{k,l} for 1≤l≤r1\leq l\leq r and l≤k≤l+rl\leq k\leq l+r by (44) as in the Gaussian case. From (16) with the centering and scaling of (48) and (3.1), we obtain

where the O(1)O(1) terms stand in for the interior Gaussian sums of (16), all of whose moments are bounded uniformly in n,pn,p. Since m1+k/(np)k/2≤m1−2k=o(1)m^{1+k}/(np)^{k/2}\leq m^{1-2k}=o(1) for k≥1k\geq 1, these terms are negligible in the scaling of Proposition 4.1 in the sense that the associated processes converge to the zero process. Next, use that expressions of type χn−n\chi_{n}-\sqrt{n} are O(1)O(1) in the same sense, and that n−n−j=O(j/n)=O(m/n)=o(1)\sqrt{n}-\sqrt{n-j}=O(j/\sqrt{n})=O(m/\sqrt{n})=o(1) since we consider j/mj/m bounded here (and similarly for pp), to write

jointly for 1≤k,l≤r1\leq k,l\leq r. After the dust clears, we thus arrive at exactly the same limiting process as in the Gaussian case, namely (43).

Turning to Assumption 2, we may continue the processes Yn,iY_{n,i} past the end of the matrix for convenience just as in the Gaussian case. The Wishart case presents an additional issue at the “end” of the matrix: recall that the final rr rows and columns of SS in (16) may have some apparently nonzero terms set to zero. However, these changes are easily absorbed into the bounds that follow. For (22), we once again take ηn,i\eta_{n,i} to be the expectation of △Yn,i\triangle Y_{n,i} and △ωn,i\triangle\omega_{n,i} to be its centered version. We also set η‾(x)=rx\overline{\eta}(x)=rx as before.

Proof of (23)–(25), Wishart case This time we have

Using (47) one finds, for some constant cc, that

Alternative characterizations of the laws

In this section, we derive the SDE and PDE characterizations, proving Theorems 1.5 and 1.6.

For each noise path BxB_{x}, the eigenvalue equation Hβ,Wf=λf\mathcal{H}_{\beta,W}f=\lambda f can be rewritten as a first-order linear ODE with continuous coefficients. We begin with the formal second-order linear differential equation

Now let g=f′−2Bfg=f^{\prime}-{\sqrt{2}}Bf. The equation becomes

In other words, the pair (f(x),g(x))(f(x),g(x)) formally satisfies the first-order linear system

Since B0=0B_{0}=0, gg simply replaces f′f^{\prime} in the initial condition (53). If one prefers, this condition can be written in the standard form

2 Matrix oscillation theory

The matrix generalization of Sturm oscillation theory goes back to the classic work of Morse Morse (1932) [see also Morse (1973)]. Textbook treatments of self-adjoint differential systems include that of Reid (1971). Our reference will be the paper of Baur and Kratz (1989), which allows sufficiently general boundary conditions.

We first consider the eigenvalue problem on a finite interval [0,L][0,L] with Dirichlet boundary condition f(L)=0f(L)=0 at the right endpoint. In the scalar-valued setting, the number of eigenvalues below λ\lambda is found to coincide with the number of zeros of ff (the solution of the initial value problem) that lie in (0,L)(0,L). The correct generalization to the matrix-valued setting involves tracking a matrix whose columns form a basis of solutions, and counting the so-called “focal points”.

The idea is that focal points are isolated and move continuously to the left as λ\lambda increases. For sufficiently negative λ\lambda, there are no focal points on (0,L](0,L]; each time λ\lambda passes an eigenvalue, a new focal point is introduced at LL.

We indicate how the proposition follows from the results of Baur and Kratz (1989). Note that Conditions (A1), (A2) on page 337 are satisfied by our coefficients, and that (A3) on page 340 is satisfied by our boundary conditions. Theorem 1 on page 345 thus applies. See (3.5) on page 341 for the definition of Λ(λ)\Lambda(\lambda); the Dirichlet condition at LL gives the particularly simple result that the right-hand side of (4.1) vanishes, so the quantity n2(λ)n_{2}(\lambda) is constant. Theorem 2 applies as well, and we obtain n1(λ)−n1=n3(λ)n_{1}(\lambda)-n_{1}=n_{3}(\lambda). Here, n1(λ)n_{1}(\lambda) is the number of focal points in [0,L)[0,L), n1=lim⁡λ→−∞n1(λ)n_{1}=\lim_{\lambda\to-\infty}n_{1}(\lambda) and n3(λ)n_{3}(\lambda) is the number of eigenvalues below λ\lambda. To finish, we consult Theorem 3 on page 353; noting that (A4′) is satisfied by Section 7.2, page 365, to find that n1n_{1} is simply the multiplicity of the focal point at 0. The oscillation result follows. For the assertion about the spectrum, we apply Theorem 4, noting that (A5), page 358 holds by (i) there, and (A6), page 359 also holds.

We conclude the following for our matrix system.

A soft argument now recovers an oscillation theorem for the original half-line problem.

The variational problem for HL\mathcal{H}_{L} simply minimizes over the subset of L∗L^{*} functions that vanish on [L,∞)[L,\infty); the Dirichlet condition is important here. It follows immediately that ΛL,k≥Λk\Lambda_{L,k}\geq\Lambda_{k}, using the min–max formulation of the variational characterization. Proceed by induction, assuming that ΛL,j→ΛL\Lambda_{L,j}\to\Lambda_{L} for j=0,…,k−1j=0,\ldots,k-1.

Let fL,jf_{L,j} be orthonormal eigenvectors corresponding to ΛL,j\Lambda_{L,j}. By the induction hypothesis, the variational characterization for H\mathcal{H} and the finite-dimensionality of its eigenspaces, every subsequence has a further subsequence such that fL,j→L2fjf_{L,j}\to_{L^{2}}f_{j}, eigenvectors corresponding to Λj\Lambda_{j}. Let fkf_{k} be an orthogonal eigenvector corresponding to Λk\Lambda_{k} and take fkεf_{k}^{\varepsilon} compactly supported with ∥fkε−fk∥∗<ε\|f_{k}^{\varepsilon}-f_{k}\|_{*}<\varepsilon. Let

For large LL, the inner products are at most 2ε2\varepsilon, so ∥gL−fk∥∗≤cε\|g_{L}-f_{k}\|_{*}\leq c\varepsilon. Noting that gLg_{L} is eventually supported on [0,L][0,L], the variational characterization gives

and the right-hand side tends to H(fk,fk)/⟨fk,fk⟩=Λk{\mathcal{H}(f_{k},f_{k})}/{\langle f_{k},f_{k}\rangle}=\Lambda_{k} as ε→0\varepsilon\to 0.

3 Riccati SDE: Stochastic airy meets dyson

Let (F,G)(F,G) be a conjoined basis for (54) as defined in the previous subsection. Then, on any interval with no focal points, the matrix Q=GF−1Q=GF^{-1} is self-adjoint and satisfies the matrix Riccati equation

Now let P=F′F−1P=F^{\prime}F^{-1}. While P=Q+2BP=Q+{\sqrt{2}}B is not differentiable, by (56) it certainly satisfies the integral equation

if [x1,x2][x_{1},x_{2}] is free of focal points. In other words, PP is a strong solution of the Itô equation

Consider the eigenvalues p1,…,prp_{1},\ldots,p_{r} of PP. The main point is that the drift term in (58) is unitarily equivariant and passes through the usual derivation of Dyson’s Brownian motion [Dyson (1962)]. The eigenvalues therefore evolve as an autonomous Markov process.

To describe the law on paths we need a space, and there are two issues: it will be necessary to keep the eigenvalues ordered but also allow for explosions/restarts. We therefore define a sequence of Weyl chambers Ck⊂(−∞,∞]rC_{k}\subset(-\infty,\infty]^{r} by

Writing X=A˙(0)X=\dot{A}(0) and ∇X\nabla_{X} for the directional derivative, and takingv1(0),…,vr(0)v_{1}(0),\ldots,v_{r}(0) to be the standard basis, we find

Returning to (58), at each fixed time xx we can change to the diagonal basis for PxP_{x} because the noise term is invariant in distribution and the drift term is equivariant. Itô’s lemma amounts to formally writing dpi=∇dPpi+12∇dP2pidp_{i}=\nabla_{dP}p_{i}+\frac{1}{2}\nabla_{dP}^{2}p_{i} and using that dBiidB_{ii} are jointly distributed as 2/β dbi\sqrt{2/\beta}\,db_{i} for i=1,…,ri=1,\ldots,r while ∣dBij∣2=dt|dB_{ij}|^{2}=dt for j≠ij\neq i. We thus arrive at (59).

Recall that the evolution of PP through a focal point is still described by an SDE, after changing coordinates. The same is therefore true of p\mathbf{p} through an explosion; the form (60) is obtained from (59) by an application of Itô’s lemma.

Just as with the usual Dyson’s Brownian motion, the pip_{i} are almost surely distinct at all positive times: p(x)∈C\mathbf{p}(x)\in\mathcal{C} for all x>0x>0. One can show this “no collision property” holds for any solution of (59), (60), even with an initial condition p(0)∈∂C0\mathbf{p}(0)\in\partial C_{0}. (Technically, one defines an entrance law from ∂C\partial\mathcal{C} by a limiting procedure.) Since the coefficients are regular inside C\mathcal{C}, this suffices to prove uniqueness of the law. See Anderson, Guionnet and Zeitouni (2010), Section 4.3.1 for a detailed proof in the driftless case.

Proof of Theorem 1.5 Explosions of p\mathbf{p} as in Theorem 5.4 correspond to focal points of FF for each λ\lambda. By Theorem 5.3, the total number of explosions KK is equal to the number of eigenvalues strictly below λ\lambda. (Notice that p\mathbf{p} ends up in CKC_{K}.) For a fixed λ\lambda, translation invariance of the driving Brownian motions bib_{i} allows one to shift time x↦x−λ/rx\mapsto x-\lambda/r and use (3) started at x0=−λ/rx_{0}=-\lambda/r. Putting a=−λa=-\lambda we have P⁡(−Λk≤a)=P⁡(Λk≥λ)=P⁡a/r,w(K≤k)\operatorname{\mathbf{P}}(-\Lambda_{k}\leq a)=\operatorname{\mathbf{P}}(\Lambda_{k}\geq\lambda)=\operatorname{\mathbf{P}}_{a/r,\mathbf{w}}(K\leq k) as required.

4 PDE and boundary value problem

We now prove the PDE characterization, Theorem 1.6. We will need two properties of the eigenvalue diffusion.

Let p:[x0,∞)→C‾\mathbf{p}:[x_{0},\infty)\to\overline{\mathcal{C}} have law P⁡x0,w\operatorname{\mathbf{P}}_{x_{0},\mathbf{w}} as in (3) and let KK be the number of explosions. Then the following hold:

Given x0,kx_{0},k, P⁡x0,w(K≤k)\operatorname{\mathbf{P}}_{x_{0},\mathbf{w}}(K\leq k) is increasing in w\mathbf{w} with respect to the partial order w≤w′\mathbf{w}\leq\mathbf{w}^{\prime} given by wi≤wi′w_{i}\leq w_{i}^{\prime}, i=1,…,ri=1,\ldots,r.

P⁡x0,w\operatorname{\mathbf{P}}_{x_{0},\mathbf{w}}-almost surely, p1,…,prp_{1},\ldots,p_{r} remain bounded below in CKC_{K} (after the last explosion), or equivalently in C0C_{0} on the event {K=0}\{K=0\}.

Part (i) is a consequence Theorem 1.5 and Remark 1.1, the pathwise monotonicity of the eigenvalues Λk\Lambda_{k} as a function of the boundary parameter WW with respect to the usual matrix partial order. It can also be seen from the related fact that the matrix partial order is preserved pathwise by the matrix Riccati equation (58), which implies that a solution started from WW explodes no later than one started from W′≥WW^{\prime}\geq W. This fact holds for the PP evolution if it holds for the QQ evolution (56), and for the latter it is Theorem IV.4.1 of Reid (1972).

Part (ii) follows from the stronger assertion that pi∼rxp_{i}\sim\sqrt{rx} as x→∞x\to\infty. In the r=1r=1 case, this is Proposition 3.7 of RRV. Heuristically, the single particle drift linearizes at the stable equilibrium rx\sqrt{rx} to 2rx(rx−pi)2\sqrt{rx}(\sqrt{rx}-p_{i}); even with the repulsion terms one expects fluctuations of variance only C/xC/\sqrt{x}. We omit the proof.

For FkF^{k}, there is the following more general picture. Consider the PDE in C‾0∪⋯∪C‾k\overline{C}_{0}\cup\cdots\cup\overline{C}_{k}, defined across the seams by changing coordinates as in (60). Put the boundary condition (7) on all the chambers and (8) on the bottom of C‾k\overline{C}_{k}. Then the solution is FkF^{k} in C‾0\overline{C}_{0}; the reason is the same as for F=F0F=F^{0}, but now using (5) and the hitting event “at most kk explosions”. Similarly, the solution is Fk−1F^{k-1} in C‾1\overline{C}_{1} and so on down to F0F^{0} in C‾k\overline{C}_{k}. Continuity holds across the seams and (1.6) follows after permuting coordinates.

Connection with Painlevé II

In Part I, we used the PDE characterization to give new proofs of certain Painlevé II formulas for the single-parameter (rank one deformed) distribution functions Fβ(x;w)F_{\beta}(x;w) in the cases β=2,4\beta=2,4, in particular recovering the Painlevé II representations for the corresponding undeformed Tracy–Widom distributions by taking w→∞w\to\infty. The Painlevé formulas appeared originally in Baik and Rains (2000; 2001) in a different context; in the random matrix theory setting, Baik (2006) derived them from the BBP result in the case β=2\beta=2 but they are new for β=4\beta=4 when w≠0w\neq 0 [see Wang (2008)].

Baik (2006) also derives a Painlevé II formula for the multi-parameter distribution function F2(x;w1,…,wr)F_{2}(x;w_{1},\ldots,w_{r}). While we do not have a full independent proof at present, we used the computer algebra system Maple to verify symbolically that it does indeed satisfy our PDE (6) at β=2\beta=2 for r=2,3,4,5r=2,3,4,5. Since this article was first posted, a pencil-and-paper proof for all rr was found [Bloemendal and Baik (2013)]. We first state Baik’s formula and then briefly describe the symbolic computation.

Let u(x)u(x) be the Hastings–McLeod solution of the homogeneous Painlevé II equation

where Ai⁡(x)\operatorname{Ai}(x) is the Airy function. Put

Equation (64) is one member of the Lax pair for the Painlevé II equation. The other member of the pair is

Our symbolic verification for small values of rr consisted of the following steps. The differential relations given by (61)–(65) were encoded as formal substitution rules. The determinant in (66) was expanded (this step becomes problematic for larger rr…!) and the result plugged into our PDE (6). The substitution rules were then applied repeatedly. Finally, the result was factored using Maple’s built-in command. Each time, the output contained the factor

which vanishes identically: differentiate and apply (61) to see it is constant, and take x→∞x\to\infty to see the constant is zero.

Acknowledgements

Alex Bloemendal would like to thank Percy Deift for valuable comments and Jinho Baik, Alexei Borodin, Peter Forrester, Brian Rider, Craig Tracy, Benedek Valko and Dong Wang for interesting and helpful discussions.

References