A Combinatorial Approach to the Opposite Bi-Free Partial $S$-Transform
Paul Skoufranis

TL;DR
This paper introduces a combinatorial method for the opposite bi-free partial $S$-transform, extending it to conditional and operator-valued bi-free contexts, advancing the mathematical understanding of bi-free probability.
Contribution
It presents a novel combinatorial approach to the opposite bi-free partial $S$-transform and extends it to new settings such as conditional and operator-valued bi-free frameworks.
Findings
Developed a combinatorial framework for the opposite bi-free partial $S$-transform.
Extended the transform to conditional bi-free probability.
Extended the transform to operator-valued bi-free probability.
Abstract
In this paper, we present a combinatorial approach to the opposite 2-variable bi-free partial -transforms where the opposite multiplication is used on the right. In addition, extensions of this partial -transforms to the conditional bi-free and operator-valued bi-free settings are discussed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A Combinatorial Approach to the
Opposite Bi-Free Partial -Transform
Paul Skoufranis
Department of Mathematics and Statistics, York University, 4700 Keele Street, Toronto, Ontario, M3J 1P3, Canada
Abstract.
In this paper, we present a combinatorial approach to the opposite 2-variable bi-free partial -transforms where the opposite multiplication is used on the right. In addition, extensions of this partial -transforms to the conditional bi-free and operator-valued bi-free settings are discussed.
Key words and phrases:
Bi-Free Probability, Partial Bi-Free -Transform, Bi-Free Convolutions
2010 Mathematics Subject Classification:
46L54, 46L53
1. Introduction
Since [V1986, V1987] the use of analytic functions as transformations has been a vital part of free probability. With the inception of bi-free probability by Voiculescu in [V2014] it has been natural to ask whether extensions of past results hold and can be used to develop new theories. Using analytic techniques similar to those from [H1997], Voiculescu in [V2016-1, V2016-2] developed bi-free partial - and -transforms to study additive and multiplicative bi-free convolution of bi-partite systems. Furthermore, due to the combinatorial breakthroughs in [CNS2015-1, CNS2015-2], the author of this paper was able to develop new proofs to these results in [S2016-1, S2016-2] using the combinatorics of cumulants. These alternative proofs were essential in extending the bi-free partial -transform to the conditional bi-free setting in [GS2016-1, GS2016-2] and extending both transformations to the operator-valued bi-free setting in [S2016-3]. The bi-free partial transforms developed in these papers were instrumental in developing bi-free infinite divisibility theorems such as those in [GHM2015, HW2016, GS2016-1].
However, one important question remained with respect to the bi-free partial -transform. Given a non-commutative probability space and elements with , in [V2016-2, S2016-1] a holomorphic function defined on a neighbourhood of was constructed. The important property of was that if and are pairs in with non-zero moments that are bi-free with respect to , then
[TABLE]
that is, the product of the bi-free partial -transforms of and is the bi-free partial -transform of the natural product of and . As it was demonstrated in [CNS2015-2]*Theorem 5.2.1 that the use of the opposite multiplication on the right-hand component of the pairs leads to combinatorial structures similar to those in free probability (see Subsection 3.2), it was natural to ask whether there was an opposite bi-free partial -transform; that is a holomorphic function defined on a neighbourhood of such that if and are pairs in with non-zero moments that are bi-free with respect to , then
[TABLE]
At the time of [S2016-1], the author endeavoured to solve this problem. Using similar combinatorial techniques to those in [S2016-1] that are slightly more intricate due to a recursive nature, Lemma 4.1 of this paper was obtainable. The remaining gap to obtaining an with the desired properties was rearranging the expression in Lemma 4.1 in the appropriate manner and this remained elusive.
In [HW2017], a deeper study of bi-free partial -transforms was performed from an analytical standpoint. In particular, in order to develop a theory of bi-free multiplicative infinite divisibility, a formula for the opposite bi-free partial -transform was required and discovered. Consequently, due to the expression in [HW2017], it is now possible to complete the combinatorial approach started in [S2016-1].
This paper contains four sections excluding this introduction, which are structured as follow. In Section 2 we recall the necessary transformations from free and bi-free probability necessary in this paper. In particular Proposition 2.5 demonstrates an alternative expression for than that which was given in [HW2017]. The paper continues by recalling the necessary combinatorial tools in Section 3 and proving equation (1) in Section 4.
As the main uses of the combinatorial proofs of the bi-free partial transforms thus far has been the extension of these transformations to the operator-valued bi-free and conditional bi-free settings, we conclude this paper with Section 5 analyzing whether the results of this paper extend to these settings. Unfortunately, the answers appear to be negative.
2. The Transforms
In this section, we recall several transformations in free and bi-free probability and set the notation for the paper, which is consistent with the notation in [V2016-2, S2016-1].
2.1. Free Transforms
Let be a non-commutative probability space (that is, a unital algebra with a linear functional such that ). We will always assume that is a Banach algebra with norm and is a continuous linear function. These assumptions are made so that the power series defined in this paper converge absolutely and define holomorphic functions.
Fix . Recall the moment series of is defined to be
[TABLE]
and, if denotes the free cumulant of , the cumulant series of is
[TABLE]
Remark 2.1**.**
We momentarily pause to discuss the convergence of the above series. Notice for all that
[TABLE]
Hence, provided , we see that converges absolutely.
The moment-cumulant formula will immediately imply that converges absolutely if is sufficiently small. To see this, let denote the set of non-crossing partitions on elements, let denote the full partition , and let denote the Möbius function on the set of non-crossing partitions. Then for each , is a sum of at most terms of the form for some times a product of moments of each of which is bounded in absolute value by . Due to the lattice structure, is at most . Since is the Catalan number and since , converges absolutely if is sufficiently small.
To define the -transform of , we illustrate two possible methods. For both we must assume . For the first, let . Since and , has an inverse under composition, denoted (see [D2006] for analytic arguments). We define so that
[TABLE]
The -transform of can then defined by [V1987] to be
[TABLE]
For the second, notice since and , has an inverse under composition, denoted . The -transformation of can also be defined by [NS1997] to be
[TABLE]
2.2. Bi-Freeness
For more background on scalar-valued bi-free probability, we refer the reader to the summary in [CNS2015-2]*Section 2.
For a map , the set of bi-non-crossing partitions on associated to is denoted by and is used to denote the full partition. Given two elements , we will use to denote the smallest element of that is larger than both and under the usual ordering of refinement.
Given a non-commutative probability space and elements , the -cumulant associated to a map is denoted . Given a , each block of corresponds to the bi-non-crossing partition for some (where the ordering on is induced from ). We denote
[TABLE]
where denotes the -tuple where indices not in are removed.
For , we will only ever consider the maps such that if and if . For notation purposes, it will be useful to think of as a map on under the identification if and if . Furthermore, we denote for , for , and, for , for . In the case that and , we will use to denote for all . Consequently, for , we have , , and .
2.3. Bi-Free Series
Given a Banach non-commutative probability space and a pair of elements in , we define the ordered joint moment and cumulant series of the pair to be
[TABLE]
respectively (where ). Note and are not sufficient to describe all joint moments of and unless and commute.
Remark 2.2**.**
We momentarily pause again to discuss the convergence of the above series. Notice for all that
[TABLE]
Hence, provided and , we see that converges absolutely. As the combinatorics of bi-non-crossing partitions is identical to that of non-crossing partitions up to a permutation, similar arguments to those in Remark 2.1 implies that converges if and are sufficiently small.
Note [S2016-2]*Theorem 7.2.4 demonstrates that
[TABLE]
through combinatorial techniques. In addition, for notational purposes it will be helpful to consider the series
[TABLE]
2.4. Bi-Free Partial -Transforms
Finally, with the above notation, we can define the bi-free partial -transform and the opposite bi-free partial -transform.
Definition 2.3** ([V2016-2]*Definition 2.1, [S2016-1]*Proposition 4.2).**
Let be a two-faced pair in a non-commutative probability space with and . The -variable partial bi-free -transform of is the holomorphic function on near defined by
[TABLE]
Definition 2.4** ([HW2017]*Definition 2.7).**
Let be a two-faced pair in a Banach non-commutative probability space with and . The opposite -variable partial bi-free -transform of is the holomorphic function on near defined by
[TABLE]
Note equation (7) written slightly differently than in [HW2017]*Definition 2.7 but is the same formula. However, we desire an alternative formula along the lines of [S2016-1]*Proposition 4.2. To simplify discussions, we will demonstrate the equality in the case . See Remark 2.6 for why we can do this.
Proposition 2.5**.**
If is a two-faced pair in a Banach non-commutative probability space with , then as holomorphic functions on near ,
[TABLE]
Proof.
First note that the two expression for in equation (8) are equal by equation (4). Furthermore, these expressions are well defined. Indeed, as , if are sufficiently near then and and thus and are well-defined and for sufficiently small .
When is sufficiently near ), is near and thus is near 1 and invertible. Hence we obtain from equation (7) that
[TABLE]
Using equations (2, 3, 4, 5), we obtain that
[TABLE]
Therefore, using equations (6), we obtain that
[TABLE]
Remark 2.6**.**
One might be concerned that we have restricted to the case . However, if we use equation (8) as the definition of the opposite bi-free partial -transform and if , then . Indeed so and similarly . Therefore, since , we see that
[TABLE]
Thus there is no loss in assuming .
Remark 2.7**.**
Note Proposition 2.5 easily describes the bi-free partial -transform when and are independent; that is, when for all . Indeed, in this setting for all (see [S2016-2]*Section 3.2). Hence so . This agrees with the value of when and are independent (see [V2016-2]*Proposition 4.2 or [S2016-1]*Remark 4.4).
Remark 2.8**.**
It is also curious to note that is well defined and would be an equivalent definition of the opposite bi-free partial -transform. Moreover, and behave very differently with respect to interchanging and . Indeed it is elementary to see that
[TABLE]
Of course our goal is to prove the following desired property for using techniques similar to [S2016-1]*Theorem 4.5.
Theorem 2.9** ([HW2017]*Proposition 2.8).**
Let and be bi-free two-faced pairs in a Banach non-commutative probability space with and . Then
[TABLE]
on near .
3. The Tools
Before we can prove Theorem 2.9, we require some technical tools that are used in the proof.
3.1. Multiplicative Functions and Convolutions
Recall denotes the lattice of non-crossing partitions on with its usual reverse refinement order. Let to denote the minimal element of and let to denote the maximal element of as before. For with , the interval between and , denoted , is the set
[TABLE]
The incidence algebra of non-crossing partitions, denoted , is the algebra of all functions
[TABLE]
such that unless , equipped with pointwise addition and a convolution product defined by
[TABLE]
A procedure described in [S1994] demonstrates a method for decomposing each interval into a product of full partitions of the form
[TABLE]
where . Consequently, there are special elements of the incidence algebra. Recall is called multiplicative if whenever has a canonical decomposition , then
[TABLE]
Thus the value of a multiplicative function on any pair of non-crossing partitions is completely determined by the values of on full non-crossing partition lattices. We will denote the set of all multiplicative functions by and the set all multiplicative functions with by . If , one can verify that . Furthermore, there is a nicer expression for convolution of multiplicative functions. Given a non-crossing partition , the Kreweras complement of , denoted , is the non-crossing partition on with non-crossing diagram obtained by drawing via the standard non-crossing diagram on , placing nodes with directly to the right of , and drawing the largest non-crossing partition on that does not intersect , which is then . The following diagram exhibits that if , then .
[TABLE]
For , the convolution may be written as
[TABLE]
Note [NS1997] demonstrated that if are free and if is the multiplicative function associated to the cumulants of defined by , then . Furthermore, for with blocks , .
We will need another convolution product on from [NS1997]. Let denote all non-crossing partitions on such that is a block in . It is not difficult to construct an natural isomorphism between and . The following diagrams illustrate all elements , together with their Kreweras complements.
[TABLE]
[TABLE]
Notice if and is the non-crossing partition on (with the ordering being the order of listing) with blocks for all , then the only non-crossing partition on such that is non-crossing (under the ordering ) and is . Indeed this result can be shown by induction.
For the pinched-convolution of and , denoted , is the unique element of such that
[TABLE]
The pinched-convolution product is not commutative on .
Given an element , we define the formal power series
[TABLE]
Note if is the multiplicative function associated to the cumulants of defined by , then . Several formulae involving are developed in [NS1997]. In particular, [NS1997]*Proposition 2.3 demonstrates that if then and thus
[TABLE]
Furthermore, [NS1997]*Theorem 1.6 demonstrates that
[TABLE]
Note that equation (4) is an immediate consequence of equation (10) when .
3.2. Bi-Free Kreweras Complements
The one additional technicality required revolves around the Kreweras complement for bi-non-crossing partitions described in [CNS2015-2]. To begin, recall if is such that
[TABLE]
there is a corresponding permutation on defined by . Consequently, if and only if (the partition obtained by applying to each element of each block) is non-crossing on .
Definition 3.1**.**
For all , , and , the Kreweras complement of , denoted , is the element of obtained by applying to the Kreweras complement in of ; that is, .
Remark 3.2**.**
Note that may be obtained by taking the diagram corresponding to , placing a node beneath each left node and above each right node of , and drawing the largest bi-non-crossing diagram on the new nodes. Indeed the following diagrams illustrate this procedure.
[TABLE]
Furthermore, given a , the above demonstrates a natural way to view the pair as an element of . Indeed if one applies the map
[TABLE]
to the blocks in and the map
[TABLE]
to the blocks in , then is an element of . Note an element can be obtain in this fashion if and only if where
[TABLE]
and contains no blocks with a and a for any , , and , no blocks with a and a for any and , and no blocks with a and a for any and .
The reason Kreweras complements of bi-non-crossing partitions are essential in this paper is the following.
Theorem 3.3** ([CNS2015-2]*Theorem 5.2.1).**
Let and be bi-free two-faced pairs in a non-commutative probability space . Then for all
[TABLE]
4. The Proof
To simplify the proof of Theorem 2.9, we will assume via Remark 2.6 that . Note by freeness of the left algebras and of the right algebras in bi-free pairs. Furthermore, we will let (respectively ) denote the multiplicative function associated to the cumulants of (respectively ) defined by (respectively ). Recall if (respectively ) is the multiplicative function associated to the cumulants of (respectively ), then (respectively ). Thus , , , and . Note that by assumptions.
The majority of the proof of Theorem 2.9 is to show the following.
Lemma 4.1**.**
Let and be bi-free two-faced pairs in a non-commutative probability space with and . Then, on near ,
[TABLE]
where
[TABLE]
Again note the expression in equation (11) is well defined as if are near then is well defined and near 1.
To begin the proof of Lemma 4.1, recall
[TABLE]
Therefore, since and are bi-free, Theorem 3.3 implies that
[TABLE]
It is necessary to analyze and decompose the pair .
Given a , we will view the pair as an element of as in Remark 3.2. Under this view, there are two possible cases: the block of containing contains a for some , or the block of containing contains a for some . Indeed if the block of containing does not contain a for some and is the largest integer such that the block of containing also contains , then by the properties of the Kreweras complement the block of containing contains . Consequently, if
[TABLE]
then is the disjoint union of and .
In order to discuss and decompose elements of and , it is necessary to discuss other bi-non-crossing partitions. Given , let denote the element of with blocks and let denote the element of with blocks . Then, for all let
[TABLE]
As will be seen in the proofs which follow, elements of are the ‘bottoms’ of elements of and elements of are the ‘bottoms’ of elements of .
Using these bi-non-crossing partitions, we define the following transformations:
[TABLE]
Notice that each of the above is a well-defined holomorphic function near and that
[TABLE]
by construction. Thus to understand we must understand and . The reason we must consider and are the following.
Lemma 4.2**.**
Under the above notation and assumptions,
[TABLE]
as holomorphic functions near .
Proof.
First observe that dividing by is valid (e.g. see the end of the proof for how this division term occurs). Furthermore all terms involved in proof involve absolutely summable series and thus can be rearranged in any order we desired.
For now fix and a . View as an element of as in Remark 3.2. Below is two diagrams of such a with and . The left diagram illustrates how the bi-non-crossing partition is the union of and via shading. The diagram on the right highlights portions of the diagram used in the proof. Note two nodes are connected to each other with a solid line if and only if lie in the same block of . Furthermore, due to properties of the Kreweras complement, one must be able travel from any one node to any another using a combination of solid and dotted lines. Note we really should draw all of the left nodes above all of the right notes, but we do not do so in order to save space.
[TABLE]
As , the block of that contain contains a for some . Furthermore, due to the properties of the Kreweras complement, there exist , , and such that
[TABLE]
Note that divides the remaining nodes into regions on the left, regions on the right (including the one with ), and one region at the bottom.
For each let where . Note that . For each (if any such exist) let denote the non-crossing partition obtained by restricting to . We omitted the case as belongs to the bottom region. Notice for that if is obtained from by adding the singleton block , then is naturally an element of . The below diagram demonstrates an example of this restriction.
[TABLE]
Similarly, for each let , where and . Note that . For each let denote the non-crossing partition obtained by restricting to . We omitted the case as belongs to the bottom region. Notice for that if is obtained from by adding the singleton block , then is naturally an element of .
Finally let denote the restriction of to . Then is easily seen to be an element of .
Now, by writing each of and as a product of cumulants, we obtain that
[TABLE]
Consequently, summing over all such that if is the element of corresponding to via Remark 3.2 then and , we obtain
[TABLE]
Finally, if we sum over all possible and all possible , we will be summing over all possible , all for all , all for all , all , and all possible . Therefore we obtain
[TABLE]
where we needed divide by due to the occurrence of instead of in the product. ∎
Lemma 4.3**.**
Under the above notation and assumptions,
[TABLE]
as holomorphic functions near .
Proof.
The proof of this result can be obtained by applying a mirror to the proof of Lemma 4.2. ∎
To understand and we demonstrate the following.
Lemma 4.4**.**
Under the above notation and assumptions,
[TABLE]
as holomorphic functions near .
Proof.
First observe that dividing by is valid (e.g. see the end of the proof for how this division term occurs). Furthermore all terms involved in proof involve absolutely summable series and thus can be rearranged in any order we desired.
First observe for all that . Therefore, summing over all and elements of in directly yields as . Thus we focus on the elements of with .
For now fix , , and a . Let denote the block of containing . Note that in order for , it must be the case that contains . Furthermore there must exists , , and such that
[TABLE]
Note that divides the remaining nodes into regions on the left, regions on the right, and one region at the bottom. Below is a diagram of such a with the same conventions as in Lemma 4.2 where and .
[TABLE]
For each let where . Note that . For each (if any such exist) let denote the non-crossing partition obtained by restricting to . We omitted the case as (which only exists if or, equivalently, ) belongs to the bottom region. Notice for that if is obtained from by adding the singleton block , then is naturally an element of .
Similarly, for each let , where . Note that . For each let denote the non-crossing partition obtained by restricting to . We omitted the case as belongs to the bottom region. Notice for that if is obtained from by adding the singleton block , then is naturally an element of .
Finally let denote the restriction of to . Then is easily seen to be an element of .
Now, by writing
[TABLE]
as a product of cumulants, we obtain
[TABLE]
where the extra occurs as . Consequently, by summing over all such that and , we obtain
[TABLE]
Finally, if we sum over all possible , , and all possible , we will be summing over all possible , all for all , all for all , and all possible . Therefore we obtain
[TABLE]
where we needed divide by due to the occurrence of and instead of and in the products. ∎
Lemma 4.5**.**
Under the above notation and assumptions,
[TABLE]
as holomorphic functions near .
Proof.
The proof of this result can be obtained by applying a mirror to the proof of Lemma 4.4. ∎
The above equations are enough now complete the proof of Theorem 2.9 via some algebraic operations. To simplify notation, let
[TABLE]
Lemma 4.6**.**
Under the above notation and assumptions,
[TABLE]
as holomorphic functions near .
Proof.
First observe both expressions are valid as holomorphic functions near as the leading coefficient of both and is so is invertible near .
Using Lemmata 4.4 and 4.5 along with equations (9, 10), we obtain that
[TABLE]
and
[TABLE]
Substituting the first equation into the second equation yields
[TABLE]
Rearranging this equation and solving for yields the desired expression. A similar substitution yields the expression for . ∎
The proof of Lemma 4.1 is now a simple computation.
Proof of Lemma 4.1.
First, by Lemmata 4.2 and 4.3 and equations (9, 12) we see that
[TABLE]
By equations (13) and Lemma 4.6, we see that
[TABLE]
More algebraic manipulation (and holomorphic extensions) will yield Theorem 2.9.
Proof of Theorem 2.9.
By multiply the numerator and denominator of the expression in Lemma 4.1 by when are near zero and not equal yields
[TABLE]
However, notice
[TABLE]
Hence, by multiply by the denominator in the expression for , moving all negative terms to the opposite side, adding one to both sides, and factoring, we obtain that
[TABLE]
By dividing both sides by
[TABLE]
and applying holomorphic extensions then yields the result. ∎
5. Other Settings
In this final section, we discuss extensions of the opposite bi-free partial -transform to both the operator-valued bi-free and the conditional bi-free settings.
5.1. Operator-Valued Bi-Free -Transforms
In [S2016-3] the author extended the bi-free partial -transform to the operator-valued bi-free setting. This generalization required a function of three arguments; one for left -operators, one for right -operators, and a central -operator. We briefly recall the results of [S2016-3] here although we refer the reader to [S2016-3] for full definitions.
Definition 5.1** ([S2016-3]*Definition 8.1).**
Let be a Banach --non-commutative probability space. For each let and . Let and be such that and are invertible. For , define
[TABLE]
where denotes the -valued bi-free cumulant.
The operator-valued bi-free partial -transform of is the analytic function defined by
[TABLE]
where
[TABLE]
for any bounded collection of provided and sufficiently small.
Theorem 5.2** ([S2016-3]*Theorem 8.3).**
Let be a Banach --non-commutative probability space, let and be bi-free over with and invertible for all . Then
[TABLE]
for any bounded collection of provided and sufficiently small.
Considering the above, it is natural to ask whether there is an operator-value version of the opposite bi-free partial -transform. However, this does not appear to be the case.
To prove Theorem 5.2 it was possible to extend the proof of [S2016-1]*Theorem 4.5 because the bi-non-crossing diagrams that yielded are encapsulated in those that produced and hence appeared as a term composed in .
For the opposite bi-free partial -transform as proved above, this encapsulation and composition do not take place. In particular, the problem is with Lemmata 4.4, 4.5, and 4.6. Specifically the recursive nature of and is problematic in regards to extending the above proof to the operator-valued setting. If one tries to extend Lemma 4.4 to the operator-valued setting, one obtains an expression for in terms of a composition of with ; that is, a term of the form . Similarly, if one tries to extend Lemma 4.5 to the operator-valued setting, one obtains an expression for in terms of a composition of with ; that is, a term of the form . If one attempts to solve for as in Lemma 4.6, the one obtains that equals an expression involving . Thus one cannot isolate and solve for due to the properties of operator-valued bi-free cumulants and the inability to pull out the -terms in . Even if one views these three variable functions as linear maps from to in the central variable, one only obtains that is an inverse of a rather nasty linear map.
Thus, at least at this time, it appears the -transform is more natural to the operator-valued setting then the opposite bi-free partial -transform.
5.2. Conditional Bi-Free -Transforms
In [GS2016-1, GS2016-2] the study of conditional bi-free and operator-valued conditional bi-free probability was initiated. Using the conditional bi-free cumulants, analogues of the bi-free partial -transforms were constructed in both the scalar and operator-valued conditional bi-free settings and used to discuss additive infinitely divisibility. However, a conditional bi-free partial -transform remains elusive. Here we quickly record what occurs when one tries to repeat the combinatorial proof for the bi-free partial -transform and the opposite bi-free partial -transform in the conditional bi-free setting.
Given a two-state non-commutative probability space and , let
[TABLE]
where denotes the conditional free cumulant of and denotes the -th conditional bi-free cumulant of .
If and are conditionally free in with respect to and have non-zero moments, then [PW2011]*Theorem 3.6 demonstrated that if
[TABLE]
Thus, based on [PW2011], it is natural to consider
[TABLE]
in the bi-free setting.
Suppose and are conditional bi-free pairs in with non-zero moments. If one repeats the arguments of [S2016-1]*Section 4 keeping track of which blocks are internal and which blocks are external, then one obtains by using results from [PW2011] that
[TABLE]
(As a sanity check, note that when the conditional free and bi-free cumulants are equal to the free and bi-free cumulants respectively, and this reduces to the expression obtained in [S2016-1]*Section 4). However, even when combining this with the expression of , it is not clear how to define in order to obtain a product formula seeing as the expression for is not symmetric in and (i.e. if we had and involved , the right-hand side would be symmetric in and ).
If one repeats the arguments of Section 4 keeping track of which blocks are internal and which blocks are external, then one obtains by using results from [PW2011] the conditional bi-free analogue of Lemma 4.1 is
[TABLE]
where
[TABLE]
(As a sanity check, note that when the conditional free and bi-free cumulants are equal to the free and bi-free cumulants respectively, and this reduces to the expression obtained in Lemma 4.1). However, even when combining this with the expression of , it is not clear how to define in order to obtain a product formula seeing as the expression for is not symmetric in and .
Thus, due to the lack of symmetry, conditional bi-free partial -transforms appear difficult. Even in the simplest case of bi-Boolean independence in [GS2017], no product formulae were obtainable.
Acknowledgements
The author would like to thank Yinzheng Gu for informing him of the existence of [HW2017].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[3]
- 3[5]
- 4[7]
- 5[9]
- 6[11]
- 7[13]
- 8[15]
