Curious properties of free hypergraph C*-algebras
arXiv:1808.09220 · doi:10.7900/jot.2018oct18.2240
Abstract
A finite hypergraph consists of a finite set of vertices and a collection of subsets which we consider as partition of unity relations between projection operators. These partition of unity relations freely generate a universal C*-algebra, which we call the "free hypergraph C*-algebra" . General free hypergraph C*-algebras were first studied in the context of quantum contextuality. As special cases, the class of free hypergraph C*-algebras comprises quantum permutation groups, maximal group C*-algebras of graph products of finite cyclic groups, and the C*-algebras associated to quantum graph homomorphism, isomorphism, and colouring. Here, we conduct the first systematic study of aspects of free hypergraph C*-algebras. We show that they coincide with the class of finite colimits of finite-dimensional commutative C*-algebras, and also with the class of C*-algebras associated to synchronous nonlocal games. We had previously shown that it is undecidable to determine whether is nonzero for given . We now show that it is also undecidable to determine whether a given is residually finite-dimensional, and similarly whether it only has infinite-dimensional representations, and whether it has a tracial state. It follows that for each one of these properties, there is such that the question whether has this property is independent of the ZFC axioms, assuming that these are consistent. We clarify some of the subtleties associated with such independence results in an appendix.
19 pages. v2: minor clarifications. v3: terminology 'free hypergraph C*-algebra', added Remark 2.21
References in corpus (6)
- Perfect Commuting-Operator Strategies for Linear System Games
- A synchronous game for binary constraint systems
- Algebras, Synchronous Games and Chromatic Numbers of Graphs
- Perfect strategies for non-signalling games
- About the Connes Embedding Conjecture---Algebraic approaches---
- Is set theory indispensable?