Ergodic Decomposition for Inverse Wishart Measures on Infinite Positive-Definite Matrices
Theodoros Assiotis

TL;DR
This paper completely solves the ergodic decomposition problem for inverse Wishart measures on infinite positive-definite matrices, extending the classification of invariant measures in infinite-dimensional matrix spaces.
Contribution
It provides the first complete ergodic decomposition for inverse Wishart measures, a significant step in understanding invariant measures on infinite matrices.
Findings
Complete ergodic decomposition for inverse Wishart measures achieved
Extends classification of invariant measures to a new family
Provides foundational results for infinite-dimensional matrix analysis
Abstract
The ergodic unitarily invariant measures on the space of infinite Hermitian matrices have been classified by Pickrell and Olshanski-Vershik. The much-studied complex inverse Wishart measures form a projective family, thus giving rise to a unitarily invariant measure on infinite positive-definite matrices. In this paper we completely solve the corresponding problem of ergodic decomposition for this measure.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
\FirstPageHeading
\ShortArticleName
Ergodic Decomposition for Inverse Wishart Measures on Infinite Positive-Definite Matrices
\ArticleName
Ergodic Decomposition for Inverse Wishart Measures
on Infinite Positive-Definite Matrices
\Author
Theodoros ASSIOTIS
\AuthorNameForHeading
T. Assiotis
\Address
Mathematical Institute, University of Oxford, Oxford, OX2 6GG, UK \Email[email protected] \URLaddresshttps://sites.google.com/view/theoassiotis/home
\ArticleDates
Received April 08, 2019, in final form September 04, 2019; Published online September 11, 2019
\Abstract
The ergodic unitarily invariant measures on the space of infinite Hermitian matrices have been classified by Pickrell and Olshanski–Vershik. The much-studied complex inverse Wishart measures form a projective family, thus giving rise to a unitarily invariant measure on infinite positive-definite matrices. In this paper we completely solve the corresponding problem of ergodic decomposition for this measure.
\Keywords
infinite random matrices; ergodic measures; inverse Wishart measures; orthogonal polynomials
\Classification
60B15; 60G55
1 Introduction
1.1 Informal introduction and historical overview
Since their introduction in the 1920’s [34] the Wishart measures have been ubiquitous in mathematics, physics and statistics. They appear in diverse fields, from statistical analysis [17, 19] to stochastic processes [3, 28] and free probability [8, 22]. More recently, there has been renewed interest in connection to their applications in quantum transport [10, 11] and their enumerative properties, in particular relations to Hurwitz numbers [9].
This paper stems from the following remarkable property, and its consequences, of these measures: the inverse Wishart measures \big{\{}\mathsf{M}^{(\nu),N}\big{\}}_{N\geq 1} ( is a real parameter greater than ) defined in (1.3) on (positive-definite) Hermitian matrices form a projective family under the so-called corners maps given in (1.1) below. The goal of this paper is to study the corresponding unitarily invariant, namely invariant under conjugation by unitary matrices, measure on infinite (positive-definite) Hermitian matrices and describe explicitly how it decomposes into ergodic components.
These ergodic measures for the action by conjugation of the inductive limit of unitary groups on infinite Hermitian matrices have been classified in classical works of Pickrell [26] and Olshanski and Vershik [24]. They are parametrized by the infinite dimensional space defined in (1.2) below and depend on a set of parameters \big{(}\{\alpha^{+}\},\{\alpha^{-}\},\gamma_{1},\gamma_{2}\big{)}\subset\mathbb{R}_{+}^{\infty}\times\mathbb{R}_{+}^{\infty}\times\mathbb{R}\times\mathbb{R}_{+}. As we will see in Section 3, the parameters are asymptotic eigenvalues and and are related to the asymptotic trace and asymptotic sum of squares respectively; the parameter is also called the ‘Gaussian component’. The study of especially and also is a much more difficult task compared to describing the ’s.
The problem of ergodic decomposition of certain distinguished unitarily invariant measures on infinite Hermitian matrices was initiated by Borodin and Olshanski in [2]. They considered the Hua–Pickrell measures depending on a complex parameter . These measures were first studied by Hua in his classical book [18] and implicit in his calculations is consistency under the corners maps, see also Neretin’s generalization [23]. Borodin and Olshanski described the parameters and proved that for , . The determination of and was left open for many years until recently in a breakthrough work [27] Qiu proved that for general parameter and completely described for real (see Remark 5.5 for more on this restriction). In the case of the inverse Wishart measures we are able to completely describe all the parameters for all . This is achieved in Theorem 1.6, the main result of this paper.
A closely related problem is the ergodic decomposition of the so-called Pickrell measures [25] (depending on a real parameter ) on infinite square complex matrices. The ergodic unitarily invariant (by multiplication to the left and to the right) measures on infinite square complex matrices have also been classified. These are parametrized by a different infinite dimensional space that is a subset of (there is no analogue of ). The explicit description of the ergodic decomposition has been settled in a series of papers by Bufetov [4, 5, 6] (see also [7]), which have been very influential for us. We should mention that the papers of Bufetov [4, 5, 6] and Qiu [27] also study the infinite case of the problem of ergodic decomposition, namely when the corresponding matrix measures no longer have finite mass. Since this requires quite different techniques we will not consider it in this work.
Finally, before closing this informal introduction we remark that a key role in all these papers [2, 4, 5, 6, 7, 27] is played by orthogonal polynomials. In the case of the Hua–Pickrell measures these are the pseudo-Jacobi polynomials and in the case of the Pickrell measures these are the Jacobi. The analogous role in this paper is played by the Bessel [21] and also Laguerre polynomials.
In the next subsections we give the necessary background to make the informal discussion above precise and state our results rigorously.
1.2 Ergodic unitarily invariant measures on infinite Hermitian matrices
Let and be the group of unitary matrices and the space of Hermitian matrices respectively. Let be the inductive limit of unitary groups
[TABLE]
under the natural embeddings. In more explicit terms an element of is an infinite block matrix whose top corner is an unitary matrix for some finite and the other block is the (infinite) identity matrix.
Consider the so called corners maps defined by
[TABLE]
Let be the space of infinite Hermitian matrices defined as the projective limit
[TABLE]
under the corners maps. Moreover, let denote the space of positive-definite matrices; namely matrices with positive eigenvalues. By Cauchy’s interlacing theorem we get that . Thus, we can also correctly define the projective limit .
Now, acts on by conjugation: for each we have a map given by . It is a classical theorem of Pickrell [26] and also Olshanski and Vershik [24] that ergodic measures on for this action (namely ones such that all -invariant subsets have mass 0 or 1) are parametrized by the infinite dimensional space :
[TABLE]
Observe that is a locally compact space. We then have the following classification theorem, see [24, 26], also [12].
Theorem 1.1** (Pickrell, Olshanski–Vershik).**
There exists a parametrization of ergodic -invariant probability measures on the space by the points of the space described as follows. Given the characteristic function of the ergodic measure is given by
[TABLE]
where
[TABLE]
Note that the characteristic function is well defined for all by the fact that the sum of squares of the ’s is finite. Also, observe that parameter corresponds to an infinite random Hermitian matrix with independent (subject to the Hermitian constraint) complex Gaussian entries with mean 0 and variance on the diagonal.
1.3 The inverse Wishart measures on infinite positive-definite matrices
For , consider the complex Wishart (or Laguerre ensemble) probability measure on Hermitian matrices, supported on :
[TABLE]
where throughout the paper for a Hermitian matrix , denotes Lebesgue measure on (we suppress dependence on ):
[TABLE]
The restriction is so that the normalization constant is finite.
Under the change of variables we obtain the central object of study in this paper, the inverse Wishart probability measures on
[TABLE]
Observe that, for all the measure is unitarily invariant, namely invariant under the action of by conjugation. Then, we have the following consistency result:
Proposition 1.2**.**
For the measures \big{\{}\mathsf{M}^{(\nu),N}\big{\}}_{N\geq 1} form a projective family
[TABLE]
Thus, by Kolmogorov’s theorem we obtain a unitarily invariant measure on that is supported on .
Proposition 1.2 is proven in Section 2 as Proposition 2.3. A key role in the proof is played by the Bessel orthogonal polynomials [21].
Remark 1.3**.**
Although we have not been able to locate Proposition 1.2 anywhere in the literature, in an equivalent form a close variant of it, for the analogous measure on real symmetric positive-definite matrices, appears to be folklore in the statistical literature, see for example [17, Chapter 3]. The argument there makes use of the technique of Schur complementation, the formula for the determinant of a block matrix and the special form of the density of . The proof presented in Section 2 is completely different and makes a novel use of the connection to orthogonal polynomials.
1.4 Description of ergodic decomposition of
Consider the measure defined above for . It is a result of Borodin and Olshanski, see Proposition 4.4 in [2], that there exists a unique probability measure on such that
[TABLE]
Here, the equality is interpreted as integrated against a test function, see Section 3. The main result of this paper is the explicit description of . To proceed and state it precisely we need some more definitions and background on determinantal measures.
Definition 1.4**.**
Define the subset such that iff
[TABLE]
In particular, on there is no ‘Gaussian component’ namely and the parameter is completely determined by the .
Determinantal measures
Let be a locally compact Polish space equipped with a -finite reference measure . Let be the space of point configurations over . Points in a point configuration will be called particles. We can embed in the space of finite measures on by and with the induced topology is a Polish space.
A Borel probability measure on is called a determinantal point process or measure, see [29], with (Hermitian) kernel if for any and function \Phi\in C_{c}\big{(}\mathcal{X}^{n}\big{)}, continuous and of compact support, we have
[TABLE]
where the sum is taken over ordered -tuples of particles with pairwise distinct labels. The measure satisfying (1.4) completely determines the pair and dropping dependence on (usually fixed), we denote it by .
Throughout this paper the reference measure will be Lebesgue measure. We now define a distinguished determinantal measure on .
Definition 1.5**.**
Define the Bessel kernel by
[TABLE]
where is the Bessel function of order . This kernel gives rise to the Bessel determinantal point process on of Tracy and Widom [32].
We are ready to give the explicit description of the ergodic decomposition of the inverse Wishart measures .
Theorem 1.6**.**
Let . The spectral measure associated to is concentrated on
[TABLE]
Moreover, the law of the parameters \alpha^{+}=\big{(}\alpha_{1}^{+}\geq\alpha_{2}^{+}\geq\alpha_{3}^{+}\geq\cdots\geq 0\big{)} under viewed as a point configuration on is given by the determinantal point process with correlation kernel defined by
[TABLE]
Theorem 1.6 above will be proven by an approximation procedure, the so-called ‘ergodic method’ of Olshanski and Vershik [24], that is explained in Section 3. For this asymptotic analysis we will exploit the relation with the Laguerre ensemble.
1.5 Organisation of the paper
In Section 2, we prove consistency for the inverse Wishart measures. This is proved at the level of eigenvalue measures first and then lifted to matrices. The key ingredient is the backward shift equation for Bessel polynomials. In Section 3, we recall in detail the approximation procedure of Vershik, Borodin and Olshanski. In Section 4, we study the parameters. We obtain the parameters as limits of the Bessel orthogonal polynomial ensemble, which is a determinantal point process. In Section 5, we obtain certain estimates for the kernel of the Bessel orthogonal polynomial ensemble. These are essential for the study of and . In Section 6, we prove that . In Section 7, we treat the parameter. A key role is played by positivity along with the estimates from Section 5. Finally, in Section 8 we simply put everything together to conclude the proof of Theorem 1.6.
2 Consistency of
Let . Recall that, we are interested in the normalized (probability) measure
[TABLE]
where the normalizing constant will be given explicitly below.
By Weyl’s integration formula we get that the induced probability measure on eigenvalues in the Weyl chamber (we write if all coordinates are positive)
[TABLE]
is given by
[TABLE]
with the Bessel weight on
[TABLE]
and we will write
[TABLE]
for the Vandermonde determinant.
Moreover, the constants and are related by
[TABLE]
It will be convenient to introduce the following notation: we define the map by the vector of eigenvalues of in weakly decreasing order. In this notation we have
[TABLE]
Bessel polynomials. The orthogonal polynomials with respect to , that are called the Bessel polynomials [21], will be important for us. The reference for all the facts stated below is [20, Chapter 9.13, pp. 244–247].
For , there exist monic orthogonal polynomials of degree with respect to . These can be expressed in terms of hypergeometric functions but we shall not need any explicit expression here. Their norms are given by, for ,
[TABLE]
Here, is the Pochhammer symbol.
Also, we have the following key relation, called the backward shift equation, that relates orthogonal polynomials with respect to to orthogonal polynomials with respect to
[TABLE]
Furthermore, by writing the Vandermonde determinant in terms of the monic orthogonal polynomials a standard calculation gives that
[TABLE]
and thus we also obtain an explicit expression for .
Now, we introduce the following Markov kernel from to , defined for (the interior of ) as
[TABLE]
where denotes interlacing
[TABLE]
This Markov kernel has a random matrix interpretation, due to Baryshnikov [1] (the required computation is already implicit in the classical book of Gelfand and Naimark [15]), which easily extends to any (even when the coordinates coincide)
[TABLE]
where is a random (Haar distributed) unitary matrix from .
We will first prove consistency at the level of eigenvalues:
Proposition 2.1**.**
For
[TABLE]
Proof.
Since both sides are probability measures, it suffices to prove that they are equal up to multiplicative constant (we will use the notation for this). Since is supported on we can write (note that since we have \big{\{}x\in W^{N+1}_{+}\big{\}}\Rightarrow\big{\{}y\in W^{N}_{+}\big{\}})
[TABLE]
Note that we can write
[TABLE]
We thus need to show
[TABLE]
By multilinearity of the determinant we obtain that the l.h.s. of (2.1) is
[TABLE]
where .
Now, by the backward shift equation we can perform the integral inside the determinant and obtain for :
[TABLE]
We note that when evaluated at and the terms above vanish. Hence, we get that the l.h.s. of (2.1) is proportional to (note that the entry with index is the difference and not just , similarly for the entry with index )
[TABLE]
Successively adding column to column we obtain that this is equal to
[TABLE]
from which (2.1) immediately follows. ∎
Remark 2.2**.**
As pointed out to me by Grigori Olshanski a similar idea of using the backwards shift equation to prove consistency appears in the study of the q-zw measures on the quantized Gelfand–Tsetlin graph [16]. The corresponding orthogonal polynomials are the pseudo big -Jacobi, see [16] and the references therein.
We will now, making use of Baryshnikov’s result [1], prove consistency for the matrix measures.
Proposition 2.3**.**
For , the inverse Wishart measures form a projective family
[TABLE]
Thus, by Kolmogorov’s theorem there exists a unique unitarily invariant measure on that is supported on .
Proof.
First, observe that if a measure is unitarily invariant on then \big{(}\pi_{N}^{N+1}\big{)}_{*}\mathfrak{N} is unitarily invariant on . Thus, it suffices to show that
[TABLE]
On the other hand from Proposition 2.1 we have
[TABLE]
Hence, we need to show
[TABLE]
Now, let be fixed and consider the orbital measure on
[TABLE]
where is Haar distributed in .
Then, since , Baryshnikov’s result [1] can be written as
[TABLE]
By Weyl’s integration formula we have
[TABLE]
So we obtain
[TABLE]
By linearity of the operations involved
[TABLE]
and so we finally arrive at
[TABLE]
Remark 2.4**.**
The exact same scheme of proof, can be applied to the case of the Hua–Pickrell measures. One uses, instead the backward shift equation for the pseudo-Jacobi polynomials, see [20, Section 9.9].
We finally reinterpret the proposition above to obtain the following matrix integral. This is an analogue of Hua’s integrals [18, 23] for the inverse Wishart measures. Let
[TABLE]
For we write
[TABLE]
where , , . Note that, implies .
Corollary 2.5**.**
For and
[TABLE]
3 Approximation of spectral measures
In order to proceed we will need to get a handle on the abstract spectral measure . The following approximation procedure of Olshanski–Vershik [24] and Borodin–Olshanski [2], based on the ergodic method of Vershik [33] allows us to do so.
For we define the numbers
[TABLE]
Equivalently, if and denote the number of strictly positive terms in \big{\{}\alpha_{i,N}^{+}\big{(}\lambda^{(N)}\big{)}\big{\}} and \big{\{}\alpha_{i,N}^{-}\big{(}\lambda^{(N)}\big{)}\big{\}} respectively, we have
[TABLE]
Define the corner map by . Let be given. Then, we define the numbers \big{\{}\alpha_{i,N}^{+}(X)\big{\}}, \big{\{}\alpha_{i,N}^{-}(X)\big{\}} by
[TABLE]
We also set,
[TABLE]
Having all these notations in place we now arrive at the following important definition (see Theorem 3.2 below for the motivation behind it):
Definition 3.1**.**
A matrix is called regular and we will write if the following limits exist
[TABLE]
We can easily see that and we define
[TABLE]
We also define by
[TABLE]
and similarly , that is defined correctly on and thus almost everywhere on as we shall see in Theorem 3.2 below
[TABLE]
With all these definitions in place we can now state the following result from [2, Section 5].
Theorem 3.2**.**
Let be any -invariant probability measure on . Then, is supported on . Moreover, there exists a unique spectral measure associated to in the particular case we write as we did in the introduction defined by
[TABLE]
where the equality is understood as follows: for all Borel functions on
[TABLE]
Furthermore, the spectral measure is given explicitly by
[TABLE]
Finally, we have the following weak convergence of probability measures
[TABLE]
We will need some more definitions and notations used in later sections. For (deterministic or random) in and respectively define the point configurations
[TABLE]
omitting possible zeroes. We will write if .
For on that is -invariant we will let and (we drop dependence on ) denote the corresponding random point configurations, namely and if .
We need a final definition for a general measure on . We define its correlation functions for each (if they exist) with respect to , by replacing the r.h.s. of (1.4) by
[TABLE]
In particular, for a determinantal measure we have
[TABLE]
4 Limit of the correlation kernel and the parameters
4.1 The parameters
The following proposition is obvious from the definitions in Section 3 and Theorem 3.2, since the measure is supported on :
Proposition 4.1**.**
Let . Then,
[TABLE]
Thus, we can restrict our attention on the parameters which form a random point configuration on (throughout, the reference measure on will be Lebesgue measure), which we go on to study next.
4.2 Explicit expression for the correlation kernel and the parameters
It is a standard result from random matrix theory that the measure gives rise to a determinantal point process on with particles. It is the orthogonal polynomial ensemble associated to the Bessel weight . We will denote its correlation kernel by . This is given explicitly in terms of Bessel polynomials but for the purposes of the asymptotic analysis we will instead exploit the connection to the Laguerre ensemble.
First, we need to recall a simple fact about transformations of determinantal measures on . Let be a bijection and let be its inverse. Then, induces a homeomorphism of : for a configuration the particles of are of the form , . Let be a determinantal measure on . Then, its pushforward under is also a determinantal measure
[TABLE]
with correlation kernel
[TABLE]
The Laguerre ensemble , defined for , is the probability measure on
[TABLE]
We will denote for , by the monic Laguerre polynomials, orthogonal with respect to the measure (note that this, unlike , does not depend on )
[TABLE]
Their squared norm is given by:
[TABLE]
It is a standard result that the Laguerre ensemble gives rise to a determinantal point process on with particles and its correlation kernel , with respect to Lebesgue measure, is given by
[TABLE]
Using the Christoffel–Darboux formula we can further write
[TABLE]
Now, note that under the transformation we have
[TABLE]
Thus, the correlation kernel of the determinantal point process associated to is given by
[TABLE]
Furthermore, the scaled point process where is determinantal on with correlation kernel , with respect to Lebesgue measure, given by
[TABLE]
And also in terms of the Laguerre kernel
[TABLE]
Proposition 4.2**.**
Let . Then, we have uniformly on compacts in
[TABLE]
Furthermore, the determinantal point process with on convergences weakly as to the determinantal point process such that
[TABLE]
and so do all the correlation functions. Finally, under the transformation we get the Bessel point process
[TABLE]
Proof.
We first write using relation (4.1)
[TABLE]
Then, the first statements of the proposition are immediate consequences of the following well-known facts: the uniform convergence on compacts in , with
[TABLE]
and convergence of the Laguerre ensemble determinantal point process at the hard edge scaling limit to the Bessel process, see [13, 14, 32]. These results follow from uniform on compacts asymptotics for Laguerre polynomials, see [31]. The final statement is immediate from the transformation rule for determinantal point processes. ∎
Remark 4.3**.**
Using, the representation of and thus in terms of the Bessel polynomials it is possible to give an alternative proof of Proposition 4.2. The analysis boils down to asymptotics for hypergeometric functions.
Finally, the following completes the description of the parameters.
Proposition 4.4**.**
Let . Then,
[TABLE]
Proof.
Observe that, since the are strictly decreasing (by Proposition 4.2 they form a determinantal point process) it suffices to prove that
[TABLE]
Under the map , by Proposition 4.2, it then suffices to prove that the Bessel point process has infinitely many particles almost surely which is a well-known result (in fact stronger quantitative results are known on the number of particles in growing intervals, see [30, Theorem 2]). This is a simple consequence of Theorem 4 of [29] and the fact that is a projection kernel of infinite rank (more precisely induces on the operator of orthogonal projection onto the subspace of functions whose Hankel transform is supported on , see [32]). ∎
5 An estimate on the correlation kernel
In this section we obtain certain, uniform in , estimates on , that will be useful for the description of the parameters and .
Proposition 5.1**.**
Let . For any , there exists such that for all
[TABLE]
Using relation (4.1), then in terms of the Laguerre kernel it will suffice to prove:
Proposition 5.2**.**
Let . For any there exists large enough such that for all
[TABLE]
Bounds for Laguerre polynomials. In order to prove Proposition 5.2 we first need to recall some bounds for Laguerre polynomials from the classical book of Szegö [31].
Lemma 5.3**.**
We have the following, uniform in , estimate for the Laguerre wavefunction defined by the first equality below, with being an arbitrary fixed constant
[TABLE]
Here, only depends on and in particular is independent of , while is a generic constant independent of all quantities involved in the statement above.
Proof.
We make use of results from Szegö [31]. We note that in [31] statements involving Laguerre polynomials are for the ones normalized to have leading coefficient . Since we are interested in the monic Laguerre polynomials we simply need to multiply the formulae therein by the inverse of this coefficient. Then, Theorem 7.6.4 in [31] reads as follows in our setting, for some fixed constant and uniformly in
[TABLE]
Here, only depends on and is independent of , while is a generic constant independent of all quantities involved in the statement above.
Now, recall that . Then, using the classical fact for ratios of Gamma functions
[TABLE]
and the trivial bound we obtain the statement of the lemma. ∎
With these preliminaries in place we are ready to prove Proposition 5.2.
Proof of Proposition 5.2.
Let be arbitrary (and for convenience assume ). Below, we will pick (in this order) constants depending on . This choice will be made in display (5.2) based on the bound (5.1).
We will use the notation to mean up to a constant; with the implicit constant being independent of (and obviously of the quantities , , depending on it) and uniform in (in particular we keep track of the constant from Lemma 5.3 but not of the generic constant ). It is clear that it suffices to prove that we can find large enough such that uniformly in :
[TABLE]
First, recall that
[TABLE]
We split the integral, with to be picked according to (large)
[TABLE]
We then, using the fact that for all , easily estimate
[TABLE]
We now focus on the integral
[TABLE]
and split the range of summation, for to be picked depending on (small), as follows
[TABLE]
We will moreover, in the range , split the integral further as
[TABLE]
Note that, since the integrand is positive, in case , we simply estimate
[TABLE]
Thus, we have the bound
[TABLE]
where we define
[TABLE]
We now go on to estimate each of these terms individually. Using the bound for from Lemma 5.3 in the range , we estimate :
[TABLE]
We split into three cases. For we have
[TABLE]
While, for
[TABLE]
Finally, for
[TABLE]
Observe that, the last bound decreases as increases since is negative.
Now, using the bound for from Lemma 5.3 in the range , we estimate :
[TABLE]
Finally, we turn to . We assume that is large enough so that . The fact that this is possible (not trivial apriori since both quantities depend on ) will be clear by the choices made in (5.2) below. Thus, the bound for from Lemma 5.3 valid in the range , is valid throughout the range of integration . Hence, we estimate
[TABLE]
Putting everything together we obtain
[TABLE]
We now pick the quantities depending on so that each summand in bound (5.1) is of order at most (for small). We first choose . It is also convenient to define the following constant
[TABLE]
Observe that, with this choice of the bound in (5.1) is clearly still valid if we replace by .
Hence, it is not hard to see that we can choose as follows (of course other choices are possible)
[TABLE]
Note that, in all cases above the requirement , that was used to bound , is satisfied. Thus, if we take as above, we get uniformly in
[TABLE]
The proof is complete. ∎
The proof of Proposition 5.2, in particular the inequality in display (5.1), also gives the following lemma, written in terms of :
Lemma 5.4**.**
Let . Let be fixed. Then
[TABLE]
Remark 5.5** (estimates for Hua–Pickrell measures).**
For the Hua–Pickrell measures an estimate for the corresponding correlation kernel (the analogue of ) also holds (the integral is over the range since the in this case are not trivial)
[TABLE]
This as we see in the next section gives that .
On the other hand, in the analysis of the parameter , one is led to consider the following term
[TABLE]
For , due to the symmetry of the kernel , it is immediate that this term vanishes identically. Then, one is left with terms that can be easily estimated by (5.3). In general, the problem of estimating (5.4) (when it’s not trivial) appears to be open.
6 The parameter
We first recall the following result, see [2, Proposition 7.2]:
Proposition 6.1**.**
Let be a -invariant probability measure on . Let and be the corresponding point processes on defined in Section 3. Let and be the first correlation functions with respect to Lebesgue measure assuming they exist of these point processes. Assume that, for any we have
[TABLE]
Finally, assume that
[TABLE]
Then, we have
[TABLE]
The proposition above, along with the results of the previous sections, allows us to determine :
Proposition 6.2**.**
Let . Then
[TABLE]
Proof.
We apply Proposition 6.1 with . The convergence of correlation functions (6.1) comes from Proposition 4.4. Moreover, statement (6.2) above becomes (recall that the first correlation function for and vanishes identically for ):
[TABLE]
which is an immediate consequence of Proposition 5.1. ∎
7 The parameter
Proposition 7.1**.**
Let . Then
[TABLE]
Proposition 7.1 will be an easy consequence of the next result, Propositions 7.4 and 5.1.
Proposition 7.2**.**
Let be a -invariant measure on such that
[TABLE]
In particular,
[TABLE]
Moreover, assume that
[TABLE]
Let be the corresponding point processes of ’s on and let and be their first correlation functions with respect to Lebesgue measure assuming they exist. Assume that for any
[TABLE]
Finally, assume that
[TABLE]
Then, we have
[TABLE]
We first need an elementary lemma.
Lemma 7.3**.**
Assume we are given numbers
[TABLE]
such that
[TABLE]
Moreover, assume the following limit exists and is finite
[TABLE]
Note that by Fatou’s lemma and positivity
[TABLE]
Let be a continuous function on such that
[TABLE]
for a certain . Then,
[TABLE]
Proof.
Observe that, there exists such that . Then for sufficiently large and for by monotonicity. Also, for . Therefore
[TABLE]
Thus,
[TABLE]
and
[TABLE]
As by continuity of
[TABLE]
and by the assumptions of the lemma
[TABLE]
The statement now follows. ∎
Proof of Proposition 7.2.
First, observe that is supported on the subset that we now define. An element iff
[TABLE]
Fix a continuous function , vanishing for large enough, such that near 0. For any we set
[TABLE]
Apply the previous lemma to the sequences , for (note that all conditions are satisfied) to get
[TABLE]
Observe that all three functions , , are non-negative and thus Fatou’s lemma gives
[TABLE]
Associate the point configurations , to . Then
[TABLE]
so that by the definition of the correlation functions
[TABLE]
and similarly
[TABLE]
Thus
[TABLE]
We now proceed to show that
[TABLE]
Since on we get that for , from which, recalling that is supported on the conclusion of the proposition follows.
To this end, decompose as follows, for arbitrary
[TABLE]
where , , near [math] and and positive. From the assumption of the proposition we obtain
[TABLE]
Thus by Fatou’s lemma for any
[TABLE]
Taking the limit we finally get, by convergence of the first correlation function ,
[TABLE]
Proposition 7.4**.**
Let . Then
[TABLE]
Proof.
First of all, we note that is supported on the subset that we now define. An element iff
[TABLE]
Moreover, if we define for the subset such that iff we easily see that
[TABLE]
Hence it will suffice to show that for any fixed
[TABLE]
Furthermore, by positivity it actually suffices to show
[TABLE]
where the expectation is with respect to . We calculate, using Fatou’s lemma and the underlying determinantal structure
[TABLE]
The last claim is the statement of Lemma 5.4. ∎
Proof of Proposition 7.1.
We apply Proposition 7.2. The first assumptions follow from Propositions 4.1, 4.4 and 7.4 above, while the fact that
[TABLE]
follows from Proposition 5.1. ∎
8 Proof of main theorem
Proof of Theorem 1.6.
The fact that
[TABLE]
follows from combining Propositions 4.1, 4.4, 6.2, and 7.1.
The description of the law of the parameters under viewed as a point configuration on is given by Proposition 4.2 (after making use of Theorem 3.2). The proof is complete. ∎
Acknowledgements
I would like to thank Alexei Borodin and Grigori Olshanski for some useful comments and pointers to the literature. Finally, I would like to thank the anonymous referees for a careful reading of the paper and a number of useful suggestions and remarks. Research supported by ERC Advanced Grant 740900 (LogCorRM).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Baryshnikov Yu., GU Es and queues, Probab. Theory Related Fields 119 (2001), 256–274. · doi ↗
- 2[2] Borodin A., Olshanski G., Infinite random matrices and ergodic measures, Comm. Math. Phys. 223 (2001), 87–123, ar Xiv:math-ph/0010015 . · doi ↗
- 3[3] Bru M.-F., Wishart processes, J. Theoret. Probab. 4 (1991), 725–751. · doi ↗
- 4[4] Bufetov A.I., Infinite determinantal measures and the ergodic decomposition of infinite Pickrell measures. I. Construction of infinite determinantal measures, Izv. Math. 79 (2015), 1111–1156, ar Xiv:1312.3161 . · doi ↗
- 5[5] Bufetov A.I., Infinite determinantal measures and the ergodic decomposition of infinite Pickrell measures. II. Convergence of infinite determinantal measures, Izv. Math. 80 (2016), 299–315, ar Xiv:1610.04639 . · doi ↗
- 6[6] Bufetov A.I., Infinite determinantal measures and the ergodic decomposition of infinite Pickrell measures III. The infinite Bessel process as the limit of radial parts of finite-dimensional projections of infinite Pickrell measures, Izv. Math. 80 (2016), 1035–1056, ar Xiv:1610.04646 . · doi ↗
- 7[7] Bufetov A.I., Qiu Y., The explicit formulae for scaling limits in the ergodic decomposition of infinite Pickrell measures, Ark. Mat. 54 (2016), 403–435, ar Xiv:1402.5230 . · doi ↗
- 8[8] Capitaine M., Casalis M., Asymptotic freeness by generalized moments for Gaussian and Wishart matrices. Application to beta random matrices, Indiana Univ. Math. J. 53 (2004), 397–431, ar Xiv:math.PR/0504414 . · doi ↗
