Higher-rank graphs and their C-algebras.pdf

a r X i v : m a t h / 0 1 0 7 2 2 2 v 1 [ m a t h .O A ] 3 1 J u l 2 0 0 1 HIGHER-RANK GRAPHS AND THEIR C?-ALGEBRAS IAIN RAEBURN, AIDAN SIMS, AND TRENT YEEND Abstract. We consider the higher-rank graphs introduced by Kumjian and Pask as models for higher-rank Cuntz-Krieger algebras. We describe a variant of the Cuntz-Krieger relations which applies to graphs with sources, and de- scribe a local convexity condition which characterises the higher-rank graphs that admit a nontrivial Cuntz-Krieger family. We then prove versions of the uniqueness theorems and classifications of ideals for the C?-algebras generated by Cuntz-Krieger families. 1. Introduction The C?-algebras of higher-rank graphs of Kumjian and Pask [7] generalise the higher-rank Cuntz-Krieger algebras of Robertson and Steger [11, 12, 13] in the same way that the C?-algebras of infinite graphs generalise the original Cuntz-Krieger algebras [4, 5]. In [7], Kumjian and Pask analysed higher-rank graph algebras using a groupoid model like that used in [9] and [8] to analyse graph algebras. The results in [9] and [8] were sharpened in [3] using a direct analysis based on the original arguments used by Cuntz and Krieger in [4] and [5]; the analysis of [3] applies to the algebras of quite general row-finite graphs, and in particular the graphs can have sinks or sources. Here we carry out a direct analysis of the C?-algebras of row-finite higher-rank graphs. One interesting new feature is the difficulty in extending results to higher- rank graphs with sources: the paths λ in higher-rank graphs have degrees d(λ) in Nk rather than lengths in N, and vertices may receive edges of some degrees and not of others. To overcome this difficulty we modify the Cuntz-Krieger relation to ensure that Cuntz-Krieger algebras have a spanning family of the usual sort, and identify a local convexity condition under which a higher-rank graph admits a nontrivial Cuntz-Krieger family. We then prove versions of the gauge-invariant