This paper explores the connection between orbital free entropy and matrix liberation processes, establishing large deviation principles and introducing a new approach to free mutual information.
Contribution
It demonstrates that fundamental questions about orbital free entropy can be addressed through large deviation principles for matrix liberation processes, offering a novel perspective.
Findings
01
Established a large deviation upper bound for certain random matrices
02
Linked orbital free entropy to large deviation principles
03
Proposed a new approach to free mutual information
Abstract
We investigate the concept of orbital free entropy from the viewpoint of matrix liberation process. We will show that many basic questions around the definition of orbital free entropy are reduced to the question of full large deviation principle for the matrix liberation process. We will also obtain a large deviation upper bound for a certain family of random matrices that is an essential ingredient to define the orbital free entropy. The resulting rate function is made up into a new approach to free mutual information.
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.
Full text
Matrix liberation process
II: Relation to Orbital free entropy
Yoshimichi Ueda
Graduate School of Mathematics,
Nagoya University,
Furocho, Chikusaku, Nagoya, 464-8602, Japan
We investigate the concept of orbital free entropy from the viewpoint of matrix liberation process. We will show that many basic questions around the definition of orbital free entropy are reduced to the question of full large deviation principle for the matrix liberation process. We will also obtain a large deviation upper bound for a certain family of random matrices that is an essential ingredient to define the orbital free entropy. The resulting rate function is made up into a new approach to free mutual information.
Key words and phrases:
Random matrix; Stochastic process; Unitary Brownian motion; Large deviation; Large N limit; Free probability; Orbital free entropy
2010 Mathematics Subject Classification:
60F10; 15B52; 46L54.
Supported by Grant-in-Aid for Challenging Exploratory Research 16K13762 and Grant-in-Aid for Scientific Research (B) JP18H01122.
1. Introduction
This paper is a sequel to our previous one [29] on the matrix liberation process, and devoted to explaining how the matrix liberation process is connected to the orbital free entropy χorb. Here, the negative of orbital free entropy may be regarded as a possible microstate approach to mutual information in free probability.
The key concept of free probability theory, initiated by Voiculescu in the early 80s, is the so-called free independence, which is a kind of statistical independence. Voiculescu then discovered around 1990 that the large N limit of independent (suitable) random matrices produces freely independent non-commutative random variables. In the 90s, in order to understand the notion of free independence deeply, Voiculescu introduced and studied several notions of free entropy (the microstate and the microstate-free ones), which are both analogs of Shannon’s entropy and expected to agree. Then, these notions of free entropy were further studied by Biane, Guionnet, Shlyakhtenko and many others from several viewpoints, including large deviation theory and optimal transportation theory. (See [31] for early history on free entropy.)
On the other hand, the information theory suggests us to introduce a free probability analog of mutual information that should characterize the freely independent situation as a unique minimizer. The main difficulty in such an attempt is the lack of free probability analog of relative entropy, and thus a completely new idea was (and probably still is) necessary. It was also Voiculescu [30] who first attempted to develop the theory of mutual information in free probability. His approach is based upon the liberation theory that he started to develop there with the microstate-free approach to free entropy. The most important concept in the liberation theory is the liberation process, a natural non-commutative probabilistic interpolation between given non-commutative random variables and their freely independent copies. Voiculescu’s idea of liberation theory is completely non-commutative in nature, and has no origin in the classical probability theory. Hence the liberation theory is quite attractive from the view point of noncommutative analysis.
Almost a decade later, we introduced, in a joint work [15] with Hiai and Miyamoto, the second candidate for mutual information in free probability, which we call the orbital free entropy, and its definition involves the adjoint actions of Haar-distributed unitary random matrices to the matrix space MNsa of N×N self-adjoint matrices and follows the basic idea of microstate approach to free entropy. (Some considerations looking for better variants of orbital free entropy were made by Biane and Dabrowski [5], and a direct generalization dropping the hyperfiniteness for given random multi-variables was then given by us [27].) The liberation process is exactly the large N limit of the matrix liberation process introduced in [29] and its ‘invariant measure’ (or its limit distribution as time goes to ∞) exactly arises as the ‘distribution’ of the adjoint actions of Haar-distributed unitary random matrices. Thus it is natural to consider the matrix liberation process for the conjectural unification between Voiculescu’s and our approaches to mutual information in free probability.
As a very first step, we proved in [29], following the idea of [4], the large deviation upper bound with a good rate function that completely characterizes the corresponding liberation process as a unique minimizer. The next ideal steps on this line of research should be: (1) proving the large deviation lower bound with the same rate function, (2) applying the contraction principle to the resulting large deviation upper/lower bounds at time T=∞, and (3) identifying the resulting rate function with Voiculescu’s free mutual information.
In this paper, we will mainly work on item (2). As a consequence, we will clarify how the matrix liberation process might resolve several technical drawbacks around the definition of orbital free entropy. As another consequence, we will get a large deviation upper bound result by applying the established contraction principle at T=∞ to the one for the matrix liberation process in our previous paper [29]. We will then make the resulting rate function up into a new microstate-free candiadate for free mutual information. Items (1) and (3) are left as sequels to this paper.
The precise contents of this paper are as follows. Sections 2 and 3 are preliminaries, and sections 4, 5 and 6 form the main body of this paper. The subsequent sections concern related materials.
In section 2, we will give one of the key technical lemmas. It is about the long time behavior of the large N limit of the logarithm of the heat kernel on U(N) divided by N2. This seems to be of independent interest. Then we will give a slightly modified definition of orbital free entropy in section 3.
In section 4, building on the previous work [29] we will prove that any large deviation upper or lower bound with speed N2 for the matrix liberation process starting at given several deterministic matrices, say ξij(N), with limit joint distribution implies the corresponding one with the same speed for the corresponding random matrices UN(i)ξij(N)UN(i)∗ with independent Haar-distributed unitary random matrices UN(i). This explicitly relates the matrix liberation process with the orbital free entropy. Combining this with the main result of [29] we will obtain a large deviation upper bound for UN(i)ξij(N)UN(i)∗.
In section 5, we will investigate the resulting rate function for UN(i)ξij(N)UN(i)∗ in some detail; we will prove that it admits a unique minimizer, which is precisely given by freely independent copies of the initially given non-commutative random multi-variables. This fact supports the validity of full large deviation principle with speed N2 and the same rate function for UN(i)ξij(N)UN(i)∗, because this unique minimizer property also follows from the conjectural full large deviation principle as well as the fact that the orbital free entropy completely characterizes the free independence (under the assumption of having matricial microstates). Moreover, this unique minimizer property suggests that the rate function can be regarded as a possible microstate-free candidate for free mutual information, and hence that the rate function ought have to have a coordinate-free fashion.
In section 6, we will give such a coordinate-free formulation. The coordinate-free formulation will be shown to be a quantity for a given finite family of subalgebras in a tracial W∗-probability space, which satisfies a desired set of properties (see subsection 6.7) that any kind of free mutual information has to satisify and, of course, Voiculescu’s one does.
In section 7, we will explain how the proofs given in the previous paper [29] also work well for several independent unitary Brownian motions with deterministic matrices (which are assumed to have the large N limit joint distribution), and compare its consequences with the corresponding results on the matrix liberation process. In section 8, we will give an explicit description in terms of free cumulants for the conditional expectation of the (time-dependent) liberation cyclic derivative EN(τ)(πτ~(Πs(Ds(k)P))) (see section 4 for the notation), which is the most essential component of the rate function. The description is a complement to a rather ad-hoc computation made in section 5. Finally, in the appendix, we explain some basic facts on universal free products of unital C∗-algebras for the reader’s convenience.
Glossary
•
∥−∥∞ denotes the operator norm.
•
MN⊃MNsa denote the N×N complex matrices and the N×N self-adjoint matrices. For each R>0, (MNsa)R denotes the subset of A∈MNsa with ∥A∥∞≤R.
•
TrN denotes the usual (i.e., non-normalized) trace on MN, and trN does its normalized one. We consider the Hilbert-Schmidt norm ∥A∥HS:=TrN(A∗A) on MN. It is known that MNsa equipped with ∥⋅∥HS is naturally identified with the N2-dimensional Euclidean space RN2. Thus MN=MNsa+−1MNsa equipped with ∥⋅∥HS is also naturally identified with the 2N2-dimensional Euclidean space R2N2=RN2⊕RN2.
•
U(N) denotes the N×N unitary matrices equipped with the Haar probability measure νN; n.b., the symbol νN differs from the one γU(N) in [15], [27]. A Haar-distributed N×N random unitary matrix means a random variable with values in U(N), whose probability distribution measure is exactly νN.
•
TS(A) denotes the tracial states on a unital C∗-algebra A. For a given subset X of a W∗-algebra, we denote by Xw its closure in the σ-weak topology (i.e., the weak∗ topology induced from the predual). For a unital ∗-homomorphism π:A→B between unital C∗-algebras, π∗:TS(B)→TS(A) denotes the dual map φ∈TS(B)↦φ∘π∈TS(A).
•
For a random variable X in the usual sense, E[X] denotes the expectation of X. Moreover, for a random variable Y with values in a topological space, we write P(Y∈A):=E[1A(Y)] for any Borel subset A; this is the distribution measure of Y. Here 1A denotes the indicator function of A.
Remark on Part I
We have investigated the matrix liberation process Ξlib(N) starting at (deterministic) Ξ(N)=(Ξi(N))i=1n+1 with Ξi(N)=(ξij(N))j=1r(i)∈(MNsa)r(i). Here, we remark that r(i)=∞ is allowable; namely, each Ξi(N) may be a countably infinite family of N×N self-adjoint matrices, and all the results given in part I still hold true in this more general situation without essential changes. In fact, we only need to change the metric d on the continuous tracial states TS^{c}\big{(}C^{*}_{R}\langle x_{\bullet\diamond}(\,\cdot\,)\rangle\big{)} (see subsection 4.3 below) as follows. Let W≤ℓ be all the words of length not greater than ℓ in indeterminates xij=xij∗ with 1≤i≤n+1, 1≤j≤ℓ (remark this restriction on j, which guarantees that W≤ℓ is a finite set), and we define
[TABLE]
for \tau_{1},\tau_{2}\in TS^{c}\big{(}C^{*}_{R}\langle x_{\bullet\diamond}(\,\cdots\,)\rangle\big{)}. Here, w(t1,…,tℓ) is constructed by substituting xikjk(tk) for xikjk in a given word w=xi1j1⋯xiℓ′jℓ′ with ℓ′≤ℓ.
Acknowledgements
We thank the CRM, Montréal and the organizers of the thematic one-month program ‘New Developments in Free Probability and Applications’ held there in March 2019, where we wrote a part of this paper. We also thank Thierry Lévy for his inspiring lectures and discussions at Kyoto and Nagoya in Oct. 2018 and David Jekel for his detailed feedback to the first version of this paper, which enabled us to improve the presentation of this paper. Finally, we thank the referee for his/her careful reading and pointing out some typos.
Added in proof
We have further investigated the rate functions in this paper after the submission. As one of its simple consequences, we confirmed that Iσ0,∞lib(τ)=Iσ0lib(τ) certainly holds if Iσ0lib(τ)<+∞ (see subsection 4.6 for the notation). We will give those details elsewhere.
2. The long time behavior of the large N limit of the Heat kernel on U(N)
In this section, we will investigate the long time behavior of the large N limit of the logarithm of the heat kernel on U(N) by utilizing a recent work on the Douglas and Kazakov transition due to Thierry Lévy and Maïda [21] (based on Guionnet and Maïda’s work [14]) as well as Li and Yau’s classical work on parabolic kernels [22]. The consequence (Lemma 2.1) will play a key role in section 4 to establish the contraction principle at time T=∞ for large deviation upper/lower bounds with speed N2 for the matrix liberation process Ξlib(N).
Consider U(N) as a Riemannian manifold of dimension N2 by the inner product on the corresponding Lie algebra u(N)=−1MNsa:
[TABLE]
Let Ric be the Ricci curvature associated with this Riemannian structure. It is known, by e.g., [1, Lemma F.27], that
[TABLE]
for every X∈u(N).
Let pN,t(U) be the heat kernel on U(N) with respect to this Riemannian structure as in [21, section 3.1]. Looking at the Fourier expansion of pN,t (see e.g., [21, Eq.(21)]) we observe that
[TABLE]
holds for every t>0. Recall that pN,t(U)=pN(U,IN,t/2), where pN(U,V,t), U,V∈U(N), t>0, is a unique fundamental solution of the heat equation ∂tu=Δu with the Laplacian Δ on U(N) equipped with the above Riemannian structure. See e.g., [10, p.135] for the notion of fundamental solutions of heat equations. It is well known, see e.g. [10, Theorem 1 in V.III.1], that pN is strictly positive. Since the Ricci curvature is non-negative as we saw before, we can apply Li–Yau’s theorem [22, Theorem 2.3] to u(U,t):=pN(U,IN,t) and obtain that
[TABLE]
for every t>0, 0<ε<1 and U∈U(N), where dN(IN,U) denotes the Riemannian distance between IN and U. Since maxU∈U(N)dN(IN,U)=Nπ (see e.g. the proof of [20, Proposition 4.1]), the above inequality with t=T/2 implies that
[TABLE]
for every T>0, 0<ε<1 and U∈U(N). Consequently, we have obtained that
[TABLE]
for every t>0, 0<ε<1 and U∈U(N). By [21, Theorem 1.1], it is known that
[TABLE]
exists and defines a continuous function on (0,+∞). Thus, we have
[TABLE]
for every T>0, 0<ε<1 and U∈U(N). In particular, we obtain that
[TABLE]
for every T>0 and 0<ε<1.
Assume that T>π2 in what follows. We need
the complete elliptic functions of the first kind and the second kind:
[TABLE]
With T=4K(2E−(1−k2)K), [21, Propositions 4.2, 5.2] show that
[TABLE]
Recall that
[TABLE]
(see e.g. [8, p.11]). This immediately implies that limk→1−0(1−k)αK=0 for any α>0. We also have E=1 at k=1. By the well-known formulas dK/dk=(E−(1−k2)K)/(k(1−k2)) and dE/dk=(E−K)/k, 0<k<1 (see [8, p.282]), we have d(2E−(1−k2)K)/dk=(1−k2)dK/dk. It is clear that K is increasing in k. Hence T is an increasing function in k. Then, we observe that T→+∞ if and only if k→1−0. Moreover, we have
[TABLE]
as k→1−0. Since dE/dk=(E−K)/k, 0<k<1 again, L’Hospital’s rule (see e.g. [26, Theorem 5.13]) enables us to confirm that limk→1−0(E−1)/(1−k)1/2=0 and hence
for all 0<ε<1. Since ε can arbitrarily be close to 1, we finally obtain the next lemma, which will play a key role in §4.
Lemma 2.1**.**
With
[TABLE]
we have
[TABLE]
3. Orbital free entropy revisited
Let Ξ=(Ξi)i=1n+1 with Ξi=(Ξi(N))N∈N be a finite family of sequences of (deterministic) multi-matrices such that each Ξi(N)=(ξij(N))j=1r(i), 1≤i≤n+1, is chosen from ((MNsa)R)r(i) with r(i)∈N∪{∞}for some R>0. We sometimes write Ξ=(Ξ(N))N∈N with Ξ(N)=((ξij(N))j=1r(i))i=1n+1. As in [29] we consider the universal C∗-algebra CR∗⟨x∙⋄⟩ generated by xij=xij∗, 1≤i≤n+1,j≥1, such that ∥xij∥∞≤R for all i,j, into which the universal unital ∗-algebra C⟨x∙⋄⟩ generated by the xij=xij∗ is faithfully and norm-densely embedded. Similarly, we define C⟨xi⋄⟩↪CR∗⟨xi⋄⟩ by fixing the first suffix i of generators. These universal C∗-algebras are constructed as universal free products of copies of C[−R,R], and each generator xij is given by the coordinate function f(t)=t in the (i,j)th copy of C[−R,R]. The above embedding properties are guaranteed by Proposition A.4. The ∗-homomorphism given by xij↦ξij(N) enables us to define tracial states trΞ(N)∈TS(CR∗⟨x∙⋄⟩) as well as trΞi(N)∈TS(CR∗⟨xi⋄⟩), 1≤i≤n+1, by P=P(x∙⋄)↦trN(P(ξ∙⋄(N))) (n.b., these notations differ a little bit from those in [29]). Remark that we can alternatively define trΞi(N) to be the restriction of trΞ(N) to CR∗⟨xi⋄⟩ (↪CR∗⟨x∙⋄⟩ faithfully by [6, Theorem 3.1] with Lemma A.1). We also assume that each Ξi, 1≤i≤n+1, has a limit distribution as N→∞; namely, there exists a σ0,i∈TS(CR∗⟨xi⋄⟩) such that limN→∞trΞi(N)=σ0,i in the weak∗ topology. (This is the minimum requirement for Ξ to define χorb(σ∣Ξ) below.) In what follows, we denote by TSfda(CR∗⟨xi⋄⟩) all the tracial states that arise in this way for a fixed 1≤i≤n+1. We also define TSfda(CR∗⟨x∙⋄⟩) similarly.
Let us introduce a variant of orbital free entropy, say χorb(σ∣Ξ) for σ∈TS(CR∗⟨x∙⋄⟩), which is essentially the same as the old one in [15, section 4] for hyperfinite non-commutative random multi-variables.
Define \mathbf{U}=(U_{i})_{i=1}^{n}\in\mathrm{U}(N)^{n}\mapsto\mathrm{tr}^{\Xi(N)}_{\mathbf{U}}\in TS\big{(}C^{*}_{R}\big{\langle}x_{\bullet\diamond}\big{\rangle}\big{)} by trUΞ(N):=trN∘ΦUΞ(N), where \Phi_{\mathbf{U}}^{\Xi(N)}:C^{*}_{R}\big{\langle}x_{\bullet\diamond}\big{\rangle}\to M_{N}(\mathbb{C}) is a unique ∗-homomorphism sending xij(1≤i≤n+1) to Uiξij(N)Ui∗ with U=(Ui)i=1n and xn+1j to ξn+1j(N), respectively. Consider an open neighborhood Om,δ(σ), m∈N, δ>0, at σ in the weak∗ topology on TS(CR∗⟨x∙⋄⟩) defined to be all the σ′∈TS(CR∗⟨x∙⋄⟩) such that
[TABLE]
whenever 1≤ik≤n+1, 1≤jk≤m, 1≤k≤p and 1≤p≤m. Then we define
[TABLE]
with log0:=−∞. Remark that χorb(σ∣Ξ)=−∞, if σ does not agree with σ0,i on CR∗⟨xi⋄⟩ for some 1≤i≤n+1. This is a natural property; see [17, Proposition 3.1] as well as Remark 6.2.
We could prove in [15, Lemma 4.2] that χorb(σ∣Ξ) depends only on the given σ0,i, 1≤i≤n+1, that is, it is independent of the choice of Ξ, when each tuple (xij)j=1r(i) produces a hyperfinite von Neumann algebra via the GNS construction associated with σ0,i. However, we suspected that this is not always the case. Hence, in [27], in order to remove the dependency of Ξ we took the supremum of χorb(σ∣A;N,m,δ) all over the tuples A of multi-matrices in place of Ξ(N) to define χorb(X1,…,Xn+1) (see the review below). Here, we will examine another simpler way of removing the dependency. So far, we have only assumed that each Ξi has a limit distribution as N→∞, that is, limN→∞trΞi(N)=σ0,i. In what follows, we need the stronger assumption that the whole Ξ has a limit distribution as N→∞, that is, limN→∞trΞ(N)=σ0.
Let another σ0∈TS(CR∗⟨x∙⋄⟩) be given in such a way that its restriction to CR∗⟨xi⋄⟩ is σ0,i for every 1≤i≤n+1. Then we define
[TABLE]
We define it to be −∞ if σ0 does not fall into TSfda(CR∗⟨x∙⋄⟩). Remark that χorb(σ∣Ξ) is well defined in the above definition, since limN→∞trΞ(N)=σ0 implies that limN→∞trΞi(N)=σ0,i for every 1≤i≤n+1. Moreover, taking the supremum all over the possible approximations Ξ to σ0 is motivated from the large deviation upper bound for the matrix liberation process starting at Ξ(N) [29] (see the next section), because the rate function that we found there is independent of the choice of approximations Ξ. We will prove two propositions, which suggest that χorb(σ∣σ0) should be the same for a large class of σ0.
We next recall the original orbital free entropy introduced in [27] (with a non-essential modification [28, Remark 3.3]) in the current setting. Let πσ:CR∗⟨x∙⋄⟩↷Hσ be the GNS representation associated with σ. Set Xijσ:=πσ(xij), 1≤i≤n+1,j≥1, and then write Xiσ=(Xijσ)j=1r(i), 1≤i≤n+1. Remark that the joint distribution of those X1σ,…,Xn+1σ with respect to the tracial state on πσ(CR∗⟨x∙⋄⟩)′′ induced from σ is exactly σ. On the other hand, if we have uniformly norm-bounded non-commutative self-adjoint random multi-variables X1=(X1j)j=1r(1),…,Xn+1=(Xn+1j)j=1r(n+1) in a W∗-probability space (M,τ), i.e., Xij∗=Xij and R:=supi,j∥Xij∥∞<+∞, then we have a unique tracial state σ(Xi)∈TS(CR∗⟨x∙⋄⟩) naturally, that is, σ(Xi)(xi1j1⋯ximjm):=τ(Xi1j1⋯Ximjm) for example. For any A=(Ai)i=1n+1 with Ai=(Aij)j=1r(i)∈((MNsa)R)r(i), 1≤i≤n+1, we define
[TABLE]
where trUA is defined in the same manner as the trUΞ(N) above. Note that the above definition clearly works even when r(i)=∞ for every 1≤i≤n+1.
The next proposition suggests which approximating sequences Ξ are suitable to define the orbital free entropy.
Proposition 3.1**.**
We have
[TABLE]
and equality holds when σ=σ0.
Proof.
Let Ξ=(Ξ(N))N∈N with Ξi(N)=(ξij(N))j=1r(i), 1≤i≤n+1, be as in definition (3.2). Clearly,
[TABLE]
holds for every N, m and δ. This immediately implies χorb(σ∣Ξ)≤χorb(X1σ,…,Xn+1σ). Since Ξ has arbitrarily been chosen, we obtain χorb(σ∣σ0)≤χorb(X1σ,…,Xn+1σ).
We next prove the latter assertion. We may and do assume that χorb(X1σ,…,Xn+1σ)>−∞; otherwise the desired equality trivially holds as −∞=−∞ by the first part. We can inductively choose an increasing sequence Nk in such a way that
[TABLE]
holds for every k; hence
[TABLE]
For each k one can choose A(Nk)=(Ai(Nk))i=1n+1 with Ai(Nk)=(Aij(Nk))j=1r(i)∈((MNksa)R)r(i), 1≤i≤n+1, in such a way that
[TABLE]
By definition, for each k there exists U(Nk)∈U(Nk)n such that trU(Nk)A(Nk)∈Ok,1/k(σ). With U(Nk)=(Ui(Nk))i=1n we define B(Nk)=((Bij(Nk))j=1r(i))i=1n+1 by
[TABLE]
Let Ξ=(Ξ(N))N∈N with Ξi(N)=(ξij(N))j=1r(i), 1≤i≤n+1, be the one chosen at the beginning of this proof. (The existence of such a sequence follows from χorb(X1σ,…,Xn+1σ)>−∞; see e.g. [17, Lemma 2.1].) Define Ξ′=(Ξ′(N))N∈N by
[TABLE]
Since
[TABLE]
it is easy to see that trΞ′(N) converges to σ in the weak∗ topology on TS(CR∗⟨x∙⋄⟩). Since
[TABLE]
for every k and since νN is invariant under right-multiplication, we observe that
[TABLE]
for every k. Thus, for each m∈N, δ>0, we have
[TABLE]
for all sufficiently large k. Thus, for every m∈N, δ>0, we obtain that
[TABLE]
Therefore, by taking the limit as m→∞, δ↘0 we have
[TABLE]
With the former assertion we are done.
∎
Another natural choice of initial tracial state σ0 is available; the tracial state is determined by making the resulting random multi-variables Xiσ0, 1≤i≤n+1, freely independent. The χorb(σ∣σ0) with this choice of σ0 is nothing but an unpublished variation of orbital free entropy due to Dabrowski, and the proposition below shows that it turns out to be the same as our original χorb(X1σ,…,Xn+1σ) in [27].
Proposition 3.2**.**
When the Xiσ0, 1≤i≤n+1, are freely independent, then χorb(σ∣σ0)=χorb(X1σ,…,Xn+1σ).
Proof.
By Proposition 3.1 we may and do assume χorb(X1σ,…,Xn+1σ)>−∞, and it suffices to prove
[TABLE]
To this end, let Ξ=(Ξ(N))N=1∞ with Ξ(N)=(Ξi(N))i=1n+1, Ξi(N)=(ξij(N))j=1r(i)∈((MNsa)R)r(i), 1≤i≤n+1, be such that limN→∞trΞ(N)=σ in the weak∗ topology. Choose an independent family of Haar-distributed unitary random matrices VN(i), 1≤i≤n. It is known, see e.g. [16, Theorem 4.3.1], that VN(1),…,VN(n),Ξ(N) are asymptotically free almost surely as N→∞ and moreover that the subfamily VN(1),…,VN(n) converges to a freely independent family of Haar unitaries in distribution almost surely as N→∞ too. Thus, thanks to the almost sure convergence, we can choose deterministic sequences Vi(N), 1≤i≤n, from random sequences VN(i), 1≤i≤n such that V1(N),…,Vn(N),Ξ(N) converge to the same family of non-commutative random variables in distribution as N→∞. Define Ξ′=(Ξ′(N))N=1∞ with Ξ′(N)=(Ξi′(N))i=1n+1, Ξi′(N)=(ξij′(N))j=1r(i) by
[TABLE]
Then, the Ξi′(N), 1≤i≤n+1, are asymptotically free as N→∞. Therefore, we conclude that limN→∞trΞ′(N)=σ0 in the weak∗ topology. Remark that
[TABLE]
holds for every N. Therefore, thanks to the invariance of νN under right-multiplication, we conclude, as in the proof of Proposition 3.1, that
[TABLE]
Since Ξ has arbitrarily been chosen, we are done.
∎
The above proof suggests that χorb(σ∣σ0) coincides with χorb(X1σ,…,Xn+1σ) for a large class of tracial states σ0∈TSfda(CR∗⟨x∙⋄⟩).
4. Orbital free entropy and Matrix liberation process
Building on our previous work [29] we will clarify how some fundamental questions concerning the orbital free entropy χorb are precisely reduced to the conjectural large deviation principle for the matrix liberation process. Lemma 2.1 will play a key role in what follows.
4.1. Non-commutative coordinates
Let CR∗⟨x∙⋄(⋅)⟩⊂CR∗⟨x∙⋄(⋅),v∙(⋅)⟩ be the universal unital C∗-algebras generated by xij(t)=xij(t)∗, 1≤i≤n+1,j≥1,t≥0, and vi(t), 1≤i≤n, t≥0, with subject to ∥xij(t)∥∞≤R and vi(t)∗vi(t)=vi(t)vi(t)∗=1=vi(0). These universal C∗-algebras are constructed as universal free products of uncountably many C[−R,R] and C(T), and generators xij(t) and ui(t) are given by coordinate functions f(t)=t in t∈[−R,R] or g(z)=z in z∈T of component algebras. Proposition A.3 guarantees the inclusion of two universal C∗-algebras. Recall that j may run over the natural numbers N as we remarked at the end of section 1. The universal ∗-algebras C⟨x∙⋄(⋅)⟩⊂C⟨x∙⋄(⋅),v∙(⋅)⟩ generated by the same indeterminates xij(t) and vi(t) can naturally be regarded as norm-dense ∗-subalgebras of CR∗⟨x∙⋄(⋅)⟩⊂CR∗⟨x∙⋄(⋅),v∙(⋅)⟩, respectively. Proposition A.4 guarantees this fact. For each T≥0, the correspondence xij↦xij(T), 1≤i≤n+1,j≥1, defines a unique (injective) ∗-homomorphism πT:CR∗⟨x∙⋄⟩→CR∗⟨x∙⋄(⋅)⟩ with notation CR∗⟨x∙⋄⟩ in section 3.
4.2. Time-dependent liberation derivative
We introduce the derivation
[TABLE]
which sends each xij(t) to
[TABLE]
Then we write Ds(k):=θ∘δs(k), 1≤k≤n,s≥0, where θ denotes the flip-multiplication mapping a⊗b↦ba.
4.3. Continuous tracial states
A tracial state τ on CR∗⟨x∙⋄(⋅)⟩ is said to be continuous if t↦πτ(xij(t)) is strongly continuous for every 1≤i≤n+1,j≥1, where πτ:CR∗⟨x∙⋄(⋅)⟩↷Hτ is the GNS representation associated with τ. We denote by TSc(CR∗⟨x∙⋄(⋅)⟩) all the continuous tracial states. The space TSc(CR∗⟨x∙⋄(⋅)⟩) becomes a complete metric space endowed with metric d defined by (1.1), which defines the topology of uniform convergence on finite time intervals.
4.4. Liberation process τs starting at a given time
We extend a given τ∈TSc(CR∗⟨x∙⋄(⋅)⟩) to a unique τ~∈TSc(CR∗⟨x∙⋄(⋅),v∙(⋅)⟩) in such a way that the vi(t) are ∗-freely independent of CR∗⟨x∙⋄(⋅)⟩ and form a ∗-freely independent family of left-multiplicative free unitary Brownian motions under this extension τ~. This extension of tracial state can be constructed, via the GNS representation πτ:CR∗⟨x∙⋄(⋅)⟩↷Hτ, by taking a suitable reduced free product. We write
[TABLE]
on Hτ, where πτ~:CR∗⟨x∙⋄(⋅),v∙(⋅)⟩↷Hτ~ is the GNS representation associated with τ~. Write xijτ(t):=πτ~(xij(t)) and viτ(t):=πτ~(vi(t)) and the canonical extension of τ~ to M(τ) is still denoted by the same symbol τ~ for simplicity. We denote by EN(τ) the τ~-preserving conditional expectation from M(τ) onto N(τ), which is known to exist and to be unique as a standard fact on von Neumann algebras. Consider an ‘abstract’ non-commutative process in CR∗⟨x∙⋄(⋅),v∙(⋅)⟩
[TABLE]
and the corresponding ‘concrete’ non-commutative stochastic process in M(τ)
[TABLE]
By universality, this process xijτs(t) clearly defines a tracial state τs∈TSc(CR∗⟨x∙⋄(⋅)⟩).
By the ∗-homomorphism Γ:CR∗⟨x∙⋄(⋅)⟩→CR∗⟨x∙⋄⟩ sending each xij(t) to xij, we obtain Γ∗(σ0):=σ0∘Γ∈TS(CR∗⟨x∙⋄(⋅)⟩) with a given σ0∈TS(CR∗⟨x∙⋄⟩) and set σ0lib:=Γ∗(σ0)0∈TS(CR∗⟨x∙⋄(⋅)⟩) (Γ∗(σ0)0 is defined in the same way as τs with s=0), which we call the liberation process starting at σ0 (precisely its empirical distribution).
4.5. New description of τs
By universality, we have a unique unital ∗-homomorphism
Πs:CR∗⟨x∙⋄(⋅),v∙(⋅)⟩→CR∗⟨x∙⋄(⋅),v∙(⋅)⟩ sending xij(t) and vi(t) to xijs(t) and vi(t), respectively. By using this ∗-homomorphism we obtain a unital ∗-homomorphism
[TABLE]
Then πτ~(Πs(Ds(k)P)), P∈C⟨x∙⋄(⋅)⟩, becomes the element of M(τ) obtained by substituting (xijτs(t),viτ(t)) for (xij(t),vi(t)) in Ds(k)P. Moreover, we have τs=τ~∘Πs on CR∗⟨x∙⋄(⋅)⟩.
4.6. Rate function
To a given σ0∈TS(CR∗⟨x∙⋄⟩)
we associate two functionals Iσ0lib,Iσ0,∞lib:TSc(CR∗⟨x∙⋄(⋅)⟩)→[0,+∞] as follows. For any τ∈TSc(CR∗⟨x∙⋄(⋅)⟩, P=P∗∈C⟨x∙⋄(⋅)⟩ and t∈[0,∞] we first define
[TABLE]
with regarding τ as τ∞ (since τt(P)=τ(P) when t is large enough), where ∥−∥τ~,2 denotes the 2-norm on the tracial W∗-probability space (M(τ),τ~). We remark that the integrand in (4.1) agrees with that given in [29] (though their representations are different at first glance), and moreover that the integration above is well defined even when t=∞, because Ds(k)P=0 when s is large enough. Then we define
[TABLE]
Each of the functionals Iσ0lib,Iσ0,∞lib is shown, in [29, Proposition 5.6, Proposition 5.7(3)] (n.b., their proofs work well even for the modification Iσ0,∞lib without any essential changes), to be a well-defined, good rate function with unique minimizer. Moreover, the minimizer for both functionals is identified with the liberation process σ0lib starting at σ0 for both functionals. Remark that the proofs of [29, Proposition 5.6, Proposition 5.7(3)] do not use the assumption that σ0 falls into TSfda(CR∗⟨x∙⋄⟩), and thus the functionals Iσ0lib,Iσ0,∞lib can be considered in the general setting. Remark that Iσ0,∞lib(τ)≤Iσ0lib(τ) obviously holds, but it is a question whether equality holds or not.
Here is a simple lemma, which can be applied to I=Iσ0lib or I=Iσ0,∞lib. Recall that πT:CR∗⟨x∙⋄⟩→CR∗⟨x∙⋄(⋅)⟩ is the unique injective ∗-homomorphism sending each xij to xij(T). In the lemma below, we will use the map πT∗:TSc(C∗⟨x∙⋄(⋅)⟩)→TSc(C∗⟨x∙⋄⟩) induced from πT, see the glossary in section 1.
Lemma 4.1**.**
For any functional I:TSc(C∗⟨x∙⋄(⋅)⟩)→[0,+∞], the new one J:TS(CR∗⟨x∙⋄⟩)→[0,+∞] defined by
[TABLE]
for any σ∈TS(CR∗⟨x∙⋄⟩) (with notation Om,δ(σ) in the previous section) is a well-defined rate function, where TS(CR∗⟨x∙⋄⟩) is endowed with the weak∗ topology and the infimum over the empty set is taken to be +∞. Moreover, replacing Om,δ(σ) with the closed neighborhood Fm,δ(σ) in the above definition of J(σ) does not affect its value, where Fm,δ(σ) is all the σ′∈TS(CR∗⟨x∙⋄⟩) such that
[TABLE]
whenever 1≤ik≤n+1, 1≤jk≤m, 1≤k≤p and 1≤p≤m.
Proof.
If m1≤m2 and δ1≥δ2>0, then Om1,δ1(σ)⊇Om2,δ2(σ) so that
[TABLE]
Therefore, taking limm→∞,δ↘0 in the definition of J(σ) is actually well defined and coincides with taking the supremum all over m∈N and δ>0.
We then confirm that J is lower semicontinuous. Assume that σk→σ in TS(CR∗⟨x∙⋄⟩) as k→∞. Choose an arbitrary 0≤L<J(σ). Then there exist m0∈N and δ0>0 such that
[TABLE]
Then, there exists k0∈N such that if k≥k0, then Om0,δ0/2(σk)⊆Om0,δ0(σ) and hence
[TABLE]
where the first inequality follows from the fact that limm→∞,δ↘0=supm,δ in the definition of J(σ) as remarked before. Therefore, we obtain that limk→∞J(σk)≥L, which guarantees that J is lower semicontinuous.
Since Om,δ(σ)⊆Fm,δ(σ)⊆Om,2δ(σ), we have
[TABLE]
for every m∈N and δ>0. This implies the last assertion.
∎
The above lemma clearly holds true even if limT→∞ is replaced with limT→∞ in the definition of J. We also remark that TS(CR∗⟨x∙⋄⟩) is weak∗ compact, and hence J is trivially a good rate function.
4.7. Matrix liberation process
Let Ξ(N)=((ξij(N))j=1r(i))i=1n+1 with ξij(N)∈(MNsa)R be an approximation to a given σ0∈TSfda(CR∗⟨x∙⋄⟩). Let UN(i)(t), 1≤i≤n, be independent, left-increment unitary Brownian motions on U(N), and we define the matrix liberation process Ξlib(N)(t)=((ξijlib(N)(t))j=1r(i))i=1n, t≥0, starting at Ξ(N) by
[TABLE]
Then, via the ∗-homomorphism πΞlib(N):CR∗⟨x∙⋄(⋅)⟩→MN determined by xij(t)↦ξijlib(N)(t), 1≤i≤n+1,j≥1,t≥0, we obtain a tracial state τΞlib(N):=trN∘πΞlib(N), which falls into TSc(CR∗⟨x∙⋄(⋅)⟩). This tracial state is a random variable in TSc(CR∗⟨x∙⋄(⋅)⟩) in the ordinary sense, and hence we can consider the probability P(τΞlib(N)∈Θ) of any Borel subset Θ⊆TSc(CR∗⟨x∙⋄(⋅)⟩). By [29, Theorem 5.8] we already know that the sequence of probability measures P(τΞlib(N)∈⋅) satisfies the large deviation upper bound with speed N2 and the above rate function Iσ0lib.
4.8. Contraction principle at T=∞
Let UN=(UN(i))i=1n be an n-tuple of independent N×N unitary random matrices distributed under the Haar probability measure νN on U(N). The random tracial state trUNΞ(N)∈TS(CR∗⟨x∙⋄⟩) is defined in the same manner as in §3. A well-known, standard result on the heat kernel measure on U(N) implies that E[πT∗(τΞlib(N))(a)] converges to E[trUNΞ(N)(a)] as T→∞ for every a∈CR∗⟨x∙⋄⟩. The usual method to obtain the large deviation upper/lower bound with speed N2 for P(trUNΞ(N)∈⋅) from that for P(τΞlib(N)∈⋅) in the same scale is to show that (a kind of) the exponential convergence of πT∗(τΞlib(N)) to trUNΞ(N) as T→∞ (see e.g. [13, §4.2.2]). Nevertheless, we will be able to prove the next proposition by utilizing Lemma 2.1 without establishing the exponential convergence.
Proposition 4.2**.**
Assume that the sequence of probability measures P(τΞlib(N)∈⋅) satisfies the large deviation upper (lower) bound with speed N2 and rate function I+ (resp. I−). Then P(trUNΞ(N)∈⋅) also satisfies the large deviation upper (resp. lower) bound with speed N2 and the following rate function:
[TABLE]
for every σ∈TS(CR∗⟨x∙⋄⟩), where the infimum over the empty set is taken to be +∞.
In particular, if the sequence of probability measures P(τΞlib(N)∈⋅) satisfies the full large deviation principle with speed N2, that is, the above large deviation upper and lower bounds with I+=I−, then J:=J+=J− and
[TABLE]
holds for every σ∈TS(CR∗⟨x∙⋄⟩) and any choice of approximating sequence Ξ=(Ξ(N))N∈N to σ0∈TSfda(CR∗⟨x∙⋄⟩).
Proof.
Set
[TABLE]
By the contraction principle (see e.g. [13, Theorem 4.2.1]), P(πT∗(τΞlib(N))∈⋅) satisfies the large deviation upper (resp. lower) bound with speed N2 and the rate function IT+ (resp. IT−). Write \mathbf{U}_{N}(t)=\big{(}U_{N}^{(i)}(t)\big{)}_{i=1}^{n}, t≥0, and define the random tracial state trUN(T)Ξ(N) in the same manner as trUNΞ(N). Let L(T)≤U(T) as well as νN,T and νN be as in the previous sections. Observe that
[TABLE]
as well as
[TABLE]
Since
[TABLE]
we observe that
[TABLE]
Now, we will use the functions L(T),U(T) in T introduced in Lemma 2.1. If we assume the large deviation upper (resp. lower) bound for P(πT∗(τΞlib(N))∈⋅), then
[TABLE]
for any closed Λ⊂TS(CR∗⟨x∙⋄⟩) (resp.
[TABLE]
for any open Γ⊂TS(CR∗⟨x∙⋄⟩)). It follows by Lemma 2.1 that
(resp. the same identity with replacing limT→∞ and IT+ with limT→∞ and IT−, respectively) holds and defines a rate function. Since TS(CR∗⟨x∙⋄⟩) is weak∗ compact, we finally conclude by [13, Theorem 4.1.11, Lemma 1.2.18] that P(trUNΞ(N)∈⋅) satisfies the large deviation upper (resp. lower) bound with speed N2 and the rate function J+ (resp. J−).
For the last assertion, we first point out that
[TABLE]
Since I+=I−, we have −J−(σ)≥−J+(σ) for every σ∈TS(CR∗⟨x∙⋄⟩). Therefore, we conclude that equality holds in (4.3). This together with (4.2) immediately implies the last assertion.
∎
It is plausible that the definition of the orbital free entropy χorb(X1,…,Xn+1) can still be defined independently of the choice of approximating sequence Ξ=(Ξ(N))N∈N (under the constraint that trΞ(N) converges to the joint distribution of the Xi) without assuming the hyperfiniteness of each random multi-variable Xi.
As mentioned before, we have already established that the sequence of probability measures P(τΞlib(N)∈⋅) satisfies the large deviation upper bound with speed N2 and the rate function Iσ0lib. Hence, we can prove the next corollary.
Corollary 4.3**.**
The sequence of probability measures P(trUNΞ(N)∈⋅) satisfies the large deviation upper bound with speed N2 and the rate function
[TABLE]
where the infimum over the empty set is taken to be +∞.
Moreover, χorb(σ∣σ0)≤−Jσ0lib(σ) holds for every σ∈TS(CR∗⟨x∙⋄⟩).
Proof.
The first assertion immediately follows from Lemma 4.1 and Proposition 4.2.
For the second assertion, we first observe that
[TABLE]
for every σ∈TS(CR∗⟨x∙⋄⟩).
Since Jσ0lib is independent of the choice of approximation Ξ to σ0, we conclude that χorb(σ∣σ0)≤−Jσ0lib(σ) for every σ∈TS(CR∗⟨x∙⋄⟩).
∎
Remark 4.4**.**
Several questions on the matrix liberation process Ξlib(N) toward the completion of developing the theory of orbital free entropy are in order.
(Q1)
Show that Jσ0lib(σ)=0 implies that the Xiσ are freely independent. (This is a question about minimizers of Jσ0lib.)
(Q2)
Identify Jσ0lib(σ) with Voiculescu’s free mutual information i∗(W∗(X1σ);…;W∗(Xn+1σ)) (at least when σ=σ0 or when the Xiσ0 are freely independent) if possible. Here each W∗(Xiσ) denotes the von Neumann subalgebra generated by Xiσ=(Xijσ)j=1r(i).
(Q3)
Prove a large deviation lower bound with speed N2 for the sequence of probability measures P(τΞlib(N)∈⋅). It is preferable to identify its rate function with Iσ0lib.
The affirmative answer to (Q2) shows χorb≤−i∗. On the other hand, as we saw in Proposition 4.2, the affirmative complete answer to (Q3) enables one to define χorb independently of the choice of approximating sequence at least when σ=σ0 or when σ0 is the ‘empirical distribution’ of a freely independent family as in (Q2). Also, the affirmative complete answers to both (Q2) and (Q3) show χorb=−i∗. Finally, the affirmative answer to (Q2) or (Q3) solves (Q1) in the affirmative; hence (Q1) is a test for both (Q2) and (Q3).**
5. Minimizer of the Rate function Jσ0lib
In this section, we will solve (Q1) of Remark 4.4 in the affirmative.
The next lemma is probably known to specialists, but we include its proof for the sake of the completeness of this paper.
Lemma 5.1**.**
The limit σ0fr:=limT→∞πT∗(σ0lib) exists in TS(CR∗⟨x∙⋄⟩), and we have
(i)
σ0fr* agrees with σ0 on each CR∗⟨xi⋄⟩, i=1,…,n+1;*
(ii)
the Xiσ0fr, 1≤i≤n+1, are freely independent.
Proof.
By construction it is clear that πT∗(σ0lib) agrees with σ0 on CR∗⟨xi⋄⟩ for each 1≤i≤n+1. Hence (i) trivially holds. Thus it suffices to prove only (ii).
Let (M,τ) be a tracial W∗-probability space and N⊂M be a W∗-subalgebra. Let {vi(t)}i=1n be a ∗-freely independent family of free left unitary Brownian motions in M such that the family is ∗-freely independent of N. Set vn+1(t):=1 for all t≥0 for the ease of notations. In order to prove (ii), it suffices to prove that
[TABLE]
whenever m≥1, ik=ik+1 (1≤k≤m−1) and xk∘∈N with τ(xk∘)=0 (1≤k≤m). When m=1, the left-hand side must be [math]; thus the desired fact trivially holds. Thus we may assume m≥2.
Recall that τ(vi(t))=e−t/2 for every t≥0 and 1≤i≤n. This is a particular case of Biane’s result [3, Lemma 1]. Since vik(T) and vik+1(T) are ∗-freely independent, we have
[TABLE]
for every 1≤k≤m−1. Hence we obtain that
[TABLE]
with (vi1(T)∗vi2(T))∘:=vi1(T)∗vi2(T)−τ(vi1(T)∗vi2(T))1. We continue this procedure for vi2(T)∗vi3(T) and so on until vim−1(T)∗vim(T) inductively, and obtain
[TABLE]
where we used ∥(vi1(T)∗vi2(T))∘∥∞≤2.
By the ∗-free independence between N and {vi(t)}i=1n,
[TABLE]
implying the desired estimate.
∎
Lemma 5.2**.**
For any τ∈TSc(CR∗⟨x∙⋄(⋅)⟩) with Iσ0,∞lib(τ)<+∞ and any P∈C⟨x∙⋄⟩ we have
[TABLE]
for some constant C=C(P)>0 depending only on P.
Proof.
Iteratively performing the decomposition Q=σ0(Q)1+Q∘ with Q∘=Q−σ0(Q)1 we observe that P is a sum of a scalar and several monomials of the form:
[TABLE]
where Qℓ∘∈C⟨xiℓ⋄⟩ with σ0(Qℓ∘)=0 such that m≥1 and iℓ=iℓ+1 (1≤ℓ≤m−1). Hence we may and do assume that P=Q1∘⋯Qm∘ in what follows, since any scalar term vanishes under Ds(k). We also observe that each δs(k)πT(Qℓ∘), 1≤ℓ≤m, becomes
[TABLE]
Hence we may and do restrict our consideration to the case s≤T, and obtain that
[TABLE]
where Zℓ(k)(s) is defined to be [math] when iℓ=k; otherwise to be
[TABLE]
and we write wi,i′:=viτ(T−s)∗vi′τ(T−s) (1≤i=i′≤n+1). (n.b., vn+1τ(t):=1 for all t≥0) and (Q)s:=πτ~(πs(Q)) for Q∈C⟨x∙⋄⟩. By [29, Proposition 5.7(1),(2)], which still holds for Iσ0,∞lib without any essential changes, Iσ0,∞lib(τ)<+∞ guarantees that τ~((Q)s)=σ0(Q) for all Q∈C⟨xi⋄⟩ with each fixed i=1,…,n+1. Hence the first case im=i1 can be treated essentially in the same way as in the proof of Lemma 5.1. Namely, when im=i1 (and iℓ=k), we have, for any y∈N(τ) (see subsection 4.4 for this notation),
[TABLE]
and obtain that
[TABLE]
with (wi,i′)∘:=wi,i′−τ~(wi,i′)1. Making the same computation for the second term and iterating this procedure until wiℓ−2,iℓ−1, we finally arrive at the following formula: Zℓ(k)(s) is the sum of τ~(wij,ij+1) times
[TABLE]
over all j=l,…,m,1,…,ℓ−2 (where we read m+1 as 1). Therefore, we have obtained that
[TABLE]
since ∥(wi,i′)∘∥∞≤2 and 0≤τ~(wi,i′)=τ~(viτ(T−s)∗vi′τ(T−s))≤e(s−T)/2 with i=i′ (see (5.1) for a similar computation). Hence we get
[TABLE]
with a positive constant C1 depending only on P and ℓ.
We then consider the case im=i1 (and s≤T). This case is a bit complicated, but can still be treated similarly as above. In fact, if im−1=i2, then
[TABLE]
since wim−1,i1wi1,i2=wim−1,i2. Thus, we apply the previous procedure to the first and the second terms, respectively, and conclude
[TABLE]
Iterating this procedure in the cases e.g. im=i1, im−1=i2 and im−2=i3, we can estimate ∥Zℓ(k)(s)∥∞ by e(s−T)/2 times a positive constant only depending on P except the case when im=i1,im−1=i2,…,iℓ+1=iℓ−1 (i.e, m is odd and ℓ=(m+1)/2). In the remaining case, we can easily observe that
[TABLE]
with an element Zℓ(k)(s)∼∈N(τ) whose operator norm ∥Zℓ(k)(s)∼∥∞ is not greater than e(s−T)/2 times a positive constant only depending on P. Then we have
[TABLE]
with a positive constant C2 depending only on P and ℓ.
Consequently, the expansion (5.2) of Z(k)(s) together with the above norm estimates (5.3), (5.4) shows the desired norm estimate.
∎
A more explicit description on EN(τ)(πτ~(Πs(Ds(k)P))) is possible based on the combinatorial techniques introduced by Speicher (see e.g. Nica–Speicher [23] as a standard textbook). See section 8.
With the above lemmas we will prove that the rate function Jσ0lib admits a unique minimizer, and moreover, we will explicitly compute the minimizer. Moreover, we will also prove that the modification Jσ0,∞lib of Jσ0lib by replacing Iσ0lib with Iσ0,∞lib, i.e.,
[TABLE]
admits the same unique minimizer.
Theorem 5.3**.**
For any σ∈TS(CR∗⟨x∙⋄⟩) the following are equivalent:
(1)
σ=σ0fr.
(2)
Jσ0lib(σ)=0.
(3)
Jσ0,∞lib(σ)=0.
Proof.
(1) ⇒ (2): Since Iσ0lib(σ0lib)=0 and moreover since πT∗(σ0lib)→σ0fr as T→+∞ by Lemma 5.1, we have Jσ0lib(σ0fr)=0.
(2) ⇒ (3): Trivial because 0≤Jσ0,∞lib≤Jσ0lib, which follows from 0≤Iσ0,∞lib≤Iσ0lib.
(3) ⇒ (1): Jσ0,∞lib(σ)=0 implies that for every m∈N and δ>0 we have
[TABLE]
Thus we can choose a sequence 0<T1<T2<⋯<Tm↗+∞ as m↗∞ and τTm∈TSc(C∗⟨x∙⋄(⋅)⟩) for each m∈N such that πTm∗(τTm)∈Om,1/m(σ) and Iσ0,∞lib(τTm)<1/m for every m∈N.
For each P=P∗∈C⟨x∙⋄⟩ we have
[TABLE]
by [29, Lemma 5.3] that still holds true for Iσ0,∞lib without any essential changes. Now, we use Lemma 5.2 to get
[TABLE]
for all m with a constant C>0 only depending on P. Consequently, we obtain that
[TABLE]
whose right-hand side converges to [math] as m→∞ thanks to πTm∗(τTm)∈Om,1/m(σ) (that guarantees that σ=limm→∞πTm∗(τTm) in TS(CR∗⟨x∙⋄⟩)) and Lemma 5.1. Hence we conclude that σ=σ0fr.
∎
Thanks to the standard Borel-Cantelli argument (see e.g. the proof of [29, Corollary 5.9]) the above proposition together with Corollary 4.3 implies that trUNΞ(N) converges to σ0fr almost surely as N→∞. This is nothing less than a consequence of the asymptotic freeness of independent Haar-distributed unitary random matrices. On the other hand, the corresponding result for the matrix liberation process [29, Corollary 5.9] was not known prior to it.
We would also like to point out that both Jσ0lib,Jσ0,∞lib can be regarded as a kind of mutual information in free probability, since they characterize the free independence as a unique minimizer (see the third paragraph of section 1). Thus it is natural to reformulate the functionals Jσ0lib,Jσ0,∞lib as well as their sources Iσ0lib,Iσ0,∞lib in a coordinate-free fashion. This will be done in the next section.
6. A coordinate-free approach: A new kind of free mutual information
Let (M,τ) be a tracial W∗-probability space. We consider unital C∗-subalgebras Ai⊂M, 1≤i≤n+1, and define a kind of free mutual information i∗∗(A1;…;An:An+1), without appealing to any kind of (matricial) microstates, whose definition comes from the rate functions discussed so far.
6.1. Universal algebras
Let A:=★i=1n+1Ai be the universal free product C∗-algebra. Let A(t), t≥0, be copies of A, and define A(R+) to be the universal free product C∗-algebra ★t≥0A(t). (Here we write R+=[0,+∞).) We denote by λi:Ai→A and ρt:A↠A(t)⊂A(R+) the canonical ∗-homomorphisms, which are known to be injective, see the appendix for an explicit reference about this fact. Write ρt,i:=ρt∘λi:Ai→A(R+). By Lemma A.1, A(R+) with ∗-homomorphisms ρt,i can naturally be identified with the universal free product of the copies of Ai, 1≤i≤n+1, over R+.
6.2. Time-dependent liberation derivatives
Let P be the ∗-subalgebra of A algebraically generated by λi(Ai), 1≤i≤n+1. Consider the ∗-subalgebra P(R+) of A(R+) algebraically generated by ρt(P), t≥0. Remark that λi(Ai), 1≤i≤n+1, and ρt,i(Ai), 1≤i≤n+1, t≥0, are algebraically free families of ∗-subalgebras, and the resulting P and P(R+) are naturally identified with the algebraic free products of the λi(Ai), 1≤i≤n+1, and of the ρt,i(Ai), 1≤i≤n+1, t≥0, respectively. See Proposition A.4.
We extend A(R+) to A~(R+) by taking its universal free product with the universal C∗-algebra generated by ui(t), 1≤i≤n, t≥0 with subject to ui(t)∗ui(t)=ui(t)ui(t)∗=1 and ui(0)=1. This procedure is justified by Proposition A.3. Consider the derivation Δs(k):P(R+)→A~(R+)⊗algA~(R+), 1≤k≤n, sending each ρt,i(x) with x∈Ai to
[TABLE]
(n.b., the algebraic freeness among the ρt,i(Ai) makes every Δs(k) well-defined). Therefore, with the flip-multiplication map θ:A~(R+)⊗algA~(R+)→A~(R+) sending a⊗b to ba, we obtain the cyclic derivative ∇s(k):=θ∘Δs(k):P(R+)→A~(R+).
6.3. Continuous tracial states
Differently from the previous sections we will use symbols φ,ψ, etc., instead of τ for tracial states on A(R+), etc., in order to avoid any confusion of symbols.
A tracial state φ∈TS(A(R+)) is said to be continuous, if t↦πφ(ρt(x)) is strongly continuous for every x∈A, where πφ:A(R+)↷Hτ denotes the GNS representation associated with τ.
In what follows, we denote by TSc(A(R+)) all the continuous tracial states on A(R+).
Lemma 6.1**.**
For a given φ∈TS(A(R+)) the following are equivalent:
(i)
φ* is continuous.*
(ii)
For every m∈N and every x1,…,xm∈A the function
[TABLE]
is continuous.
(iii)
For every m∈N and every xk∈Aij, 1≤ik≤n+1, 1≤k≤m, the function
[TABLE]
is continuous.
(iv)
For every 1≤i≤n+1, there exists a C∗-generating set Xi consisting of self-adjoint elements in Ai such that for every m∈N and every xj∈Xij, 1≤ij≤n+1, 1≤j≤m, the function
[TABLE]
is continuous.
Proof.
Since ∥ρt(x)∥∞=∥x∥∞ for every x∈A and since the ρt(A) over t≥0 generate A(R+) as a C∗-algebra, the proof of [29, Lemma 2.1] works for showing that item (i) ⇔ item (ii) without any essential changes. Item (ii) ⇒ item (iii) is trivial. The standard approximation argument using the norm density of the unital ∗-algebra algebraically generated by λi(Ai) in A shows that item (iii) ⇒ item (ii). Item (iii) ⇔ item (iv) is also confirmed similarly by using the norm density of the unital ∗-algebra algebraically generated by Xi in Ai.
∎
We extend each φ∈TSc(A(R+)) to a unique φ~∈TS(A~(R+)) in such a way that the ui(t)’s are ∗-freely independent of A(R+) and form a ∗-freely independent family of left-multiplicative free unitary Brownian motions under this extension φ~. It is not difficult to see that φ~ is ‘continuous’, that is, both t↦πφ~(ρt(x)) with x∈A and t↦πφ~(ui(t)) are strongly continuous. Denote by πφ~:A~(R+)↷Hφ~ the GNS representation associated with φ~. We have a unique surjective unital ∗-homomorphism Λs:A~(R+)→A~(R+) sending each ρt,i(x) with x∈Ai, t≥0 to
[TABLE]
and keeping each ui(t) as it is. Note that each ρt,is clearly defines a unital ∗-homomorphism from Ai to A~(R+) for every 1≤i≤n+1, and moreover, by universality, those ρt,is give rise to a unital ∗-homomorphism ρts:A→A~(R+). Observe that Λs∘ρt:=ρts holds for every s,t≥0. We define φs:=φ~∘Λs on A(R+). Since
[TABLE]
we observe, by (6.1), that φs is a continuous tracial state.
By the ∗-homomorphism Γ:A(R+)→A sending each ρt,i(x) with x∈Ai to λi(x) we construct Γ∗(σ0):=σ0∘Γ∈TSc(A(R+)) with a given σ0∈TS(A) and set σ0lib:=Γ∗(σ0)0∈TSc(A(R+)).
6.4. The new free mutual information
For a given σ0∈TS(A) let us define two functionals Iσ0lib,Iσ0,∞lib:TSc(A(R+))→[0,+∞] as follows. Let φ∈TSc(A(R+)) be arbitrarily given. Let EQ(φ) denote the φ~-preserving conditional expectation from P(φ):=πφ~(A~(R+))′′ onto Q(φ):=πφ~(A(R+))′′, where the double commutants are taken on Hφ~. For any P=P∗∈P(R+) and t∈[0,∞] we define
[TABLE]
with regarding φ as φ∞ (since φt(P)=φ(P) when t is large enough). We observe that s↦∥EQ(φ)(πφ~(Λs(∇s(k)P)))∥φ~,22 is piecewise continuous in s and becomes zero when s is large enough thanks to P∈A(R+). These two facts guarantee that Iσ0,tlib(φ,P) is well defined for every t possibly with t=∞. Then we define
[TABLE]
Clearly, Iσ0lib(φ)≥Iσ0,∞lib(φ) holds, and it is a question again whether equality holds or not.
We then introduce two functionals Jσ0lib,Jσ0,∞lib:TS(A)→[0,+∞] as before. To this end, we have to endow TS(A) with the weak∗ topology. Let σ∈TS(A) be arbitrarily given. Let O(σ) be the open neighborhoods at σ in the weak∗ topology on TS(A). Then we define
[TABLE]
and also Jσ0,∞lib(σ) in the same manner as above with replacing Iσ0lib(φ) with Iσ0,∞lib(φ). Here the infimum over the empty set is taken to be +∞ as usual. Remark that the supremum over O∈O(σ) coincides with the limit over a neighborhood basis at σ. We also remark that O(σ) can be replaced with the smaller neighborhood basis consisting of
[TABLE]
all over the finite collections W of words W like λi1(a1)⋯λim(am) with aik∈Aik and δ>0, since all the linear combinations of words form a norm dense ∗-subalgebra of A.
Definition 6.1**.**
Thanks to the universality of A, we have a unique ∗-homomorphism Υ:A→M sending each λi(x) to x with x∈Ai⊂M, 1≤i≤n+1. Then we define
[TABLE]
Moreover, we write
[TABLE]
These quantities will be shown to satisfy that (i) characterizing free independence, (ii) invariance under taking closure Aiw and (iii) the monotonicity in Ai. Hence they can be understood as a kind of mutual information in free probability. Here is a remark on the choice of σ0.
Remark 6.2**.**
If Jσ0lib(A1;…;An:An+1) is finite, then λi∗(σ0) must agree with τ on Ai for every 1≤i≤n+1.
Proof.
Assume that λi∗(σ0) does not agree with τ for some i. Namely, there is an element x∈Ai such that σ0(λi(x))=τ(x). Remark that τ(x)=Υ∗(τ)(λi(x)). Then we can choose an open neighborhood O∈O(Υ∗(τ)) in such a way that σ(λi(x))=σ0(λi(x)) for every σ∈O. As in the proof of [29, Proposition 5.7] we have
[TABLE]
for all r∈R and T≥0. It follows that Iσ0,∞lib(φ)=+∞ as long as ρT∗(φ)∈O. It follows that Jσ0lib(A1;…;An:An+1)=Jσ0lib(Υ∗(τ))≥Jσ0,∞lib(Υ∗(τ))=+∞.
∎
Consequently, we will assume that λi∗(σ0) agrees with τ on Ai for every 1≤i≤n+1 throughout the rest of this section. In particular, the natural two choices of σ0 are Υ∗(τ) and the so-called free product state ★i=1n+1(λi−1)∗(τ).
6.5. Relation to the matrix liberation process
Assume that each Ai, 1≤i≤n+1, is generated by a self-adjoint random multi-variable Xi=(Xij)j=1r(i) as in section 3, that is, Ai=C∗(Xi). Assume further that R:=supi,j∥Xij∥∞<+∞. Then we have two unique surjective unital ∗-homomorphisms Φ:CR∗⟨x∙⋄⟩→A and Ψ:CR∗⟨x∙⋄(⋅),v∙(⋅)⟩→A~(R+) sending xij, xij(t) and vi(t) to λi(Xij), ρt,i(Xij)=ρt(λi(Xij)) and ui(t), respectively. Clearly, Ψ(CR∗⟨x∙⋄(⋅)⟩)=A(R+) and Ψ(xij(t))=ρt(Φ(xij)) hold. In particular, the latter implies that Ψ∘π0=ρ0∘Φ.
For the reader’s convenience we summarize the notations of algebras and maps that we have introduced so far. The algebras and the maps between them are:
[TABLE]
The liberation cyclic derivatives Ds(k) (see subsection 4.2) and the maps Πs (see subsection 4.5) on the upper line of the above diagram correspond to ∇s(k) (see subsection 6.2) and Λs (see subsection 6.3) on the lower line, respectively. Moreover, the spaces of (continuous) tracial states and the dual maps between them are:
[TABLE]
Lemma 6.3**.**
For any φ∈TSc(A(R+)) we have Ψ∗(φ):=φ∘Ψ∈TSc(CR∗⟨x∙⋄(⋅)⟩) and Ψ∗(φ~)=Ψ∗(φ)∼. Hence Ψ∗(φ)s=Ψ∗(φs) holds for every s≥0. Moreover, for any P∈C⟨x∙⋄(⋅)⟩, we have
[TABLE]
for every 1≤k≤n and s≥0.
Proof.
Observe that
[TABLE]
which implies that Ψ∗(φ) falls in TSc(CR∗⟨x∙⋄(⋅)⟩) by [29, Lemma 2.1] and Lemma 6.1. Moreover, we have
[TABLE]
for any ak∈CR∗⟨x∙⋄(⋅)⟩, 1≤ik≤n, tk≥0 and ϵk=±1. Since Ψ(CR∗⟨x∙⋄(⋅)⟩)=A(R+), we conclude that the vi(t) are freely independent of CR∗⟨x∙⋄(⋅)⟩ and form a freely independent family of left-multiplicative free unitary Brownian motions under Ψ∗(φ~). Therefore, we conclude that Ψ∗(φ~)=Ψ∗(φ)∼. We observe that
[TABLE]
implying that Ψ∘Πs=Λs∘Ψ on CR∗⟨x∙⋄(⋅)⟩. Therefore, we obtain that
[TABLE]
Choose an arbitrary monomial P=xi1j1(t1)⋯ximjm(tm)∈C⟨x∙⋄(⋅)⟩. By definition we have Ψ(P)=ρt1,i1(Xi1j1)⋯ρtm,im(Ximjm). We observe that
[TABLE]
Since Ψ∗(φ)∼=Ψ∗(φ~) and since Ψ(xij(t))=ρt,i(Xij) and Ψ(vi(t))=ui(t), we observe that the joint distribution of the xij(t) and the vi(t) under Ψ∗(φ)∼ coincides with that of the ρt,i(Xij) and the ui(t) under φ~. Moreover, N(Ψ∗(φ)) is generated by the πΨ∗(φ)∼(xij(t)) and also Q(φ) is by the πφ~(ρt,i(Xij)). These together with the definitions of xijs(t) and ρt,is(Xij) imply the desired 2-norm equality.
∎
Proposition 6.4**.**
With Φ∗(σ0):=σ0∘Φ∈TS(CR∗⟨x∙⋄⟩) we have
[TABLE]
for any φ∈TSc(A(R+)). Moreover, Ψ∗(TSc(A(R+))) is an essential domain of both the functionals IΦ∗(σ0)lib,IΦ∗(σ0),∞lib, that is, the functionals take +∞ outside it.
Proof.
We first remark the following facts:
•
Ψ∗(φ)t(P)=Ψ∗(φt)(P)=φt(Ψ(P)) for any P∈C⟨x∙⋄(⋅)⟩.
•
If ρ0∗(φ)=σ0, then π0∗(Ψ∗(φ))=φ∘Ψ∘π0=φ∘ρ0∘Φ=Φ∗(σ0). Thus, Φ∗(σ0)lib(P)=σ0lib(Ψ(P)) for any P∈C⟨x∙⋄(⋅)⟩.
holds for any P∈C⟨x∙⋄(⋅)⟩. Note that Ψ(C⟨x∙⋄(⋅)⟩)⊂P(R+). Hence the above identity at least gives
[TABLE]
To show the reverse inequality in both, it suffices to prove:
(♢) For any Q=Q∗∈A(R+) there is a sequence Qk=Qk∗ in Ψ(C⟨x∙⋄(⋅)⟩)
such that Iσ0,tlib(τ,Qk)→Iσ0,tlib(τ,Q) for all t∈[0,∞].
Remark that Q is a finite sum of monomials, say W=ρt1,i1(x1)⋯ρtm,im(xm) with xℓ∈Aiℓ. Since the unital ∗-subalgebra Ai,0 algebraically generated by (Xij)j=1r(i) is norm-dense in Ai, we can choose norm-bounded sequences xℓ(p) in Aiℓ,0 in such a way that xℓ(p)→xℓ in norm as p→∞ for every 1≤ℓ≤m. Since Ψ(xij(t))=ρt,i(Xij) and ρt,i is a unital ∗-homomorphism, Wp:=ρt1,i1(x1(p))⋯ρtm,im(xm(p)) falls into Ψ(C⟨x∙⋄(⋅)⟩) and converges to W in norm as p→∞. Moreover, using expression (6.3) we can easily see that both Λs(∇s(k)Wp)→Λs(∇s(k)W) and Λs(∇s(k)Wp∗)→Λs(∇s(k)W∗) in norm and uniformly in s as p→∞. Since all the maps involved are linear, we have proved the desired assertion (♢) by taking, if necessary, the (operator-theoretic) real part of the approaching sequence that we have obtained. Hence, we complete the proof of the first part of the proposition.
We will then prove the second part of the proposition. Choose ψ∈TSc(CR∗⟨x∙⋄(⋅)⟩) with IΦ∗(σ0),∞lib(ψ)<+∞. By (the proof of) [29, Proposition 5.7] we have πt∗(ψ)=Φ∗(σ0) on CR∗⟨xi⋄⟩, the unital C∗-subalgebra generated by the xij, j≥1, with fixing i, for each 1≤i≤n+1. Denote by Φi the restriction of Φ:CR∗⟨x∙⋄⟩→A to each CR∗⟨xi⋄⟩. Since Φi:CR∗⟨xi⋄⟩→λi(Ai) is a surjective ∗-homomorphism, we obtain a bijective unital ∗-homomorphism λi(Ai)≅CR∗⟨xi⋄⟩/Ker(Φi) sending λi(Xij) to xij+Ker(Φi) for j≥1. Consider the GNS representation πψ:CR∗⟨x∙⋄(⋅)⟩↷Hψ. For any y∈Ker(Φi) we have
[TABLE]
and hence πψ(πt(y))=0 thanks to the trace property of ψ. Therefore, by the C∗-algebraic freeness among the ρt,i(Ai) (≅λi(Ai)≅CR∗⟨xi⋄⟩/Ker(Φi) by ρt,i(Xij)↔λi(Xij)↔xij+Ker(Φi) as remarked before), we obtain a unique unital ∗-homomorphism from A(R+) to B(Hτ′) sending each ρt,i(Xij) to πψ(πt(xij))=πψ(xij(t)). Then the pull-back of ψ by this ∗-homomorphism defines a tracial state φ on A(R+), under which the ρt,i(Xij) have the same joint distribution as that of the xij(t) under ψ. This means that Ψ∗(φ)=ψ and the continuity of φ follows thanks to Lemma 6.1. Hence we are done.
∎
for any σ∈TS(A). In particular, the following are equivalent:
(1)
Ai, 1≤i≤n+1, are freely independent.
(2)
Jσ0lib(A1;…;An:An+1)=0.
(3)
Jσ0,∞lib(A1;…;An:An+1)=0.
Moreover,
[TABLE]
at least when σ0 is either Υ∗(τ) or ★i=1n+1(λi−1)∗(τ).
Proof.
We will first prove two identities (6.4), which enables us to derive the equivalence of (1) – (3) from Theorem 5.3 immediately.
In the current setting, an open neighborhood basis at σ in TS(A) should be given as a collection of Om,δ(σ), where Om,δ(σ) is all the σ′∈TS(A) such that
[TABLE]
whenever 1≤ik≤n+1, 1≤jk≤m, 1≤k≤p and 1≤p≤m. Thus, supO∈O(σ) and ρT∗(φ)∈O can/should be replaced with limm,δ and ρT∗(φ)∈Om,δ(σ), respectively. By definition we observe that
[TABLE]
Hence πT∗(Ψ(τ))∈Om,δ(Φ∗(σ)) if and only if ρT∗(φ)∈Om,δ(σ). Moreover, Ψ∗(TSc(CR∗⟨x∙⋄⟩) is an essential domain for the functionals by Proposition 6.4. Therefore, the main identities in Proposition 6.4 imply two identities (6.5).
Since
[TABLE]
Corollary 4.3 together with Propositions 3.1, 3.2 implies inequality (6.5).
∎
Remarks 6.6**.**
(1) The part characterizing free independence by Jσ0lib as well as Jσ0,∞lib in the above corollary can directly be proved by using the same argument as in §5 without appealing to generators of each Ai.
(2) The last two assertions of the above corollary suggests that Jσ0lib(A1;⋯;An:An+1) may be independent of σ0, at least under some constraint. However, this question is untouched yet due to the lack of techniques to discuss ‘minimal paths’ of tracial states under the functionals.
6.6. Invariance under weak closure
Corollary 6.5 suggests that Jσ0lib(A1;…;An:An+1) as well as Jσ0,∞lib(A1;…;An:An+1) are W∗-invariants, that is, they are unchanged if each Ai is replaced with its σ-weak closure Aiw. This is indeed the case, as we will see below. The proof is rather technical, but the idea behind it is simple.
Let us denote by M and M(R+)⊂M~(R+) the C∗-algebras corresponding to A and A(R+)⊂A~(R+) when each Ai is replaced with Mi:=Aiw. Observe that the original A and A(R+)⊂A~(R+) are naturally embedded into M and M(R+)⊂M~(R+). See Proposition A.3. Notations λi,ρt,i,ρt of morphisms are used simultaneously in what follows. To this end, we need several technical, purely operator algebraic facts (Lemmas 6.7–6.9).
The first lemma seems a folklore among operator algebraists, but we do give its proof because it plays a key role in the discussion below.
Lemma 6.7**.**
Let A be a σ-weakly dense, unital C∗-subalgebra of a W∗-algebra M and φ be a normal state on M. Let π:A↷H be a unital ∗-representation with a distinguished vector ξ0∈H such that ξ0 is separating for π(A) and that (π(a)ξ0∣ξ0)H=φ(a) holds for every a∈A. Then there is a unique normal unital ∗-representation πˉ:M↷H extending π such that πˉ(M)=π(A)w.
Proof.
Let (Hφ,πφ,ξφ) be the GNS triple of (M,φ). Set K:=π(A)ξ0, a reducing subspace for π(A). Observe, by the uniqueness of GNS representations, that the restriction of π to K with ξ0 is a realization of (Hφ,πφ↾A,ξφ). Since ξ0 is separating for π(A), π is quasi-equivalent to πφ by [19, Theorem 10.3.3(ii)]. This means that there exists a normal unital, bijective ∗-homomorphism ρ:πφ(M)=πφ(A)w→π(A)w sending πφ(a) to π(a) for every a∈A. Thus, πˉ:=ρ∘πφ:M→π(A)w is the desired ∗-homomorphism.
∎
We need the next two state extension properties. The proofs crucially use the previous lemma with the universality of universal free products.
Lemma 6.8**.**
Any σ0∈TS(A) with λi∗(σ0)=τ on Ai for all 1≤i≤n+1 has a unique extension σˉ0∈TS(M) with λi∗(σˉ0)=τ on Mi for all 1≤i≤n+1.
Proof.
Let (Hσ0,πσ0,ξσ0) be the GNS triple of (A,σ0). Since σ0 is tracial, ξσ0 must be separating for πσ0(A). In particular, ξσ0 is separating for each πσ0(λi(Ai)) too. Set πσ0,i:=πσ0∘λi:Ai↷Hσ0. Then we have (πσ0,i(a)ξσ0∣ξσ0)Hσ0=σ0∘λi(a)=λi∗(σ0)(a)=τ(a) for every a∈Ai. Thus, the previous lemma shows that there exists a unique normal extension πˉσ0,i:Mi:=Aiw↷Hσ0 such that πˉσ0,i(Mi)=πσ0(λi(Ai))w and πˉσ0,i↾Ai=πσ0,i. By the universality of universal free products, there exists a unique ∗-homomorphism πˉσ0:M→B(Hσ0) such that πˉσ0∘λi=πˉσ0,i:Mi↷Hσ0 is normal for every 1≤i≤n+1. By construction, it is clear that πˉσ0↾A=πσ0. Set σˉ0:=(πˉσ0(⋅)ξσ0∣ξσ0)Hσ0∈TS(M). Trivially, σˉ0↾A=σ0. For each xk∈Mik, 1≤k≤m, by the Kaplansky density theorem, one can choose a net ak(κ)∈Ai (with a common index set) such that ∥ak(κ)∥∞≤∥xk∥∞ and ak(κ)→xk in the σ-strong∗ topology on Mik. Since each πˉσ0,i is normal on Mi, we observe that
[TABLE]
and hence σˉ0(λi1(x1)⋯λim(xm))=limκσ0(λi1(a1(κ))⋯λim(am(κ))). Since the λi(Mi) generate M as a C∗-algebra, we conclude that σˉ0 is a unique extension of σ0. Moreover, λi∗(σˉ0)(x)=σˉ0(λi(x))=limκσ0(λi(aκ))=limκλi∗(σ0)(aκ)=limκτ(aκ)=τ(x) for every x∈Mi with approximation aκ→x as above.
∎
Lemma 6.9**.**
Any φ∈TSc(A(R+)) with ρt,i∗(φ)=τ on Ai for all t≥0 and 1≤i≤n+1 has a unique extension φˉ∈TSc(M(R+)) with ρt,i∗(φˉ)=τ on Mi for all t≥0 and 1≤i≤n+1.
Proof.
Let (Hφ,πφ,ξφ) be the GNS triple of (A(R+),φ). The same argument as in the previous lemma shows that there exists a ∗-representation πˉφ:M(R+)↷Hφ such that πˉφ∘ρt,i:Mi→B(Hφ) is normal as well as that πˉφ∘ρt,i↾Ai=πφ∘ρt,i holds for every t≥0 and 1≤i≤n+1. Define φˉ:=(πˉφ(⋅)ξφ∣ξφ)Hφ∈TS(M(R+). Remark that ρt,i∗(φˉ)=τ on Mi holds for every t≥0 and 1≤i≤n+1. By the uniqueness of GNS representations, the triple (Hφ,πˉφ,ξφ) is identified with the GNS triple of (M(R+),φˉ). Namely, we may and do assume that πφˉ=πˉφ, Hφˉ=Hφ and ξφˉ=ξφ.
Since the given φ is continuous, the mapping t↦πφˉ(ρt,i(a))=πφ(ρt,i(a)) is strongly continuous for every a∈Ai. We claim that this is the case even when a∈Ai is replaced with an arbitrary x∈Mi. By the Kaplansky density theorem, we can choose a net aκ∈Ai in such a way that ∥aκ∥∞≤∥x∥∞ and ∥aκ−x∥τ,2:=τ((aκ−x)∗(aκ−x))→0. We have
[TABLE]
For any η∈Hφˉ and any ε>0, there is a Y′∈πφˉ(M(R+))′ such that ∥η−Y′ξφˉ∥Hφˉ<ε (n.b., ξφ is separating for πφˉ(M(R+)), and the existence of such a Y′ is guaranteed). Then
[TABLE]
and hence
[TABLE]
Then, we can see that t↦πφˉ(ρt,i(x)) is strongly continuous for every x∈Mi. It follows thanks to Lemma 6.1 (iii) that φˉ is continuous.
∎
Here is an important remark obtained from the above proof.
Remark 6.10**.**
We keep the notations φ, φˉ, etc., of the previous lemma. If a bounded net a(κ) in Ai converges to x∈Mi in ∥⋅∥τ,2 or equivalently, in the σ-strong∗ topology on Mi, then
[TABLE]
for every ξ∈Hφˉ, that is, the convergence πφˉ(ρt,i(a(κ)))→πφˉ(ρt,i(x)) in the strong operator topology is uniform for t≥0.
Lemma 6.11**.**
For any φ∈TSc(A(R+) with ρt,i∗(φ)=τ on Ai for all t≥0 as well as λi∗(σ0)=τ on Ai for all 1≤i≤n+1, we have Iσ0lib(φ)=Iσˉ0lib(φˉ) as well as Iσ0,∞lib(φ)=Iσˉ0,∞lib(φˉ) with the notations in the previous lemmas.
Proof.
The same pattern as in the proof of Proposition 6.4 (and Lemma 6.3) works well by replacing the norm convergence xℓ(p)→xℓ with a bounded net convergence aℓ(κ)→xℓ in the σ-strong∗ topology with the help of Remark 6.10.
∎
Here is the desired statement. Namely, the next proposition tells us that taking the σ-weak closure does not give any effect to Jσ0lib as well as Jσ0,∞lib. This is analogous to [30, Remarks 10.2].
Proposition 6.12**.**
With the notations as in the previous lemmas we have
[TABLE]
as long as λi∗(σ0)=τ on Ai for all 1≤i≤n+1.
Proof.
For the ease of notations we will write σ:=Υ∗(τ)∈TS(A) and σˉ:=Υˉ∗(τ)∈TS(M), where Υ:A→M and Υˉ:M→M the unital ∗-homomorphisms sending each λi(a) with a∈Ai to a and λi(x) with x∈Mi to x, respectively. In particular, Υˉ is an extension of Υ, and hence σˉ is an extension of σ too.
We denote by W a word whose letters from the λi(Ai) and also by Wˉ a word whose letters from the λi(Mi). According to this notation, we will also denote by W a finite collection of words W and by Wˉ a finite collection of words Wˉ. These play parts of parameters to define neighborhood base of the weak∗ topologies on TS(A) and TS(M), respectively.
Let T≥0, δ>0, and ψ∈TSc(M(R+)) be arbitrarily chosen. Denote by ψ the restriction of ψ to A(R+), which clearly falls into TSc(A(R+)). By construction, it is easy to see that Iσ0lib(ψ)≤Iσˉ0lib(ψ) holds in general. Hence
[TABLE]
where we use that ρT∗(ψ)∈OW,δ(σ)⇔ρT∗(ψ)∈OW,δ(σˉ), since every W∈W falls into A (and hence σ(W)=σˉ(W) and ψ(ρt(W))=ψ(ρt(W))). Taking the limT→∞ of the above inequality, we get
[TABLE]
Since (W,δ) is arbitrary, Jσ0lib(A1;…;An:An+1)=Jσ0lib(σ)≤Jσˉ0lib(σˉ)=Jσˉ0lib(M1;⋯;Mn:Mn+1). The same assertion also holds with the same proof even if Jσ0lib and Jσˉ0lib are replaced with Jσ0,∞lib and Jσˉ0,∞lib, respectively. We remark that the discussion in this paragraph uses only inclusion relation Ai⊂Mi, 1≤i≤n+1. This remark will be summarized into the corollary following this proposition.
We will then prove the reverse inequality. To this end, we may assume that Jσ0lib(A1;…;An:An+1)=Jσ0lib(σ)<+∞; otherwise the reverse inequality trivially holds as −∞=−∞ by the first part of this proof. Let (Wˉ,δ) is arbitrarily given. For each Wˉ∈Wˉ, we can choose a word W in such a way that
[TABLE]
whenever φ∈TSc(A(R+)) satisfies that ρt,i∗(φ)=τ on Ai for all t≥0 and 1≤i≤n+1, where φˉ is in the sense of Lemma 6.11. This fact can be confirmed by the iterative use of the following observation: Let X,Y∈M be given. For any x∈Mi and a∈Ai we have
[TABLE]
for every t≥0, where (Hφˉ,πφˉ,ξφˉ) is the GNS triple of (M(R+),φˉ) and Jφˉ is the the so-called modular conjugation, that is, a conjugate-linear isometric map defined by JφˉZξφˉ=Z∗ξφˉ for every Z∈πφˉ(M(R+))′′, the double commutant is taken on Hφˉ. Similarly, we have
[TABLE]
We denote by W the collection of W with Wˉ∈Wˉ obtained in this way. Let φ∈TSc(A(R+)) be arbitrarily chosen in such a way that ρT∗(φ)∈OW,δ/3(σ) as well as Iσ0lib(φ)<+∞. The latter requirement guarantees, by the same proof as in [29, Proposition 5.7], that ρt,i∗(φ)=τ on Ai for all t≥0 and 1≤i≤n+1. By the above consideration we observe that φˉ∈OWˉ,δ(σˉ). Therefore, we conclude that
[TABLE]
Taking limT→∞ of this inequality we obtain that
[TABLE]
which implies the desired inequality since (Wˉ,δ) is arbitrary. The discussion so far in this paragraph also works again when Jσ0lib and Jσˉ0lib are replaced with Jσ0,∞lib and Jσˉ0,∞lib, respectively. Hence we are done.
∎
As remarked in the above proof, we have essentially proved the next monotonicity fact too.
Corollary 6.13**.**
If Bi⊆Ai be a unital C∗-subalgebra (possibly W∗-subalgebra) for each 1≤i≤n+1, then
[TABLE]
where σ0 on the left-hand side should be understood as the restriction of σ0 to the universal C∗-algebra obtained from the Bi.
6.7. Summary of basic properties
We have established the next properties of i∗∗ so far.
Here W∗(Ai) and W∗(Xi) denote the von Neumann subalgebras generated by Ai and Xi, respectively. An important question is whether or not i∗=i∗∗. It is also an interesting question whether or not Jσ0lib and Jσ0,∞lib are independent of the choice of σ0.
7. Unitary Brownian motions
Let Ξ(N) and UN(i)(t), 1≤i≤n be as in subsection 4.7, that is, Ξ(N) is a countable family of deterministic N×N self-adjoint matrices and the UN(i)(t) are independent, left-increment unitary Brownian motions on U(N). For the ease of notation, we number the elements of Ξ(N) as ξj(N) rather than ξij(N). In this section, we will explain how the proofs in [29] work well for the UN(i)(t) together with Ξ(N) and compare their consequences on the matrix liberation process Ξlib(N) with the corresponding results on the UN(i)(t) together with Ξ(N).
7.1. Malliavin derivatives of unitary Brownian motions
We begin with the SDE representation of UN(k)(t): Let Bαβ(i)(t), 1≤α,β≤N, 1≤i≤n, be the nN2 independent Brownian motions on the real line with natural filtration Ft. Consider the system of SDEs in the 2nN2-dimensional Euclidean space (MN)n:
[TABLE]
where Cαβ, 1≤α,β≤N, form an orthonormal basis of the Euclidean space MNsa. This system of SDEs are linear, and thus each system of them admits a unique strong solution after fixing initial X(i)(0). The unitary Brownian motions UN(i)(t), 1≤i≤n, are constructed as a unique strong solution X(i)(t) of the system (7.1) under initial condition X(i)(0)=I.
Lemma 7.1**.**
Let Ds(k;α,β) be the Malliavin derivative along the Brownian motion Bαβ(k). Then
[TABLE]
for almost every t≥0.
Proof.
We also consider the system of SDEs
[TABLE]
For a given X∈MN, it is easy to see that X(i)(t):=UN(i)(t)X and Y(i)(t):=XUN(i)(t)∗ satisfy the systems (7.1), (7.2) of SDEs, respectively. Thus, the unique strong solutions of the system of SDEs (7.1),(7.2) with initial condition X(i)(0)=X, Y(i)(0)=X must be UN(i)(t)X, XUN(i)(t)∗. Thus, UN(i)(t)X, XUN(i)(t)∗ are both linear in the variable X, and hence their gradients (or ‘Jacobian matrix’) in X become the linear transformations LUN(i)(t) and RUN(i)(t)∗ on MN, respectively, where LAX:=AX, RBX:=XB for A,B,X∈MN. By a standard fact on Malliavin derivatives for strong solutions of SDEs [24, Theorem 2.2.1; Eq.(2.59)] it follows that
[TABLE]
Hence we are done.
∎
By the linearity and the Leibniz rule of Ds(k;α,β) we have, for a monomial W in UN(i)(t),UN(i)(t)∗ and ξj(N),
[TABLE]
With these remarks it is a straightforward task to modify the proof of the large deviation upper bound for the matrix liberation process in [29] to the case of unitary Brownian motions with deterministic matrices. The consequence is as follows.
7.2. Non-commutative derivations
We assume the norm constraint ∥ξj(N)∥∞≤R for all j≥1, and moreover that Ξ(N) has a limit distribution as N→∞. Thus we consider the universal C∗-algebras CR∗⟨x⋄⟩⊂CR∗⟨x⋄,u∙(⋅)⟩⊂CR∗⟨x⋄,u∙(⋅),v∙(⋅)⟩ generated by xj=xj∗, j≥1, and ui(t),vi(t), 1≤i≤n, t≥0, with subject to ∥xj∥∞≤R and ui(t)∗ui(t)=ui(t)ui(t)∗=vi(t)∗vi(t)=vi(t)vi(t)∗=ui(0)=vi(0)=1, 1≤i≤n, t≥0. Remark that the universal ∗-algebra C⟨x⋄,u∙(⋅)⟩ generated by the same indeterminates with the same algebraic constraints (and without the norm constraint) is naturally embedded into CR∗⟨x⋄,u∙(⋅)⟩ as a norm-dense ∗-subalgebra. By formula (7.3) we introduce derivations δs(k):C⟨x⋄,u∙(⋅)⟩→C⟨x⋄,u∙(⋅)⟩⊗algC⟨x⋄,u∙(⋅)⟩ determined by
[TABLE]
(In fact, one can easily check (uδs(k)uk(t))⋅uk(t)∗−uk(t)⋅(uδs(k)uk(t)∗)=0 for example, and hence the above definition works well.) With the linear mapping θ:a⊗b↦ba we define cyclic derivatives Ds(k):=θ∘δs(k):C⟨x⋄,u∙(⋅)⟩→C⟨x⋄,u∙(⋅)⟩. If we denote by P(ξ⋄(N),U∙(i)(⋅)) the specialization of a given P∈C⟨x⋄,u∙(⋅)⟩ with xj=ξj(N) and ui(t)=UN(i)(t), then formula (7.3) admits a ‘compact’ expression
[TABLE]
for any P∈C⟨x⋄,v∙(⋅)⟩. Thus, the Clark–Ocone formula (see e.g., [18, Proposition 6.11] for any dimension and [24, subsection 1.3.4] for 1 dimension) shows that
[TABLE]
7.3. Continuous tracial states
A tracial state φ on CR∗⟨x⋄,u∙(⋅)⟩ (or CR∗⟨x⋄,u∙(⋅),v∙(⋅)⟩) is said to be continuous if t↦uiφ(t):=πφ(ui(t)) is strongly continuous (resp. t↦πφ(ui(t)),πφ(vi(t)) are strongly continuous) for every 1≤i≤n, where πφ:CR∗⟨x⋄,u∙(⋅)⟩↷Hφ (resp. πφ:CR∗⟨x⋄,u∙(⋅),v∙(⋅)⟩↷Hφ) is the GNS representation associated with φ. We then denote by TSc(CR∗⟨x⋄,u∙(⋅)⟩) and TSc(CR∗⟨x⋄,u∙(⋅),v∙(⋅)⟩) all the continuous tracial states on CR∗⟨x⋄,u∙(⋅)⟩ and CR∗⟨x⋄,u∙(⋅),v∙(⋅)⟩, respectively. Set xj(t):=xj, t≥0, for each j for the ease of notation below. Then, the same facts as [29, Lemmas 2.1,2.2] holds and the metric d on TSc(CR∗⟨x⋄,u∙(⋅)⟩) can be defined in the exactly same manner as (1.1) by considering words in xj(t) and ui(t),ui(t)∗ in place of xi1j1(t1)⋯ximjm(tm) for w(t1,…,tm). We remark that τ((xij(s)−xij(t))2) in [29, Lemma 2.2(2)] should be replaced with φ((ui(s)−ui(t))∗(ui(s)−ui(t)))=2(1−Reφ(ui(s)∗ui(t))) in this context.
7.4. Rate function
By universality, we have the ∗-homomorphism
[TABLE]
for each s≥0, which sends each ui(t) to uis(t) and keeping each xj as it is, where
[TABLE]
We can extend each φ∈TSc(CR∗⟨x⋄,u∙(⋅)⟩) to a unique φ~∈TSc(CR∗⟨x⋄,u∙(⋅),v∙(⋅)⟩) in such a way that the vi(t) are freely independent of CR∗⟨x⋄,u∙(⋅)⟩ and form a freely independent family of left-multiplicative free unitary Brownian motions under φ~. For each φ∈TSc(CR∗⟨x⋄,u∙(⋅)⟩) we define φs:=φ~∘Πs∈TSc(CR∗⟨x⋄,u∙(⋅)⟩), s≥0, and also write
[TABLE]
on Hφ~, where πφ~:CR∗⟨x⋄,u∙(⋅),v∙(⋅)⟩↷Hφ~ is the GNS representation associated with φ~. We fix a distribution of the xj, say σ0∈TS(CR∗⟨x⋄⟩). Let σ0frBM be φ0 with φ∈TSc(CR∗⟨x⋄,u∙⟩) such that the restriction of φ to CR∗⟨x⋄⟩ is σ0. Such a continuous tracial state φ0 is uniquely determined; in fact, it is the joint distribution of the xj’s and the vi(t)’s such that the vi(t) form a freely independent family of left-multiplicative free unitary Brownian motions and are freely independent of the xj’s, and moreover that the distribution of the xj’s is σ0. For any φ∈TSc(CR∗⟨x⋄,u∙(⋅)⟩), P=P∗∈C⟨x⋄,u∙(⋅)⟩ and t∈[0,∞] we define
[TABLE]
with regarding φ as φ∞. Then we introduce two functionals Iσ0uBM,Iσ0,∞uBM:TSc(CR∗⟨x⋄,u∙(⋅)⟩)→[0,+∞] defined by
[TABLE]
for φ∈TSc(CR∗⟨x⋄,u∙(⋅)⟩).
7.5. Consequences
Here is the main consequence of this section.
Theorem 7.2**.**
Assume that σ0∈TS(CR∗⟨x⋄⟩) is the limit distribution of Ξ(N) as N→∞. We denote by P∈CR∗⟨x⋄,u∙(⋅,)⟩↦P(ξ⋄(N),UN(∙)(⋅))∈MN the ∗-homomorphism sending ui(t) and xj to UN(i)(t) and ξj(N), respectively. Let φΞ(N)uBM∈TSc(CR∗⟨x⋄,u∙(⋅)⟩) be the random tracial state sending P∈CR∗⟨x⋄,u∙(⋅,)⟩ to trN(P(ξ⋄(N),UN(∙)(⋅))). Then we have the following large deviation upper bound:
[TABLE]
for every closed Λ⊂TSc(CR∗⟨x⋄,u∙(⋅)⟩). Moreover, both Iσ0uBM≥Iσ0,∞uBM are good rate functions and admit the same unique minimizer σ0frBM.
Proving that the rate functions are good along the line of the proof of [29, Proposition 5.6] needs the formula
[TABLE]
Similarly to [29, Corollary 5.9] the standard Borel–Cantelli argument shows the next corollary.
Corollary 7.3**.**
Keep the same setting as in Theorem 7.2. Let σ0frBM∈TSc(CR∗⟨x⋄,u∙(⋅)⟩) be constructed in such a way that the distribution of the xj is σ0 under σ0frBM and also that the ui(t) form a freely independent family of left-multiplicative free unitary Brownian motions and are freely independent of the xj under σ0frBM. Then d(φΞ(N)uBM,σ0frBM)→0 almost surely as N→∞.
This is a precise statement about the almost sure convergence as continuous process for an independent family of unitary Brownian motions together with deterministic matrices, and seems to have been missing so far, even though the almost sure strong convergence for its time marginals was already established by Collins, Dahlqvist and Kemp [11].
7.6. Haar-distributed unitary random matrices
As in section 4, using Lemma 2.1 we can derive a large deviation upper bound for an independent family of N×N Haar-distributed unitary random matrices UN(i), 1≤i≤n, with deterministic matrices Ξ(N) from Theorem 7.2. The resulting rate function is given as in Lemma 4.1. Let CR∗⟨x⋄,u∙⟩ be the universal C∗-algebra generated by xj, j≥1, and ui, 1≤i≤n, with subject to ∥xj∥∞≤R and ui∗ui=uiui∗=1. We denote by P∈CR∗⟨x⋄,u∙⟩↦P(ξ⋄(N),UN(∙))∈MN the ∗-homomorphism sending xj and ui to ξj(N) and UN(i), respectively. Then we have the random tracial state φΞ(N)uHaar∈TS(CR∗⟨x⋄,u∙⟩)→C defined by φΞ(N)uHaar(P):=trN(P(ξ⋄(N),UN(∙))) for P∈CR∗⟨x⋄,u∙⟩.
Namely, let πT:CR∗⟨x⋄,u∙⟩→CR∗⟨x⋄,u∙(⋅)⟩ be the ∗-homomorphism sending xj and ui to xj and ui(T), respectively, as before. Then we have the large deviation upper bound for the probability measures P(φΞ(N)uHaar∈⋅) with speed N2 and the rate function
[TABLE]
where as before the infimum over the empty set is taken as +∞ and Om,δ(ψ) is the open neighborhood consisting of all the χ∈TS(CR∗⟨x⋄,u∙⟩) such that ∣χ(w)−ψ(w)∣<δ for all words w in xj,ui,ui∗ (j≤m, 1≤i≤n) of length not greater than m.
We remark that Cabanal Duvillard and Guionnet [9, Corollary 4.2] have also obtained a large deviation upper bound for the UN(i) with seemingly different rate function based on self-adjoint matrix Brownian motions.
7.7. Relation to the matrix liberation process
We will compare Theorem 7.2 with [29, Theorem 5.8]. To this end, we re-number ξj(N) and xj as ξij(N) and xij, respectively. Let πlib:CR∗⟨x∙⋄(⋅)⟩→CR∗⟨x∙⋄,u∙(⋅)⟩ be the ∗-homomorphism sending xij(t) to ui(t)xijui(t)∗. This induces a continuous map πlib∗:TSc(CR∗⟨x∙⋄,u∙(⋅)⟩)→TSc(CR∗⟨x∙⋄(⋅)⟩) defined by πlib∗(φ):=φ∘πlib. We observe that πlib∗(φΞ(N)uBM)=τΞlib(N). Therefore, the contraction principle in large deviation theory implies the large deviation upper bound for P(τΞlib(N)∈⋅) in the same scale with the good rate function:
[TABLE]
where the infimum over the empty set is taken as +∞.
Therefore, we have two large deviation upper bounds with (seemingly different) rate functions for P(τΞlib(N)∈⋅).
Let τ∈TSc(CR∗⟨x∙⋄(⋅)⟩) be given. Consider an arbitrary φ∈TSc(CR∗⟨x∙⋄,u∙(⋅)⟩) with πlib∗(φ)=τ. It is not difficult to show that
[TABLE]
for every P∈C⟨x∙⋄(⋅)⟩ and every s≥0. Therefore, Iσ0,tlib(τ,P)=Iσ0,t(φ,πlib(P)) for every P∈C⟨x∙⋄(⋅)⟩ and every t≥0, and hence
[TABLE]
where Iσ0,∞ulib(τ):=inf{Iσ0,∞uBM(φ)∣φ∈TSc(CR∗⟨u∙(⋅).x⋄⟩),πlib∗(φ)=τ}. Therefore, the current approach using unitary Brownian motions directly gives an improved large deviation upper bound for the matrix liberation process, though the description of the resulting rate function is ‘indirect’. Remark that the above inequalities between two kinds of rate functions guarantee that Iσ0ulib≥Iσ0,∞ulib also have a unique minimizer, which is given by σ0lib. Remark that this fact on the rate functions Iσ0ulib≥Iσ0,∞ulib holds even when σ0 does not fall into TSfda(C∗⟨x∙⋄⟩).
8. Conditional expectations of liberation cyclic derivatives
We will give a technical result on liberation cyclic derivatives Ds(k), 1≤k≤n, for future work. The most non-trivial component of the rate functions Iσ0lib,Iσ0,∞lib is EN(τ)(πτ~(Πs(Ds(k)P))), which will be described in terms of free cumulants when P is a monomial. In what follows, we use the notations in section 4.
We first introduce some terminology: Let (A,φ) be a non-commutative probability space, and a1,…,an∈A be arbitrarily chosen. For a ‘block’ V=(i1<⋯<is) of [n]={1,…,n}, we define id(V)[a1,…,an]:=ai1⋯ais (i.e., the word obtained by arranging ai1,…,ais in order). For a partition π={V1,…,Vm} of [n], we define
[TABLE]
where φ(Vℓ)[a1,…,an] is defined as in [23, Lecture 11]; namely, we have φ(Vℓ)[a1,…,an]=φ(id(Vℓ)[a1,…,an]).
Proposition 8.1**.**
Write
[TABLE]
with i0:=in and (t−s)+:=0∨(t−s). Then, we have
[TABLE]
where NC(n) denotes the non-crossing partitions of [n], κπ the free cumulant associated with π, and K:NC(n)→NC(n) the Kreweras complementation map; see [23, Lecture 11].
Proof.
Write P=xi1j1(t1)⋯xinjn(tn) for simplicity. Let y∈CR∗⟨x∙⋄(⋅)⟩ be arbitrarily chosen. Then we compute
[TABLE]
where we use the same symbol τ~ as a different meaning on each side; see subsection 4.D. By a direct computation using the trace property, we have
[TABLE]
each of whose terms is the τ~-value of the monomial obtained from Πs(P) by replacing xiℓjℓ(s∧tℓ) with [xiℓjℓ(s∧tℓ),y]. By [23, Theorem 14.4] we obtain that
[TABLE]
When K(π)={V1,…,Vm} with ℓ∈Vp (1≤p≤m), we have
[TABLE]
If Vp=(s1<⋯<sf) with sg=ℓ, then
[TABLE]
which together with the definition of Ds(k) implies that
[TABLE]
Hence we conclude that
[TABLE]
Hence we are done.
∎
It is interesting to compute κπ[w1,…,wn] in the above explicitly.
Appendix A Universal free products of unital C∗-algebras
The concept of universal free products in the category of unital C∗-algebras has been studied in detail by several hands, including Blackadar [6], Pedersen [25] and others. However, almost all existing works deal with only universal free products of two unital C∗-algebras. We have used universal free products of uncountably many unital C∗-algebras crucially (even in [29] without any references). Hence, we will collect a few facts on universal free products of arbitrary number of unital C∗-algebras with explicit explanations for the reader’s convenience. However, we do not claim any credit to the materials in this appendix, because they all seem to be known among specialists.
Let Ai, i∈I, be unital C∗-algebras. Consider their universal free product ★i∈IAi with canonical unital ∗-homomorphisms λi:Ai→★i∈IAi, i∈I, which is characterized by the universality asserting that for any family πi:Ai→B of unital ∗-homomorphisms into a common unital C∗-algebra, then there exists a unital ∗-homomorphism π:★i∈IAi→B such that π∘λi=πi for all i∈I. Note that the injectivity of each λi was established in [6, Theorem 3.1] (or [25, Theorem 4.2]).
Lemma A.1**.**
For any disjoint decomposition I=⨆j∈JIj of I into non-empty subsets, we consider the universal free product C∗-algebras ★i∈IjAi, j∈J. Then ★i∈IAi≅★j∈J(★i∈IjAi) naturally, that is, each λi(a) with a∈Ai is sent to the corresponding element in the jth free product component ★i∈IjAi on the right-hand side when i∈Ij.
Proof.
This follows from the universality of the involved universal free product C∗-algebras.
∎
Lemma A.2**.**
For each finite subset F⋐I, we consider the universal free product C∗-algebra AF:=★i∈FAi with setting A∅:=C1. Then the following hold true:
(1)
If F1⊂F2, then the canonical unital ∗-homomorphism AF1→AF1★AF2∖F2=AF2 via Lemma A.1 is injective.
(2)
★i∈IAi≅limFAF* naturally (see e.g. [19, Proposition 11.4.1(i)] for the latter), that is, the isomorphism sends each λi(a) with a∈Ai to the corresponding one in AF with i∈F.*
Proof.
(1) follows from Blackadar’s result [6, Theorem 3.1]. (2) follows from [6, Theorem 3.1] and [19, Proposition 11.4.1(ii)] for example.
∎
Proposition A.3**.**
Let Bi⊆Ai, i∈I, be unital C∗-subalgebras. Then the universal free product C∗-algebra ★i∈IBi is naturally embedded into ★i∈IAi. Namely, ★i∈IBi can be identified with the C∗-subalgebra generated by the λi(Bi) and the canonical unital ∗-homomorphisms from Bi into ★i∈IBi is given by the restriction of λi to Bi.
Proof.
Write BF:=★i∈FBi for each finite subset F⋐I with B∅:=C1. By the iterative use of Pedersen’s result [25, Theorem 4.2] with the help of Lemma A.1 we can see that BF↪AF naturally. Then, by e.g. [19, Proposition 11.4.1(ii)] we have a natural unital injective ∗-homomorphism from limFBF into limFAF by means of inductive limits. Thus the desired assertion follows thanks to Lemma A.2(2).
∎
Proposition A.4**.**
Let ★i∈IalgAi be the free product of the λi(Ai), i∈I, in the category of unital ∗-algebras, in which we regard each Ai as a unital ∗-subalgebra. Let λ:★i∈IalgAi→★i∈IAi be the unique ∗-homomorphism sending a∈Ai⊂★i∈IalgAi to λi(a)∈★i∈IAi, whose existence is guaranteed by universality. Then λ must be injective. Namely, the ∗-subalgebra algebraically generated by the λi(Ai) in ★i∈IAi can be identified with ★i∈IalgAi.
Proof.
We have to show that if a∈★i∈IalgAi satisfies λ(a)=0, then a=0. To this end we will use the reduced free product construction, see e.g. [32], following Avitzour’s idea [2, Proposition 2.3].
Let a∈★i∈IalgAi be given. Then a is nothing but a linear combination of words whose letters from the Ai. For each i∈I we let Ai0 be the unital C∗-subalgebra of Ai generated by the letters from Ai (with fixed i) appearing in the words in the linear combination description of a. Since there are only finitely many letters for each i∈I, Ai0 must be separable. By Proposition A.3 we may and do regard ★i∈IAi0 as a unital C∗-algebra of ★i∈IAi naturally, and λ(a) falls into ★i∈IAi0. Hence we may and do regard each Ai as a separable unital C∗-algebra.
We claim that for each i∈I there exists a faithful state ωi on Ai. Since Ai is separable, it faithfully acts on a separable Hilbert space, say π:Ai↷K. See [12, Theorem I.9.12]. Then we choose a dense sequence of non-zero vectors ξn∈K and set ωi(a):=∑n=1∞2n∥ξn∥K1(π(a)ξn∣ξn)K for a∈Ai. This clearly defines a faithful state.
Consider the reduced C∗-free product (A,ω)=★i∈I(Ai,ωi) with canonical ∗-homomorphisms γi:Ai→A. See e.g. [32]. By universality, we have a unique ∗-homomorphism γ:★i∈IAi→A such that γ∘λi=γi for every i∈I. Write
[TABLE]
with Ai∘:=Ker(ωi), where Ai1∘⋯Aim∘ denotes all the linear combinations of words a1∘⋯am∘ with ak∘∈Aik∘. According to this representation we write
[TABLE]
where a∘(i1,…,im) is an element in Ai1∘⋯Aim∘. Remark that a(i1,…,im)=0 for all but except finitely many (i1,…,im). We denote by a∘(i1,…,im)⊗ in the spacial (or minimal) C∗-tensor product A1⊗⋯⊗Aim the corresponding elements obtained by changing each word a1∘⋯am∘ appearing in a∘(i1,…,im) to a simple tensor a1∘⊗⋯⊗am∘∈A1⊗⋯⊗Aim. By universality of algebraic tensor products sitting inside A1⊗⋯⊗Aim (which is simply confirmed by the iterative use of a well-known fact, see e.g. [19, Proposition 11.18] or a more direct statement [7, Corollary 3.1]), we observe that a∘(i1,…,im)⊗=0 implies a∘(i1,…,im)=0.
Assume that λ(a)=0. Since
[TABLE]
where (Hω,πω,ξω) is the GNS triple of (A,ω). By the free independence among the λi(Ai), we can easily see that αξω and the πω(γ(λ(a∘(i1,…,im))))ξω are mutually orthogonal in Hω. In particular, α as well as all the πω(γ(λ(a∘(i1,…,im))))ξω must be [math]. Let (Hωi,πωi,ξωi) be the GNS triple of (Ai,ωi). Then, it is easy to see that the norm of each πω(γ(λ(a∘(i1,…,im))))ξω is the same as that of
[TABLE]
which must be [math] too. Since ωi is faithful, so is πωi and hence the tensor product representation πωi1⊗⋯⊗πωim:Ai1⊗⋯⊗Aim↷Hωi1⊗⋯⊗Him too (see e.g. [19, Theorem 11.1.3]). We conclude that a∘(i1,…,im)⊗=0 so that a∘(i1,…,im)=0. Consequently, a must be [math].
∎
Bibliography32
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] G. Anderson, A. Guionnet and O. Zeitouni, An Introduction to Random Matrices. Cambridge Studies in Advanced Mathematics, 118. Cambridge University Press, Cambridge, 2009.
2[2] D. Avitzour, Free products of C ∗ superscript 𝐶 C^{*} -algebras. Trans. Amer. Math. Soc. , 271 (1982), 423–435.
3[3] Ph. Biane, Free Brownian motion, free stochastic calculus and random matrices. Free Probability Theory , Fields Institute Communications, 12 (1997), 1–19.
4[4] P. Biane, M. Capitaine and A. Guionnet, Large deviation bounds for matrix Brownian motion. Invent. math. , 152 (2003), 433–459.
5[5] Ph. Biane and Y. Dabrowski, Concavification of free entropy, Adv. Math, , 234 (2013), 667–696.
6[6] B. Blackadar, Weak expectations and nuclear C ∗ superscript 𝐶 C^{*} -algebras. Indiana Univ. Math. J. , 26 (1978), 1021–1026.
7[7] N.P. Brown and N. Ozawa, C ∗ -algebras and Finite-dimensional Approximations. Graduate Studies in Mathematics, 88 , American Mathematical Society, Providence, RI, 2008.
8[8] P.F. Byrd and M.D. Friedman, Handbook of Elliptic Integrals for Engineers and Scientists. Springer-Verlag Berlin Heidelberg New York, 1971.