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 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 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 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 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 , though see the prior work of Wang (2008) on the rank one case at , as well as the subsequent work of Mo (2012) offering a more standard treatment of the rank one case. Forrester (2013) comments on all three works and gives an alternative interpretation and construction of our general rank one spiked model.
Here, we deal with “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 -diagonal band form that has a purely algebraic interpretation. It generalizes the Dumitriu–Edelman forms and is able to handle rank 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 () cases simultaneously. Once again, even the existence of a near-critical soft-edge limit is new off . Unlike in Part I, however, we do not define a general 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 -generalization.
Dyson’s Brownian motion makes a surprise appearance, providing nice SDE and PDE characterizations of the limit laws—new parameter deformations of Tracy–Widom()—in which 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 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 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 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 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 -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 case. In the GO/U/SE case, we take to be the initial coordinate basis vectors, while in the Wishart case we use the initial rows of the data matrix . 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 is “standard matrix white noise”, the derivative of a standard matrix Brownian motion, and is scalar. (Here, again is restricted to the classical values, as the noise term lacks a straightforward -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 and corresponding eigenfunctions of are given, respectively, by the minimum and any minimizer in the recursive variational problem
Here, candidates 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 .
We note one important property of the eigenvalue processes, namely the pathwise monotonicity of in 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 . (For the higher eigenvalues, it is most apparent from the standard min–max formulation of the variational problem.)
then, jointly for in the sense of finite-dimensional distributions,
where are the eigenvalues of . Convergence holds jointly over satisfying the condition.
then, jointly for in the sense of finite-dimensional distributions,
where are the eigenvalues of . Convergence holds jointly over satisfying the condition.
for Write simply 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 be the measure on paths determined by the coupled diffusions
with initial conditions and entering into , where are independent standard Brownian motions; particles may explode to in finite time whereupon they are restarted at . 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, is “continuous to the boundary” as one or several . For subsequent eigenvalue laws , (8) is replaced with the recursive boundary condition
At , 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 ; details are described in Section 6. A pencil-and-paper proof for all was found since the initial posting [Bloemendal and Baik (2013)].
We make two final remarks. From the finite matrix models it is clear that the “rank deformed” limiting distributions reduce to those for a lower rank 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 (although one has to be careful for ). It would be interesting to find natural “general multi-spiked models” at finite , interpolating between those studied here at and generalizing those introduced in Part I for . At , 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 , we have and . Suppose inductively that have been obtained for some , satisfying the preceding conditions for . Let ; we must choose so that and . There are two cases to consider. If then must be a multiple of ; the positivity condition further forces , which gives . If , then any will do, and in this case .
When uniqueness holds, as is generically the case, the basis may also be obtained by applying the Gram–Schmidt process to the first vectors of the sequence
We now state and prove a concrete matrix formulation in which the first coordinate vectors play the role of . 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 and 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 .
Stop when . Let and .
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 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 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 -dimensional coordinate subspace, and so we take the basis of Theorem 2.1 that begins with the first 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 rows of the data matrix. Our new basis will begin with the Gram–Schmidt orthogonalization of these initial rows. As in the 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 be an GOE matrix. Applying the algorithm from the proof of Theorem 2.3 while keeping track of the distribution of the matrix at each step—the key of course being the unitary invariance of standard Gaussian vectors—yields the following band Jacobi random matrix :
As expected the perturbation shows up undisturbed in the upper-left corner of .
Continue in this way until the rows and columns both run out (stop alternating if one runs out before the other).
The resulting has nonzero columns and nonzero rows, which can be described as follows:
where we have ignored the issue of truncation in the final rows and columns ( and with indices beyond the allowed range should simply be zero). The change of basis is thus ; a little thought shows that, as claimed earlier, the new basis begins with the orthogonalization of the first rows of . 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 and . The point is that same change of basis works in the rank spiked case, and by the lower band structure of , the perturbation shows up in the upper-left corner:
Viewed in terms of the algorithm used to produce , the point is that the first rows of 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 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 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 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 into as an additive constant, but keep it separate for reasons that will soon be clear. Note also that the upper-left block has rather than .) We refer to as a rank 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 ) with (as matrices), such that for some deterministic scalar continuous nondecreasing unbounded functions , not depending on , and random constants defined on the same probability spaces, the following hold: the are tight in distribution, and for each we have almost surely
2 Reduction to deterministic setting
In the next subsection, we will define a limiting object in terms of and ; 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 and the upper bound of (23) give that for the piecewise linear process 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 , 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 as the Dirichlet subspace and the corresponding 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 is just the usual one associated with the operator ; 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 is defined as with . [Define the negative part similarly with , so that .] We refer to as the norm and define an associated Hilbert space as the closure of 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 .
Any is uniformly -continuous and satisfies for all ; furthermore, for .
We have . For we have ; an -bounded sequence in , therefore, has a compact-uniformly convergent subsequence, so we can extend this bound to and also conclude the behaviour in the Dirichlet components.
Every -bounded sequence has a subsequence converging in the following modes: (i) weakly in , (ii) derivatives weakly in , (iii) uniformly on compacts and (iv) in .
(i) and (ii) are just Banach–Alaoglu; (iii) is the previous fact and Arzelà–Ascoli again; (iii) implies convergence locally, while the uniform bound on 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 and using pointwise convergence.
By the bound in Fact 3.1 with , the boundary term in (32) could be done away with. It is natural to include the term, however, when considering all 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 there is a such that, for each , the following holds for all and all :
In particular, extends uniquely to a continuous symmetric bilinear form on .
For the first three terms of (31), we use the decomposition from the previous subsection. Integrating the term by parts, (27) easily yields
Break up the term as follows. The moving average is differentiable with ; writing , we have
By (28), for , where can be made small. In particular, the first term above is bounded absolutely by . Averaging, we also get ; Cauchy–Schwarz then bounds the second term absolutely by and thus by . Now combine all the terms and set 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 ; then implies that
which may be subtracted from the inequality already obtained. For the positive part , use the fact that to simply add it in. We thus arrive at (33).
For the bilinear form bound, begin with the quadratic form bound ; 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 is an eigenfunction with eigenvalue if and for all we have
Note that (34) then automatically holds for all , by -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 the restriction on test functions implies that , so the first boundary term on the right-hand side is replaced with an arbitrary constant.) Now (35) shows that has a continuous version, and the equation may be taken to hold everywhere. In particular, satisfies the boundary condition of (3.3) classically. [For a Dirichlet component, we just find that the arbitrary constant is .] 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 -orthogonal). The 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 -convergent subsequence by Fact 3.2. At a given level, more is true.
By linearity, it suffices to show a solution of (35) with must vanish identically. Integrate by parts to write
which implies that with some increasing in . Gronwall’s lemma then gives for all .
There is a well-defined st lowest eigenvalue , counting with multiplicity. The eigenvalues together with an orthonormal sequence of corresponding eigenvectors are given recursively by the variational problem
in which the minimum is attained and we set to be any minimizer.
Since we must have , exhausts the spectrum and the resolvent operator is compact. We do not make this statement precise.
Proceed inductively, minimizing now over the orthocomplement . Again, -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 also restricted to the orthocomplement.
4 Statement
Let be a rank block tr-diagonal ensemble as in (19) satisfying Assumptions 1–3, and let be its st lowest eigenvalue. Define the associated form as in (31) and let be its a.s. defined st lowest eigenvalue. In the deterministic setting of subsequential pathwise coupling, for each Furthermore, a sequence of normalized eigenvectors corresponding to is precompact in norm, and every subsequential limit is an eigenfunction corresponding to . Finally, convergence holds uniformly over possible . One recovers the corresponding distributional tightness and convergence statements for the full sequence, jointly for in the sense of finite-dimensional distributions and jointly over .
The proof will be given over the course of the next two subsections.
5 Tightness
with the nonnegative part defined as before.
When considering just a single , 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 in our notation. (The form and norm there contained a term , though it is hidden in the fact that, in our notation, they use in place of .)
The potential term , defined in (18), is analyzed according to (22):
Together with , the -terms provide the structure of the bound as we now show. Afterward we will control the -terms and lastly deal with the boundary term.
Recall (23) and that . For an upper bound, rearrange to
Now since is nondecreasing, and we obtain
Toward a lower bound, we use the slightly tricky rearrangement . With (24), we get
We handle the -terms with a discrete analogue of the decomposition used in the continuum proof. Consider the moving average
which has ; it is convenient to extend for . Decompose . For the -term,
By (25) and Cauchy–Schwarz, the first term is bounded absolutely by and its integral by . The second term calls for a summation by parts:
The averaged bound and Cauchy–Schwarz bound the integrand
and its integral by . One thus obtains a similar bound on .
There are corresponding bounds for the -terms. For the -term, use . For the -term, modify the summation by parts:
Incorporating all the -terms into (39), (40) and setting 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 , and then implies that
which may be subtracted from the inequality already obtained. The positive part may simply be added in using that . We thus arrive at (37).
If the are not bounded below then the lower bound in (37) breaks down: in fact, the bottom eigenvalue of really goes to like minus the square of the bottom eigenvalue of . This is the supercritical regime.
6 Convergence
We begin with a simple lemma, a discrete-to-continuous version of Fact 3.2.
Let be as in the hypothesis and conclusion of Lemma 3.15. Then for all we have . In particular, in this way and so
Since is compactly supported, we have for large and the s may be dropped. By assumption is bounded and weakly in , so by the preceding observations and
For the potential term, we must verify that
converges to . Recall by Assumption 1 (1) and (3.2) that compact-uniformly () and . Writing (and disregarding the notational collision with ), we first approximate by :
which converges to the desired limit by the observations preceding the lemma together with the assumptions on and the fact that in since is bounded. The error in the above approximation comes as a sum of and terms. Consider twice the term:
Finally, for the boundary terms Assumption 3 gives
where in the Dirichlet case the left-hand side vanishes for large because is supported away from 0.
Turning to the second statement, we must verify that as in Lemma 3.15. The uniform bound on follows from the following observations: ; for large enough that we have (Young’s inequality); for the boundary term note that is bounded if and in fact vanishes for large if . The convergence is easy: compact-uniformly and in , and for we have .
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 we have . Assume that . The eigenvalues of are uniformly bounded below by Lemma 3.13, so there is a subsequence along which . By the same lemma, corresponding orthonormal eigenvector sequences have -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 and we are done.
We proceed by induction, assuming the conclusion of the theorem up to . For let be orthonormal eigenvectors corresponding to ; for any subsequence we can pass to a further subsequence such that , eigenfunctions corresponding to . Take an orthogonal eigenfunction corresponding to and find with . Consider the vector
The -norm of the sum term is uniformly bounded by : indeed, the are uniformly bounded by Lemma 3.13, while the coefficients satisfy for large . By the variational characterization in finite dimensions and the uniform form bound on (by Lemma 3.13) together with the uniform bound on (by Lemma 3.16), we then have
where as . But (41) of Lemma 3.16 provides , so the right-hand side of (3.6) is
Now letting , we conclude .
Thus, ; Lemmas 3.13 and 3.15 imply that any subsequence of the has a further subsequence converging in to some ; Lemma 3.16 then implies that is an eigenfunction corresponding to . Finally, convergence is uniform over 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 on compact sets as . Then converges in law, with respect to the compact-uniform topology, to the process where 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 by gives, to first order, times the discrete Laplacian on blocks of size . With space scaled down by , the Laplacian must be scaled up by to converge to the second derivative. Finally, the scaling is determined by convergence of the next order terms to the noise and drift parts of the limiting potential.
Decompose as in (19), (3.1). The upper-left block is
we want the boundary term to absorb the “extra” (the 2 in the right-hand side “should be” a 1) and the perturbation in order to make small just like the subsequent increments of . We therefore set
With this choice Assumption 3 is an immediate consequence of the hypotheses of Theorem 1.2. The processes are determined and it remains to verify Assumptions 1 and 2.
Proof of (1), Gaussian case Define scalar processes for and by
Note that the are independent increment processes that are mutually independent of one another. With the usual embedding , Proposition 4.1 together with standard moment computations for Gaussian and Gamma random variables—in particular
for large [valid since we consider 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 in .
We turn to Assumption 2. Here, we need bounds over the full range . Recall that we can extend the processes beyond the end of the matrix arbitrarily ( takes care of the truncation), and it is convenient to “continue the pattern” for an extra block or two by setting for . For the decomposition (22), we simply take to be the expectation of and to be its centered version; the components of are then easily estimated and those of become independent increment martingales. We further set .
Proof of (23)–(25), Gaussian case From (46), we have and
for some fixed , which yields the matrix inequalities
and verifies (23) with . Separately, we have the upper bound (24):
are tight over . Squaring, bounding the outer supremum by the corresponding sum, and then taking expectations gives
where we have used the 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 nonzero terms that are with constants independent of and . It follows that the entire sum is uniformly bounded over , as required.
2 The Wishart case
See Part I for detailed heuristics behind the scaling; written in this way, it allows that together arbitrarily, that is, only . It is useful to note that
Decompose 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 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, is given by (43).
Proof of (1), Wishart case By the preceding paragraph it suffices to treat the null case and afterward check (50). Define processes for and by (44) as in the Gaussian case. From (16) with the centering and scaling of (48) and (3.1), we obtain
where the terms stand in for the interior Gaussian sums of (16), all of whose moments are bounded uniformly in . Since for , 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 are in the same sense, and that since we consider bounded here (and similarly for ), to write
jointly for . 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 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 rows and columns of 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 to be the expectation of and to be its centered version. We also set as before.
Proof of (23)–(25), Wishart case This time we have
Using (47) one finds, for some constant , 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 , the eigenvalue equation can be rewritten as a first-order linear ODE with continuous coefficients. We begin with the formal second-order linear differential equation
Now let . The equation becomes
In other words, the pair formally satisfies the first-order linear system
Since , simply replaces 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 with Dirichlet boundary condition at the right endpoint. In the scalar-valued setting, the number of eigenvalues below is found to coincide with the number of zeros of (the solution of the initial value problem) that lie in . 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 increases. For sufficiently negative , there are no focal points on ; each time passes an eigenvalue, a new focal point is introduced at .
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 ; the Dirichlet condition at gives the particularly simple result that the right-hand side of (4.1) vanishes, so the quantity is constant. Theorem 2 applies as well, and we obtain . Here, is the number of focal points in , and is the number of eigenvalues below . To finish, we consult Theorem 3 on page 353; noting that (A4′) is satisfied by Section 7.2, page 365, to find that 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 simply minimizes over the subset of functions that vanish on ; the Dirichlet condition is important here. It follows immediately that , using the min–max formulation of the variational characterization. Proceed by induction, assuming that for .
Let be orthonormal eigenvectors corresponding to . By the induction hypothesis, the variational characterization for and the finite-dimensionality of its eigenspaces, every subsequence has a further subsequence such that , eigenvectors corresponding to . Let be an orthogonal eigenvector corresponding to and take compactly supported with . Let
For large , the inner products are at most , so . Noting that is eventually supported on , the variational characterization gives
and the right-hand side tends to as .
3 Riccati SDE: Stochastic airy meets dyson
Let be a conjoined basis for (54) as defined in the previous subsection. Then, on any interval with no focal points, the matrix is self-adjoint and satisfies the matrix Riccati equation
Now let . While is not differentiable, by (56) it certainly satisfies the integral equation
if is free of focal points. In other words, is a strong solution of the Itô equation
Consider the eigenvalues of . 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 by
Writing and for the directional derivative, and taking to be the standard basis, we find
Returning to (58), at each fixed time we can change to the diagonal basis for because the noise term is invariant in distribution and the drift term is equivariant. Itô’s lemma amounts to formally writing and using that are jointly distributed as for while for . We thus arrive at (59).
Recall that the evolution of through a focal point is still described by an SDE, after changing coordinates. The same is therefore true of 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 are almost surely distinct at all positive times: for all . One can show this “no collision property” holds for any solution of (59), (60), even with an initial condition . (Technically, one defines an entrance law from by a limiting procedure.) Since the coefficients are regular inside , 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 as in Theorem 5.4 correspond to focal points of for each . By Theorem 5.3, the total number of explosions is equal to the number of eigenvalues strictly below . (Notice that ends up in .) For a fixed , translation invariance of the driving Brownian motions allows one to shift time and use (3) started at . Putting we have 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 have law as in (3) and let be the number of explosions. Then the following hold:
Given , is increasing in with respect to the partial order given by , .
-almost surely, remain bounded below in (after the last explosion), or equivalently in on the event .
Part (i) is a consequence Theorem 1.5 and Remark 1.1, the pathwise monotonicity of the eigenvalues as a function of the boundary parameter 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 explodes no later than one started from . This fact holds for the evolution if it holds for the evolution (56), and for the latter it is Theorem IV.4.1 of Reid (1972).
Part (ii) follows from the stronger assertion that as . In the case, this is Proposition 3.7 of RRV. Heuristically, the single particle drift linearizes at the stable equilibrium to ; even with the repulsion terms one expects fluctuations of variance only . We omit the proof.
For , there is the following more general picture. Consider the PDE in , 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 . Then the solution is in ; the reason is the same as for , but now using (5) and the hitting event “at most explosions”. Similarly, the solution is in and so on down to in . 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 in the cases , in particular recovering the Painlevé II representations for the corresponding undeformed Tracy–Widom distributions by taking . 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 but they are new for when [see Wang (2008)].
Baik (2006) also derives a Painlevé II formula for the multi-parameter distribution function . 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 for . Since this article was first posted, a pencil-and-paper proof for all was found [Bloemendal and Baik (2013)]. We first state Baik’s formula and then briefly describe the symbolic computation.
Let be the Hastings–McLeod solution of the homogeneous Painlevé II equation
where 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 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 …!) 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 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.