K-theory for the tame C*-algebra of a separated graph

preprint2015arXivOpen access

Abstract

A {\it separated graph} is a pair (E,C)(E,C) consisting of a directed graph EE and a set C=⨆v∈E0CvC=\bigsqcup_{v\in E^0}C_v, where each CvC_v is a partition of the set of edges whose terminal vertex is vv. Given a separated graph (E,C)(E,C), such that all the sets X∈CX\in C are finite, the K-theory of the graph C*-algebra C∗(E,C)C^*(E,C) is known to be determined by the kernel and the cokernel of a certain map, denoted by 1C−A(E,C)1_C- A_{(E,C)}, from Z(C)\mathbb Z^{(C)} to Z(E0)\mathbb Z^{(E^0)}. In this paper, we compute the K-theory of the {\it tame} graph C*-algebra O(E,C)\mathcal O(E,C) associated to (E,C)(E,C), which has been recently introduced by the authors. Letting ππ denote the natural surjective homomorphism from C∗(E,C)C^*(E,C) onto O(E,C)\mathcal O(E,C), we show that K1(π)K_1(π) is a group isomorphism, and that K0(π)K_0(π) is a split monomorphism, whose cokernel is a torsion-free abelian group. We also prove that this cokernel is a free abelian group when the graph EE is finite, and determine its generators in terms of a sequence of separated graphs {(En,Cn)}n=1∞\{(E_n, C^n)\}_{n=1}^{\infty} naturally attached to (E,C)(E,C). On the way to showing our main results, we obtain an explicit description of a connecting map arising in a six-term exact sequence computing the K-theory of an amalgamated free product, and we also exhibit an explicit isomorphism between ker(1C−A(E,C))\mathrm{ker} (1_C - A_{(E,C)}) and K1(C∗(E,C))K_1(C^*(E,C)).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.