2017
DOI: 10.1016/j.aam.2016.09.002
|View full text |Cite
|
Sign up to set email alerts
|

⁎-freeness in finite tensor products

Abstract: Abstract. In this paper, we consider the following question and variants thereof: given D := a 1;i ⊗· · ·⊗a K;i : i ∈ I , a collection of elementary tensor non-commutative random variables in the tensor product of probability spaces (when is D * -free? (See Section 1.2 for a precise formulation of this problem.)Settling whether or not freeness occurs in tensor products is a recurring problem in operator algebras, and the following two examples provide a natural motivation for the above question: (A) If (a 1;i … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 8 publications
(17 reference statements)
0
4
0
Order By: Relevance
“…Note that asymptotic freeness follows, among others, from [13]. In particular, when one restricts oneself to sum of generators i S i ⊗ S i , one obtains that the family S i ⊗ S i viewed as an operator on V ⊥ is a nearly optimal quantum expander in the sense of Hastings [26] and Pisier [38].…”
Section: Tensor Product Of Random Permutation Matricesmentioning
confidence: 97%
See 1 more Smart Citation
“…Note that asymptotic freeness follows, among others, from [13]. In particular, when one restricts oneself to sum of generators i S i ⊗ S i , one obtains that the family S i ⊗ S i viewed as an operator on V ⊥ is a nearly optimal quantum expander in the sense of Hastings [26] and Pisier [38].…”
Section: Tensor Product Of Random Permutation Matricesmentioning
confidence: 97%
“…, U d ) are independent Haar unitaries on U N . For more details about this property (a variant of an absorption principle), we refer to [52,21,23].…”
Section: Absorption Principlementioning
confidence: 99%
“…It is not a priori obvious why the claim ( 8) is easier to prove than claim (6). A reason is that the powers of (B ⋆ ) µ are much simpler to compute than the powers of A ⋆ .…”
Section: Overview Of the Proofmentioning
confidence: 99%
“…As soon as compact matrix groups are involved, the joint asymptotic behavior of independent random variables can legitimately be expected to depend on which representation of the group is being considered, and for example, although the above results are conclusive examples of asymptotic freeness irrespective of the representation in the case of the symmetric group, we are not aware of any complete result in this direction for unitary or orthogonal groups, and the initial results deal rather with the very particular case of the fundamental representation. In a recent development by the second author together with Gaudreau Lamarre and Male addressed part of the problem in [6], in the case when a signature is fixed.…”
Section: Introductionmentioning
confidence: 99%