K-graph C*-algebra explained

Λ

with domain and codomain maps

r

and

s

, together with a functor

d:Λ\toNk

which satisfies the following factorisation property: if

d(λ)=m+n

then there are unique

\mu,\nu\inΛ

with

d(\mu)=m,d(\nu)=n

such that

λ=\mu\nu

.

Aside from its category theory definition, one can think of k-graphs as a higher-dimensional analogue of directed graphs (digraphs). k- here signifies the number of "colors" of edges that are involved in the graph. If k=1, a k-graph is just an ordinary directed graph.If k=2, there are two different colors of edges involved in the graph and additional factorization rules of 2-color equivalent classes should be defined. The factorization rule on k-graph skeleton is what distinguishes one k-graph defined on the same skeleton from another k-graph. k can be any natural number greater than or equal to 1.

The reason k-graphs were first introduced by Kumjian, Pask et al. was to create examples of C*-algebras from them. k-graphs consist of two parts: skeleton and factorization rules defined on the given skeleton. Once k-graph is well-defined, one can define functions called 2-cocycles on each graph, and C*-algebras can be built from k-graphs and 2-cocycles. k-graphs are relatively simple to understand from a graph theory perspective, yet just complicated enough to reveal different interesting properties at the C*-algebra level. The properties such as homotopy and cohomology on the 2-cocycles defined on k-graphs have implications to C*-algebra and K-theory research efforts. No other known use of k-graphs exist to this day; k-graphs are studied solely for the purpose of creating C*-algebras from them.

Background

The finite graph theory in a directed graph form a category under concatenation called the free object category (generated by the graph). The length of a path in

E

gives afunctor from this category into the natural numbers

N

.A k-graph is a natural generalisation of this concept which was introduced in 2000 by Alex Kumjian and David Pask.

Examples

Tk

consisting of a single object and k commuting morphisms

{f1,...,fk}

, together with the map

d:Tk\toNk

defined by
n1
d(f
1
nk
...f
k

)=(n1,\ldots,nk)

is a k-graph.

\Omegak=\{(m,n):m,n\inZk,m\len\}

, then

\Omegak

is a k-graph when gifted with the structure maps

r(m,n)=(m,m)

,

s(m,n)=(n,n)

,

(m,n)(n,p)=(m,p)

and

d(m,n)=n-m

.

Notation

The notation for k-graphs is borrowed extensively from the corresponding notation for categories:

n\inNk

let

Λn=d-1(n)

.

Λ0=\operatorname{Obj}(Λ)

.

v,w\inΛ0

and

X\subseteqΛ

we have

vX=\{λ\inX:r(λ)=v\}

,

Xw=\{λ\inX:s(λ)=w\}

and

vXw=vX\capXw

.

0<\#vΛn<infty

for all

v\inΛ0

and

n\inNk

then

Λ

is said to be row-finite with no sources.

Visualisation - Skeletons

E=(E0,E1,r,s,c)

where

E0=Λ0

,

E1=

k
\cup
i=1
ei
Λ
,

r,s

inheritedfrom

Λ

and

c:E1\to\{1,\ldots,k\}

defined by

c(e)=i

if and only if

e\in

ei
Λ
where

e1,\ldots,en

are the canonicalgenerators for

Nk

. The factorisation property in

Λ

for elementsof degree

ei+ej

where

ij

gives rise to relations between the edges of

E

.

C*-algebra

As with graph-algebras one may associate a C*-algebra to a k-graph:

Let

Λ

be a row-finite k-graph with no sources then a Cuntz–Krieger

Λ

family
in a C*-algebra B is a collection

\{sλ:λ\inΛ\}

of operators in B such that

sλs\mu=sλ

if

λ,\mu,λ\mu\inΛ

;

\{sv:v\inΛ0\}

are mutually orthogonal projections;
  1. if

d(\mu)=d(\nu)

then
*
s
\mu

s\nu=\delta\muss

;

sv=

\sum
λ\invΛn

sλ

*
s
λ
for all

n\inNk

and

v\inΛ0

.

C*(Λ)

is then the universal C*-algebra generated by a Cuntz–Krieger

Λ

-family