1 Introduction
The Free Central Limit Theorem serves as a foundational principle in free probability [Reference Voiculescu16], [Reference Nica and Speicher12, Lecture 8]. It asserts that as the number of freely independent operators summed together approaches infinity, the distribution of the normalized sum tends toward an asymptotically semi-circular shape. This mirrors the classical Central Limit Theorem but with independence conditions replaced by free independence (also known as freeness) and the Gaussian limit substituted with a semi-circular limit. More precisely, let
$(\mathcal {A},\tau )$
be a unital noncommutative probability space equipped with a faithful tracial state
$\tau $
[Reference Nica and Speicher12, Lecture 1]. We say that subalgebras
$\mathcal {A}_1,\ldots , \mathcal {A}_d\subset \mathcal {A}$
are free if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu1.png?pub-status=live)
whenever
$p \ge 1$
,
$a_i \in \mathcal {A}_{j_i}$
,
$\tau (a_i)=0$
for all
$i\in [p]$
and
$j_1 \ne j_2 \ne \ldots \ne j_p$
. We say that random variables
$a_1,\ldots ,a_d \in \mathcal {A}$
are free if their generated algebras are free. We denote
$\mu _a$
the distribution of a (self-adjoint) random variable
$a=a^*\in (\mathcal {A},\tau )$
, that is, the unique measure such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu2.png?pub-status=live)
for all integers
$p\ge 1$
. We say that a sequence of (self-adjoint) variables
$a_n \in (\mathcal {A}_n,\tau _n)$
converges in distribution to a variable
$a \in (\mathcal {A},\tau )$
if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu3.png?pub-status=live)
for all integers
$p \ge 0$
and we denote it
$a_n \Rightarrow a$
. Equivalently,
$\mu _{a_n}$
converges weakly toward
$\mu _a$
, and denoted by
$\mu _{a_n} \Rightarrow \mu _a$
. We denote
$a-\lambda :=a-\lambda \mathbf {1}$
, where
$\mathbf {1} \in \mathcal {A}$
is the unit in the algebra. As usual,
$\tau (a)$
is the mean of a and the variance is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu4.png?pub-status=live)
The Free Central Limit Theorem states that if
$a_1,\ldots ,a_n\in (\mathcal {A},\tau )$
are free self-adjoint identically distributed random variables with mean
$\lambda $
and variance
$\sigma ^2$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu5.png?pub-status=live)
where s is the standard semi-circle random variable, whose distribution
$\mu _{sc}:=\mu _s$
has a density given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu6.png?pub-status=live)
The goal of this paper is to establish a Central Limit Theorem for the tensor product of free random variables. Concretely, given
$a_1,\ldots ,a_n\in (\mathcal {A},\tau )$
free self-adjoint identically distributed random variables, we aim at studying the convergence of the normalized sequence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn1.png?pub-status=live)
in the product space
$(\mathcal {A}\otimes \mathcal {A},\tau \otimes \tau )$
.
Just as free probability captures the limiting behavior of random matrices, the above expression appears naturally as the limiting object corresponding to several models of random quantum channels [Reference Lancien, Santos and Youssef8]. Indeed, given
$M_1,\ldots ,M_n \in \mathcal {M}_d(\mathbb {C})$
independent random self-adjoint matrices, it was shown in [Reference Lancien, Santos and Youssef8] that the empirical spectral distribution (ESD) of the quantum channel
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu7.png?pub-status=live)
having the
$M_k$
’s as random Kraus operators and with fixed Kraus rank n, converges as
$d\to \infty $
to the expression in (1) with the
$a_k$
’s being the corresponding limits of the ESD of the
$M_k$
’s. Moreover, it was in particular shown that if the random matrices
$M_k$
are centered, then the ESD of
$\Delta _{d,n}$
converges as
$n,d\to \infty $
to the semi-circle distribution. These two statements combined suggest that, in the case where the
$a_k$
’s are centered, an analog of the Free Central Limit Theorem should hold for the
$a_k\otimes a_k$
’s. Whereas these heuristics indicate that the semi-circle distribution should appear as the limit of (1) when the
$a_k$
’s are centered, the convergence and the explicit limit are not clear in the general case. The goal of this paper is to address this by establishing the convergence of the expression in (1) and identifying the limiting object. The latter, as we show, depends on the mean and variance of the variables
$a_k$
’s and represents a free interpolation between a semi-circle distribution and the classical convolution of two semi-circle distributions.
Random matrix models of the form
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn2.png?pub-status=live)
for
$M_1,\ldots ,M_n \in \mathcal {M}_d(\mathbb {C})$
independent random self-adjoint matrices, are in fact useful in other areas of Quantum Information Theory. When the
$M_k$
’s are positive semidefinite matrices, normalizing M by its trace produces a model for a random separable quantum state. Little is known about the typical asymptotic spectrum of separable states, contrary to that of entangled ones [Reference Ambainis, Harrow and Hastings1]. Moreover, a random matrix M of the form (2) appears naturally when performing a so-called realignment operation on a quantum state. Understanding the spectrum of the realignment of a state is important as it gives information on the entanglement of the state. In [Reference Aubrun and Nechita2], this was done in the particular case where the
$M_k$
’s are Gaussian matrices (corresponding to the case where the state is a normalized Wishart matrix). The results and techniques we develop here (combined with those in [Reference Lancien, Santos and Youssef8]) could be useful in addressing the questions mentioned above.
Given a measure
$\mu $
, we denote
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu8.png?pub-status=live)
its dilation by
$t \ne 0$
, where A is any Borel set in
$\mathbb {R}$
. Equivalently, if a is a random variable with distribution
$\mu $
, then
$ta$
has distribution
$t\mu $
.
The following is our main theorem.
Theorem 1.1 Let
$a \in (\mathcal {A},\tau )$
be a self-adjoint random variable with mean
$\tau (a)=\lambda $
and variance
$\operatorname {var}(a)=\sigma ^2\ne 0$
. Denote
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu9.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu10.png?pub-status=live)
Given
$(a_k)_{k\in \mathbb {N}}$
a sequence of free copies of a, the distribution
$\mu _{S_n}$
of the normalized sum
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu11.png?pub-status=live)
converges weakly as
$n\to \infty $
to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn3.png?pub-status=live)
where
$+$
denotes the classical convolution and
$\boxplus $
denotes the free convolution.
The difficulty in analyzing
$S_n$
stems from the complicated dependence structure exhibited by tensors, combining classical independence (between the two legs of the tensor) and freeness (between the variables across tensors). In the centered case, similar computations were made for semi-circle random variables [Reference Dehornoy and Biane6, Reference Nica11]. It would be of interest to design a general notion of independence corresponding to the tensor case, analyze its properties, derive the corresponding limit theorems, and characterize the corresponding universal objects. One particular generalization is by replacing the tensor product with the product of
$\varepsilon $
-independent random variables [Reference Młotkowski10, Reference Speicher and Weber14, Reference Speicher and Wysoczański15]. A direct consequence of Theorem 1.1 is that such a notion cannot, in general, reduce to freeness.
Corollary 1.2 Let
$a_1,\ldots ,a_n \in (\mathcal {A},\tau )$
be self-adjoint free identically distributed noncentered random variables. Then
$\{a_k\otimes a_k: k \in [n]\}$
are not free.
The above corollary trivially follows from Theorem 1.1, since if the
$a_k\otimes a_k$
’s were free, the limit of their normalized sum would be the semi-circle distribution contradicting the conclusion of Theorem 1.1 (when
$\lambda \neq 0$
). This fact was originally proved in [Reference Collins and Lamarre5] where, more generally, the freeness of tensors of free variables was characterized.
We will provide two proofs of Theorem 1.1. The first proof relies on the computation of the limiting moments of
$S_n$
and highlights the combinatorial structure of the set of partitions that have nonzero contributions. The second proof is shorter and explains the appearance of the three semi-circle random variables in the limiting law.
This paper is organized as follows. In Section 2, we recall some definitions and notations. In Section 3, we provide some properties of the limiting measure appearing in Theorem 1.1. Section 4 establishes the existence of the limit, while Section 5 is dedicated to the proof of Theorem 1.1. Finally, in Section 6, we provide a short alternative proof of Theorem 1.1.
2 Preliminaries and notations
Given
$p\in \mathbb {N}$
, a partition
$\pi =\{V_1, \ldots ,V_k\}$
of
$[p]$
is a collection of nonempty disjoint sets
$V_1,\ldots ,V_k$
called blocks such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu12.png?pub-status=live)
We denote by
$P(p)$
the set of partitions of
$[p]$
. We say that a partition
$\pi \in P(p)$
is connected (also referred to as a linked diagram in [Reference Nijenhuis and Wilf13]) if no proper subinterval of
$[p]$
can be written as the union of blocks of
$\pi $
. A partition
$\pi \in P(p)$
has a crossing
$i<k<j<l$
if there exist two disjoint blocks
$V_1,V_2 \in \pi $
such that
$\{i,j\}\subset V_1$
and
$\{k,l\} \subset V_2$
. In this case, we say that
$V_1$
crosses
$V_2$
. A block
$V\in \pi $
is crossing if there exists another
$V' \in \pi $
such that
$V'$
crosses V, and noncrossing if it does not cross any other block. We say that a partition
$\pi \in P(p)$
is a noncrossing partition if all its blocks are noncrossing. We denote by
$P^{\operatorname {con}}(p)$
(resp.
$NC(p)$
) the set of all connected (resp. noncrossing) partitions of
$[p]$
; see Figure 1. We note that the cardinal
$|NC(p)|$
is equal to
$C_p$
, the p-th Catalan number.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_fig1.png?pub-status=live)
Figure 1: Examples of partitions.
Finally, for a partition
$\pi \in P(p)$
, we denote by
$G(\pi )$
its intersection graph. It is the graph over the blocks of
$\pi $
such that two blocks are connected if they cross, under some arbitrary labeling. We say that a partition
$\pi $
is a bipartite partition if its intersection graph is bipartite and denote it
$\pi \in P^{\operatorname {bi}}(p)$
; see Figure 2 for the partitions in Figure 1.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_fig2.png?pub-status=live)
Figure 2: Examples of intersection graphs.
Given
$\pi \in P(p)$
, we denote
$|\pi |$
its number of blocks and
$\mathbf {cr}(\pi )$
its number of crossing blocks. Therefore, the number of noncrossing blocks of
$\pi $
is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu13.png?pub-status=live)
Given
$\pi \in P(p)$
, we denote
$\mathbf {cc}(\pi )$
its number of connected components. We denote
$P_2(p), P_2^{\operatorname {bi}}(p)$
,
$P_2^{\operatorname {con}}(p)$
,
$P_2^{\operatorname {bicon}}(p)$
, and
$NC_2(p)$
the set of pair partitions, bipartite pair partitions, connected pair partitions, bipartite connected pair partitions, and noncrossing pair partitions, respectively, that is, those partitions such that all of their blocks have cardinality two.
A pair partition
$\pi \in P_2(p)$
can be decomposed into its crossing connected components, namely, let
$\hat {\pi } \in P(p)$
be the choice of connected components and, for each block
$T \in \hat {\pi }$
, draw a connected pair partition
$\pi _T \in P_2^{\operatorname {con}}(T)$
. By definition,
$\hat {\pi } \in NC(p)$
as otherwise two disjoint components would meet (
$\hat {\pi }$
is called the noncrossing closure of
$\pi $
in [Reference Lehner9]). The mapping
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn4.png?pub-status=live)
is a bijection that will be used throughout the proof of Theorem 1.1; see Figure 3.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_fig3.png?pub-status=live)
Figure 3: A partition
$\pi $
and its image
$\Phi (\pi )$
.
Note, for instance, that
$|\hat {\pi }|=\mathbf {cc}(\pi )$
. We denote
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu14.png?pub-status=live)
Given
$a_1,\ldots ,a_n \in \mathcal {A}$
, we denote by
$\kappa ^{\operatorname {free}}_n(a_1,\ldots ,a_n)$
their free cumulants, namely, for any
$i \in [n]^k$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu15.png?pub-status=live)
This is known as the moment–cumulant formula [Reference Nica and Speicher12, Notation 11.5]. Here and throughout the paper, we denote
$V=\{v_1<\ldots <v_l\}$
a block
$V=\{v_1,\ldots ,v_l\}$
such that
$v_1< \ldots <v_l$
; see [Reference Nica and Speicher12, Lecture 11]. Note also that if the variables
$a_1,\ldots ,a_n$
are free, the free mixed cumulants vanish [Reference Nica and Speicher12, Proposition 11.15]. We denote
$\kappa ^{\operatorname {free}}_n(a)$
the free cumulants of a random variable a. The moment–cumulant formula implies the following, which is going to be used extensively in Subsection 5.3; see [Reference Nica and Speicher12, Lecture 5, Equation 5.6].
Lemma 2.1 Let
$a,c_1,c_2$
be variables such that a is free from
$\{c_1,c_2\}$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu16.png?pub-status=live)
We will equivalently denote
$\kappa ^{\operatorname {free}}_n(\mu )$
the free cumulants of a random variable a with distribution
$\mu $
. Given two measures
$\mu _a$
and
$\mu _b$
, the free convolution
$\mu _a \boxplus \mu _b$
denotes the distribution of
$a+b$
, where a and b are free random variables with distribution
$\mu _a$
and
$\mu _b$
, respectively. The classical convolution
$\mu _a+\mu _b$
denotes the distribution of
$a+b$
, where now a and b are classical independent random variables with distribution
$\mu _a$
and
$\mu _b$
, respectively.
3 Properties of the limiting measure
In this section, we summarize some of the properties of the measure
$\mu _q$
appearing in (3). We start by computing the free cumulants and the moments of
$\mu _1$
.
Proposition 3.1 Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu17.png?pub-status=live)
Then the following hold.
-
(1) Its odd moments vanish and, for every
$p \in \mathbb {N}$ , its
$2p$ -th moment is given by
$$ \begin{align*} \int x^{2p}\, \text{d}\mu_1&=2^{-p}\sum_{l=0}^p\binom{2p}{2l}C_lC_{p-l} =2^{-p}\sum_{\pi \in P_2^{\operatorname{bi}}(2p)}2^{\mathbf{cc}(\pi)}, \end{align*} $$
$C_l$ denotes the l-th Catalan number.
-
(2) Its odd free cumulants vanish,
$\kappa ^{\operatorname {free}}_2(\mu _1)=1$ and for any even integer
$n \ge 4$ , we have
$$ \begin{align*} \kappa^{\operatorname{free}}_n(\mu_1)=2\left(\frac{1}{2}\right)^{n/2}|P_2^{\operatorname{bicon}}(n)|. \end{align*} $$
Proof Let
$x_1,x_2$
be two classical i.i.d semi-circle random variables. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu20.png?pub-status=live)
Since the variables are classical independent, and in particular, they commute, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu21.png?pub-status=live)
The odd moments of
$x_1$
vanish and, for any
$l \ge 1$
,
$\tau (x_1^{2l})=C_l$
, hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu22.png?pub-status=live)
Now consider the sequence
$m_p$
given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu23.png?pub-status=live)
For every bipartite pair partition
$\pi $
, we can decompose it into its bipartite sets. Namely, let
$\mathcal {V}_1=\{V_1,\ldots , V_m\}$
and
$\mathcal {V}_2=\{V_{m+1},\ldots , V_p\}$
be the bipartition of its blocks in two disjoint families of vertices. Then, the blocks
$V_1,\ldots ,V_m$
are noncrossing from one another, and so are
$V_{m+1},\ldots , V_p$
. Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu24.png?pub-status=live)
Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu25.png?pub-status=live)
We denote
$(\pi _1,\pi _2,I,I^c)$
a left-right noncrossing representation of
$\pi $
. We note that if
$(\pi _1,\pi _2,I,I^c)$
is a left-right noncrossing representation of
$\pi $
, so is
$(\pi _2,\pi _1,I^c,I)$
. Let
$R(\pi )$
be the set of all left-right noncrossing representations of
$\pi $
. We note that
$|R(\pi )|$
corresponds to the number of ways the vertices of
$G(\pi )$
can be split into two independent families of vertices. Therefore, it is clear that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu26.png?pub-status=live)
Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn5.png?pub-status=live)
Since
$R(\pi )$
is the set of all left-right noncrossing representations of
$\pi $
and we sum over all
$\pi \in P_2^{\operatorname {bi}}(2p)$
, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu27.png?pub-status=live)
Note that for fixed
$I \subseteq [2p]$
, each
$(\pi _1,\pi _2) \in NC_2(I) \times NC_2(I^c)$
will correspond to a unique partition
$\pi \in P_2^{\operatorname {bi}}(2p)$
such that
$(\pi _1,\pi _2,I,I^c)$
is a left-right noncrossing representation of
$\pi $
. Hence we can first sum over
$I\subseteq [2p]$
so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu28.png?pub-status=live)
Therefore, by (5), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu29.png?pub-status=live)
The latter cardinality can be written as a product over the cardinals and only depends on the length of I. More precisely, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu30.png?pub-status=live)
where the cardinal
$|NC_2(2l)|$
is equal to
$C_l$
. Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu31.png?pub-status=live)
and the first statement follows. For the second, we use the bijection
$\Phi $
in (4) to write
$\Phi (\pi )=\left (\hat {\pi },(\pi _T)_{T \in \hat {\pi }}\right )$
. We note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu32.png?pub-status=live)
Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu33.png?pub-status=live)
where we use that
$\mathbf {ncr}(\pi )+\mathbf {cr}(\pi )=p$
in the first equality. We thus have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu34.png?pub-status=live)
Since the free cumulants
$\kappa ^{\operatorname {free}}_n(\mu _1)$
are uniquely characterized by the moments, it follows that for any odd integer n, we have
$\kappa ^{\operatorname {free}}_n(\mu _1)=0$
,
$\kappa ^{\operatorname {free}}_2(\mu _1)=1$
and for any even integer
$n \ge 4$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu35.png?pub-status=live)
Remark 3.2 For any
$p \ge 1$
, it was shown in [Reference Gouyou-Beauchamps7] that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu36.png?pub-status=live)
Therefore, the
$2p$
-th moment of
$\mu _1$
is also characterized by
$2^{-p}C_pC_{p+1}$
. The sequence
$(C_pC_{p+1})_{p \ge 1}$
is A005568 in Sloane’s encyclopedia (https://oeis.org/A005568), where several combinatorial objects counted by it are shown.
We are ready to compute the moments and free cumulants of
$\mu _q$
.
Proposition 3.3 Given
$q\in [0,1]$
, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu37.png?pub-status=live)
Then the following hold.
-
(1) The odd free cumulants of
$\mu _q$ vanish,
$\kappa ^{\operatorname {free}}_2(\mu _q)=1$ and for any even integer
$n \ge 4$ , we have
$$ \begin{align*} \kappa^{\operatorname{free}}_n(\mu_q)=2\Big(\frac{q}{2}\Big)^{n/2}|P_2^{\operatorname{bicon}}(n)|. \end{align*} $$
-
(2) The odd moments of
$\mu _q$ vanish and, for every
$p\in \mathbb {N}$ , its
$2p$ -th moment is given by
$$ \begin{align*} \sum_{\pi \in P_2^{\operatorname{bi}}(2p)}2^{\mathbf{cc}(\pi)-p}q^{\mathbf{cr}(\pi)}. \end{align*} $$
Proof We will use the notion of R-transform; see [Reference Nica and Speicher12, Lecture 16]. For a random variable
$a \in \mathcal {A}$
with distribution
$\mu $
, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu40.png?pub-status=live)
be its R-transform, defined as a formal series. The R-transform of a standard semi-circle law is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu41.png?pub-status=live)
whereas Proposition 3.1 shows that the R-transform of
$\mu _1$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu42.png?pub-status=live)
Since the free cumulants linearize the free convolution, we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu43.png?pub-status=live)
This proves the first part of the proposition. To prove the second part, we use the moment–cumulant formula to deduce that the odd moments vanish, while the
$2p$
-th moment can be expressed as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu44.png?pub-status=live)
where the second summation is over
$(\pi _T)_{T \in \hat {\pi }} \in \operatorname {Proj}(\hat {\pi })$
such that
$\pi _T \in P_2^{\operatorname {bicon}}(T)$
for
$T \in \hat {\pi }$
. Now noting that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu45.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu46.png?pub-status=live)
we finish the proof after using the bijection
$\Phi $
from (4) to rewrite the above expression.
4 Existence of the limit
The goal of this section is to show that the expression in (1) admits a limit that depends only on the first and second moments of the variables at hand. Let us first prove the following centering lemma.
Lemma 4.1 Let
$(\mathcal {A},\tau )$
be a unital faithful tracial noncommutative probability space. Let
$\{a_k: k \in [n]\},\{d_k: k \in [n]\} \subset \mathcal {A}$
be two collections of free random variables and let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu47.png?pub-status=live)
for every
$k\in [n]$
. Then for any
$m \ge 1$
and
$i_1,\ldots ,i_m \in [n]$
such that there exists an index
$l^* \in [m]$
satisfying
$i_{l^*} \ne i_j$
for all
$j \ne l^*$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu48.png?pub-status=live)
In particular, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu49.png?pub-status=live)
Proof By cyclicity of the trace, we can assume that
$l^*=1$
. We write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn6.png?pub-status=live)
For the first term, we open the expressions for
$c_{i_j}$
for
$j \ge 2$
to get that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu50.png?pub-status=live)
where
$\overset {\to }{\prod }$
denotes the product respecting the ordering. Since
$a_{i_1},d_{i_1}$
are free from
$a_{i_j},d_{i_j}$
for all
$j \ge 2$
, freeness implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu51.png?pub-status=live)
The summation can be easily written as
$\tau \otimes \tau (c_{i_2}\ldots c_{i_m})$
, hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu52.png?pub-status=live)
By (6), we then have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu53.png?pub-status=live)
Finally, since
$\tau \otimes \tau (a_{i_1}\otimes d_{i_1})=\tau (a_{i_1})\tau (d_{i_1})$
, we get that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu54.png?pub-status=live)
We are now ready to prove the existence of the limit and that it only depends on the first and second moments of the
$a_k$
’s. It also follows from a general scheme to prove a Central Limit Theorem type-result of Boejko and Speicher [Reference Bożejko and Speicher3, Theorem 0]. For
$i\in [n]^p$
, we denote
$\ker i\in P(p)$
the partition such that
$k,l$
are in the same block of
$\ker i$
if and only if
$i_j=i_k$
.
Proposition 4.2 (Existence)
Let
$(a_n)_{n\in \mathbb {N}} \in (\mathcal {A},\tau )$
be free self-adjoint identically distributed random variables with mean
$\lambda $
, variance
$\sigma ^2$
, and denote
$\delta ^2:=\operatorname {var}(a_1\otimes a_1)= \sigma ^2(\sigma ^2+2\lambda ^2)$
. For every
$k\in \mathbb {N}$
, denote
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu55.png?pub-status=live)
and for every
$n\in \mathbb {N}$
, denote
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu56.png?pub-status=live)
Then there exists a random variable
$\mathbf {{S}} \in (\mathcal {A}',\tau ')$
such that
$S_n\Rightarrow \mathbf {{S}}$
. Moreover, the law of
$\mathbf {{S}}$
depends only on
$\lambda $
and
$\sigma $
, its odd moments vanish and, for every
$p\in \mathbb {N}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu57.png?pub-status=live)
where
$i \in [p]^{2p}$
is any sequence such that
$\ker i=\pi $
.
Proof We begin by writing
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu58.png?pub-status=live)
Since
$b_{1},\ldots ,b_n$
are identically distributed, the expression
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn7.png?pub-status=live)
depends only on the partition
$\pi =\ker i \in P(p)$
. Denote the common value of (7) by
$\tau \otimes \tau (\pi )$
. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu59.png?pub-status=live)
To count the cardinality, we choose an index for each block. Therefore, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu60.png?pub-status=live)
By Lemma 4.1, if
$\pi $
has a block of size
$1$
,
$\tau \otimes \tau (\pi )=0$
. Thus, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu61.png?pub-status=live)
Since
$|V| \ge 2$
for all blocks
$V \in \pi $
, we have
$|\pi | \le p/2$
. If there exists a block
$V \in \pi $
such that
$|V| \ge 3$
, we immediately have
$|\pi |<p/2$
, and its contribution is negligible. In particular, this implies that the odd moments of
$S_n$
are asymptotically vanishing. We deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu62.png?pub-status=live)
In this case,
$\pi $
is a pair partition and
$|\pi |=p/2$
, hence we deduce the formula
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu63.png?pub-status=live)
which shows that
$S_n$
converges. To prove that the limit depends only on
$\lambda $
and
$\sigma $
, we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu64.png?pub-status=live)
where
$\pi (i)=\pi $
. By the moment–cumulant formula, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu65.png?pub-status=live)
Since the mixed cumulants of free variables vanish, the only partitions
$\sigma \in NC(I^c)$
that contribute are those such that every block
$V \in \sigma $
has cardinality at most two. We then have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu66.png?pub-status=live)
This concludes the proof.
5 Proof of Theorem 1.1
After proving the existence of the limit in the previous section, the goal here is to identify this limit as stated in Theorem 1.1. In all this section,
$(a_n)_{n\in \mathbb {N}}$
denote free copies of a random variable a with mean
$\lambda $
and variance
$\sigma ^2$
. Moreover, the common law of the normalized tensors will be denoted by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn8.png?pub-status=live)
where
$\delta ^2=\operatorname {var}(a\otimes a)=\sigma ^2(\sigma ^2+2\lambda ^2)$
.
Throughout the proof, we will assume p is an even integer. Following Proposition 4.2, we denote
$\mathbf {{S}}$
the limit of
$S_n$
and note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu67.png?pub-status=live)
where
$\tau \otimes \tau (\pi )=\tau \otimes \tau (b_{i_1}\ldots b_{i_p})$
with
$\pi (i)=\pi $
.
5.1 Contribution of noncrossing blocks
We begin by removing interval blocks.
Lemma 5.1 Let
$\pi \in P_2(p)$
and suppose that there exists
$l \in [p]$
such that
$\{l,l+1\} \in \pi $
(with the convention that
$p+1:=1$
). Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu68.png?pub-status=live)
Proof By cyclicity, we can assume
$l=p-1$
. We then have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu69.png?pub-status=live)
We immediately recognize
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu70.png?pub-status=live)
By Lemma 4.1, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu71.png?pub-status=live)
Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu72.png?pub-status=live)
To conclude, we note that
$\tau ^2(a^2)-\lambda ^4=\delta ^2$
and finish the proof.
Recall that a noncrossing pair partition
$\pi \in NC_2(p)$
always has an interval block
$V=\{l,l+1\} \in \pi $
such that
$\pi \setminus V$
is a noncrossing pair partition. In particular, by induction, Lemma 5.1 implies the following.
Corollary 5.2 For any
$\pi \in NC_2(p)$
, we have
$\tau \otimes \tau (\pi )=1$
.
5.2 Decomposition of pair partitions
In order to capture the contribution of crossing partitions, we need to decompose a partition
$\pi \in P_2(p)\setminus NC_2(p)$
using smaller partitions. We denote
$\pi =\pi _1\oplus \ldots \oplus \pi _k$
if
$[p]$
can be decomposed into k intervals
$I_1,\ldots ,I_k$
such that
$\pi _k \in P_2(I_k)$
and
$V \in \pi $
if
$V \in \pi _l$
for some
$1 \le l \le k$
. For
$I \subseteq [p]$
, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn9.png?pub-status=live)
and
$a_{\varnothing }:=1$
.
Lemma 5.3 Let
$\pi \in P_2(p)$
. Then, the following hold.
-
(5.3.i) If
$\pi =\pi _1 \oplus \ldots \oplus \pi _l$ , then
$$ \begin{align*} \tau\otimes \tau(\pi)=\tau\otimes \tau(\pi_1)\ldots \tau\otimes \tau(\pi_l). \end{align*} $$
-
(5.3.ii) If
$\pi =\{1,p\}\cup \pi _1$ , where
$\pi _1 \in P_2(\{2,\ldots ,p-1\})$ , then
$$ \begin{align*} \tau\otimes \tau(\pi)=\tau\otimes \tau(\pi_1). \end{align*} $$
Moreover, if there exists an interval
$I \subseteq [p]$ such that
$\pi |_I$ is a pair partition, then
$$ \begin{align*} \tau\otimes \tau(\pi)=\tau\otimes \tau(\pi|_I)\tau\otimes \tau (\pi|_{I^c}). \end{align*} $$
-
(5.3.iii) If
$\pi $ has a block
$V=\{r,s\}$ such that for any block
$U=\{l,k\} \in \pi $ with
$r <l<s$ , we have
$r<k<s$ (i.e., every point inside V matches another one inside V), we have
$$ \begin{align*} \tau\otimes \tau(\pi)=\tau\otimes \tau(\pi|_{V_-})\tau\otimes \tau(\pi|_{V_+}), \end{align*} $$
$\pi |_{V_-}$ is the restriction of
$\pi $ to inside of V and
$\pi |_{V_+}$ is the restriction of
$\pi $ to outside of V.
Proof
(5.3.i) By induction, it suffices to prove the case
$\pi =\pi _1\oplus \pi _2$
. Let
$I_1,I_2$
be the disjoint decomposition of
$[p]$
given by
$\pi _1$
and
$\pi _2$
. Then, we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu77.png?pub-status=live)
Since
$\pi $
is the direct sum of
$\pi _1,\pi _2$
, the variables
$a_{J_1^c}, a_{J_2^c}$
are free and we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu78.png?pub-status=live)
It is immediate to check that the right-hand-side is equal to
$\tau \otimes \tau (\pi _1)\tau \otimes \tau (\pi _2)$
.
(5.3.ii) By cyclicity, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu79.png?pub-status=live)
Since
$\{1,p\} \in \pi $
, Lemma 5.1 implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu80.png?pub-status=live)
The second part follows again by cyclicity as we can assume
$I=\{1,\ldots ,k\}$
for some
$k \in [p]$
, and the variables are free.
(5.3.iii) By cyclicity, we can assume that
$V=\{1,k\}$
for some
$k\in [p]$
. Note that V creates a direct sum
$\pi =(V\cup \pi |_{V_-})\oplus \pi |_{V_+}$
. The result follows by (5.3.i) and (5.3.ii).
Note that any block
$V \in \pi $
that does not cross any other block of
$\pi $
is either an interval block or a block that satisfies (5.3.iii). In particular, its removal does not affect the value of
$\tau \otimes \tau (\pi )$
. It is clear then that
$\tau \otimes \tau (\pi )$
is a multiplicative function [Reference Bożejko and Speicher4] over the connected components of
$\pi $
. Using the mapping
$\Phi $
defined in (4), we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn10.png?pub-status=live)
where
$(\hat {\pi },(\pi _T)_{T \in \hat {\pi }})=\Phi (\pi )$
. In view of this, we will now focus on the case where
$\pi \in P_2^{\operatorname {con}}(p)$
, for
$p \ge 4$
, as the case
$p=2$
corresponds to noncrossing blocks.
5.3 Contribution of connected partitions
Given
$\pi \in P_2^{\operatorname {con}}(p)$
, for an even integer
$p \ge 4$
, we recall that
$\pi \in P_2^{\operatorname {bicon}}(p)$
if its intersection graph
$G(\pi )$
is a bipartite connected graph.
The following is the main proposition of this subsection.
Proposition 5.4 Let
$p \ge 4$
be an even integer and
$\pi \in P_2^{\operatorname {con}}(p)$
. Then the following hold.
-
(1) If
$\pi \notin P_2^{\operatorname {bicon}}(p)$ , then
$\tau \otimes \tau (\pi )=0$ ;
-
(2) If
$\pi \in P_2^{\operatorname {bicon}}(p)$ , then
$$ \begin{align*} \tau\otimes \tau(\pi)=2 \Big(\frac{q}{2}\Big)^{\frac{p}{2}}, \end{align*} $$
$q=\frac {2\lambda ^2}{\sigma ^2+2\lambda ^2}$ .
To prove Proposition 5.4, our goal is to remove the blocks
$V \in \pi $
one at a time and track its influence on the rest of the partition
$\pi \setminus V$
. To this end, we will define two main quantities associated with V. First, we will define a coloring
$w_V \in \{0,1\}$
of V that encodes how the removal of V affects the other blocks. Secondly, we will define a binary vector
$\theta _V \in \{0,1\}^4$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu82.png?pub-status=live)
that is, only one coordinate of
$\theta _V$
is equal to
$1$
. It encodes how we remove the block V from
$\pi $
, that is, its weight to
$\tau \otimes \tau (\pi )$
. Let us begin this description now.
Let
$\pi \in P_2^{\operatorname {con}}(p)$
and
$i \in [p]^p$
such that
$\pi (i)=\pi $
. Given an integer
$t \ge 0$
, blocks
$V_1,\ldots ,V_t,V_{t+1} \in \pi $
, and a coloring
$w \in \{0,1\}^{t+1}$
, we denote
$V_j^{(w_j)}$
the block
$V_j$
under the color
$w_j$
. We then define the iterated joint law of
$b_{i_j}$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu83.png?pub-status=live)
for
$k \le t+1$
as follows. Let
$(\tilde {a}_j)_{j \in \mathbb {N}}$
be a family of free copies of a, free from
$(a_j)_{j \in \mathbb {N}}$
. For
$k=0$
, we define
$B_0=(b_{i_j})_{j \in [p]}$
and for any
$1 \le k \le t+1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu84.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn11.png?pub-status=live)
for any
$j \in [p]$
. We then recursively define the choices in (11) as follows. Given
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu85.png?pub-status=live)
we consider the block
$V_{k+1}=\{s_1<s_2\}$
and its color
$w_{k+1}$
, for
$1 \le k \le t$
. If
$w_{k+1}=0$
, for all blocks
$V=\{t_1,t_2\} \in \pi $
that cross
$V_{k+1}$
, we replace the left legs of
$(b_{i_{t_1},k},b_{i_{t_2},k})$
by a pair of free variables. Concretely, we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu86.png?pub-status=live)
Otherwise, if
$w_{k+1}=1$
, we replace the right legs of
$(b_{i_{t_1},k},b_{i_{t_2},k})$
by a pair of free variables instead,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu87.png?pub-status=live)
All the other blocks remain unchanged. Recall that for a vector B and a set
$I \subseteq [p]$
, we set as in (9)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu88.png?pub-status=live)
and
$B_{\varnothing }=1$
. We then define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu89.png?pub-status=live)
where
$U_1,\ldots ,U_{m},V_1,\ldots ,V_{k} \in \pi $
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu90.png?pub-status=live)
Note first that at each step k, the distribution of
$(b_{i_{v_1},k},b_{i_{v_2},k})$
for a block
$V=\{v_1<v_2\} \in \pi $
can be written as one of the following four cases.
-
(1) The blocks
$V_1,\ldots ,V_k$ do not cross V, and we have
$$ \begin{align*} &b_{i_{v_1},k}=\frac{1}{\delta}\left(a_{i_{v_1}}\otimes a_{i_{v_1}}-\lambda^2\right)\hspace{-1.5pt};\\ &b_{i_{v_2},k}=\frac{1}{\delta}\left(a_{i_{v_1}}\otimes a_{i_{v_1}}-\lambda^2\right)\hspace{-1.5pt}, \end{align*} $$
$i_{v_1}=i_{v_2}$ .
-
(2) All blocks
$V_j$ that cross V have the same color
$w_j=0$ , and we have
$$ \begin{align*} &b_{i_{v_1},k}=\frac{1}{\delta}\left(\tilde{a}_{i_{v_1}}\otimes a_{i_{v_1}}-\lambda^2\right)\hspace{-1.5pt};\\ &b_{i_{v_2},k}=\frac{1}{\delta}\left(a_{i_{v_1}}\otimes a_{i_{v_1}}-\lambda^2\right)\hspace{-1.5pt}. \end{align*} $$
-
(3) All blocks
$V_j$ that cross V have the same color
$w_j=1$ , and we have
$$ \begin{align*} &b_{i_{v_1},k}=\frac{1}{\delta}\left(a_{i_{v_1}}\otimes \tilde{a}_{i_{v_1}}-\lambda^2\right)\hspace{-1.5pt};\\ &b_{i_{v_2},k}=\frac{1}{\delta}\left(a_{i_{v_1}}\otimes a_{i_{v_1}}-\lambda^2\right)\hspace{-1.5pt}. \end{align*} $$
-
(4) Otherwise, there exist two blocks
$V_{j_1},V_{j_2}$ that cross V such that
$w_{j_1}\ne w_{j_2}$ , that is, they have different colors, and then
$$ \begin{align*} &b_{i_{v_1},k}=\frac{1}{\delta}\left(\tilde{a}_{i_{v_1}}\otimes \tilde{a}_{i_{v_1}}-\lambda^2\right)\hspace{-1.5pt};\\ &b_{i_{v_2},k}=\frac{1}{\delta}\left(a_{i_{v_1}}\otimes a_{i_{v_1}}-\lambda^2\right)\hspace{-1.5pt}. \end{align*} $$
We remark that even if the choices of replacements do not always happen for
$b_{i_{v_1}}$
, the joint distribution of
$(b_{i_{v_1},k},b_{i_{v_2},k})$
can always be written as one of those four cases since the variables are free identically distributed. For instance, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu95.png?pub-status=live)
and so on. Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu96.png?pub-status=live)
and denote
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu97.png?pub-status=live)
The choice of
$\theta :=\theta \left (V, V_1^{(w_1)}\ldots , V_k^{(w_k)}\right )$
corresponds to the case in which we are, that is, we define
$\theta $
as the binary vector such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu98.png?pub-status=live)
Let
$V=\{v_1<v_2\} \in \pi \setminus \{V_1,\ldots , V_k\}$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu99.png?pub-status=live)
Our first goal is to obtain the contribution and coloring of V to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu100.png?pub-status=live)
according to the value of
$\theta = \theta \left (V, V_1^{(w_1)}\ldots , V_k^{(w_k)}\right )\in \{0,1\}^4$
, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu101.png?pub-status=live)
We recall that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu102.png?pub-status=live)
To simplify the notation, we denote
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn12.png?pub-status=live)
We divide the four cases into the next four lemmas.
Lemma 5.5 (Case
$\theta _1=1$
)
Let
$p \ge 4$
be an even integer,
$\pi \in P_2^{\operatorname {con}}(p)$
. Let
$V_1,\ldots ,V_k \in \pi $
be blocks,
$w \in \{0,1\}^k$
be a coloring of
$V_1,\ldots ,V_k$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu103.png?pub-status=live)
Let
$V=\{v_1<v_2\} \in \pi \setminus \{V_1,\ldots ,V_{k}\}$
and the joint law
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu104.png?pub-status=live)
If
$\theta _1=1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu105.png?pub-status=live)
Proof To simplify the notation, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu106.png?pub-status=live)
Then, we must prove that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu107.png?pub-status=live)
As
$\theta _1=1$
, we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu108.png?pub-status=live)
where
$a:=a_{i_{v_1}}$
. We get by Lemma 4.1 that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn13.png?pub-status=live)
Let us write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu109.png?pub-status=live)
Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu110.png?pub-status=live)
where h is defined as in (12). We use Lemma 2.1 and compute
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu111.png?pub-status=live)
After the expansion, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu112.png?pub-status=live)
where we choose
$R_2$
to be the term with factor
$\tau (a_{J_1^c}^{(l)}\, a_{J_2^c}^{(l)}\, a_{J_3^c}^{(l)})$
. For
$R_1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu113.png?pub-status=live)
Since
$\pi $
is connected, V crosses at least one block
$U=\{j,j'\} \in \pi $
. Therefore, we assume
$j \in I_2$
whose matching symbol
$j' \in I_1\cup I_3$
. By Lemma 4.1, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu114.png?pub-status=live)
and the contribution of
$R_1$
is zero. For
$R_4$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu115.png?pub-status=live)
Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu116.png?pub-status=live)
its contribution cancels out with
$\frac {\lambda ^4}{\delta ^2}\tau \otimes \tau \left (\pi \setminus \{V_1,\ldots ,V_k,V\},V_1^{(w_1)},\ldots ,V_k^{(w_k)}\right )$
in (13). For
$R_2$
, let us first denote by
$\left (\overline {a}_{i_j}^{(l)},\overline {a}_{i_j}^{(r)}\right )_{j\in [p]}$
the variables in
$B_{k+1}\left (V_1^{(w_1)},\ldots ,V_{k}^{(w_k)},V^{(1)}\right )$
, namely,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu117.png?pub-status=live)
We then have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu118.png?pub-status=live)
By definition, the color
$w_{k+1}=1$
does not affect the left legs, hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu119.png?pub-status=live)
For the right legs and a block
$U=\{t_1<t_2\}$
, let us divide it into two cases.
-
(1) If U does not cross V, we have
$$ \begin{align*} &\overline{a}_{i_{t_1}}^{(r)}=a_{i_{t_1}}^{(r)};\\ &\overline{a}_{i_{t_2}}^{(r)}=a_{i_{t_2}}^{(r)}. \end{align*} $$
-
(2) Otherwise, either
$t_1 \in I_2$ and
$t_2 \in I_1\cup I_3$ or
$t_1 \in I_1 \cup I_3$ and
$t_2 \in I_2$ . By the definition of the color
$w_{k+1}=1$ , we have
$$ \begin{align*} &\overline{a}_{i_{t_1}}^{(r)}=\tilde{a}_{i_{t_1}};\\ &\overline{a}_{i_{t_2}}^{(r)}=a_{i_{t_1}}. \end{align*} $$
Since
$(a_k)_{k \in \mathbb {N}}$
and
$(\tilde {a}_k)_{k \in \mathbb {N}}$
are free copies of a, the following holds. First, let
$t \in I_2$
. Consider
$t'$
its matching symbol, that is,
$\{t,t'\} \in \pi $
and
$i_t=i_{t'} \ne i_j$
, for all
$j \notin \{t,t'\}$
. Recall that, by the definition in (11), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu122.png?pub-status=live)
If
$t' \in I_2$
, Case (1) implies that the law of
$(\overline {a}_{i_t}^{(r)},\overline {a}_{i_{t'}}^{(r)})$
is equal to the law of
$({a}_{i_t}^{(r)},{a}_{i_{t'}}^{(r)})$
. If
$t' \in I_1\cup I_3$
, as
$a_{i_t},\tilde {a}_{i_t}$
are free identically distributed and free from
$(a_k)_{k \ne i_t},(\tilde {a}_k)_{k \ne i_t}$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn14.png?pub-status=live)
Applying the above equalities in distribution for all
$t \in I_2$
, namely, Case (1) for
$t' \in I_2$
and (14) for
$t' \notin I_2$
, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu123.png?pub-status=live)
By symmetry, we also have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu124.png?pub-status=live)
Additionally,
$\left (\overline {a}_{i_j}^{(r)}\right )_{j \in I_2}$
is now free from
$\left (\overline {a}_{i_j}^{(r)}\right )_{j \in I_1\cup I_3}$
. Indeed, let us show that each variable
$\overline {a}_{i_t}^{(r)}$
is free from
$\left (\overline {a}_{i_j}^{(r)}\right )_{j \in I_1\cup I_3}$
, for all
$t \in I_2$
. Consider
$t'$
its matching symbol. First, if
$t' \in I_2$
, the fact that
$(a_k)_{k \in \mathbb {N}}$
and
$(\tilde {a}_k)_{k \in \mathbb {N}}$
are free identically distributed collections implies that
$\overline {a}_{i_t}^{(r)}$
(and
$\overline {a}_{i_{t'}}^{(r)}$
) is free from
$\left (\overline {a}_{i_j}^{(r)}\right )_{j \in I_1\cup I_3}$
. If
$t' \in I_1\cup I_3$
, Case (2) implies that
$\overline {a}_{i_t}^{(r)}$
is free from
$\overline {a}_{i_{t'}}^{(r)}$
and then again
$\overline {a}_{i_t}^{(r)}$
is free from
$\left (\overline {a}_{i_j}^{(r)}\right )_{j \in I_1\cup I_3}$
.
In summary, by freeness, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu125.png?pub-status=live)
Therefore
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu126.png?pub-status=live)
Following the same reasoning, it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu127.png?pub-status=live)
Combining the above relations in T, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu128.png?pub-status=live)
It remains to note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu129.png?pub-status=live)
to finish the proof.
Lemma 5.6 (Case
$\theta _2=1$
)
Let
$p \ge 4$
be an even integer,
$\pi \in P_2^{\operatorname {con}}(p)$
. Let
$V_1,\ldots ,V_k \in \pi $
be blocks,
$w \in \{0,1\}^k$
be a coloring of
$V_1,\ldots ,V_k$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu130.png?pub-status=live)
Let
$V=\{v_1<v_2\} \in \pi \setminus \{V_1,\ldots ,V_{k}\}$
and the joint law
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu131.png?pub-status=live)
If
$\theta _2=1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu132.png?pub-status=live)
Proof We must prove that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu133.png?pub-status=live)
As
$\theta _2=1$
, we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu134.png?pub-status=live)
where
$a:=a_{i_{v_1}}$
. We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn15.png?pub-status=live)
We write again
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu135.png?pub-status=live)
Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu136.png?pub-status=live)
where h is defined in (12). We use Lemmas 2.1 and 4.1 to compute
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu137.png?pub-status=live)
Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu138.png?pub-status=live)
Both terms already appeared in the proof of Lemma 5.5. The second term cancels out with
$\frac {\lambda ^4}{\delta ^2}\tau \otimes \tau \left (\pi \setminus \{V_1,\ldots , V_k,V\}, V_1^{(w_1)},\ldots , V_k^{(w_k)}\right )$
in (15), and the contribution of the first is equal to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu139.png?pub-status=live)
We then have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu140.png?pub-status=live)
and the result follows by the definition of q.
The case
$\theta _3=1$
is symmetric to the case
$\theta _2=1$
in Lemma 5.6, and we omit the proof.
Lemma 5.7 (Case
$\theta _3=1$
)
Let
$p \ge 4$
be an even integer,
$\pi \in P_2^{\operatorname {con}}(p)$
. Let
$V_1,\ldots ,V_k \in \pi $
be blocks,
$w \in \{0,1\}^k$
be a coloring of
$V_1,\ldots ,V_k$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu141.png?pub-status=live)
Let
$V=\{v_1<v_2\} \in \pi \setminus \{V_1,\ldots ,V_{k}\}$
and the joint law
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu142.png?pub-status=live)
If
$\theta _3=1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu143.png?pub-status=live)
Finally, the case
$\theta _4=1$
has a null contribution.
Lemma 5.8 (Case
$\theta _4=1$
)
Let
$p \ge 4$
be an even integer,
$\pi \in P_2^{\operatorname {con}}(p)$
. Let
$V_1,\ldots ,V_k \in \pi $
be blocks,
$w \in \{0,1\}^k$
be a coloring of
$V_1,\ldots ,V_k$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu144.png?pub-status=live)
Let
$V=\{v_1<v_2\} \in \pi \setminus \{V_1,\ldots ,V_{k}\}$
and the joint law
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu145.png?pub-status=live)
If
$\theta _4=1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu146.png?pub-status=live)
Proof Similarly to the previous proofs, we must show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu147.png?pub-status=live)
As
$\theta _4=1$
, we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu148.png?pub-status=live)
where
$a:=a_{i_{v_1}}$
. First note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu149.png?pub-status=live)
Applying Lemma 4.1 to both tensors, we get that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu150.png?pub-status=live)
The result follows by recalling that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu151.png?pub-status=live)
Proof of Proposition 5.4
Let
$\pi \notin P_2^{\operatorname {bicon}}(p)$
, and let
$2l^*+1$
be the length of the smallest odd cycle in the intersection graph of
$\pi $
. We denote
$V_1,\ldots , V_{2l^*+1} \in \pi $
(any) ordered sequence of blocks in this smallest odd cycle, where
$V_{j}$
crosses
$V_{j+1}$
for each
$j=1,\ldots ,2l^*+1$
and
$V_{2l^*+2}:=V_1$
. We first remove the first block
$V_1$
, and by Lemma 5.5 we get that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu152.png?pub-status=live)
However, as it is the first block we remove, the distribution of
$B_0=(b_{i_j})_{j \in [p]}$
is symmetric in both legs. In particular, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu153.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu154.png?pub-status=live)
Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu155.png?pub-status=live)
We then fix the color of
$V_1$
to be
$w_1=0$
. We aim to show by induction that the colors
$w_1,w_2,\ldots ,w_{2l^*}$
of
$V_1,\ldots ,V_{2l^*}$
are deterministic and alternating,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu156.png?pub-status=live)
and so is
$\theta ^{(k+1)}:=\theta \left (V_k,V_1^{(w_1)},\ldots ,V_{k}^{(w_{k})}\right )$
for
$1 \le k \le 2l^*$
in the sense that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu157.png?pub-status=live)
First, as
$V_2$
crosses
$V_1$
and
$w_1=0$
, we have
$\theta ^{(2)}_2=1$
. By Lemma 5.6, we have
$w_2=1$
. Suppose then that the result holds for some
$1 < k < 2l^*$
. Let us prove that it also holds for
$k+1$
. To simplify the reading, let us divide into two cases whether k is even or odd.
Case k is even. The induction hypothesis implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu158.png?pub-status=live)
Since
$V_{k+1}$
crosses
$V_k$
, we automatically have that
$\theta ^{(k+1)}_1=0$
. Moreover, as
$w_k=1$
, the definition of
$\theta $
implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu159.png?pub-status=live)
Hence either
$\theta ^{(k+1)}_4=1$
or
$\theta ^{(k+1)}_3=1$
. Now consider all blocks
$V_{j_t}$
that might potentially cross
$V_{k+1}$
, for
$j_t\le k$
. Since
$2l^*+1$
is the length of the smallest odd cycle, the cycles
$(V_{j_t},\ldots , V_{k}, V_{k+1})$
are of even length. By a parity check,
$j_t$
must be even, and hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu160.png?pub-status=live)
This implies that all crossing blocks
$V_{j_t}$
of
$V_{k+1}$
for
$j_t \le k$
have the same color
$w_{j_t}=1$
. In particular, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu161.png?pub-status=live)
We then apply Lemma 5.7 to get that
$w_{k+1}=0$
.
Case k is odd. This follows similarly to the even case. We first have that
$\theta ^{(k+1)}_1=0$
and as
$w_{k}=0$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu162.png?pub-status=live)
By the parity check on the even cycles
$V_{k+1}$
might belong to, all crossing blocks
$V_{j_t}$
of
$V_{k+1}$
for
$j_t \le k$
have the same color
$w_{j_t}=0$
. Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu163.png?pub-status=live)
and Lemma 5.6 implies that
$w_{k+1}=1$
. This finishes the induction.
To conclude the proof, the block
$V_{2l^*+1}$
crosses both
$V_1$
of color
$w_1=0$
and
$V_{2l^*}$
of color
$w_{2l^*}=1$
. Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu164.png?pub-status=live)
Lemma 5.8 applied to
$V=V_{2l^*+1}$
implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu165.png?pub-status=live)
Applying Lemma 5.6 for blocks
$V=V_k$
when k is even and Lemma 5.7 for
$V=V_k$
when k is odd, we get that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu166.png?pub-status=live)
Therefore, for all
$\pi \notin P_2^{\operatorname {bicon}}(p)$
, we have
$\tau \otimes \tau (\pi )=0$
. This proves the first part of the proposition.
Assume now that
$\pi \in P_2^{\operatorname {bicon}}(p)$
. Let
$V_1,\ldots ,V_{p/2}$
be an ordering of the blocks of
$\pi $
such that
$V_k$
crosses at least one
$V_j$
for
$j<k$
and all k. This can always be done as
$\pi $
is connected. Let
$\mathcal {V}_1,\mathcal {V}_2$
be the bipartite sets of vertices of the intersection graph of
$\pi $
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu167.png?pub-status=live)
Since
$\pi $
is bipartite, if
$V_k \in \mathcal {V}_1$
, all crossing blocks
$V_j$
of
$V_k$
belong to
$\mathcal {V}_2$
, and similarly if
$V_k \in \mathcal {V}_2$
. We assume again that the color of
$V_1$
is
$w_1=0$
, since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu168.png?pub-status=live)
We will prove that both the color
$w_k$
and the binary vector
$\theta ^{(k)}$
of
$V_k$
depend only on which bipartite set
$V_k$
belongs to, namely, for all
$k \ge 2$
, the following hold.
-
(1) If
$V_k \in \mathcal {V}_1$ , then
$w_k=0$ and
$\theta ^{(k)}_{3}=1$ ;
-
(2) Otherwise,
$V_k \in \mathcal {V}_2$ ,
$w_k=1$ and
$\theta ^{(k)}_2=1$ .
Indeed, note first that
$V_2 \in \mathcal {V}_2$
,
$\theta ^{(2)}_2=1$
as it crosses
$V_1$
and
$w_1=0$
. Then, Lemma 5.6 implies that
$w_2=1$
. Assume then that the result holds for some l and for all
$1 \le k \le l$
. Let us prove that it holds for
$V_{l+1}$
as well. Indeed, assume without loss of generality that
$V_{l+1} \in \mathcal {V}_1$
. Then
$V_{l+1}$
only crosses blocks
$V_{j_t}$
such that
$V_{j_t} \in \mathcal {V}_2$
, for
$j_t \le l$
. Since all colors
$w_{j_t}=1$
, we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu169.png?pub-status=live)
Then, Lemma 5.7 implies that
$w_{l+1}=0$
and induction is proved. We then apply Lemma 5.5 for
$V_1$
, Lemma 5.6 for all blocks
$V_k \in \mathcal {V}_2$
and Lemma 5.7 for all blocks
$V_k \in \mathcal {V}_1$
for
$k \ge 2$
, so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu170.png?pub-status=live)
It follows then that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu171.png?pub-status=live)
and the result is proved.
5.4 Proof of Theorem 1.1
We are now ready to prove the main theorem. Recall that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu172.png?pub-status=live)
where the second summation runs over
$(\hat {\pi },(\pi _T)_{T \in \hat {\pi }})\in \Phi (P_2(p))$
, using the bijection
$\Phi $
defined in (4). Note that if
$|T|=2$
, then by Corollary 5.2 we have
$\tau \otimes \tau (\pi _T)=1$
. Therefore, we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu173.png?pub-status=live)
Using Proposition 5.4, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu174.png?pub-status=live)
where the second summation runs over bipartite connected pair partitions
$\pi _T$
, for
$T \in \hat {\pi }$
. Finally, note that the number of size-two blocks is precisely
$\mathbf {ncr}(\pi )$
and thus
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu175.png?pub-status=live)
Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu176.png?pub-status=live)
using again the bijection
$\Phi $
, we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu177.png?pub-status=live)
This finishes the proof in view of Proposition 3.3 and of the fact that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu178.png?pub-status=live)
6 Alternative proof
In this section, we provide a short alternative proof of Theorem 1.1. Let us denote
$a_k^\circ =a_k-\lambda $
the centering of
$a_k$
. Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu179.png?pub-status=live)
In particular, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn16.png?pub-status=live)
Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn17.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn18.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn19.png?pub-status=live)
Then, we deduce by (16) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu180.png?pub-status=live)
The following lemma computes the limiting law of
$S_n^{(i)}$
.
Lemma 6.1 Let
$a,a_1,\ldots ,a_n$
be free identically distributed random variables with mean
$\lambda =\tau (a)$
and variance
$\sigma ^2=\operatorname {var}(a)$
. Let
$S_n^{(i)}$
as in (17) for
$i=1,2,3$
. Then, the following hold.
-
(1)
$S_n^{(1)}$ converges to a semi-circle random variable with variance
$\sigma ^4$ .
-
(2)
$S_n^{(2)}$ converges to a semi-circle random variable with variance
$\sigma ^2$ .
-
(3)
$S_n^{(3)}$ converges to a semi-circle random variable with variance
$\sigma ^2$ .
Proof Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu181.png?pub-status=live)
We first note that for any
$p \ge 1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu182.png?pub-status=live)
Hence, Voiculescu’s Free Central Limit Theorem implies that
$S_n^{(i)}/\sigma $
converges to a standard semi-circle random variable
$s_i$
, for
$i=2,3$
. Secondly, note that
$(a_k^{(1)})_k$
are exchangeable and centered. It also follows immediately by the tensor structure that the centering condition
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu183.png?pub-status=live)
holds whenever there exists an index
$i_k$
different from the others. We can then apply [Reference Bożejko and Speicher3, Theorem 0] to get that
$S_n^{(1)}$
converges and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu184.png?pub-status=live)
where
$\ker i=\pi $
. Now, by Voiculescu’s Free Central Limit Theorem, we get that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu185.png?pub-status=live)
We then get that
$S_n^{(1)}/\sigma ^2$
converges to a standard semi-circle law
$s_1$
.
Now, we prove that the tuple
$(S_n^{(1)},S_n^{(2)},S_n^{(3)})$
converges in distribution.
Lemma 6.2 Let
$a,a_1,\ldots ,a_n$
be free identically distributed random variables with mean
$\lambda =\tau (a)$
and variance
$\sigma ^2=\operatorname {var}(a)$
. Let
$S_n^{(i)}$
as in (17) for
$i=1,2,3$
. Then the tuple
$(S_n^{(1)},S_n^{(2)},S_n^{(3)})$
converges in distribution.
Proof We must prove that for any
$i \in \{1,2,3\}^p$
, the limit of
$\tau \otimes \tau \left (S_n^{(i_1)}\ldots S_n^{(i_p)}\right )$
exists when n goes to infinity. We write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu186.png?pub-status=live)
We can as usual decompose the summation according to
$\ker u \in P(p)$
, hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu187.png?pub-status=live)
We note that
$\tau \otimes \tau (a_{u_1}^{(i_1)}\ldots a_{u_p}^{(i_p)})$
only depends on
$\pi $
and i. Let us denote this value by
$\tau \otimes \tau (\pi , i)$
. We then have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu188.png?pub-status=live)
It is immediate to check that if
$V=\{v\}\in \pi $
has a block of size one, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu189.png?pub-status=live)
Moreover, if there exists
$V\in \pi $
with
$|V| \ge 3$
, its contribution is going to zero. We deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqn20.png?pub-status=live)
and the proof is finished.
Therefore, Lemmas 6.1 and 6.2 imply that the tuple
$(S_n^{(1)},S_n^{(2)},S_n^{(3)})$
converges in distribution to
$(\sigma ^2s_1,\sigma s_2,\sigma s_3)$
. The following final lemma allows us to understand the joint law of
$(s_1,s_2,s_3)$
.
Lemma 6.3 Let
$a,a_1,\ldots ,a_n$
be free identically distributed random variables with mean
$\lambda =\tau (a)$
and variance
$\sigma ^2=\operatorname {var}(a)$
. Let
$S_n^{(i)}$
as in (17) for
$i=1,2,3$
. Let
$(\sigma ^2s_1,\sigma s_2,\sigma s_3)$
be their joint limiting law. Then, the following holds.
-
(1) The variables
$s_2,s_3$ are classical independent.
-
(2)
$s_1$ is free from both
$s_2$ and
$s_3$ .
Proof By definition, we note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu190.png?pub-status=live)
Hence,
$S_n^{(2)}$
and
$S_n^{(3)}$
are classical independent and commute as the trace factorizes, i.e.,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu191.png?pub-status=live)
This implies that
$s_2$
and
$s_3$
are classical independent. Let us prove now that
$s_1$
is free from
$s_2$
. By definition, we need to show that for any
$i_1\ne i_2 \ne \ldots \ne i_p$
in
$\{1,2\}$
, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu192.png?pub-status=live)
By (18), we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu193.png?pub-status=live)
where
$\ker u=\pi $
. Therefore, it suffices to prove that for any pair partition
$\pi \in P_2(p)$
, any alternating sequence
$i_1 \ne i_2 \ne \ldots \ne i_p$
in
$\{1,2\}$
and any
$u\in [n]^p$
such that
$\ker u=\pi $
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu194.png?pub-status=live)
To this end, we can assume by cyclicity that
$i_1=i_3=\ldots =i_{p-1}=1$
and
$i_2=i_4=\ldots =i_p=2$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu195.png?pub-status=live)
As
$\pi \in P_2(p)$
and
$\ker u=\pi $
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu196.png?pub-status=live)
However, suppose
$\pi \in NC_2(p)$
. Then, there exists an interval block
$\{j,j+1\}\in \pi $
. Let us suppose without loss of generality that j is odd (otherwise, take
$j+1$
instead). We then have
$u_j=u_{j+1} \ne u_{l}$
for all
$l \notin \{j,j+1\}$
. But then
$a_{u_j}$
is free independent from
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu197.png?pub-status=live)
Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu198.png?pub-status=live)
Therefore, for all
$\pi \in P_2(p)$
and
$u\in [n]^p$
such that
$\ker u=\pi $
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu199.png?pub-status=live)
and it follows that
$s_1$
is free from
$s_2$
. By symmetry, it is also free from
$s_3$
and the result follows.
We can now conclude the alternative proof of Theorem 1.1.
Proof of Theorem 1.1
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu200.png?pub-status=live)
Moreover, Lemmas 6.1 and 6.2 imply that
$(S_n^{(1)},S_n^{(2)},S_n^{(3)})$
converges in distribution to
$(\sigma ^2 s_1,\sigma s_2,\sigma s_3)$
, where each
$s_i$
is a standard semi-circle random variable. Finally, Lemma 6.3 implies that
$s_1$
is free from
$(s_2,s_3)$
, and
$s_2$
is classical independent from
$s_3$
. Then,
$S_n$
converges in distribution
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu201.png?pub-status=live)
The definition of q and symmetry of
$s_2,s_3$
imply that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121072344405-0120:S0008414X24001147:S0008414X24001147_eqnu202.png?pub-status=live)
This finishes the proof.
Acknowledgments
The last named author would like to thank Guillaume Cébron and Roland Speicher for helpful discussions. The second named author also thanks Philippe Biane for useful discussions. We thank the anonymous reviewer for generously communicating the alternative proof.