De Finetti theorems for easy quantum groups (Q662438)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    De Finetti theorems for easy quantum groups
    scientific article

      Statements

      De Finetti theorems for easy quantum groups (English)
      0 references
      0 references
      0 references
      0 references
      22 February 2012
      0 references
      The reviewed paper is concerned with the investigation of de Finetti type theorems, understood as the characterization of the properties of the distribution of an infinite sequence of (classical or quantum) random variables under the assumption that this distribution is invariant under the action of certain (classical or quantum) groups. In the quantum context such a study was initiated by \textit{C. Köstler} and the last named author in [Commun. Math. Phys. 291, No. 2, 473--490 (2009; Zbl 1183.81099)], where it was shown that a sequence of quantum random variables is invariant under the action of quantum permutation groups if and only if it is freely independent and identically distributed under amalgamation with respect to a certain explicitly defined subalgebra. In the current work results of this type are obtained for all easy quantum groups, in particular for classical/free/half-liberated versions of orthogonal, hyperoctahedral and symmetric groups. The methods used are based on the combinatorics of partitions, moment-cumulant formulas and the estimates for the Weingarten matrix, and allow the authors to obtain also suitable approximation results for finite sequences of quantum random variables. It is worth noting that the study of the half-liberated case leads to a new noncommutative notion of independence, which the authors call the `half-independence'.
      0 references
      0 references
      de Finetti theorems
      0 references
      quantum invariance
      0 references
      easy quantum groups
      0 references
      noncommutative independence
      0 references
      combinatorics of partitions
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references