Self-similar graphs, a unified treatment of Katsura and Nekrashevych \(C^\ast\)-algebras (Q728248): Difference between revisions

The graph \(C^*\)-algebra \(C^*(E)\) of a directed graph \(E\) is well known. In this article, the authors consider a bigger \(C^*\)-algebra as follows. Let \(\sigma\) be an action of a discrete countable group \(G\) on \(E\), and \(\varphi:G \times E^1 \rightarrow G\) a one-cocycle for \(\sigma|_{E^1}\). Then \(\mathcal{O}_{G,E}\) is the universal \(C^*\)-algebra generated by the universal generators \((p_x)_{x \in E^0}\) and \((s_e)_{e \in E^1}\) and relations for the graph \(C^*\)-algebra \(C^*(E)\) as usual, and additional generators \((u_g)_{g \in G}\) such that \(g \mapsto u_g\) is a unitary representation, \(u_g s_e = s_{g e} u_{\varphi(g,e)}\), and \(u_g p_x = p_{g x} u_g\) for all \(g \in G\), \(x \in E^0\) and \(e \in E^1\). For various choices of the action \(\sigma\) and one-cocycle \(\varphi\), this yields different types of \(C^*\)-algebras known from the literature. For example, the crossed product \(C^*(E) \rtimes_\alpha G\) for certain actions \(\alpha\), \(C^*\)-algebras constructed by \textit{T. Katsura} [J. Reine Angew. Math. 617, 27--65 (2008; Zbl 1158.46042)], and \(C^*\)-algebras considered by \textit{V. Nekrashevych} [ibid. 630, 59--123 (2009; Zbl 1175.46048)] in connection with self-similar groups. The authors continue to make a wide analysis of their \(C^*\)-algebras, and particularly present them in the form of groupoid \(C^*\)-algebras and quotients of inverse semigroup \(C^*\)-algebras. They also present their \(C^*\)-algebras as Cuntz-Pimsner algebras. It is pointed out that they are nuclear if \(G\) is amenable. Equivalent conditions are given when the associated groupoid is Hausdorff, or when this groupoid is minimal, or when it is locally contracting. If \(G\) is amenable, then the \(C^*\)-algebra \(\mathcal{O}_{G,E}\) is simple if and only if every \(G\)-circuit has an entry. Connections to Nekrashevych algebras and Katsura algebras are analysed further at the end.