TWO-SIDED IDEALS IN LEAVITT PATH ALGEBRAS
Abstract
We explicitly describe two-sided ideals in Leavitt path algebras associated with a row-finite graph. Our main result is that any two-sided ideal of a Leavitt path algebra associated with a row-finite graph is generated by elements of the form , where is a cycle based at vertex . We use this result to show that a Leavitt path algebra is two-sided Noetherian if and only if the ascending chain condition holds for hereditary and saturated closures of the subsets of the vertices of the row-finite graph .
keywords:
Leavitt path algebra; two-sided Noetherian; two-sided ideal(xxxxxxxxx)
2000 Mathematics Subject Classification: 16D70
Throughout this paper denotes a field. For a directed graph , the Leavitt path algebra of with coefficients in has received much recent attention, see e.g. [1], [5], [6]. The two-sided ideal structure of has been an important focus of much of this work. In this paper we provide an explicit description of a generating set for any two-sided ideal of , where is any row-finite graph. We then use this description to identify those row-finite graphs for which is two-sided Noetherian.
We briefly recall the basic definitions.
A directed graph consists of two sets , and functions The elements of are called vertices and elements of are called edges. For each , is the range of and is the source of . If and , then we say that emits and that receives . A vertex which emits no edges is called a sink. A graph is called row-finite if every vertex is the source of at most finitely many edges.
A path in a graph is a sequence of edges such that for . We define the source of by and the range of by . If we have and for every , then is called a cycle. A closed path based at is a path , with , and such that . We denote the set of all such paths by . A closed simple path based at is a closed path based at , , such that for . We denote the set of all such paths by . Note that a cycle is a closed simple path based at any of its vertices. However the converse may not be true, as a closed simple path based at may visit some of its vertices (but not ) more than once.
Let be a vertex in . If there is no cycle based at , then we let and call it the trivial cycle. If is a cycle based at of length at least 1, then is called a non-trivial cycle.
Let be any directed graph, and let be a field. We define the Leavitt path -algebra associated with as the -algebra generated by a set together with a set , which satisfy the following relations:
-
1.
for all .
-
2.
for all .
-
3.
for all .
-
4.
for all .
-
5.
for every such that .
The elements of are called real edges, while for we call a ghost edge. The set is denoted by . We let denote , and we let denote . We say that a path in is a real path (resp., a ghost path) if it contains no terms of the form (resp., ). We say that is a polynomial in only real edges (resp., in only ghost edges) if it is a sum of real paths (resp., ghost edges). The length of a real path (resp., ghost path) , denoted by , is the number of edges it contains. The length of is . Let be a polynomial in only real edges (resp., in only ghost edges) in . If , where the ’s are real paths (resp., ghost paths), then the length of , denoted by , is defined as . An edge is called an exit to the path if there exists such that and .
The proofs of the following can be found in [1].
Lemma 1
is spanned as a -vector space by monomials
-
1.
with and , or
-
2.
where ; , , .
Lemma 2
If , then . For every there exist unique such that .
For a given graph we define a preorder on the vertex set by: if and only if or there is a path such that and . We say that a subset is hereditary if and imply . We say is saturated if whenever and , then . The hereditary saturated closure of a set is defined as the smallest hereditary and saturated subset of containing . For the hereditary saturated closure of we use the notation given in [3]: , where
Example 3
Let be the directed graph where and such that and .
Then , whereas .
Example 4
Let be a directed graph where and such that and .
Let . Then we get . Furthermore,
Similarly, , and hence .
With the introductory remarks now complete, we begin our discussion of the main result with the following important observation.
Remark 5
If is a two-sided ideal of and is in , where are monomials in , then is the sum of those whose sources are all the same and whose ranges are all the same; specifically, the sum of those for which and . Moreover, . Thus we may write , with each with the above properties.
Notation. Let (resp., ) be the subring of elements in whose terms involve only real edges (resp., only ghost edges).
Lemma 6
Let be a two-sided ideal of and . Then is the two-sided ideal of generated by elements of having the form , where , is a cycle based at and for .
Proof 0.1.
Let be the ideal of generated by elements in of the indicated form. Our claim is . Towards a contradiction, suppose ; choose of minimal length. By Remark 5, we can write with each is in and is the sum of those paths whose sources are all the same and whose ranges are all the same. Since , one of the . Replacing by , we may assume that where all the have the same source and the same range. First we claim that one of the must have length 0, i.e. for some vertex and . Suppose not. Then for each we can write where . So . Now
and has smaller length than . So and hence clearly . Then
a contradiction. So we can assume without loss of generality that , with a vertex. Since all the terms in have the same source and the same range, each is a closed path based at . Multiplying by a scalar if necessary we can write , closed paths at .
Case I: There exists no, or exactly one, closed simple path at . If there are no closed simple paths at then we get , a contradiction. If there is exactly one closed simple path based at then necessarily must be a cycle. Furthermore, the only paths in which have source and range equal to are powers of . Then , a contradiction.
Case II: There exist at least two distinct closed simple paths and based at . As and neither is a subpath of the other, . Without loss of generality assume . Then for some . Multiplying by on the left and on the right, we get
Note that if , then . Since , we get for some path . Since the are closed paths based at the vertex , one gets from the equation that for some integer . So commutes with and thus each non-zero term .
Since , for every and so we get , which implies that is in . Then , a contradiction.
It can be easily shown that the analogue of Lemma 6 is true for . We state this for the sake of completeness.
Lemma 7.
Let be a two-sided ideal of . Then is generated by elements of the form , where , is a cycle at and for .
Theorem 8.
Let be a row-finite graph. Let be any two-sided ideal of . Then is generated by elements of the form , where , is a cycle at and .
Proof 0.2.
Let be the two-sided ideal of generated by . By Lemma 6, it is enough if we show that . Suppose not. Choose in , where is minimal and are real paths in . By Remark 5, , where each and is a sum of those monomials all having the same source and same range. Since , for some . By the minimality of , we can replace by . Thus we we can assume that , where for all , , and . Among all such with minimal , select one for which is the smallest in the lexicographic order of . First note that we have for some , otherwise is in Let be in . Then note that
either has fewer terms , or and is smaller than . Then by minimality, we get is in for every . Since for some , is not a sink and emits finitely many edges. Hence we have
We get a contradiction, so the result follows.
Remark 9.
We note that the Theorem does not hold for arbitrary graphs. An example is the “infinite clock”: Let and with and . Then the two-sided ideal generated by is not generated by the elements of the desired form.
Notation. The element is denoted by , where .
Now the Theorem is in hand, we are going to put the pieces together to get the Noetherian result.
Remark 10.
Let be a cycle based at and let be such that . If we let , then .
Lemma 11.
Let be a two-sided ideal of , where is an arbitrary graph. Suppose , are two non-trivial cycles based at distinct vertices , respectively. Suppose and both belong to , where and are polynomials of smallest positive degree in with such that and . If , then
Proof 0.3.
Let be a path from to . We claim must lie on the cycle . Because, otherwise, and so . This contradicts the fact that . So we can write and where is the part of from to . Since , we get . By the minimality of , is a divisor of in . Similarly, since , we conclude that is a divisor of . Thus for some . Since , . Hence .
The next Lemma and its proof is implicit in the proof of Lemma 7 in [2].
Lemma 12.
Let be an arbitrary graph and . If , and there is a non-trivial cycle based at , then for some .
Proof 0.4.
We recall that . Let be the smallest non-negative integer such that . We prove the Lemma by the induction on , the Lemma being true by definition when . Assume and that the Lemma holds when . Let . Since , and . Since is the base of a non-trivial cycle , one of the vertices, say, lies on the cycle and so . Since and is the base of a cycle, by induction there is a such that . Then , as desired.
We also need the following Lemma, whose proof is given in the first paragraph of the proof of Theorem 5.7 in [8].
Lemma 13.
Let be an arbitrary graph and let be a hereditary and saturated subset of vertices in . If is the two-sided ideal generated by , then .
Theorem 14.
Let be a row-finite graph. Then the following are equivalent:
has a.c.c. on two-sided ideals,
has a.c.c. on two-sided graded ideals,
The hereditary saturated closures of the subsets of the vertices in satisfy a.c.c..
Proof 0.5.
Suppose the ascending chain condition holds on the hereditary saturated closures of the subsets of . Let be a two-sided ideal of . By Theorem 8 and by Remark 10, is generated by the set
It is well known that two-sided Noetherian is equivalent to every two-sided ideal being finitely generated, so we wish to show that is generated by a finite subset of .
Suppose, towards a contradiction, there are infinitely many with , an infinite set and for each , is a non-trivial cycle based at and that . By Lemma 11, we may assume that for any two , with , . Well-order the set and consider it as the set of all ordinals less than an infinite ordinal . Define and for any , define if is a limit ordinal, and define if is a non-limit ordinal of the form . By the hypothesis the ascending chain of hereditary saturated closures of subsets becomes stationary after a finite number of steps. So there is an integer such that . Now and by Lemma 12, there is a such that . This is a contradiction. Hence the set is finite.
So by the previous paragraph, if there are only finitely many in with , that is, only finitely many vertices in , then we are done. We index the vertices in by ordinals , an infinite ordinal, then as before, we get a well-ordered ascending chain of hereditary saturated closure of subsets where and the are inductively defined as before. Since, by hypothesis, this chain becomes stationary after a finite number of steps, there is an integer such that for all . Thus . Since the ideal generated by the finite set contains , we conclude that the ideal is generated by the finite set . Thus the Leavitt path algebra is two-sided Noetherian.
Conversely, suppose is two-sided Noetherian. Consider an ascending chain of hereditary saturated closures of subsets of vertices in . Consider the corresponding ascending chain of two-sided ideals where for each integer , is the two-sided ideal generated by . By hypothesis, there is an integer such that for all . We claim that for all . Otherwise, we can find a vertex and since , by Lemma 13 and this is a contradiction.
It is well-known (see [8]) that if is a two-sided ideal of generated by a hereditary and saturated subset of , then is a graded ideal of . If we call graded two-sided Noetherian if graded two-sided ideals of satisfy the ascending chain condition, then Theorem 14 states that for any graph , is two-sided Noetherian if and only if it is graded two-sided Noetherian.
Remark 15.
We note that this result only shows that the a.c.c. on graded ideals is sufficient to get a.c.c. on all ideals, and that we are not proving that every ideal in a Noetherian Leavitt path algebra is graded. As an example we can consider , which is the Leavitt path algebra of the graph with one vertex and one loop. Note that although this Leavitt path algebra has infinitely many ideals, it is nonetheless Noetherian, but has only the trivial graded ideals.
Now we easily see
Corollary 16.
Every Leavitt path algebra with a finite graph is two-sided Noetherian.
We conclude by presenting another example of a non-Noetherian Leavitt path algebra.
Example 17
Let be the directed graph where and is such that and . The graph of this Leavitt path algebra is given in Figure 1.
\psfigfile=Figure2a.pdf
Note that if we let , then is a non-terminating ascending chain of hereditary saturated closures of sets in . Hence by Theorem 8, is not two-sided Noetherian. Indeed, is a non-terminating ascending chain of ideals in .
In [4] we present some additional consequences of Theorem 8, including a description of the two-sided artinian Leavitt path algebras.
Acknowledgments
The author is indebted to Dr. Jason P. Bell for the guidance and the technical discussions since the inception of this work, as well as to Dr. Gene Abrams and to Dr. Kulumani M. Rangaswamy for their thorough reviews and support. The author also thanks Dr. Gonzalo Aranda Pino and Dr. Kathi Crow for their valuable feedback on the first draft of this paper, and Azhvan Sheikh Ahmady for reading and improving this manuscript.
References
- [1] G. Abrams and G. Aranda Pino, The Leavitt path algebra of a graph, J. Algebra 293 (2005) 319–334.
- [2] G. Abrams and G. Aranda Pino, Purely infinite simple Leavitt path algebras, J. Pure and Applied Algebra 207 (2006) 553–563.
- [3] G. Abrams and G. Aranda Pino, The Leavitt path algebras of arbitrary graphs, Houston J. Math. 34 (2006) 423–443.
- [4] G. Abrams, J. P. Bell, P. Colak and K. M. Rangaswamy, Two-sided ideals in Leavitt path algebras: Applications, in preparation.
- [5] P. Ara, M. A. Moreno and E. Pardo, Nonstable -theory for graph algebras, Algebras Represent. Theory 10 (2007) 157–178.
- [6] K. R. Goodearl, Leavitt path algebras and direct limits, Rings, Modules and Representations. Contemporary Mathematics series, (2009) 165–188.
- [7] I. Raeburn, Graph algebras. CBMS Regional Conference Series in Mathematics, vol 103, American Mathematical Society, Providence, 2005.
- [8] M. Tomforde, Uniqueness theorems and ideal structure for Leavitt path algebras, J. of Algebra 318 (2007) 270–299.