Search arXiv⌕ Search

arXiv · 0704.1582

L^2-Betti numbers of coamenable quantum groups

Abstract

We prove that a compact quantum group is coamenable if and only if its corepresentation ring is amenable. We further propose a Foelner condition for compact quantum groups and prove it to be equivalent to coamenability. Using this Foelner condition, we prove that for a coamenable compact quantum group with tracial Haar state, the enveloping von Neumann algebra is dimension flat over the Hopf algebra of matrix coefficients. This generalizes a theorem of Lueck from the group case to the quantum group case, and provides examples of compact quantum groups with vanishing L^2-Betti numbers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Kyed. 2008-11-27. L^2-Betti numbers of coamenable quantum groups. https://arxiv.org/abs/0704.1582

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bratteli diagrams, translation flows and their $C^*$-algebras

In [LT16], Kathryn Lindsey and the second author constructed a translation surface from a bi-infinite Bratteli diagram. We continue an investigation into these surfaces. The construction given in [LT16] was essentially combinatorial. Here, we provide explicit links between the path space of the Bratteli diagram and the surface, including various intermediate topological spaces. This allows us to relate the $C^{*}$-algebras associated with tail equivalence on the Bratteli diagram and the foliation of the surface, under some mild hypotheses. This also allows us to relate the K-theory of the $C^{*}$-algebras involved. We also treat the case of finite genus surfaces in some detail, where the process of Rauzy-Veech induction (and its inverse) provide an explicit construction of the Bratteli diagrams involved.

math.OA↗

Quantum Graph Theory by Example

Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in working with quantum graphs compared to classical graphs stems from the fact that they are no longer discrete objects. This makes it generally difficult to construct insightful, non-trivial examples. We present a collection of non-trivial quantum graphs that can be thought of in discrete terms, and that can be expressed in the diagrammatic formalism introduced by Musto, Reutter, and Verdon. The examples arise as the quantum graphs acted on by increasingly smaller classical matrix groups, and are parametrised by triples of matrices $(A, B, C)$. The parametrisation reveals a clean decomposition of quantum graph structure into classical and genuinely quantum components: $A$ and $C$ are described by a classical weighted graph called the strange graph, while $B$ provides a purely quantum contribution with no classical analogue. Based on this model, we give exact formulas or establish bounds for quantum graph parameters, such as the number of connected components, the chromatic number, the independence number, and the clique number. Our results provide the first large, parametric families of quantum graphs for which standard graph parameters can be computed analytically.

math.OA↗