Subsets of vertices give Morita equivalences of Leavitt path algebras
Lisa Orloff Clark, Astrid an Huef, Pareoranga Luiten-Apirana

TL;DR
This paper demonstrates that subsets of vertices in a directed graph induce Morita equivalences between subalgebras and ideals of associated Leavitt path algebras, and shows how graph contractions preserve Morita equivalence.
Contribution
It introduces a method to obtain Morita equivalences via vertex subsets and extends graph contraction techniques to preserve algebraic properties.
Findings
Subsets of vertices induce Morita equivalences in Leavitt path algebras.
Graph contractions can produce Morita equivalent Leavitt path algebras.
Examples include desingularisation and delaying of graphs.
Abstract
We show that every subset of vertices of a directed graph E gives a Morita equivalence between a subalgebra and an ideal of the associated Leavitt path algebra. We use this observation to prove an algebraic version of a theorem of Crisp and Gow: certain subgraphs of E can be contracted to a new graph G such that the Leavitt path algebras of E and G are Morita equivalent. We provide examples to illustrate how desingularising a graph, and in- or out-delaying of a graph, all fit into this setting.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Operator Algebra Research · Advanced Topics in Algebra · Algebraic structures and combinatorial models
Subsets of vertices give
Morita equivalences of Leavitt path algebras
Lisa Orloff Clark
,
Astrid an Huef
and
Pareoranga Luiten-Apirana
Department of Mathematics and Statistics, University of Otago, P.O. Box 56, Dunedin 9054, New Zealand
lclark, astrid @maths.otago.ac.nz
(Date: 12 January 2017)
Abstract.
We show that every subset of vertices of a directed graph gives a Morita equivalence between a subalgebra and an ideal of the associated Leavitt path algebra. We use this observation to prove an algebraic version of a theorem of Crisp and Gow: certain subgraphs of can be contracted to a new graph such that the Leavitt path algebras of and are Morita equivalent. We provide examples to illustrate how desingularising a graph, and in- or out-delaying of a graph, all fit into this setting.
Key words and phrases:
Directed graph, Leavitt path algebra, Morita context, Morita equivalence, graph algebra
2010 Mathematics Subject Classification:
16D70
This research has been supported by a University of Otago Research Grant.
1. Introduction
Given a directed graph , Crisp and Gow identified in [10, Theorem 3.1] a type of subgraph which can be “contracted” to give a new graph whose -algebra is Morita equivalent to . Crisp and Gow’s construction is widely applicable, as they point out in [10, §4]. It includes, for example, Morita equivalences of the -algebras of graphs that are elementary-strong-shift-equivalent [4, 11], or are in- or out-delays of each other [5].
The -algebra of a directed graph is the universal -algebra generated by mutually orthogonal projections and partial isometries associated to the vertices and edges of , respectively, subject to relations. In particular, the relations capture the connectivity of the graph. For any subset of vertices, converges to a projection in the multiplier algebra of . (If is finite, then is in .) Then the module implements a Morita equivalence between the corner of and the ideal of . The difficult part is to identify and with known algebras. The corner may not be another graph algebra, but sometimes it is (see, for example, [9]). The projection is called full when .
Now let be a commutative ring with identity. A purely algebraic analogue of the graph -algebra is the Leavitt path algebra over . This paper is based on the very simple observation that every subset of the vertices of a directed graph gives an algebraic version of the Morita equivalence between and for Leavitt path algebras (see Theorem 1). We show that this observation is widely applicable by proving an algebraic version of Crisp and Gow’s theorem (see Theorem 3). A special case of this result has been very successfully used in both [2, Section 3] and [13].
If is infinite, we cannot make sense of the projection in , but we can make sense of the algebraic analogues of the sets , and . For example,
[TABLE]
has analogue
[TABLE]
where we also use and for universal generators of . Theorem 1 below gives a surjective Morita context between the -subalgebra and the ideal of . The set is full, in the sense that , if and only if the saturated hereditary closure of is the whole vertex set of (see Lemma 2).
Recently, the first author and Sims proved in [7, Theorem 5.1] that equivalent groupoids have Morita equivalent Steinberg -algebras. They then proved that the graph groupoids of the graphs and appearing in Crisp and Gow’s theorem are equivalent groupoids [7, Proposition 6.2]. Since the Steinberg algebra of a graph groupoid is canonically isomorphic to the Leavitt path algebra of the graph, they deduced that the Leavitt path algebras of and are Morita equivalent.
In particular, we obtain a direct proof of [7, Proposition 6.2] using only elementary methods. There are two advantages to our elementary approach: it illustrates on the one hand where we have had to use different techniques from the -algebraic analogue, and on the other hand where we can just use the -algebraic results already established.
2. Preliminaries
A directed graph consists of countable sets and , and range and source maps . We think of as the set of vertices, and of as the set of edges directed by and . A vertex is called a infinite receiver if and is called a source if . Sources and infinite receivers are called singular vertices.
We use the convention that a path is a sequence of edges such that . We denote the th edge in a path by . We say a path is finite if the sequence is finite and denote its length by . Vertices are regarded as paths of length [math]. We denote the set of finite paths by and the set of infinite paths by . We usually use the letters for infinite paths. We extend the range map to by ; for we also extend the source map by .
Let be a set of formal symbols called ghost edges. If , then we write for and call it a ghost path. We extend and to the ghost paths by and .
Let be a commutative ring with identity and let be an -algebra. A Leavitt -family in is a set where is a set of mutually orthogonal idempotents, and
- (L1)
and for ; 2. (L2)
for ; and 3. (L3)
for all non-singular , .
For a path we set . The Leavitt path algebra is the universal -algebra generated by a universal Leavitt -family : that is, if is an -algebra and is a Leavitt -family in , then there exists a unique -algebra homomorphism such that and [15, §2-3]. It follows from (L2) that
[TABLE]
3. Subsets of vertices of a directed graph give Morita equivalences
Theorem 1**.**
Let be a directed graph, let be a commutative ring with identity and let be a universal generating Leavitt -family in . Let , and
[TABLE]
Then
- (1)
* is an -subalgebra of ;* 2. (2)
, and is an ideal of containing ; 3. (3)
with actions given by multiplication in , is an –-bimodule and is an –-bimodule; 4. (4)
there are bimodule homomorphisms
[TABLE]
such that is a surjective Morita context.
Proof.
We have
[TABLE]
Products of the form are either zero or of the form for some . Thus it is easy to see that is a subalgebra of and
[TABLE]
Similarly, is an ideal.
To see that , take a spanning element of . Then , , and . Thus .
Since the module actions are given by multiplication in it is easy to verify that is an –-bimodule and is an –-bimodule. The function defined by is bilinear and for all . By the universal property of the balanced tensor product, there is a bimodule homomorphism such that . Similarly, there is a bimodule homomorphism such that . Both and are surjective. Since multiplication in is associative, for , we have
[TABLE]
Thus is a surjective Morita context. ∎
In the situation of Theorem 1, we say a subset of is full if the ideal is all of . We want a graph-theoretic characterisation of fullness, and so we want an the algebraic version of [5, Lemma 2.2]. We need some definitions.
For we write if there is a path such that and . We say a subset of is hereditary if and implies . A hereditary subset of is saturated if
[TABLE]
We denote by the smallest saturated hereditary subset of containing . For a saturated hereditary subset of we write for the ideal of generated by .
Lemma 2**.**
Let be a directed graph, and let . Then is full if and only if .
Proof.
Let be a commutative ring with identity and let be a universal generating Leavitt -family in . As in Theorem 1, let .
First suppose that is full, that is, that . To see that , fix . Then , and we can write as a linear combination
[TABLE]
where are finite subsets of , and each and .
Since is a hereditary subset containing , we have , , and hence . Thus each summand
[TABLE]
It follows that . Thus , and hence . The reverse set inclusion is trivial. Thus .
Conversely, suppose that . To see that is full, we need to show that the ideal is all of . For this, suppose that is an ideal of containing . It suffices to show that : by Theorem 1, is an ideal of containing , and taking gives , as needed.
By [15, Lemma 7.6], the subset of is a saturated hereditary subset of . Since contains , we have for all . Thus , and since is a saturated hereditary subset, we get . By assumption, , and now . So for any ideal containing . Thus is full. ∎
4. Contractible subgraphs of directed graphs
We start by stating the algebraic version of Crisp and Gow’s [10, Theorem 3.1]; for this we need a few more definitions.
Let be a directed graph. A finite path in with is a cycle if and when . Then (respectively, a subgraph) is acyclic if it contains no cycles. An acyclic infinite path in is a head if each receives only and each emits only .
If has a head, we can get a new graph by collapsing the head down to a source. This is an example of a desingularisation, and hence and are Morita equivalent by [1, Proposition 5.2]. Thus the “no heads” hypothesis in Theorem 3 below is not restrictive.
Theorem 3**.**
Let be a commutative ring with identity, let be a directed graph with no heads, and let be a universal generating Leavitt -family in . Suppose that contains the singular vertices of . Suppose also that the subgraph of defined by
[TABLE]
is acyclic. Suppose that
- (T1)
each vertex in is the range of at most one infinite path such that for all .
Also suppose that for each ,
- (T2)
there is a path from to a vertex in ; 2. (T3)
* for all ; and* 3. (T4)
, .
Let be the graph with vertex set and one edge for each with and for , such that and . Then is Morita equivalent to .
In words, the new graph of Theorem 3 is obtained by replacing each path with in of length at least which passes through by a single edge , which has the same source and range as . Note that the edges in with and in remain unchanged.
Let . As in [10] define
[TABLE]
Then of corresponds to the set of edges in .
To prove Theorem 3, we apply Theorem 1 with so that
[TABLE]
Then is an ideal of containing the subalgebra , and and are Morita equivalent. We need to show that and that is isomorphic to . Our proof uses quite a few of the arguments from Crisp and Gow’s proof of [10, Theorem 3.1]. In particular, Lemma 3.6 of [10] gives a Cuntz-Krieger -family in , and since the proof is purely algebraic it also gives a Leavitt -family in . The universal property of then gives a unique homomorphism . Crisp and Gow used the gauge-invariant uniqueness theorem to show that their -homomorphism is one-to-one. The analogue here would be the graded uniqueness theorem, however is not graded. Instead, to show is one-to-one, we adapt some clever arguments from the proof of [1, Proposition 5.1] in Lemma 5 below which uses a reduction theorem.
Theorem 4** (Reduction Theorem).**
Let be a commutative ring with identity, let be a directed graph, and let be a universal Leavitt -family in . Suppose that . There exist such that either:
- (1)
for some and we have , or 2. (2)
there exist with , , and a non-trivial cycle such that . (If is negative, then .)
Proof.
For Leavitt path algebras over a field this is proved in [3, Proposition 3.1]. We checked carefully that the same proof works over a commutative ring with identity. ∎
Lemma 5**.**
Let be a commutative ring with identity. Let and be directed graphs, and let be an -algebra -homomorphism. Denote by and universal Leavitt - and -families in and , respectively. Suppose that
- (1)
for all , for some ; and 2. (2)
for all , for some with .
Then is injective.
Proof.
We follow an argument made in [1, Proposition 5.1]. Let . Aiming for a contradiction, suppose that . By Theorem 4 there exist such that either condition (1) or (2) of the theorem holds.
First suppose that (1) holds, that is, there exist and such that . Using assumption (1), there exists such that . Now
[TABLE]
But for all , giving a contradiction.
Second suppose that (2) holds, that is, there exist with , , and a non-trivial cycle such that . Since is a non-trivial cycle, it has length at least . By assumption (2), where is a path in such that . Since is an -algebra -homomorphism we get
[TABLE]
Since for some , has grading , and hence each has grading . Thus each term in the sum is in a distinct graded component. But since , we must have for all . Thus , which is a contradiction. In either case, we obtained a contradiction to the assumption that . Thus and is injective. ∎
Proof of Theorem 3.
Let be a universal Leavitt -family in . We apply Theorem 1 with to get a surjective Morita context between and .
Since and , we have . To see that , let . We may assume that , for otherwise . If , then the Leavitt -family relations give and we are done. So suppose . Then the graph-theoretic [10, Lemma 3.4(c)] implies that . Suppose first that is finite. It then follows from the first part of [10, Lemma 3.6] that is a nonsingular vertex. The second part of [10, Lemma 3.6] implies that for any Cuntz-Krieger -family in ,
[TABLE]
the proof is purely algebraic and works for any Leavitt -family in . Thus
[TABLE]
Next suppose that is infinite. Since and is infinite, the graph-theoretic [10, Lemma 3.4(d)] implies that there exists such that . By assumption (T2), there is a path with such that . Now
[TABLE]
Thus . (We could have used Lemma 2 to prove that , as Crisp and Gow do, but this seemed easier.)
Next we show that and are isomorphic. For and define
[TABLE]
Then is a Leavitt -family in ; again this follows as in the proof of [10, Theorem 3.1]. To see what is involved, we briefly step through this. Relations (L1) follow immediately from the relations for . To see that (L2) holds, let . Then . By the graph-theoretic [10, Lemma 3.4(a)] neither nor can be a proper extension of the other. Thus , and (L2) holds.
To see that (L3) holds, let be a non-singular vertex. Then is finite and non-empty because it is equinumerous with . Using the algebraic analogue of [10, Lemma 3.6] again, we have
[TABLE]
Thus (L3) holds and is a Leavitt -family in .
Now let be a universal Leavitt -family in . The universal property of gives a unique homomorphism such that for , ,
[TABLE]
If , then ; if for some , then , and and . It follows that the range of is contained in . That is onto again follows from work of Crisp and Gow. They take a non-zero spanning element and use the graph-theoretic [10, Lemma 3.4(b)], the algebraic [10, Lemma 3.6] and assumptions (T1)-(T4) to show that is in the range of . Thus is onto.
Finally, satisfies the hypotheses of Lemma 5, and hence is one-to-one. Thus is an isomorphism of onto . ∎
Remark 6*.*
A version of Theorem 1 should hold for the Kumjian-Pask algebras associated to locally convex or finitely aligned -graphs [6, 8]. But the challenge would be to formulate an appropriate notion of contractible subgraph in that setting.
5. Examples
As mentioned in the introduction, the setting of Theorem 3 includes many known examples. We found it helpful to see how some concrete examples fit.
Example 7**.**
An infinite path in a directed graph is collapsible if has no exits except at , the set of edges is finite for every , and (see [14, Chapter 5]). Consider the following row-finite directed graph :
v_{0}$$v_{1}$$v_{2}$$v_{3}$$v_{4}……x_{1}$$x_{2}$$x_{3}$$x_{4}
The infinite path is collapsible. When we collapse to the vertex , as described in [14, Proposition 5.2], we get the following graph with infinite receiver :
v_{0}$$v_{1}$$v_{2}$$v_{3}…
This fits the setting of Theorem 3: take , and then is the subgraph defined by and . Then contains none of the singular vertices of , is acyclic, and satisfies the conditions (T1)–(T4). Thus is the graph described in the theorem.
Example 8**.**
Consider the directed graph with source and infinite receiver :
v$$w$$\infty
An example of a Drinen-Tomforde desingularisation [12] of is the row-finite graph with no sources below on the left: a head has been added at the source of and each edge from to in has been replaced with paths as shown. (This desingularisation is also an example of an out-delay.) Then, since we are interested in Morita equivalence, we delete the head at to get the graph below on the right.
v$$w…⋮
v$$w⋮
Set and Then the subgraph contains none of the singularities of , is acyclic, and satisfies conditions (T1)–(T4) of Theorem 3. The graph we started with is the graph of Theorem 3.
Example 9**.**
Consider again the graph of Example 8. Label the infinitely many edges from to by for . This time we will consider the in-delayed graph given by the Drinen source-vector (see [5, Section 4]) to be the function defined by for , and . Then the in-delayed graph given by , as described in [5], is
v^{0}$$w^{0}$$w^{1}$$w^{2}$$e_{1}$$e_{2}$$e_{3}⋮
Now take . Then contains none of the singular vertices of , and the corresponding subgraph is acyclic. There are no infinite paths in , and hence conditions (T1)–(T4) of Theorem 3 hold trivially. The graph of the theorem is again the graph that we started out with.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Abrams and G. Aranda Pino. The Leavitt path algebras of arbitrary graphs. Houston J. Math. Univ. 34 (2008), 423–442.
- 2[2] G. Abrams, A. Louly, E. Pardo, and C. Smith. Flow invariants in the classification of Leavitt path algebras. J. Algebra 333 (2011), 202–231.
- 3[3] G. Aranda Pino, D. Martín Barquero, C. Martín González and M. Siles Molina. The socle of a Leavitt path algebra. J. Pure Appl. Algebra 212 (2008), 500–509.
- 4[4] T. Bates. Applications of the gauge-invariant uniqueness theorem for graph algebras. Bull. Austral. Math. Soc. 66 (2002), 57–67.
- 5[5] T. Bates and D. Pask. Flow equivalence of graph algebras. Ergodic Theory Dynam. Sys. 24 (2004), 367–382.
- 6[6] L.O. Clark, C. Flynn and A. an Huef. Kumjian-Pask algebras of locally convex higher-rank graphs. J. Algebra 399 (2014), 445–474.
- 7[7] L.O. Clark and A. Sims. Equivalent groupoids have Morita equivalent Steinberg algebras. J. Pure Appl. Algebra 219 (2015), 2062–2075.
- 8[8] L.O. Clark and Y.E.P. Pangalela. Kumjian-Pask algebras of finitely-aligned higher-rank graphs. ar Xiv:1512.06547.
