加载中…
By a labeled graph -algebra we mean a -algebra associated to a labeled space consisting of a labeled graph and the smallest normal accommodating set of vertex subsets. Every graph -algebra is a labeled graph -algebra and it is well known that is simple if and only if the graph is cofinal and satisfies Condition (L). Bates and Pask extend these conditions of graphs to labeled spaces, and show that if a set-finite and receiver set-finite labeled space is cofinal and disagreeable, then its -algebra is simple. In this paper, we show that the converse is also true.

生成讲解博客的中文版本

生成AI智能校验的中文版本