Kumjian-Pask algebras of locally convex higher-rank graphs. (Q397871): Difference between revisions

For an integer \(k\geq 1\), a \(k\)-graph is a category \(\Gamma\) with a degree functor \(d\colon\Gamma\to\mathbb N^k\). The set \(\Gamma^0\) of objects can be seen as the vertices and the morphisms \(\lambda\) of \(\Gamma\) can be seen as paths of degree \(d(\lambda)\). It is required a unique factorization property: each path \(\lambda\) satisfies that if \(d(\lambda)=m+n\) in \(\mathbb N^k\), then there are unique \(\mu\), \(\nu\) in \(\Gamma\) with \(d(\mu)=m\), \(d(\nu)=n\), such that \(\lambda=\mu\nu\). For a commutative unital ring \(R\) and \(\Gamma\) a row-finite \(k\)-graph without sources, G. Aranda, J. Clark, A. an Huef and I. Raeburn constructed a graded algebra \(KP_R(\Gamma)\) called the Kumjian-Pask algebra universal for the so called Kumjian-Pask families. For \(k=1\) these are the Leavitt path algebras \(L_R(E)\) where \(E\) is the graph whose vertices are the objects of \(\Gamma\) and edges the paths of degree \(1\). In the paper under review the authors construct a Kumjian-Pask algebra for row-finite \(k\)-graphs which may have sources but are ``locally convex''. This restriction is motivated by results on \(C^*\)-algebras and Kumjian-Pask algebras of ``rank-2 Bratteli diagrams'' by the previously mentioned authors and also by D. Pask, M. Rørdam and A. Sims. After proving versions of the graded-uniqueness theorem and the Cuntz-Krieger uniqueness theorem, the authors study the Kumjian-Pask algebra of rank-2 Bratteli diagrams by studying certain finite subgraphs which are locally convex. They prove that the desourcification procedure of Farthing and Webster (applied to \(\Gamma\)) yields a row-finite higher-rank graph \(\widehat\Gamma\) without sources such that the Kumjian-Pask algebras of \(\widehat\Gamma\) and \(\Gamma\) are Morita equivalent. Then, they use the Morita equivalence to study the ideal structure of the Kumjian-Pask algebra of \(\Gamma\) by pulling the appropriate results across the equivalence.