The structure of gauge-invariant ideals of labelled graph C∗C^*-algebras

preprint2011arXivOpen access

Abstract

In this paper, we consider the gauge-invariant ideal structure of a C∗C^*-algebra C∗(E,L,B)C^*(E,\mathcal{L},\mathcal{B}) associated to a set-finite, receiver set-finite and weakly left-resolving labelled space (E,L,B)(E,\mathcal{L},\mathcal{B}), where L\mathcal{L} is a labelling map assigning an alphabet to each edge of the directed graph EE with no sinks. Under the assumption that an accommodating set B\mathcal{B} is closed under taking relative complement, it is obtained that there is a one to one correspondence between the set of all hereditary saturated subsets of B\mathcal{B} and the gauge-invariant ideals of C∗(E,L,B)C^*(E,\mathcal{L},\mathcal{B}). For this, we introduce a quotient labelled space (E,L,[B]R)(E,\mathcal{L},[\mathcal{B}]_R) arising from an equivalence relation ∼R\sim_R on B\mathcal{B} and show the existence of the C∗C^*-algebra C∗(E,L,[B]R)C^*(E,\mathcal{L},[\mathcal{B}]_R) generated by a universal representation of (E,L,[B]R)(E,\mathcal{L},[\mathcal{B}]_R). Also the gauge-invariant uniqueness theorem for C∗(E,L,[B]R)C^*(E,\mathcal{L},[\mathcal{B}]_R) is obtained. For simple labelled graph C∗C^*-algebras C∗(E,L,Eˉ)C^*(E,\mathcal{L},\bar{\mathcal{E}}), where Eˉ\bar{\mathcal{E}} is the smallest accommodating set containing all the generalized vertices, it is observed that if for each vertex vv of EE, a generalized vertex [v]l[v]_l is finite for some ll, then C∗(E,L,Eˉ)C^*(E,\mathcal{L},\bar{\mathcal{E}}) is simple if and only if (E,L,Eˉ)(E,\mathcal{L},\bar{\mathcal{E}}) is strongly cofinal and disagreeable. This is done by examining the merged labelled graph (F,LF)(F,\mathcal{L}_F) of (E,L)(E,\mathcal{L}) and the common properties that C∗(E,L,Eˉ)C^*(E,\mathcal{L},\bar{\mathcal{E}}) and C∗(F,L,Fˉ)C^*(F,\mathcal{L},\bar{\mathcal{F}}) share.

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.