Abstract
The algebraic structures known as Leavitt path algebras were initially developed in 2004 by Ara, Moreno and Pardo, and almost simultaneously (using a different approach) by the author and Aranda Pino. During the intervening decade, these algebras have attracted significant interest and attention, not only from ring theorists, but from analysts working in C-algebras, group theorists, and symbolic dynamicists as well. The goal of this article is threefold: to introduce the notion of Leavitt path algebras to the general mathematical community; to present some of the important results in the subject; and to describe some of the field’s currently unresolved questions.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Our goal in writing this article is threefold: first, to provide a history and overall viewpoint of the ideas which comprise the subject of Leavitt path algebras; second, to give the reader a general sense of the results which have been achieved in the field; and finally, to give a broad picture of some of the research lines which are currently being pursued. The history and overall viewpoint (Sect. 1) are presented with a completely general mathematical audience in mind; the writing style here will be more chatty than formal. Our description of the results in the field has been split into two pieces: we describe Leavitt path algebras of row-finite graphs (Sects. 2, 3, and 4), and subsequently discuss various generalizations of these (Sect. 5). Our intent and hope in ordering the presentation this way is to allow the non-expert to appreciate the key ideas of the subject, without getting ensnarled in the at-first-glance formidable constructs which drive the generalizations. We close with Sect. 6, in which we describe some of the current lines of investigation in the subject. In part, our hope here is to attract mathematicians from a wide variety of fields to join in the research effort.
The exhilarating increase in the level of interest in Leavitt path algebras during the first decade since their introduction has resulted in the publication of scores of articles on these and related structures. Certainly it is not the goal of the current article to review the entirety of the literature in the subject. Rather, we have tried to strike a balance between presenting enough information to make clear the beauty and diversity of the subject on the one hand, while avoiding “information overload” on the other. Apologies are issued in advance to those authors whose work in the field has consequently not been included herein.
In keeping with our goal of making this article accessible to a broad audience, we will offer either a complete, formal Proof, or an intuitive, informal Sketch of Proof, only for specific results for which such proofs are particularly illuminating. In other situations we will simply present statements without proof. Appropriate references are provided for all key results.
1 History and overview
1.1 History and overview: module type, and Leavitt’s Theorem
The fundamental examples of rings that are encountered during one’s algebraic pubescence (e.g., fields , , , , ) all have the following property.
Definition 1
The unital ring has the Invariant Basis Number (IBN) property in case, for each pair , if the left -modules and are isomorphic, then .
A wide class of rings can easily be shown to have the IBN property, including rings possessing any sort of reasonable chain condition on one-sided ideals, as well as commutative rings. But there are naturally occurring examples of algebras which are not IBN.
Let be a countably infinite dimensional vector space over a field , and let denote , the algebra of linear transformations from to itself. It is not hard to see that as left (or right) -modules for any pair , as follows. One starts by viewing as the -algebra consisting of those matrices having the property that each row of contains at most finitely many nonzero entries. (In this context we view transformations as acting on the right, and define composition of transformations by setting to mean “first , then ”. Of course, depending on the reader’s tastes, the same analysis can be performed by considering the analogous algebra of column-finite matrices.) Then a left-module isomorphism is easy to establish, by considering the map that associates with any row-finite matrix the pair of row-finite matrices , where is built from the odd-indexed columns of , and from the even-indexed columns. Once such an isomorphism is guaranteed, then by using the obvious generalization of the observation we see that for all .
The following is easy to prove.
Lemma 1
Let be a unital ring and let . Then as left -modules if and only if there exist elements of for which
In effect, the ring lies on the complete opposite end of the spectrum from the IBN property, in that every pair of finitely generated free left -modules are isomorphic; such a ring is said to have the Single Basis Number (SBN) property. The question posed (and answered completely) by William G. Leavitt in the early 1960’s regards the existence of a middle ground between IBN and SBN: do there exist rings for which for some, but not all, pairs ? If we assume an isomorphism exists between and for some pair , then clearly by appending copies of to this isomorphism we get that . With this idea in mind, and using only basic properties of the semigroup , it is easy to prove the following.
Lemma 2
Let be a unital ring. Assume is not IBN i.e. that there exist with . Let be the least integer for which for some . For this let denote be the least integer for which and . Let denote . Then for any pair
We call the pair the module type of. (We caution that some authors, including Leavitt, instead use the phrase module type to denote the pair .) In particular, the ring has module type .
With Lemma 2 in mind, Leavitt proved the following “anything-that-can-happen-actually-does-happen” result.
Theorem 1
(Leavitt’s Theorem) [76, Theorem 8] Let with and let be any field. Then there exists a -algebra having module type . Additionally:
-
1.
is universal in the sense that if is any -algebra having module type then there exists a nonzero -algebra homomorphism .
-
2.
is simple i.e. has no nontrivial two-sided ideals if and only if . This was shown in [77, Theorems 2 and 3].) In this case for each there exists for which
-
3.
is explicitly described in terms of generators and relations.
We will refer to as the Leavitt algebra of type.
Since the ring has module type , by Lemma there necessarily exists a set of four elements in which satisfy the appropriate relations; for clarity, we note that one such set is given by
Moreover, the subalgebra of generated by these four matrices is isomorphic to .
In the specific case when , the explicit description of the algebra given in [76] yields that is the free associative -algebra modulo the relations given in . So, with Lemma in mind, we may view as essentially the “smallest” algebra of type .
In the following subsection we will rediscover the algebras from a different point of view.
1.2 History and overview: the -monoid, and Bergman’s Theorem
We begin this subsection with a well-known idea, perhaps cast more formally than is typical. Let be a finitely generated projective left -module. (The notions of “finitely generated” and “projective” are categorical, and make sense even in case is nonunital.)
Definition 2
For a ring , let denote the set of isomorphism classes of finitely generated projective left -modules, and define the obvious binary operation on by setting . Then is easily seen to be a commutative monoid (with neutral element ).
For any idempotent , ; indeed, elements of of this form will play a central role in the subject. If is a division ring, then ; the same is true for , as well as for various additional classes of rings. The wide range of monoids which can arise as will be demonstrated in Theorem 2. For an arbitrary ring , it’s fair to say that an explicit description of is typically hard to come by. The well-studied Grothendieck groupof is precisely the universal abelian group corresponding to the commutative monoid .
When is unital then . Key information about may be provided by the pair . If and are isomorphic as rings then there exists an isomorphism of monoids for which . (In this situation we write .) More generally, if and are Morita equivalent (denoted ), then there exists an isomorphism of monoids . However, such an induced isomorphism need not have the property . For instance, if for a field , then , and . But , while , and clearly no automorphism of the monoid can take to .
In addition to the commutativity of , the monoid has the following two easy-to-see properties. First, is conical: if have , then . Second (for unital), contains a distinguished element: for each , there exists and having (specifically, ). In 1974, George Bergman established the following remarkable result.
Theorem 2
(Bergman’s Theorem) [49, Theorem 6.2] Let be a finitely generated commutative conical monoid with distinguished element and let be any field. Then there exists a -algebra for which Additionally:
-
1.
is universal in the sense that if is any unital -algebra for which there exists a monoid homomorphism having then there exists a not necessarily unique-algebra homomorphism for which the induced map is precisely .
-
2.
is left and right hereditary i.e. every left ideal and every right ideal of is projective
-
3.
The construction of depends on the specific representation of as where is a finitely generated free abelian monoid and is a given finite set of relations in With and viewed as starting data the algebra is constructed explicitly via a finite sequence of steps where each step consists of adjoining elements satisfying explicitly specified relations provided by to an explicitly described algebra.
We will refer to as the Bergman algebra of .
Example 1
Three important examples.
-
1.
Perhaps not surprisingly, when , then . (In this situation we view as the free abelian monoid on one generator.)
-
2.
Somewhat more subtly, we consider the same pair , but this time represent the monoid as . Then , the Laurent polynomial algebra with coefficients in .
-
3.
Let . Let denote the free abelian monoid having a single generator , subject to the relation . So , , and clearly satisfies the hypotheses of Bergman’s Theorem. (In [49], the semigroup is denoted .) In this situation, Bergman’s explicit construction yields that , with relations given by exactly the same defining relations as given in above, namely,
Consequently, as observed in [49, Theorem 6.1], the Bergman algebra is precisely the Leavitt algebra .
1.3 History and overview: graph C-algebras
Because of the central role they play in both the genesis and the ongoing development Leavitt path algebras, no history of the subject would be complete without a discussion of graph C-algebras. We present here only the most basic description of these algebras, just enough so that even the reader who is completely unfamiliar with them can get a sense of their connection to Leavitt path algebras.
Throughout this subsection all algebras are assumed to be unital algebras over the complex numbers (but most of these ideas can be cast significantly more generally). The algebra is a -algebra in case there is a map which has: ; ; ; ; and for all and , where denotes the complex conjugate of . Standard examples of -algebras include matrix rings (where is ‘conjugate transpose’), and the ring of continuous functions from the unit circle to (where is defined by setting for ).
A C-norm on a -algebra is a function for which: ; ; ; ; and for all and . For , a -norm on is given by operator norm, where we view elements of as operators , with the Euclidean norm on . (This operator norm assigns to the square root of the largest eigenvalue of the matrix .) A C-norm on is also given by an operator norm.
A C-norm on a -algebra induces a topology on in the usual way, by defining the -ball around an element to be .
Definition 3
A C-algebra is a -algebra endowed with a -norm , for which is complete with respect to the topology induced by .
A second description of a C-algebra, from an operator-theoretic point of view, is given here. Let be a Hilbert space, and let denote the continuous linear operators on . A C-algebra is an adjoint-closed subalgebra of which is closed with respect to the norm topology on . In general, and especially relevant in the current context, one often builds a C-algebra by starting with a given set of elements in , and then forming the smallest C-subalgebra of which contains that set.
A partial isometry is an element in a C-algebra for which is a self-adjoint idempotent; that is, in case and . Such elements are characterized as those elements of for which in . For instance, in , any element which is the sum of distinct matrix units () is a partial isometry (indeed, a projection); there are other partial isometries in as well. Since the only idempotents in are the constant functions and , it is not hard to show that the set of partial isometries in consists of .
The study of C-algebras has its roots in the early development of quantum mechanics; these were used to model algebras of physical observables. Various questions about the structure of C-algebras arose over the years. One of the most important of these questions, the explicit description of a separable simple infinite C-algebra, was resolved in 1977 by Cuntz [56, Theorem 1.12]. A C-algebra is simple in case it contains no nontrivial closed two-sided ideals. (It can be shown that this is equivalent to the algebra containing no nontrivial two-sided ideals, closed or not.) A C-algebra is infinite in case it contains an element for which and .
Theorem 3
(Cuntz’ Theorem) [56, Theorem 1.12] Let . Consider a Hilbert space and a set of isometries i.e. on . Assume that Let denote the C-algebra generated by . Then the infinite separable C-algebra is simple.
Indeed, Cuntz proves much more in [56, Theorem 1.12] than we have stated here. Additionally, it is shown in [56, Theorem 1.13] that if is any nonzero element in , then there exist for which .
Cuntz notes that the condition implies that the are pairwise orthogonal. So the C-algebra is the C-completion of a -subalgebra of , where as a -algebra is generated by isometries , for which . Since a C-algebra is adjoint-closed, we see that may also be viewed as the C-completion of a -subalgebra of generated by isometries together with, for which .
In retrospect, such a -algebra is seen to be isomorphic to .
Subsequent to the appearance of [56], a number of researchers in operator algebras investigated natural generalizations of the Cuntz C-algebras ; see especially [59]. In the early 1980’s, various constructions of C-algebras corresponding to directed graphs were studied by Watatani and others (e.g., [100]). Even though, via this approach, the Cuntz algebra could be realized as the C-algebra corresponding to the graph (see Example 6 below), this methodology did not gain much traction at the time. Instead, the study of these C-algebras from a different point of view (arising from matrices with non-negative integer entries, or arising from groupoids) became more the vogue. But then, in the fundamental article [75] (in which groupoids are still in the picture, and the corresponding graphs could not have sinks), and the subsequent followup articles [74] and [47], the power of constructing a C-algebra based on the data provided by a directed graph became clear.
Definition 4
A (directed) graph is a quadruple , where and are sets (the vertices and edges of , respectively), and and are functions from to (the source and range functions of , respectively). A sink is an element for which . is finite in case both and are finite sets.
Definition 5
Let be a finite graph. Let denote the universal C-algebra generated by a collection of mutually orthogonal projections together with partial isometries which satisfy the Cuntz–Krieger relations:
-
(CK1)
for all , and
-
(CK2)
for each non-sink .
For example, in [74] the authors were able to identify those finite graphs for which is simple, and those for which is purely infinite simple. (The germane graph-theoretic terms will be described in Notations 2 and 3 below. A unital C-algebra is purely infinite simple in case , and for each there exist with .)
Theorem 4
(Simplicity and Purely Infinite Simplicity Theorems for graph C-algebras) Let be a finite graph. Then is simple if and only if the only hereditary saturated subsets of are trivial and every cycle in has an exit. Moreover is purely infinite simple if and only if C is simple and contains at least one cycle.
Subsequently, in [47], results were clarified, sharpened, and extended; and the groupoid techniques were eliminated from the arguments.
During the same timeframe, Kirchberg (unpublished) and Phillips [85] independently proved a beautiful, deep result which classifies up to isomorphism a class of C-algebras satisfying various properties. Although the now-so-called Kirchberg Phillips Theorem covers a wide class of C-algebras, it manifests in the particular case of purely infinite simple graph C-algebras as follows.
Theorem 5
(The Kirchberg Phillips Theorem for graph C-algebras) Let and be finite graphs. Suppose and are purely infinite simple. Suppose there is an isomorphism for which Then .
The work described in [47] became the basis of a newly-energized research program in the C-algebra community, a program which continues to flourish to this day. For additional information about graph C-algebras, see [86]; for a more complete description of the history of graph C-algebras, see [99, Appendix B].
1.4 History and overview: the confluence of many ideas leads to the definition of Leavitt path algebras
With the overview of Leavitt algebras, Bergman algebras, and graph C-algebras now in place, we are in position to describe the genesis of Leavitt path algebras.
There are two plot lines to the history.
1.4.1 Historical Plot Line #1: graph algebras as Bergman algebras
The first Historical Plot Line begins with an investigation into the algebraic notion of purely infinite simple rings, begun by Ara, Goodearl, and Pardo (each of whom has significant expertise in both ring theory and C-algebras) in [35]. In it, the authors “... extend the notion of a purely infinite simple C-algebra to the context of unital rings, and study its basic properties, especially those related to -theory”.
The authors note in the introduction of [35] that “The Cuntz algebra is the C-completion of the Leavitt algebra over the field of complex numbers.” Although this connection between the Cuntz and Leavitt algebras is now viewed as almost obvious, it was not until the early 2000’s that such a connection was first noted in the literature. (A somewhat earlier mention of this connection appears in [3]; the observation in [3] was included at the request of an anonymous referee.)
With the notion of purely infinite simple rings so introduced, the same three authors (together with González-Barroso) set out to find large classes of explicit examples of such rings. With the purely infinite simple graph C-algebras as motivation, the four authors in [29] introduced the “algebraic Cuntz–Krieger (CK) algebras.” (Retrospectively, these are seen to be the Leavitt path algebras corresponding to finite graphs having neither sources nor sinks, and which do not consist of a disjoint union of cycles.) These algebraic Cuntz–Krieger algebras arose as specific examples of fractional skew monoid rings, and the germane ones were shown to be purely infinite simple by using techniques which applied to the more general class.
With the -theory of the corresponding graph C-algebras in mind, it was then natural to ask analogous -theoretic questions about the algebraic CK algebras. In addition, earlier work by Ara, Goodearl, O’Meara and Pardo [33] regarding semigroup-theoretic properties of (e.g., separativity and refinement) for various classes of rings provided the motivation to ask similar questions about for these algebras.
Once various specific examples had been completely worked out, it became clear to Ara and Pardo that much of the information about the -monoid of the algebraic CK algebras could be seen directly in terms of relations between vertices and edges in an associated graph . Indeed, these relations between vertices and edges could be codified as information which could then be used to generate a monoid in a natural way, defined here.
Definition 6
Let be a finite graph, with . The graph monoid of is the free abelian monoid on a generating set , modulo the relations
In a private communication to the author, Enrique Pardo wrote that, with all this information and background as context,
at some moment [early in 2004] one of us suggested that probably Bergman’s coproduct construction would be a good manner of solving the computation and prove that both monoids coincide.
Once some additional necessary machinery was included (the notion of a complete subgraph), then Ara and Pardo, together with Pardo’s colleague Mariangeles Moreno-Frías, had all the ingredients in hand to make the following definition, and prove the subsequent theorem, in [36]. (We state the definition and theorem here only for finite graphs; these results were established for more general graphs in [36], and the general version will be discussed below.)
Definition 7
[36, p. 161] Let be a finite graph, and let be a field. We define the graph-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 that emits edges.
We note that both the terminology used in this definition (“graph algebra”), as well as the notation, is quite similar to the terminology and notation which was already being employed in the context of graph C-algebras.
Theorem 6
(The Ara/Moreno/Pardo Realization Theorem) [36, Theorem 3.5] Let be a finite graph and any field. Then there is a natural monoid isomorphism
By examining the proof of [36, Theorem 3.5], and using Bergman’s Theorem, we can in fact restate this fundamental result as follows.
Theorem 6 (The Ara/Moreno/Pardo Realization Theorem, restated) Letbe a finite graph andany field. Letbe the monoid given by the specific set of generators and relations presented in Definition 6. Letdenote the elementof. Then. Consequently, . Moreover, is hereditary.
In the same groundbreaking article [36], Ara, Moreno, and Pardo were also able to establish a connection between the -monoids of and .
Theorem 7
(The Ara/Moreno/Pardo Monoid Isomorphism Theorem) [36, Theorem 7.1] Let be a finite graph. Then there is a natural monoid isomorphism .
We conclude our discussion of Historical Plot Line #1 in the development of Leavitt path algebras by again quoting Enrique Pardo:
For us the motivation was to give an algebraic framework to all these families of (purely infinite simple) C-algebras associated to combinatorial objects, say Cuntz–Krieger algebras and graph C-algebras. For this reason we always looked at properties that were known incase and were related to combinatorial information: we wanted to know which part of these results relies in algebraic information, and which ones in analytic information. So, we looked at K-Theory, stable rank, exchange property (in C-algebras this is real rank zero property), prime and primitive ideals, the classification problem and Kirchberg–Phillips Theorem
We will visit each of these topics later in the article.
1.4.2 Historical Plot Line #2: Leavitt path algebras as quotients of quiver algebras
The second Historical Plot Line begins with the author’s interest in Leavitt’s algebras, specifically the algebras . For instance, these algebras were used in [1] to produce non-IBN rings having unexpected isomorphisms between their matrix rings; were used again in [2] to solve a question (posed in [79]) about strongly graded rings; and were subsequently investigated yet again in [3], in joint work with P. N. Ánh of the Rényi Institute of Mathematics (Hungarian Academy of Sciences, Budapest).
During a Spring 2001 visit to the University of Iowa, Ánh met the analyst Paul Muhly.Footnote 1 Subsequently, Ánh invited Muhly to give a talk at the Rényi Institute (during a 2003 trip that Muhly and his wife were making to Budapest anyway, to visit their son); it was during this visit that the two mathematicians began to consider the potential for connections between various topics. Muhly was one of the organizers of the May/June 2004 NSF-CBMS conferenceFootnote 2 “Graph Algebras: Operator Algebras We Can See”, delivered by Iain Raeburn, held at the University of Iowa. Muhly consequently extended invitations to attend that conference to the author, to Ánh, and to a handful of other ring theorists.Footnote 3 During conference coffee break discussions, the algebraists began to realize that when one considered the “pre-completion” version of the graph C-algebras, the remaining algebraic structure looked quite familiar, specifically, as some sort of modification of the well-known notion of a quiver algebra or path algebra.
Definition 8
Let be a graph and any field. The path-algebra of (also known as the quiver-algebra of ), denoted , is the -vector space having basis , with multiplication given by the -linear extension of
Gonzalo Aranda Pino visited the author’s home institution for the period July 2004 through December 2004.Footnote 4 Early in Aranda Pino’s visit, the author shared with him some of the ideas which had been discussed in Iowa City during the previous month. A few weeks of collaborative effort subsequently led to the following.
Definition 9
Given a directed graph we define the extended graph of as the graph where , and the functions and are defined by setting , and
Definition 10
Let be a finite graph and any field. The Leavitt path-algebra is defined as the path -algebra , modulo the relations:
-
(CK1)
for every and .
-
(CK2)
for every which is not a sink.
Some of the notation which was developed in the C-algebra context is also used in the Leavitt path algebra world, e.g., the use of the “CK” labels to denote the two key relations. (Cf. Definition 5).
With both Leavitt’s Theorem (part 2 of Theorem 1) and The Simplicity Theorem for graph C-algebras (Theorem 4) in mind, the author and Aranda Pino focused their initial investigation on an internal, multiplicative question about the algebras : for which graphs and fields is simple? Using techniques completely unlike those utilized to achieve Theorem 4, the following result was established. (See Notations 2 and 3 below for definitions of appropriate terms.)
Theorem 8
(The Abrams/Aranda Pino Simplicity Theorem) [7, Theorem 3.11] Let be a finite graph and any field. Then is simple if and only if the only hereditary saturated subsets of are trivial and every cycle in has an exit.
1.4.3 The confluence of the two Historical Plot Lines
By making the obvious correspondences , , and , we see immediately:
For a finite graph and field ,
the graph -algebra of Definition 7 is the same algebra
as the Leavitt path -algebra of Definition 10.
It is of historical interest to note that the work on [7] was started in July 2004. Subsequently, [7] was submitted for publication in September 2004, accepted for publication in June 2005, appeared online in September 2005, and appeared in print in November 2005. On the other hand, the work on [36] was started in early 2004. Subsequently, [36] was submitted for publication in late 2004 (and posted on ArXiV at that time), and accepted for publication in early 2005, but did not appear in print until April 2007. So even though [7] appeared in print eighteen months prior to the appearance in print of [36], in fact most the mathematical work done to produce the latter preceded that of the former.
Both [7] and [36] should be viewed as the foundational articles on the subject.
2 Leavitt path algebras of row-finite graphs: general properties and examples
Section 1 of this article was meant to give the reader an overall view of the motivating ideas which led naturally to the construction of Leavitt path algebras. Over the next three sections we describe some of the key ideas and results for Leavitt path algebras arising from row-finite graphs. Subsequently, in Sect. 5 we relax this hypothesis on the graphs. (For those results which do not extend verbatim to the unrestricted case, we will indicate in the statement that the graph must be row-finite (or finite); otherwise, we will make no such stipulation in the statement.)
Notation 1
A vertex in a graph is called regular in case ; otherwise, is called singular. Specifically, if then is called a sink, while is called an infinite emitter in case is infinite. is called row-finite in case contains no infinite emitters.
Here is the formal definition of a Leavitt path algebra arising from a row-finite graph.
Definition 11
Let be a row-finite graph and any field. Let denote the extended graph of . The Leavitt path-algebra is defined as the path -algebra , modulo the relations:
-
(CK1)
for every and .
-
(CK2)
for every non-sink .
Equivalently, we may define as the free associative -algebra on generators , modulo the relations
-
1.
for all
-
2.
for all
-
3.
for all
-
4.
for all .
-
5.
for every non-sink .
It is established in [97] that the expected map from to is in fact injective. With this and the construction of the graph C-algebra , we get
Proposition 1
For any graph is isomorphic to a dense -subalgebra of
The interplay between graphs and algebras will play a major role in the theory. It is important to note at the outset that in general, if is a subgraph of , then need not correspond to a subalgebra of , because the (CK2) relation imposed at a vertex in need not be the same as the relation imposed at in . For a row-finite graph , a subgraph is said to be complete in case, whenever , then either , or . (In other words, if , then either emits no edges in , or emits the same edges in as it does in .) Perhaps not surprisingly, when is a complete subgraph of , then there is an injection of algebras . Moreover,
Proposition 2
[36, Lemma 3.2] The assignment can be extended to a functor from the category of row-finite graphs and complete graph inclusions to the category of -algebras and not necessarily unital algebra homomorphisms. The functor commutes with direct limits. It follows that every for a row-finite graph is the direct limit of graph algebras corresponding to finite graphs.
Because of Proposition 2, it is often the case that a result which holds for the Leavitt path algebras of finite graphs can be extended to the row-finite case.
Definition 12
Let be any graph and any -algebra. A Leavitt-family in is a subset of for which
-
1.
for all
-
2.
for all
-
3.
for all
-
4.
for all .
-
5.
for every non-sink .
By the description of as a quotient of a free associative -algebra modulo the germane relations given in Definition 11, we immediately get the following result, which often proves to be quite useful in the subject.
Proposition 3
(Universal Homomorphism Property of Leavitt path algebras) Let be a graph and suppose is a Leavitt -family in the -algebra . Then there exists a unique -algebra homomorphism for which and for all and .
Notation 2
A sequence of edges in a graph for which for all is called a path of length. We typically denote such more simply by . Each vertex of is viewed as a path of length . The set of paths of length in is denoted by ; the set of all paths in is denoted . So we have .
For , denotes , denotes , and denotes the set . The path is closed if . A closed path is simple in case for all . Such a simple closed path is said to be based at. A simple closed path is a cycle in case there are no repeats in the list of vertices . is called acyclic in case there are no cycles in .
An exit for a path is an edge for which and for some .
The graph satisfies Condition (L) in case every cycle in has an exit.
The graph satisfies Condition (K) in case no vertex in is the base of exactly one simple closed path in .
If is a path in , then we may view as an element of the path algebra , and as an element of the Leavitt path algebra as well. (In this sense, concatenation in the graph is interpreted as multiplication in or .) We denote by the element of . We often refer to a path of (viewed as an element of ) as a real path, while an element of of the form is called a ghost path. Here are some easily verified basic properties of Leavitt path algebras.
Proposition 4
Let be any graph and any field.
-
1.
Every nonzero element of may be written not necessarily uniquely as
where and with for .
-
2.
For each .
-
3.
The natural -algebra map is a one-to-one homomorphism.
-
4.
is unital with multiplicative identity if and only if is finite. In general has a set of enough idempotents consisting of finite sums of distinct vertices.
-
5.
The map induces an isomorphism . In particular for Leavitt path algebras the categories of left -modules and right -modules are isomorphic.
2.1 Examples of familiar/“known” algebras which arise as Leavitt path algebras
We saw in Sect. 1 how specific algebras arise from Bergman’s Theorem, starting with a specified monoid. We re-examine those here, and present additional examples as well.
Example 2
Full matrix -algebras. Let denote the graph
Then . This is not hard to see. We present two different approaches, in order to play up the germane ideas.
The first approach: consider the standard matrix units in . Since each vertex (other than ) emits a single edge, the (CK2) relation at these vertices becomes . Using this, it is straightforward to verify that the set
is an -family in . So the Universal Homomorphism Property ensures the existence of a -algebra homomorphism for which , , and . That is an isomorphism is easily checked (for instance, by constructing the expected function , and verifying that ).
The second approach: we analyze the monoid , define , and see easily that . With the relations describing , it is clear that Now Theorem 6 applies.
Full matrix rings over arise as the Leavitt path algebras of graphs other than the graphs. In Theorem 9 below we will justify the isomorphisms asserted in the next two examples. These two examples play up the fact that non-isomorphic graphs may have isomorphic Leavitt path algebras. (This observation lies at the heart of much of the current research activity in Leavitt path algebras.)
Example 3
Full matrix -algebras, revisited. For let denote the graph
Then
Example 4
Full matrix -algebras, again revisited. For let denote the graph
Then .
Proceeding in a manner similar to that utilized in Example 2, one can easily establish the following two claims. (See Example 1.)
Example 5
The Laurent polynomial -algebra. Let denote the graph
Then , the Laurent polynomial algebra. The isomorphism is clear: , , and .
Here is the Fundamental Example of Leavitt path algebras.
Example 6
Leavitt -algebras. For , let denote the graph
Then , the Leavitt algebra of order . The isomorphism is clear: using the description of the generators and relations for given in above, , , and .
Example 7
The Toeplitz -algebra. For any field , the Jacobson algebra, described in [70], is the -algebra
This algebra was the first example appearing in the literature of an algebra which is not directly finite, that is, in which there are elements for which but . Let denote the “Toeplitz graph”
Then . The isomorphism is not hard to write down explicitly. First, the set
is easily shown to be a -family in , so by the Universal Homomorphism Property of Leavitt path algebras there exists a -algebra homomorphism for which , , , , , and . On the other hand, we define in . Using (CK1) and (CK2) we get easily that . This gives a -algebra homomorphism , the algebra extension of and . It is easy to check that and are inverses.
Example 8
Full matrix -algebras over . Let be any graph, any field, and . The graph is defined as follows. For each , one adds to the following vertices and edges
where Then . (See [18, Proposition 9.3].)
Example 9
Infinite matrix -algebras. Let be any set. We denote by the set of those matrices , having entries in , for which for at most finitely many pairs . Then is a -algebra, which is unital if and only if is finite (and in this case consists of all matrices having entries in ). When is infinite, then has a set of enough idempotents, consisting of finite sums of distinct matrix units of the form .
If denotes the graph
then .
More generally, for any infinite set , let denote the graph having vertices , and edges , with and for all . Then .
3 Internal/multiplicative properties of Leavitt path algebras
Not surprisingly, a number of the key results in the subject focus on passing structural information from the directed graph to the Leavitt path algebra , and vice versa; i.e., results of the form
The Simplicity Theorem (Theorem 8) is the quintessential result of this type. We will describe a number of additional such results in this section and the next. In the author’s opinion, these results are quite interesting, some even remarkable, in their own right. Just as compellingly, some of these results have been utilized to produce heretofore unrecognized classes of algebras having interesting ring-theoretic properties.
Looking ahead: in contrast, in the next section, we will engage in a discussion of the equally important “external/module-theoretic” properties of Leavitt path algebras. As described in Sect. 1, the “internal/multiplicative” and “external/module-theoretic” properties form the historical foundations of the subject. We will see in the final section that these also drive much of the current investigative energy.
3.1 Finite dimensional Leavitt path algebras
We start by analyzing the Leavitt path algebras of finite acyclic graphs. From a ring-theoretic point of view, these turn out to be the most basic (least interesting?) of all the Leavitt path algebras.
Theorem 9
(Structure Theorem of Leavitt path algebras for finite acyclic graphs) Let be a finite acyclic graph and any field. Let denote the sinks of . At least one sink must exist in any finite acyclic graph. For each , let denote the number of elements of having range vertex . This includes itself as a path of length Then
Sketch of Proof
For each sink consider the ideal of . If have , then . Using the (CK1) relation with the fact that is a sink, one shows easily that the set of elements is a set of matrix units, which yields that That the sum is direct follows by again using the hypothesis that the are sinks. Now let be any monic monomial in . If is a sink, then . Otherwise, the (CK2) relation may be invoked at , and we may write
If is a sink, then the expression is in ; if not, then in the same manner one can use the (CK2) relation at to rewrite . Since is finite and acyclic, the process must terminate with expressions of the desired form.
So for finite acyclic graphs, the resulting Leavitt path algebras are, among other things: unital semisimple; left artinian; and finite dimensional. Indeed, any of these three ring/algebra-theoretic properties characterizes the Leavitt path algebras of finite acyclic graphs, thus yielding three examples of results of type . Perhaps more importantly, Theorem 9 yields a result of the following type: among a certain class of graphs (specifically, finite acyclic), we can determine, using easy-to-compute graph-theoretic properties, which of those graphs yield isomorphic Leavitt path algebras (specifically, those for which the number of sinks, and the corresponding , are equal). So Theorem 9 may be viewed as a very basic type of Classification Theorem.
Notation 3
Let be any graph, and let . We write in case there exists for which and .
Let be a subset of . is called hereditary in case, whenever and and , then . is called saturated in case, whenever is regular and , then . (Less formally: is saturated in case whenever is a non-sink in which emits finitely many edges, and the range vertices of all of those edges are in , then is in as well.)
Clearly both and are hereditary saturated subsets of , and clearly the intersection of any collection of hereditary saturated subsets of is again hereditary saturated. If is any subset of , then denotes the smallest hereditary saturated subset of which contains ; is called the hereditary saturated closure of. (Such exists by the previous observation.)
The interplay between vertices of on the one hand (viewed as idempotent elements of ), and ideals of on the other, plays a central role in the ideal structure of . This connection clearly brings to light the roles of the two (CK) relations in this context.
Proposition 5
Let be any graph and any field. Let be an ideal of . Then is a hereditary saturated subset of .
Proof
Let . If for which there exists with and , then by Proposition 4(2)
in , so that , and thus in . So is hereditary. On the other hand, suppose has the property that is finite, and that for each . But by (CK2)
in , so that , and thus in . So is saturated.
3.2 The -grading, and graded ideals
A -algebra is -graded in case as -vector spaces, in such a way that for all . The subspaces are called the homogeneous components of . The Leavitt path algebras admit a -grading, as follows. Any path -algebra of an extended graph is -graded, by setting for , and , for , and extending additively and multiplicatively. Since the two sets of relations (CK1) and (CK2) consist of homogeneous elements of degree with respect to this grading on , the grading passes to the quotient algebra . In particular, for , the homogeneous component of degree consists of -linear combinations of elements of the form , where , and .
A two-sided ideal in a -graded ring is called a graded ideal in case, whenever and is the decomposition of into homogeneous components, then for each . It is easy to show that if a two-sided ideal in a -graded ring is generated by homogeneous elements of degree , then is a graded ideal. In particular, for any set of vertices , the ideal of is graded. In contrast, not all ideals of a Leavitt path algebra are necessarily graded; for instance, the ideal is not graded, as neither nor is in .
So on the one hand any ideal of gives rise to the hereditary saturated subset of , while on the other, any subset of gives rise to the graded ideal of . The perhaps-expected connection is the following.
Proposition 6
[36, Theorem 5.3] Let be a row-finite graph. Then there is a lattice isomorphism between the lattice of graded ideals of and the lattice of hereditary saturated subsets of :
In particular every graded ideal of is generated by vertices.
Sketch of Proof
It is not hard to show that . On the other hand, if , then by using an explicit, iterative description of the hereditary saturated closure of a set, one can show that .
The connection between these two lattices does not hold verbatim in case contains infinite emitters, as we will see in Sect. 5.
It was shown by Bergman [48] that if is a -graded (unital) ring, then the Jacobson radical is necessarily a graded ideal. (See also [89, Theorem 2.5.40].) Using that contains no nonzero idempotents in any ring , Proposition 6 yields the following nice “internal” result about Leavitt path algebras.
Corollary 1
Let be any graph and any field. Then has zero Jacobson radical.
3.3 Ideals in Leavitt path algebras
In general, loosely speaking, the two key players in the graph which drive the ideal structure of are the vertices, and the cycles without exits. While the hereditary saturated subsets will dictate the graded structure of , the cycles without exits (when contains such) provide additional structural nuances. The following result provides some motivation as to why this should be the case. For an element (with ), and a cycle in the graph , we denote by the element of , where whenever , and .
Theorem 10
(The Reduction Theorem) [42, Proposition 3.1] Let be any graph and any field. Let . Then there exist for which either:
-
1.
for some and or
-
2.
where and is a cycle without exits.
In other words we can transform via multiplication by real paths and/or ghost paths any element of to either a nonzero multiple of a vertex or to a nonzero polynomial in a cycle without exits.
Sketch of Proof
The proof uses an idea similar to the one Leavitt used in his proof of the Simplicity Theorem for [77, Theorem 2]. Essentially, starting with , one shows that there is a path in for which . This is done by finding for which , then writing in a form which minimizes the length of the ghost terms from among all possible representations of , and then applying an induction argument. With this in hand, one then modifies via left multiplication by terms of the form to “reduce” to one of the two indicated forms.
Definition 13
For a hereditary saturated subset of , let denote the set of cycles in for which , and for which for every exit of .
For any subset of , consider a set of noninvertible, nonzero elements of . Let denote the subset of .
For instance, for the Toeplitz graph described in Example 7, let be the (only nontrivial) hereditary saturated subset . Then the cycle is in . For any polynomial , we may form the ideal of generated by the two elements and .
In a similar way, for general graphs, using the data provided by a hereditary saturated subset of , a set of cycles which miss but all of whose exits land in , and nontrivial polynomials in (one for each element of ), we can build an ideal in , namely, the ideal generated by together with elements of of the form . Rephrased, starting with such , we can build the ideal . Indeed, this process gives all the ideals of .
Theorem 11
(Structure Theorem of Ideals) [6, Theorem 2.8.10] Let be a row-finite graph. Then every ideal of is of the form as described above.
Indeed, with not-hard-to-anticipate order relations defined on triples of the form , there is a stronger form of Theorem 11, one which gives a lattice isomorphism between the set of appropriate triples and the lattice of two-sided ideals of .
There are some immediate consequences of Theorem 11. The most noteworthy of these is the Simplicity Theorem (Theorem 8): that is simple if and only if the only hereditary saturated subsets of are and , and every cycle in has an exit. (Of course the chronology here is reversed: the historically-significant Simplicity Theorem precedes the establishment of Theorem 11 by almost a decade.) This is seen quite readily. By Theorem 11, any ideal of looks like . By hypothesis there are only two possibilities for . When then , and therefore , is empty, so that the only ideal of this form is . On the other hand, when , then, as by hypothesis every cycle in has an exit, we get that , and therefore , is empty here as well. So the only ideal of this second form is , and the Simplicity Theorem follows.
Returning yet again to the Toeplitz graph of Example 7, we see as a consequence of Theorem 11 that the complete set of ideals of consists of the three graded ideals , , and , together with the nongraded ideals of the form , where is a polynomial of degree at least for which .
Considering the stronger (admittedly unstated) form of Theorem 11, a second consequence (also a statement of type ) is the following description of the Leavitt path algebras satisfying the chain conditions on two-sided ideals.
Proposition 7
Let be a row-finite graph and any field.
-
1.
has the descending chain condition on two-sided ideals if and only if satisfies Condition K and the descending chain condition holds in the lattice of hereditary saturated subsets of [11, Theorem 3.9].
-
2.
has the ascending chain condition on two-sided ideals if and only if has the ascending chain condition on graded two-sided ideals if and only if the ascending chain condition holds in the lattice of hereditary saturated subsets of . In particular the Leavitt path algebra for every finite graph has the a.c.c. on two-sided ideals [11, Theorem 3.6].
Discussion: The Rosetta Stone.
Of great interest in the study of Leavitt path algebras is the observation that many of the results in the subject seem to (quite mysteriously) mimic corresponding results for graph C-algebras. For example, comparing the Simplicity Theorem for Leavitt path algebras (Theorem 8) with the Simplicity Theorem for graph C-algebras (Theorem 4), we see that the conditions on which yield simplicity of the associated graph algebra are identical in both cases. Suffice it to say that the proofs of the two Simplicity Theorems utilize significantly different tools one from the other. More to the point, even with the close relationship between and in mind (cf. Proposition 1), it is currently not understood as to whether either one of the Simplicity Theorems should “directly” imply the other.
We provide in Appendix 1 a list of additional situations in which an algebraic property of is analogous to a topological property of , and for which the necessary and sufficient graph-theoretic property of is identical in each case. A systematic reason which would explain the existence of so many such examples is usually referred to as the “Rosetta Stone of Graph Algebras”. A good reference which contains in one place a discussion of both Leavitt path algebra and graph C-algebra properties is [45]. We note that even the seemingly most basic of questions, “if as rings, is as C-algebras?” (and its converse), has only been answered (in the affirmative) for restricted classes of graphs; the question in general remains open (see [18]). The search for the Rosetta Stone comprises one of the many current lines of research in the field.
3.4 Matrix rings over the Leavitt algebras
There are too many additional “internal/multiplicative” properties of Leavitt path algebras to include them all in this article. For a number of reasons (its connection to the Rosetta Stone and its important consequences outside of Leavitt path algebras, to name two), we spend some space here describing the Isomorphism Question for Matrix Rings over Leavitt algebras.
We reconsider the Leavitt algebras for , the motivating examples of Leavitt path algebras. Fix and , and let denote . By construction we have as left -modules; so by taking endomorphism rings and using the standard representation of these endomorphism rings as matrix rings, we get as -algebras. Indeed, since for all , we similarly get as -algebras for all . Now starting from a different point of view: once we have established a ring isomorphism for some ring and some , by taking matrix rings of both sides times, we get for any . In particular, we have for all ; indeed, using the previous observation, we have more generally that as -algebras for all .
The question arises: if is isomorphic as -algebras to some matrix ring over itself, must be an integer of the form ? It is not hard to give an example where the answer is negative: one can show (by explicitly writing down matrices which multiply correctly) that has , and is clearly not of the indicated form when . But an analysis of this particular case leads easily to the observation that if for some , then (by an explicitly described isomorphism).
The upshot of the previous observations is the natural question:
The analogous question was posed for matrix rings over the Cuntz algebras in [84]: given , for which is as C-algebras? The resolution of this analogous question required many years of effort. In the end, the solution may be obtained as a consequence of the Kirchberg Phillips Theorem: if and only if . So while the C-algebra question was resolved for matrices over the Cuntz algebras, the solution did not shed any light on the analogous Leavitt algebra question, both because the C-solution required analytic tools, and because it did not produce an explicit isomorphism between the germane algebras.
An easy consequence of [76, Theorem 5] is that, when , then . With this and the Cuntz algebra result in hand, it made sense to conjecture that if and only if . Clearly if for some then , so that the conjecture is validated in this situation. The key idea was to explicitly produce an isomorphism in situations more general than this. The method of attack was clear: one reaches the desired conclusion by finding a subset of of size which both behaves as in , and generates as a -algebra.
The smallest pair for which but for any is the case . Finding a subset of of size which behaves as in is not hard; for instance, by (somewhat) mimicking the process used in the case, one is led to consider these five matrices in
together with their “duals”
Although these ten matrices satisfy , they do not generate all of (in retrospect, one can show that these ten matrices do not generate the matrix unit , for example).
The breakthrough came from a process which involves viewing matrices over Leavitt algebras as Leavitt path algebras for various graphs, and then manipulating the underlying graphs appropriately. This process led to the consideration of the following (very similar, yet) different set of five matrices in
together with their duals
The only differences between the two sets of ten matrices lie in the fifth and tenth matrices, where two of the entries have been interchanged. It is now not hard to show that this second set of ten matrices satisfies , and generates as a -algebra. The underlying idea which prompted the interchange of entries is purely number-theoretic, and is fully described in Appendix 2. In short, the integer is used to partition the set into the subsets ; then, in order to build the first five matrices of this second set, one inserts monomials having left-most factor into row in such a way that and are in the same subset with respect to this partition. So putting the term in row 1 and in row 2 (as is done in the fifth matrix of the first displayed set) will not work; on the other hand, putting in row 1 and in row 2 is consistent with this partition, and leads to a collection with the desired properties. Once this observation was made, the generalization to arbitrary was not overly difficult.
Theorem 12
[5, Theorems 4.14 and 5.12] Let and let be any field. Then
More generally
Moreover when an isomorphism can be explicitly described.
There are two historically important consequences of the explicit construction of the isomorphisms which yield Theorem 12. First, this context is one of the few places where a result from one side of the graph algebra universe yields a result in the other. Specifically, when and , the explicit nature of an isomorphism constructed in the proof of Theorem 12 allows (by a straightforward completion process) for the explicit construction of an isomorphism . (The description of such an explicit isomorphism came as more than a bit of a surprise to some researchers in the C-community.) Second, the explicit construction led to the resolution of a longstanding question in group theory. In the mid 1970’s, G. Higman produced, for each pair with , an infinite, finitely presented simple group, denoted . (The groups are called the Higman–Thompson groups.) Higman was able to establish some sufficient conditions regarding isomorphisms between these groups, but did not have a complete classification. However, in 2011, Enrique Pardo showed how the construction given in the proof of Theorem 12 could be brought to bear in this regard.
Theorem 13
[82, Theorem 3.6]
Sketch of Proof
The () direction was already known by Higman. Conversely, one first shows that can be realized as an appropriate subgroup of the invertible elements of for any . Then one verifies that the explicit isomorphism from to provided in the proof of Theorem 12 takes onto .
For any three positive integers (with ), Brin [51] constructed a group (denoted ) which can be viewed as a -dimensional analog of the Higman–Thompson group, in that . (The groups are called the Brin–Higman–Thompson groups.) On the other hand, for a positive integer and , one may consider the -fold tensor product algebra of with itself times. (We will more fully consider such tensor products in the following subsection.) In [60], Dicks and Martínez-Pérez beautifully generalize Pardo’s Theorem 13 by showing that is isomorphic to an appropriate subgroup of the invertible elements of (specifically, the positive unitaries), and subsequently use this isomorphism to establish that if and only if , , and Along the way, Dicks and Martínez-Pérez present a streamlined, somewhat more intuitive proof of Theorem 12.
3.5 Tensor products of Leavitt path algebras
Of fundamental importance in the theory of graph C-algebras is the fact that (homeomorphically). This isomorphism is not explicitly described; rather, it follows (originally) from some deep work done by Elliott (and streamlined in [88]). The isomorphism is utilized in the proof of the Kirchberg Phillips Theorem. (The C-algebra is nuclear, so that there is no ambiguity in forming this tensor product.)
In the context of the previous paragraph, together with the Rosetta Stone discussion, it is then natural to ask: is ? This question had been posed as early as 2006, and was the focus of sustained investigative effort for a number of years. The resolution of this question in the negative came in early 2011, in the form of three different approaches by three different investigative teams.
The first proof (unpublished), offered by Warren Dicks, utilized a classical result of Cartan and Eilenberg [53, Theorem X1.3.1], which yields that the flat dimension of a tensor product is at least the sum of the flat dimensions of the two algebras. By Theorem 6, the global dimension of (indeed, of any Leavitt path algebra) is at most . (Global dimension at most is equivalent to hereditary.) Consequently, the flat dimension of a Leavitt path algebra equals precisely when is not von Neumann regular (i.e., when there are -modules which are not flat). But it had been shown in [16] that if is a graph containing at least one cycle, then is not von Neumann regular, so, in particular, is not von Neumann regular. So the flat dimension, and therefore also the global dimension, of is at least , so that cannot be a Leavitt path algebra (again using Theorem 6), and so can’t be isomorphic to .
A second proof (unpublished) was offered by Jason Bell and George Bergman. Effectively, Bell and Bergman explicitly constructed a left -module (involving functions on having finite support in of the form ), and showed that the left -module has projective dimension , so that has global dimension at least , and thus (arguing as did Dicks) cannot be isomorphic to any Leavitt path algebra.
The third approach to verifying that is the most general of the three. Utilizing Hochschild homology, Ara and Cortiñas in [28] showed (among many other things) the following, from which the result of interest follows immediately.
Theorem 14
Suppose and are finite graphs each containing at least one cycle and let be any field. If is Morita equivalent to then
Two currently unresolved questions about the tensor products of Leavitt path algebras will be given in Sect. 6.
3.6 Some additional internal/multiplicative properties of Leavitt path algebras
We conclude the section by presenting five additional multiplicative properties of Leavitt path algebras: primeness; the center; Gelfand Kirillov dimension; wreath products; and the simplicity of the corresponding bracket Lie algebra.
A ring is prime in case for any two-sided ideals of , if then or . A graph is called downward directed if, for any two vertices , there exists a vertex for which and .
Theorem 15
[44] Let be any graph and any field. Then is prime if and only if is downward directed.
Sketch of Proof
() If denotes , and , then the ideals and are each nonzero, so that , so that , which yields a nonzero element of the form with , and , so that has the desired property.
() The converse can be proved ‘elementwise’, but it is easier to invoke [80, Proposition 5.2.6(1)], which implies that for a -graded ring, primeness is equivalent to graded primeness. So we need only check that if are nonzero graded ideals, then . But by Proposition 6 (or its generalization Theorem 28 given below), any nonzero graded ideal contains a vertex; so if and , and with and , then .
For a ring , the center. It is well-known that (where denotes the identity matrix in ). Additionally, this easily yields that the center of is . The following result includes these observations as specific cases.
Theorem 16
[41] Let be a row-finite graph. Suppose is simple see Theorem 8). If is finite then . If is infinite then
For a -algebra , the Gelfand-Kirillov Dimension is an algebraic invariant of which, loosely speaking, measures how far is from being finite dimensional. (Finite dimensional algebras have GK dimension . On the other hand, the free associative -algebra on two generators has GK dimension . Such an algebra is said to have exponential growth; otherwise, the algebra has polynomially bounded growth. See e.g. [72] for a full description.) If and are two disjoint cycles (i.e., ), the symbol indicates that there is a path which starts in and ends in . A sequence of disjoint cycles is a chain of length in case . Let denote the maximal length of a chain of cycles in , and let denote the maximal length of a chain of cycles each of which has an exit.
Theorem 17
[21, Theorem 5] Let be a finite graph and any field.
-
1.
has exponential growth if and only if there exist a pair of distinct cycles in which are not disjoint.
-
2.
In case has polynomially bounded growth then the GK dimension of is .
Further results regarding Leavitt path algebras of polynomially bounded growth, and of the automorphism groups of some specific such algebras, are presented in [24].
For a countable dimensional -algebra and ring-theoretic property , an affinization ofwith respect to is an embedding of in a finitely generated (i.e., affine) -algebra , for which, if has , then so does .
Let be a row-finite graph and any associative -algebra. In [20], the authors present the construction of the wreath product, denoted . In case is a hereditary saturated subset of , then the wreath product construction allows for the realization of as the wreath product of two Leavitt path algebras, namely, as . Furthermore, let be the Toeplitz graph of Example 7. Then the wreath product is isomorphic to a -algebra of the form (with multiplication explicitly described). This algebra can then be embedded in an algebra of the form , where is the (unital) ring of those matrices with entries in , for which each row and each column contains at most finitely many nonzero entries. One may then build in a natural way an affine -algebra , generated by four elements, for which .
Theorem 18
[20] For an associative -algebra let be the affine -algebra described above.
-
1.
There exists a unital algebra for which is an affinization of with respect to the property non-nil Jacobson radical.
-
2.
There exists a unital algebra for which is an affinization of with respect to the property non-nilpotent locally nilpotent radical.
Both of the constructs mentioned in Theorem 18 give a systematic approach to what had been previously longstanding ring-theoretic questions.
For a -algebra , the corresponding bracket Lie algebra consists of -linear combinations of elements of the form with . is a Lie algebra, with the usual bracket operation. A Lie algebra is called simple in case , and the only Lie ideals of are and . Let be a finite graph, and write . If is a not a sink, for each let denote the number of edges such that and . In this situation, define (where is the element of which is in the -th coordinate, and zero elsewhere). On the other hand, if is a sink, let
Theorem 19
[15, Theorem 23] Let be a field and let be a finite graph having at least two vertices for which is simple. Write , and for each let be as above. Then the Lie -algebra is simple if and only if .
As it turns out, the condition given in Theorem 19 for the simplicity of depends not only on the structure of but also on the characteristic of (see [15, Examples 28 and 29]). The -dependence of a result about Leavitt path algebras is very much the exception. But for one intriguing additional example, see Theorem 34 and the subsequent discussion.
By introducing and utilizing the notion of a balloon over a subset of , Alahmedi and Alsulami are able to extend Theorem 19 to all row-finite graphs (specifically, the simplicity of is not required); see [23, Theorem 2]. For instance, it is shown in [23] that the graph given here
has the property that the Lie algebra is simple, even though the Leavitt path algebra is not simple.
In related work [22], the same two authors analyze the simplicity of the Lie algebra of -skew-symmetric elements of a Leavitt path algebra.
4 Module-theoretic properties of Leavitt path algebras
The module theory of Leavitt path algebras has for the most part been focused on the structure of the finitely generated projective -modules, owing to the Ara/Moreno/Pardo Realization Theorem (Theorem 6) describing . In this section we take a closer look at the structure of these projectives, specifically, the purely infinite modules. Of central interest here is the question of whether or not the analog of the Kirchberg Phillips Theorem (Theorem 5) holds for Leavitt path algebras; we present in Theorem 23 the Restricted Algebraic KP Theorem. We next look at the structure of some simple (non-projective) -modules. We conclude by considering some monoid-theoretic properties of .
4.1 Purely infinite simplicity
We have seen that the cycle structure of the graph , and the existence of exits for those cycles, is a significant factor driving the algebraic structure of the Leavitt path algebra . We have also seen behavior in the Leavitt algebras that at first glance seems somewhat exotic: as left -modules. Specifically, the module has the property that where ; i.e., that has a nontrivial direct summand which is isomorphic to itself. (Nontrivial here means that the complement of the direct summand is nonzero.) This same sort of behavior is manifest in when has cycles with exits.
Remark 1
Let , and let . Then as left -modules, since, if denotes right multiplication by , then it is easy to show that .
Proposition 8
Suppose is a cycle in a graph based at a vertex and suppose is an exit for with . Then the left -module has a nontrivial direct summand isomorphic to itself.
Proof
Clearly . But the sum is direct: if for , then multiplying both sides on the right by yields That as left -modules follows from the previous Remark. Since is an exit for we have by (CK1). Now to show that the complement is nonzero, assume to the contrary that . Multiplying both sides on the left by gives , thus giving , which is impossible.
A left -module is called infinite in case with . An idempotent is called infinite in case is infinite. The ring is called purely infinite simple in case is simple, and each nonzero left ideal of contains an infinite idempotent. Purely infinite simple rings were first introduced in [35]; the idea was born in the context of C-algebras. Clearly a purely infinite module can satisfy neither of the two chain conditions, nor can it have finite uniform dimension.
With the Simplicity Theorem in hand, and with Proposition 8 as guidance, some medium-level effort yields the following.
Theorem 20
(The Purely Infinite Simplicity Theorem) [8] Let be a row-finite graph and any field. Then is purely infinite simple if and only if is simple and contains at least one cycle.
Theorems 9 and 20 together yield what is typically called the Dichotomy for simple Leavitt path algebras: for simple, either is purely infinite simple, or for some .
In the context of Leavitt path algebras, the purely infinite simple algebras play an especially intriguing role. For any ring , the Grothendieck group is the universal group corresponding to the abelian monoid . (Here universal means that any homomorphism from to an abelian group necessarily factors through .) When (as is often the case in general, e.g., when is a field or ), then one gets , by “adding in the negatives”. As it turns out, however, if is purely infinite simple, then is a group, precisely . This is perhaps counterintuitive at first glance: although has an identity element (namely, ), there still remains an identity element once is eliminated. For instance, if , then . Using this, it’s trivial to conclude that is an identity element for . The group is clearly isomorphic to .
Although the converse is not true for arbitrary rings, when one restricts to the class of Leavitt path algebras, then the converse is true as well [83]: is purely infinite simple if and only if is a group (necessarily ). Moreover, this group is easy to describe in this situation. As is standard, for a finite graph with , the incidence matrix of is the -valued matrix , where equals the number of edges for which and . By interpreting the (CK2) relation as it plays out in , one gets
Proposition 9
Let be a finite graph with . Suppose is purely infinite simple. Then
where denotes the identity matrix.
In other words, when is purely infinite simple, then is the cokernel of the linear transformation induced by matrix multiplication.
As an easy example of how this plays out in an already-familiar situation, suppose , the graph with one vertex and loops. Then , so is the matrix , and , as we’ve seen previously.
4.2 Towards a Classification Theorem for purely infinite simple Leavitt path algebras
In many endeavors in which an object from one class is associated to an object in another, a fundamental question is to identify the stalks of the process; that is, determine which objects from the first class correspond to the same object in the second. Asked in the current context: if two graphs produce the “same” Leavitt path algebra (up to isomorphism, or up to Morita equivalence, or up to some other ring-theoretic invariant), can anything be said about the relationship between and ? As seen in Theorem 9, if and are finite acyclic graphs for which , then and have the same number of sinks, and the same number of directed paths ending at those sinks. (An additional easy consequence of Theorem 9 is that if is Morita equivalent to , then and have the same number of sinks.)
We spend some time here investigating this question in the context of purely infinite simple Leavitt path algebras. The reason is twofold: this investigation plays up an important relationship between Leavitt path algebras and symbolic dynamics, and also provides the foundation for much of the current research focus in Leavitt path algebras. The discussion here will be quite broad and intuitive; for details, the standard reference is [78].
For a finite directed graph , one defines the notion of a “flow” (essentially, “flow of information”) through the graph. Two graphs and are “flow equivalent” in case the collection of flows through match up appropriately with the collection of flows through . Two matrices with entries in are called flow equivalent in case the directed graphs corresponding to the two matrices are flow equivalent. The directed graph (or the corresponding incidence matrix ) is called
-
1.
irreducible if for any pair there is a path from to ;
-
2.
essential if there are neither sources nor sinks in ; and
-
3.
trivial if consists of a single cycle with no other vertices or edges.
A deep, fundamental result in flow dynamics is
Franks’ Theorem [64] Suppose that and are non-negative irreducible essential nontrivial square integer matrices. Then and are flow equivalent if and only if
There are a number of ways to systematically modify a directed graph. As an intuitive example, expansion at modifies the graph to the graph as indicated here.
It can easily be shown that the graphs and are flow equivalent. In a similar manner, one may describe five more systematic modifications of a graph (each having the property that the original graph is flow equivalent to the modified graph): contraction (the inverse of expansion); out-split, as well as its inverse out-amalgamation; and in-split, as well as its inverse in-amalgamation. The specific descriptions of these “graph moves” are given in Appendix 3.
The second deep, fundamental theorem germane to the current discussion is
The Parry/Sullivan Theorem Two finite directed graphs are flow equivalent if and only if one can be gotten from the other by a sequence of transformations involving these six graph moves.
Combining Franks’ Theorem with the Parry/Sullivan Theorem, we get
Theorem 21
Suppose and are irreducible essential nontrivial graphs. Then if and only if can be obtained from by some sequence of graph moves with each move one of the six types described above.
We are now in position to present the (miraculous?) bridge between the ideas from flow dynamics and those of Leavitt path algebras. First, using the Purely Infinite Simplicity Theorem (Theorem 20) and some straightforward graph theory, it is not hard to show that is irreducible, essential, and nontrivial if and only if has no sources and is purely infinite simple. Next,
Proposition 10
Suppose is a graph for which is purely infinite simple. Suppose is gotten from by doing one of the six aforementioned graph moves. Then and are Morita equivalent. In particular is purely infinite simple. In addition if is a source in and is gotten from by eliminating and all edges having then and are Morita equivalent.
Sketch of Proof
It is not hard to show that an isomorphic copy of can be viewed as a (necessarily full, by simplicity) corner of (or vice-versa), where and are related by one of the graph moves.
The previous discussion yields the first of two desired results.
Theorem 22
Let and be finite graphs and any field. Suppose and are purely infinite simple. If
then and are Morita equivalent.
Sketch of Proof
Suppose and/or have sources; then using Proposition 10 we may construct graphs and for which and are purely infinite simple, is Morita equivalent to , and is Morita equivalent to , where and have no sources. But since Morita equivalent rings have isomorphic groups, and because (it’s straightforward to show that) and , we have that the hypotheses of Theorem 21 are satisfied for and . Thus can be gotten from by a sequence of appropriate graph moves. But again invoking Proposition 10, each of these moves preserves Morita equivalence. So is Morita equivalent to , and the result follows.
The third deep, fundamental result of interest here is
Huang’s Theorem Suppose is Morita equivalent to . Further, suppose there is some isomorphism for which . Then there is some Morita equivalence for which
Consequently:
Theorem 23
(The Restricted Algebraic Kirchberg Phillips Theorem) [13, Corollary 2.7] Let and be finite graphs and any field. Suppose and are purely infinite simple. If
then .
Sketch of Proof
For any Morita equivalence , if , then as rings. Now apply Theorem 22 together with Huang’s Theorem.
As an example of how the Restricted Algebraic KP Theorem can be implemented, let be the graph
Then using the description provided in Proposition 9, we get ; moreover, under this isomorphism, . Easily we get . But the Leavitt path algebra has precisely the same data associated with it, so we conclude that
In Sect. 6 we describe how the Restricted Algebraic Kirchberg Phillips Theorem has been acting as a springboard for much of the current research energy in the subject.
4.3 Simple -modules
We now move our focus on -modules from projectives to simples.
Let be an infinite path in; that is, is a sequence , where for all , and for which for all . (N.b.: an infinite path in is not an element of , nor of the Leavitt path algebra .) The set of infinite paths in is denoted by . For and , denotes the infinite path
Let be a closed path in . Then is an infinite path in , denoted by , and called a cyclic infinite path. A closed path is irreducible in case cannot be written as for any closed path and . For any closed path there exists an irreducible for which ; then as elements of .
For , and are tail equivalent (written ) in case there exist integers for which (i.e., in case and eventually become the same infinite path). For , denotes the equivalence class of . An element of is rational in case for some irreducible closed path ; otherwise is irrational. For instance, in
is an irrational infinite path. In any graph for which there exists a vertex having two distinct irreducible closed paths based at that vertex, it is not hard to show that there are uncountably many irrational infinite paths in . Additionally, there are infinitely many irreducible paths in such a situation (and thus infinitely many tail-inequivalent infinite rational paths); for instance, any path of the form for is irreducible in .
Definition 14
Let be an infinite path in the graph , and let be any field. Let denote the -vector space having basis , consisting of the distinct elements of which are tail-equivalent to . For , , and , define
Then the -linear extension of this action to all of gives a left -module structure on .
Theorem 24
[54, Theorem 3.3] Let be any graph and any field. Let . Then the left -module described in Definition 14 is simple. Moreover if then as left -modules if and only if which happens precisely when
A module of the form as in Theorem 24 is called a Chen simple-module. In [39], Ara and Rangaswamy describe those Leavitt path algebras which admit at most countably many simple left modules (Chen simples or otherwise) up to isomorphism. Building on an observation made prior to Definition 14, one sees that the structure of plays a role in this result, in that when has this property, and contains cycles, then necessarily must be countable.
It is possible to explicitly describe projective resolutions for the Chen simple modules. Let or . For each (and if ), let and let be the left ideal of . The following explicit description of projective resolutions of Chen simple modules follows from an elementwise analysis of the kernel of the appropriate right-multiplication map. (For an element in a left -module , and any left ideal of , denotes right multiplication by .)
Theorem 25
[14] Let be any graph and any field.
-
1.
Let be an irreducible closed path in with Then is finitely presented in fact singly presented a projective resolution of is given by
-
2.
Let be an irrational infinite path in for which no element of is an infinite emitter. Then
is a projective resolution of . In particular is finitely presented if and only if is nonempty for at most finitely many .
Theorem 25 sharpens and clarifies some of the results of [38]. The explicit description of projective resolutions given in Theorem 25 can be used to (easily) show that is never projective, and that (for irrational) is not projective when is not finitely presented (e.g., whenever is a finite graph). Consequently, these two types of modules admit nontrivial extensions, some of which are captured in the following result.
Theorem 26
[14] Let be a finite graph and any field. Let be a Chen simple module. Denote by the set For denote by the set .
-
1.
Let be an irreducible closed path in with . Then if and only if
-
2.
Let be an irrational infinite path in . Then if and only if for infinitely many .
As a consequence of Theorem 26, whenever is a graph containing at least one cycle, then (non-projective) indecomposable -modules of any desired finite length can be constructed.
We close this subsection on simple -modules by noting that Rangaswamy [87] has given a construction of such modules arising from the infinite emitters of .
4.4 Additional module-theoretic properties of
The previous discussion in this section first focused on projective modules, then on non-projective simple modules, over Leavitt path algebras. We conclude the section by mentioning some monoid-theoretic properties of . As the -monoid of a ring, is of course conical, and contains a distinguished element (as described prior to Theorem 2). But there are two important additional properties of , both of which yield information about the decomposition of projective -modules.
Suppose that is a left -module which admits two direct sum decompositions . We ask whether there is necessarily some relationship between the two decompositions, indeed, whether there is some compatible “refinement” of these which allows for the systematic formation of each of the summands. More formally, suppose as left -modules. Then a refinement of this pair of direct sums consists of left -modules and , for which:
A second type of decomposition of modules relates to cancellation of direct summands. Clearly in general an isomorphism of left -modules need not imply . A germane example here is this: if , and , , and , then we have (since ), but obviously . In various situations it is natural to require a stronger relationship between such isomorphic direct sums, prior to trying to cancel . One possible approach is as follows. A ring is called separative in case it satisfies the following property: If satisfy , and is isomorphic to direct summands of both and for some , then . (Note that this additional condition obviously renders moot the previous example.)
Theorem 27
Let be a row-finite graph and any field.
-
1.
[36, Proposition 4.4] The monoid is a refinement monoid. Consequently is a refinement monoid.
-
2.
[36, Theorem 6.3] The monoid is separative. Consequently the monoid and thus the ring is separative.
Sketch of Proof
(1) is established by a careful analysis of the generators and relations which produce the graph monoid . On the other hand, (2) follows in part from results of Brookfield [52] on primely generated refinement monoids.
In fact, the class of primely generated refinement monoids satisfies many other nice cancellation properties, e.g. unperforation. We will revisit refinement monoids at the end of Sect. 6.
5 Classes of algebras related to, or motivated by, Leavitt path algebras of row-finite graphs
Historically, Leavitt path algebras were first defined only in the context of row-finite graphs. Subsequently, the more general definition of Leavitt path algebras for countable graphs [9], and then truly arbitrary graphs [66], appeared in the literature. The original notion of a Leavitt path algebra for row-finite graphs has been generalized in other ways as well, including: the construction of Leavitt path algebras for separated graphs; Cohn path algebras; Kumjian–Pask algebras of higher ranks graphs; Leavitt path rings; and more. In this section we give an overview of some of these Leavitt-path-algebra-inspired structures.
5.1 Leavitt path algebras for arbitrary graphs.
Suppose is a graph which contains an infinite emitter ; that is, the set is infinite. Then in a purely ring-theoretic context, the symbol , which would be the natural generalization of the (CK2) relation imposed at , is not defined. Even in the analytic context of graph C-algebras, where convergence properties might allow for some sort of appropriate interpretation of an infinite sum, an expression of the form proves to be problematic, in part owing to the fact that is an infinite set of orthogonal projections.
So, somewhat cavalierly, we simply choose not to invoke any (CK2)-like relation at infinite emitters. We recall that a vertex is regular in case .
Definition 15
Let be any graph, and any field. Let denote the extended graph of . The Leavitt path-algebra is defined as the path -algebra , modulo the relations:
-
(CK1)
for all .
-
(CK2)
for every regular vertex .
Equivalently, we may define as the free associative -algebra on generators , modulo the relations
-
1.
for all
-
2.
for all
-
3.
for all
-
4.
for all .
-
5.
for every regular .
So the definition of a Leavitt path algebra for arbitrary graphs is essentially word-for-word identical to that for row-finite graphs (since “regular” and “non-sink” are identical properties in the row-finite case); there is simply no (CK2) relation imposed at any vertex which is the source vertex of infinitely many edges.
The generalization from Leavitt path algebras of row-finite graphs to those of arbitrary graphs was achieved in two stages. Owing to the hypotheses typically placed on the corresponding graph C-algebras (in order to ensure separability), the initial extension for Leavitt path algebras was to graphs having countably many vertices and edges. It is shown in [9] that the Leavitt path algebra of any such countable graph is Morita equivalent to the Leavitt path algebra of a suitably defined row-finite graph, using the desingularization process. Subsequently, the foundational results regarding Leavitt path algebras for arbitrary graphs were presented in [66]. Among other things, Goodearl established a suitable definition and context for morphisms between graphs (so-called CK-morphisms). He was then able to show that direct limits exist in the appropriately defined graph category (denoted CKGr), and that the functor from CKGr to the category of -algebras preserves direct limits.
The generalization to Leavitt path algebras of arbitrary graphs (from those of row-finite graphs) indeed expands the Leavitt path algebra universe. For instance, it was shown in [17] that is Morita equivalent to for some row-finite graph if and only if contains no uncountable emitters (i.e., in case the set is at most countable for each ). So, for instance, let be an uncountable set, and let denote the graph consisting of two vertices , and edges , where and . Then is isomorphic to the (unital) -algebra generated by , where is the identity matrix. So is not Morita equivalent (let alone, isomorphic) to the Leavitt path algebra of any row-finite graph. Similarly, if denotes the “rose with uncountably infinitely many petals” graph, then is not Morita equivalent to for any row-finite graph .
In this expanded universe of Leavitt path algebras for arbitrary graphs, many of the results established in the row-finite case generalize verbatim, but many do not. One of the main differences is that in the general case, we may pick up many new idempotents inside for which there are no counterparts in the row-finite case. For instance, let , and let . Then the element of is easily shown to be an idempotent. If is a regular vertex, then by the (CK2) relation. On the other hand, if is an infinite emitter, then has no such analogous representation.
We recall the graph-theoretic ideas given in Notation 3: a subset of is hereditary in case, whenever and and , then ; is saturated in case, whenever is regular and , then .
Definition 16
Let be any graph, and let be a hereditary subset of . A vertex is a breaking vertex of in case is in the set
In words, consists of those vertices which are infinite emitters, which do not belong to , and for which the ranges of the edges they emit are all, except for a finite (but nonzero) number, inside . For , define
and, for any subset , define .
Of course a row-finite graph contains no breaking vertices, so that this concept does not play a role in the study of Leavitt path algebras arising from such graphs. Also, we note that both and are empty. To help clarify the concept of breaking vertex, we offer the following example.
Example 10
The infinite clock. Let denote the infinite clock graph
Let denote the set . Any subset of is a hereditary subset of . We note also that, since saturation applies only to regular vertices, any subset of is saturated as well.
If has infinite, or if , then . On the other hand, if is finite, then , and in this situation, .
It is clear that for any hereditary saturated subset of a graph , and for any , the ideal is a graded ideal, as it is generated by elements of of degree zero. It turns out that this process generates all the graded ideals of . We denote by the collection of two-sided graded ideals of , and by the collection of pairs where is a hereditary saturated subset of , and .
Theorem 28
[97, Theorem 5.7] Let be an arbitrary graph and any field. Then there is a bijection where for . The inverse is given by
There is an appropriate lattice structure which can be defined in so that the map is a lattice isomorphism. In addition, there is a generalization of Theorem 28 to the lattice of all ideals of , see [6, Theorem 2.8.10].
We close the subsection by presenting a result which is of interest in its own right (it provided a systematic approach to answering a decades-old question of Kaplansky), and which will reappear later in the context of the Rosetta Stone. An algebra is called left primitive in case admits a faithful simple left module. It was shown in [44] that for row-finite graphs, is primitive if and only if is downward directed and satisfies Condition (L). However, the extension of this result to arbitrary graphs requires an extra condition. The graph has the Countable Separation Property in case there exists a countable set with the property that for every there exists for which .
Theorem 29
[10, Theorem 5.7] Let be an arbitrary graph and any field. Then is primitive if and only if is downward directed satisfies Condition L and has the Countable Separation Property.
5.2 Leavitt path algebras of separated graphs
The (CK2) condition imposed at any regular vertex in the definition of a Leavitt path algebra may be modified in various ways. Such is the motivation for the discussion in both this and the following subsection. All of these ideas appear in [31].
In the (CK2) condition which appears in the definition of the Leavitt path algebra , the edges emanating from a given regular vertex are treated as a single entity, and the relation is imposed. More generally, one may partition the set into disjoint nonempty subsets, and then impose a (CK2)-type relation corresponding exactly to those subsets. More formally, a separated graph is a pair , where is a graph, , and, for each , is a partition of (into pairwise disjoint nonempty subsets). (In case is a sink, is taken to be the empty family of subsets of .)
Definition 17
Let be any graph and any field. Let denote the extended graph of , and the path -algebra of . The Leavitt path algebra of the separated graphwith coefficients in the field is the quotient of by the ideal generated by these two types of relations:
-
(SCK1)
for each , for all , and
-
(SCK2)
for each non-sink , for every finite .
So the usual Leavitt path algebra is exactly , where each is defined to be the subset if is not a sink, and otherwise. Leavitt path algebras of separated graphs include a much wider class of algebras than those which arise as Leavitt path algebras in the standard construction. For instance, the algebras of the form for originally studied by Leavitt in [76] do not arise as for any graph . On the other hand, as shown in [31, Proposition 2.12], () appears as a full corner of the Leavitt path algebra of an explicitly described separated graph (having two vertices and edges). In particular, is Morita equivalent to the Leavitt path algebra of a separated graph.
Of significantly more importance is the following Bergman-like realization result, which shows that the collection of Leavitt path algebras of separated graphs is extremely broad.
Theorem 30
[31, Section 4] Let be any conical abelian monoid. Then there exists a graph and partition for which .
Consequently, need not share the separativity nor the refinement properties of the standard Leavitt path algebras . Furthermore, the ideal structure of is in general significantly more complex than that of , but a description of the idempotent-generated ideals can be achieved (solely in terms of graph-theoretic information).
5.3 Cohn path algebras
In the previous subsection we saw one way to modify the (CK2) relation, namely, by imposing it on subsets of for .
A second way to modify the (CK2) relation is to simply eliminate it.
Definition 18
Let be any graph and any field. The Cohn path algebra is the path -algebra of the extended graph of , modulo the relation
-
(CK1)
for each .
The terminology “Cohn path algebra” postdates the Leavitt path algebra terminology, and owes to the fact that for each , the algebra (for the rose with petals graph) is precisely the algebra described and investigated by Cohn in [55].
Indeed, even the case is of interest here: is the unital -algebra generated by an element for which (and no other relation involving ). Thus we get that is exactly the Jacobson algebra described in Example 7, so that (using the computation presented in that Example), we have , the Leavitt path algebra of the Toeplitz graph. Pictorially,
This isomorphism between a Cohn path algebra and a Leavitt path algebra is not a coincidence.
Theorem 31
[6, Section 1.5] Let be any graph. Then there exists a graph which is explicitly constructed from for which . That is every Cohn path algebra is isomorphic to a Leavitt path algebra.
In particular, the explicit construction mentioned in Theorem 31 of the graph from the graph in case yields that . So although at first glance the Cohn path algebra construction seems less restrictive than the Leavitt path algebra construction, the collection of algebras which arise as is (properly) contained in the collection of algebras which arise as . (One way to see that the containment is proper is to note that the Cohn path algebra has Invariant Basis Number for any finite graph ; see [12].)
One may view the Leavitt path algebras and Cohn path algebras as occupying the opposite ends of a spectrum: in the former, we impose the (CK2) relation at all (regular) vertices, while, in the latter, we do not impose it at any of the vertices. The expected middle-ground construction may be formalized: if is any subset of the regular vertices of , then the Cohn path-algebra relative to, denoted , is the algebra , modulo the (CK2) relation imposed only at the vertices . So , while . Theorem 31 generalizes appropriately from Cohn path algebras to relative Cohn path algebras.
5.4 Additional constructions
We close this section with a description of four additional Leavitt-path-algebra-inspired constructions.
Cohn–Leavitt algebras. The following (not unexpected) mixing-and-matching of the Leavitt path algebras of separated graphs with the relative Cohn path algebras has been defined and studied in [31].
Definition 19
Let be a separated graph. Let denote the subset of consisting of those for which is finite. Let be any subset of . Denote by the quotient of the path -algebra , modulo the relations (SCK1) of Definition 17, together with the relations (SCK2) for the sets . is called the Cohn–Leavitt algebra of the triple.
Kumjian–Pask algebras. Any directed graph may be viewed as a category ; the objects of are the vertices , and, for each pair , the morphism set consists of those elements of having source and range . Composition is concatenation. As well, the set is a category with one object, and morphisms given by the elements of , where composition is addition. In this level of abstraction, the length map is a functor, which satisfies the following factorization property: if and , then there are unique such that , and . Conversely, we may view a category as the morphisms of the category, where the objects are identified with the identity morphisms. Then any category which admits a functor having the factorization property can be viewed as a directed graph in the expected way.
With these observations as motivation, one defines a higher rank graph, as follows.
Definition 20
Let be a positive integer. View the additive semigroup as a category with one object, and view a category as the morphisms of the category, where the objects are identified with the identity morphisms. A graph of rank (or simply a -graph) is a countable category , together with a functor , which satisfies the factorization property: if and for some , then there exist unique such that , and . (So the usual notion of a graph is a -graph in this more general context.)
Given any -graph and field , one may define the Kumjian–Pask-algebra . (We omit the somewhat lengthy details of the construction; see [40] for the complete description.) In case , is the Leavitt path algebra .
The regular algebra of a graph. The following construction should be viewed not as a method to generalize the notion of Leavitt path algebra, but rather to use the properties of Leavitt path algebras as a tool to answer what at first glance seems to be an unrelated question. The “Realization Problem for von Neumann Regular Rings” asks whether every countable conical refinement monoid can be realized as the monoid for some von Neumann regular ring . It was shown in [16] that the only von Neumann regular Leavitt path algebras are those associated to acyclic graphs, so it would initially seem that Leavitt path algebras would not be fertile ground in the context of the Realization Problem. Nonetheless, Ara and Brustenga developed an elegant construction which provides the key connection. Using the algebra of rational power series on, and appropriate localization techniques (inversion), they showed how to construct a -algebra with the following properties.
Theorem 32
[26, Theorem 4.2] Let be a finite graph and any field. Then there exists a -algebra for which:
-
1.
there is an inclusion of algebras
-
2.
is unital von Neumann regular and
-
3.
.
Consequently, using the Realization Theorem (Theorem 6), Theorem 32 yields that any monoid which arises as the graph monoid for a finite graph has a positive solution to the Realization Problem. This result represented (at the time) a significant broadening of the class of monoids for which the Realization Problem had a positive solution. The result extends relatively easily to row-finite graphs (see [26, Theorem 4.3]), with the proviso that need not be unital in that generality.
Non-field coefficients. While nearly all of the energy expended on understand has focused on the graph , one may also relax the requirement that the coefficients be taken from a field . For a commutative unital ring and graph one may form the path ringofwith coefficients in in the expected way; it is then easy to see how to subsequently define the Leavitt path ringofwith coefficients in. While some of the results given when is a field do not hold verbatim in the more general setting (e.g., the Simplicity Theorem), one can still understand much of the structure of in terms of the properties of and ; see e.g. [98].
With these many generalizations of Leavitt path algebras having now been noted, a comment on the extremely robust interplay between algebras and C-algebras is in order. In some situations, the C-ideas preceded the algebra ideas; in other situations, the opposite; and in still others, the ideas were introduced simultaneously.
-
Leavitt [76] built the Leavitt algebras (1962); subsequently, Cuntz [56] built their C-counterparts, the Cuntz algebras (1977). (Cuntz’s results were achieved independently from the work of Leavitt.)
-
Graph C-algebras of row-finite graphs were then introduced in [47] (2000); these in turn motivated the definition of Leavitt path algebras of row-finite graphs in [7] and [36] (2005).
-
Graph C-algebras of countable graphs which contain infinite emitters were introduced in [63] (2000); these motivated the definition of Leavitt path algebras of such graphs in [9] (2006).
-
Leavitt path algebras for arbitrary graphs were first given complete consideration in [66] (2009). The initial study of C-algebras corresponding to arbitrary graphs appears in [18] (2013), where this notion was utilized to give the first systematic construction of C-algebras which are prime but not primitive.
-
C-algebras of higher rank graphs were formalized in [73] (2000); the corresponding Kumjian–Pask algebras were introduced in [40] (2014).
-
In the context of separated graphs, both Leavitt path algebras and graph C-algebras of these objects were introduced essentially simultaneously in the articles [30] (2011), and [31] (2012).
6 Current lines of research in Leavitt path algebras
In the previous five sections we have given an overview of the subject of Leavitt path algebras. In this final section we consider some of the important current research problems in the field. For additional information, see “The graph algebra problem page”:
www.math.uh.edu/tomforde/GraphAlgebraProblems/ListOfProblems.html
This website was built and is being maintained by Mark Tomforde of the University of Houston.
We have previously discussed the (currently unresolved) Rosetta Stone Question for graph algebras. More information about the Rosetta Stone is presented in Appendix 1.
6.1 The Classification Question for purely infinite simple Leavitt path algebras, a.k.a. The Algebraic Kirchberg Phillips Question
We start with what is generally agreed to be the most compelling unresolved question in the subject of Leavitt path algebras, stated concisely as:
The Algebraic Kirchberg Phillips Question:
Can we drop the hypothesis on the determinants in Theorem 23?
More formally, the Algebraic KP Question is the following “Classification Question”. Let and be finite graphs, and any field. Suppose and are purely infinite simple. If via an isomorphism for which is it necessarily the case that ?
The name given to the Question derives from the previously mentioned Kirchberg Phillips Theorem for C-algebras (see the discussion prior to Theorem 5), which yields as a special case that if and are finite graphs, and if and are purely infinite simple graph C-algebras with via an isomorphism for which then (homeomorphically). In particular, the determinants of the appropriate matrices play no role.
Intuitively, the Question asks whether or not the integer can be “seen” or “recovered” inside as an isomorphism invariant. There is indeed a way to interpret in terms of the cycle structure of , see e.g. [92]; but this interpretation has not (yet?) been useful in this context.
With the Restricted Algebraic Kirchberg Phillips Theorem having been established, there are three possible answers to the Algebraic Kirchberg Phillips Question:
No. That is, if the two graphs and have , then for any field .
Yes. That is, the existence of an isomorphism of the indicated type between the groups is sufficient to yield an isomorphism of the associated Leavitt path algebras, for any field .
Sometimes. That is, for some pairs of graphs and , and/or for some fields , the answer is No, and for other pairs the answer is Yes.
One of the elegant aspects of the Algebraic KP Question is that its answer will be interesting, regardless of which of the three possibilities turns out to be correct. If the answer is No, then isomorphism classes of purely infinite simple Leavitt path algebras will match exactly the flow equivalences classes of the germane set of graphs, which would suggest that there is some deeper, as-of-yet-not-understood connection between the two subjects. If the answer is Yes, this would yield further compelling evidence for the existence of a Rosetta Stone, since then the Leavitt path algebra and graph C-algebra results would be exactly analogous. If the answer is Sometimes, then (in addition to providing quite a surprise to those of us working in the field) this would likely require the development and utilization of a completely new set of tools in the subject. (Indeed, the Sometimes answer might be the most interesting of the three.)
Using a standard tool (the Smith Normal Form of an integer-valued matrix), it is not hard to show that the cardinality of the group is in case is finite, and the cardinality is infinite precisely when So the Algebraic KP Question admits a somewhat more concise version: If the signs of and are different, is it the case that ?
The analogous question about Morita equivalence asks whether or not we can drop the determinant hypothesis from Theorem 22. But the two questions will have the same answer: if isomorphic groups yields Morita equivalence of the Leavitt path algebras, then the Morita equivalence together with Huang’s Theorem will yield isomorphism of the algebras.
Suppose is a finite graph for which is purely infinite simple. There is a way to associate with a graph , for which is purely infinite simple, for which , and for which . This is called the “Cuntz splice” process, which appends to a vertex two additional vertices and six additional edges, as shown here pictorially:
Although the isomorphism between and need not in general send to , the Cuntz splice process allows us an easy way to produce many specific examples of pairs of Leavitt path algebras to analyze in the context of the Algebraic KP Question. The most “basic” pair of such algebras arises from the following two graphs:
We note that It is not hard to establish that
Is ?
Here is an alternate approach to establishing the (analytic) Kirchberg Phillips Theorem (Theorem 5) in the limited context of graph C-algebras. Using the same symbolic-dynamics techniques as those used to establish Theorem 23, one can establish the C-version of the Restricted Algebraic Kirchberg Phillips Theorem (i.e., one which involves the determinants). One then “crosses the determinant gap” for a single pair of algebras, by showing that ; this is done using a powerful analytic tool (KK-theory). Finally, again using analytic tools, one shows that this one particular crossing of the determinant gap allows for the crossing of the gap for all germane pairs of graph C-algebras. But neither KK-theory, nor the tools which yield the extension from one crossing to all crossings, seem to accommodate analogous algebraic techniques.
The pair can appropriately be viewed as the “smallest” pair of graphs of interest in this context, as follows. We say a graph has Condition (Sing) in case there are no parallel edges in the graph (i.e., that the incidence matrix consists only of ’s and ’s). It can be shown that, up to graph isomorphism, there are 2 (resp., 34) graphs having two (resp., three) vertices, and having Condition (Sing), and for which the corresponding Leavitt path algebras are purely infinite simple. (See [4].) For each of these graphs , . So finding an appropriate pair of graphs with (Sing) and with unequal (sign of the) determinant requires at least one of the two graphs to contain at least four vertices.
To the author’s knowledge, no Conjecture regarding what the answer to the Algebraic KP Question should be has appeared in the literature.
6.2 The Classification Question for graphs with finitely many vertices and infinitely many edges
We consider now the collection of those graphs having finitely many vertices, but (countably) infinitely many edges, and for which is (necessarily unital) purely infinite simple. The Purely Infinite Simplicity Theorem (Theorem 20) extends to this generality, so we can fairly easily determine whether or not a given graph is in . Unlike the case for finite graphs, a description of for cannot be given in terms of the cokernel of an integer-valued matrix transformation from to . Nonetheless, there is still a relatively easy way to determine , so that this group remains a useful player in this context.
For a graph let denote the set of singular vertices of , i.e., the set of vertices which are either sinks, or infinite emitters. Ruiz and Tomforde in [90] achieved the following.
Theorem 33
Let . If and then is Morita equivalent to .
So, while “the determinant of ” is clearly not defined here in the usual sense (because at least one of the entries would be the symbol ), the isomorphism class of together with the number of singular vertices is enough information to determine Morita equivalence. Although this is quite striking, it is not completely satisfying, in that it remains unclear whether or not is an algebraic property of .
Continuing the search for a Classification Theorem which is cast completely in terms of algebraic properties of the underlying algebras, the authors were able to show that for a certain type of field (those with no free quotients), there is such a result. In a manner similar to the computation of for , there is a way to easily compute as well.
Theorem 34
[90, Theorem 7.1] Suppose and suppose that is a field with no free quotients. Then is Morita equivalent to if and only if and .
The collection of fields having no free quotients includes algebraically closed fields, , finite fields, perfect fields of positive characteristic, and others. However, the field is not included in this list. Indeed, the authors in [90, Example 10.2] give an example of graphs for which and , but is not Morita equivalent to . There are many open questions here. For instance, might there be an integer for which, if for all , then and are Morita equivalent for all fields ? Of note in this context is that, unlike the situation for graph C-algebras (in which “Bott periodicity” yields that and are the only distinct -groups), there is no analogous result for the -groups of Leavitt path algebras. Further, although a long exact sequence for the -groups of has been computed in [27, Theorem 7.6], this sequence does not yield easily recognizable information about for .
Finally, a recent intriguing result presented in [65] demonstrates that, if is a finite extension of , then the pair consisting of () provides a complete invariant for the Morita equivalence classes of Leavitt path algebras arising from graphs in , while none of the pairs for provides such.
6.3 Graded Grothendieck groups, and the corresponding Graded Classification Question
The Algebraic Kirchberg Phillips Question, motivated by the corresponding C-algebra result, is not the only natural classification-type question to ask in the context of Leavitt path algebras. Having in mind the importance that the -grading on has been shown to play in the multiplicative structure, Hazrat in [68] has built the machinery which allows for the casting of an analogous question from the graded point of view.
There is a very well developed theory of graded modules over group-graded rings, see, e.g., [80]. (The theory is built for all groups, and is particularly robust in case the group is , the case of interest for Leavitt path algebras.) If is a -graded ring and is a left -module, then is graded in case , and whenever and . If is a -graded -module, and , then the suspension module is a graded -module, for which as -modules, with -grading given by setting for all .
In a standard way, one can define the notion of a graded finitely generated projective module, and subsequently build the monoid of isomorphism classes of such modules, with as operation. If , then for each , which yields a -action on . In a manner analogous to the non-graded case, one may define the graded Grothendieck group for each . Each of these groups becomes a -module, via the suspension operation.
From this graded-module point of view, one can now ask about structural information of the -graded -algebra which might be gleaned from the groups. A reasonable initial question might be to see whether the graded version of the Kirchberg Phillips Theorem holds. That is, suppose that and are finite graphs for which and are purely infinite simple, and suppose as -modules, via an isomorphism which takes to . Is it necessarily the case that as -graded -algebras?
As it turns out, the purely infinite simple hypothesis is not the natural one to start with in the graded context. In fact, Hazrat in [68] makes the following Conjecture, which at first glance might seem somewhat audacious.
Conjecture 1
Let and be any pair of finite graphs. Then as -graded -algebras if and only if as -modules, via an order-preserving isomorphism which takes to .
So Hazrat’s conjecture, slightly rephrased, asserts that the graded (viewed with the -module structure induced by the suspension operation), together with the natural order and position of the regular module, is a complete graded isomorphism invariant for the collection of all Leavitt path algebras over row-finite graphs. (The order on is induced by viewing the nonzero elements of as the positive elements. The order on plays no role in purely infinite simple rings, because every nonzero element of is positive in that case.)
In [68, Theorem 4.8], Hazrat verifies Conjecture 1 in case the graphs and are polycephalic (essentially, mixtures of acyclic graphs, or graphs which can be described as “multiheaded comets” or “multiheaded roses” in which the cycles and/or roses have no exits.)
As mentioned in the Historical Plot Line #1, in work that predates the introduction of the general definition of Leavitt path algebras the four authors of [29] investigated the notion of a fractional skew monoid ring, which in particular situations is denoted . Recast in the language of Leavitt path algebras, the discussion in [29, Example 2.5] yields that, when is an essential graph (i.e., has no sinks or sources), then for suitable elements , and a corner-isomorphism of the zero component .
When is a finite graph with no sinks, then is strongly graded [69, Theorem 2], which yields (by a classical theorem of Dade) that the category of graded modules over is equivalent to the category of (all) modules over the zero component . Thus, when has no sinks, we have reason to expect that the zero component might play a role in the graded theory. In a deep result (which relies heavily on ideas from symbolic dynamics), Ara and Pardo [37, Theorem 4.1] prove the following modified version of Conjecture 1.
Theorem 35
Let and be finite essential graphs. Write as described above. Then the following are equivalent.
-
1.
via an order-preserving -module isomorphism which takes to .
-
2.
There exists a locally inner automorphism of for which
as -graded -algebras.
A complete resolution of Conjecture 1 currently remains elusive.
6.4 Connections to noncommutative algebraic geometry
One of the basic ideas of (standard) algebraic geometry is the correspondence between geometric spaces and commutative algebras. Over the past few decades, significant research energy has been focused on appropriately extending this correspondence to the noncommutative case; the resulting theory is called noncommutative algebraic geometry.Footnote 5
Suppose is a -graded algebra (i.e., a -graded algebra for which for all ). Let denote the category of -graded left -modules (with graded homomorphisms), and let denote the full subcategory of consisting of the graded -modules which are the sum of their finite dimensional submodules. Denote by the quotient category . The category turns out to be one of the fundamental constructions in noncommutative algebraic geometry. In particular, if is a directed graph, then the path algebra is -graded in the usual way (by setting for each vertex , and for each edge ), and so one may construct the category .
Let denote the graph gotten by repeatedly removing all sinks and sources (and their incident edges) from .
Theorem 36
[94, Theorem 1.3] Let be a finite graph. Then there is an equivalence of categories
Moreover since is strongly graded then these categories are also equivalent to the full category of modules over the zero-component .
So the Leavitt path algebra construction arises naturally in the context of noncommutative algebraic geometry. (The appearance of Leavitt path algebras in this setting is clarified by the notion of a Universal Localization, see e.g. [91].)
In general, when the -graded -algebra arises as an appropriate graded deformation of the standard polynomial ring , then shares many similarities with projective -space ; parallels between them have been studied extensively (see e.g. [96]). However, in general, an algebra of the form does not arise in this way; and for these, as asserted in [95], “it is much harder to see any geometry hiding in .” In specific situations there are some geometric perspectives available (see e.g. [93]), but the general case is not well understood.
6.5 Tensor products
As described in Sect. 3.5, the algebras and are not isomorphic. However, the following related questions are still unresolved.
-
1.
Does there exist a (necessarily injective) nonzero ring homomorphism ?
-
2.
Is isomorphic to ?
6.6 The Realization Problem for von Neumann regular rings
Although significant progress has been made in resolving the Realization Problem for von Neumann regular rings (see the discussion prior to Theorem 32), there is as of yet not a complete answer. An excellent survey of the main ideas relevant to this endeavor can be found in [25].
Using direct limit arguments, one can show that the graph monoid corresponding to a countable graph can be realized as for a von Neumann regular algebra . Indeed, is constructed as a direct limit of monoids of the form , where the graphs are finite; in particular, is a direct limit of finitely generated refinement monoids. Furthermore, can be constructed as a direct limit of (von Neumann regular) quotient algebras of the form for finite.
More generally, one can divide the (countable refinement) monoids arising in the Realization Problem into two types: tame (those which can be constructed as direct limits of finitely generated refinement monoids), and the others (called wild). Investigations (by Ara and Goodearl, see [32]) continue into whether or not every finitely generated refinement monoid is realizable; whether or not the realization passes to direct limits; and whether or not there are wild monoids which are not realizable.
Notes
The Ánh/Muhly meeting was quite fortuitous. Ánh was a visiting research guest of Kent Fuller at the University of Iowa during Spring Semester 2001. Fuller regularly went to lunch at various Iowa City restaurants with a group of his departmental colleagues, an excursion in which Paul Muhly was a frequent participant; Fuller of course invited Ánh to join in.
National Science Foundation Conference Board in Mathematical Sciences. The NSF-CBMS Regional Research Conferences in the Mathematical Sciences are a series of 5-day conferences, each of which features a distinguished lecturer delivering ten lectures on a topic of important current research in one sharply focused area of the mathematical sciences.
V. Camillo, L. Márki, and E. Ortega also attended.
As if the Ánh/Muhly meeting (and consequent attendance of the ring theorists at the 2004 Iowa CBMS conference) was not fortuitous enough, it turned out that, many months prior to that conference, Mercedes Siles Molina had contacted the author regarding the possibility of having the author host one of her Ph.D. students for a 6-month visit at the University of Colorado, to commence July 2004. That having been arranged, Gonzalo Aranda Pino arrived in Colorado Springs at precisely the time that this new idea was blossoming.
Thanks to S. Paul Smith for providing much of the information contained in this subsection.
References
Abrams, G.: Non-induced isomorphisms of matrix rings. Isr. J. Math. 99, 343–347 (1997)
Abrams, G.: Invariant basis number and types for strongly graded rings. J. Algebra 237, 32–37 (2001)
Abrams, G., Ánh, P.N.: Some ultramatricial algebras which arise as intersections of Leavitt algebras. J. Algebra Appl. 1(4), 357–363 (2002)
Abrams, G., Ánh, P.N., Louly, A., Pardo, E.: The classification question for Leavitt path algebras. J. Algebra 320(5), 1983–2026 (2008)
Abrams, G., Ánh, P.N., Pardo, E.: Isomorphisms between Leavitt algebras and their matrix rings. J. Reine Angew. Math. 624, 103–132 (2008)
Abrams, G., Ara, P., Siles Molina, M.: Leavitt Path Algebras. Lecture Notes in Mathematics. Springer, Berlin (to appear)
Abrams, G., Aranda Pino, G.: The Leavitt path algebra of a graph. J. Algebra 293, 319–334 (2005)
Abrams, G., Aranda Pino, G.J. : Purely infinite simple Leavitt path algebras. Pure Appl. Algebra 207, 553–563 (2006)
Abrams, G., Aranda Pino, G.: The Leavitt path algebras of arbitrary graphs. Houst. J. Math. 34(2), 423–442 (2008)
Abrams, G., Bell, J.P., Rangaswamy, K.M.: On prime non-primitive von Neumann regular algebras. Trans. Am. Math. Soc. 366(5), 2375–2392 (2014)
Abrams, G., Bell, J.P., Colak, P., Rangaswamy, K.M.: Two-sided chain conditions in Leavitt path algebras over arbitrary graphs. J. Algebra Appl. 11(3), 1250044(1)–1250044(23) (2012)
Abrams, G., Kanuni, M.: Cohn path algebras have Invariant Basis Number. Commun. Alg. (2013, to appear). arXiV:1303.2122v2
Abrams, G., Louly, A., Pardo, E., Smith, C.: Flow invariants in the classification of Leavitt path algebras. J. Algebra 333, 202–231 (2011)
Abrams, G., Mantese, F., Tonolo, A.: Extensions of simple modules over Leavitt path algebras (2014). arXiV:1408.3580
Abrams, G., Mesyan, Z.: Simple Lie algebras arising from Leavitt path algebras. J. Pure Appl. Algebra 216(10), 2302–2313 (2012)
Abrams, G., Rangaswamy, K.M.: Regularity conditions for arbitrary Leavitt path algebras. Algebras Represent. Theory 13(3), 319–334 (2010)
Abrams, G., Rangaswamy, K.M.: Row-finite equivalents exist only for row-countable graphs. In: New Trends in Noncommutative Algebra, pp. 1–10. Contemporary Mathematics Series, vol. 562. American Mathematical Society, Providence (2012)
Abrams, G., Tomforde, M.: Isomorphism and Morita equivalence of graph algebras. Trans. Am. Math. Soc. 363(7), 3733–3767 (2011)
Abrams, G., Tomforde, M.: A class of C-algebras that are prime but not primitive. Münst. J. Math. (to appear)
Alahmadi, A., Alsulami, H.: Wreath products by a Leavitt path algebra and affinizations. Int. J. Algebra Comput. (2014). doi:10.1142/S0218196714500295
Alahmadi, A., Alsulami, H., Jain, S.K., Zelmanov, E.: Leavitt path algebras of finite Gelfand–Kirillov dimension. J. Algebra Appl. 11(6), 1250225(1)–1250225(6) (2012)
Alahmadi, A., Alsulami, H.: Simplicity of the Lie algebra of skew symmetric elements of a Leavitt path algebra (2014). arXiv:1304.2385
Alahmadi, A., Alsulami, H.: On the simplicity of Lie algebra of Leavitt path algebra (2013). arXiv:1304.1922
Alahmedi, A., Alsulami, H., Jain, S.K., Zelmanov, E.: Structure of Leavitt path algebras of polynomial growth. Proc. Natl. 110(38), 15222–15224 (2013)
Ara, P.: The realization problem for von Neumann regular rings. In: Ring Theory 2007, pp. 21–37. World Scientific Publishers, Hackensack (2009)
Ara, P., Brustenga, M.: The regular algebra of a quiver. J. Algebra 309, 207–235 (2007)
Ara, P., Brustenga, M., Cortiñas, G.: -theory of Leavitt path algebras. Münst. J. Math. 2, 5–33 (2009)
Ara, P., Cortiñas, G.: Tensor products of Leavitt path algebras. Proc. Am. Math. Soc. 141(8), 2629–2639 (2013)
Ara, P., González-Barroso, M.A., Goodearl, K.R., Pardo, E.: Fractional skew monoid rings. J. Algebra 278, 104–126 (2004)
Ara, P., Goodearl, K.R.: C-algebras of separated graphs. J. Funct. Anal. 261(9), 2540–2568 (2011)
Ara, P., Goodearl, K.R.: Leavitt path algebras of separated graphs. J. Reine Angew. Math. 669, 165–224 (2012)
Ara, P., Goodearl, K.R.: Tame and wild refinement monoids. Semigroup Forum. arXiv:%201405.7582 (to appear)
Ara, P., Goodearl, K.R., O’Meara, K.C., Pardo, E.: Separative cancellation for projective modules over exchange rings. Isr. J. Math. 105, 105–137 (1998)
Ara, P., Goodearl, K.R., O’Meara, K.C., Raphael, R.: of separative exchange rings and C-algebras of real rank zero. Pac. J. Math 195(2), 261–275 (2000)
Ara, P., Goodearl, K.R., Pardo, E.: of purely infinite simple regular rings. K-Theory 26, 69–100 (2002)
Ara, P., Moreno, M.A., Pardo, E.: Nonstable -theory for graph algebras. Algebras Represent. Theory 10(2), 157–178 (2007)
Ara, P., Pardo, E.: Towards a -theoretic characterization of graded isomorphisms between Leavitt path algebras. J. -theory 14, 203–245 (2014)
Ara, P., Rangaswamy, K.M.: Finitely presented modules over Leavitt path algebras. J. Algebra 417, 333–352 (2014)
Ara, P., Rangaswamy, K.M.: Leavitt path algebras with at most countably many irreducible representations. Rev. Mat. Iberoam. arXiv:1309.7917v2 (to appear)
Aranda Pino, G., Clark, J., an Huef, A., Raeburn, I.: Kumjian–Pask algebras of higher-rank graphs. Trans. Am. Math. Soc. 365(7), 3613–3641 (2013)
Aranda Pino, G., Crow, K.: The center of a Leavitt path algebra. Rev. Mat. Iberoam. 27(2), 621–644 (2011)
Aranda Pino, G., Martín Barquero, D., Martín González, C., Siles Molina, M.: The socle of a Leavitt path algebra. J. Pure Appl. Algebra 212, 500–509 (2008)
Aranda Pino, G., Pardo, E., Siles Molina, M.: Exchange Leavitt path algebras and stable rank. J. Algebra 305, 912–936 (2006)
Aranda Pino, G., Pardo, E., Siles Molina, M.: Prime spectrum and primitive Leavitt path algebras. Indiana J. Math. 58, 869–890 (2009)
Aranda Pino, G., Perera, F., Siles Molina, M. (eds.): Graph algebras: bridging the gap between analysis and algebra. Málaga University Press, Málaga (2007)
Bates, T., Hong, J., Raeburn, I., Szymański, W.: The ideal structure of the C-algebras of infinite graphs. Ill. J. Math. 46(4), 1159–1176 (2002)
Bates, T., Pask, D., Raeburn, I., Szymański, W.: The C-algebras of row-finite graphs. N. Y. J. Math. 6, 307–324 (2000)
Bergman, G.M.: On Jacobson radicals of graded rings (unpublished)
Bergman, G.M.: Coproducts and some universal ring constructions. Trans. Am. Math. Soc. 200, 33–88 (1974)
Blackadar, B.: K-Theory for Operator Algebras, 2nd edn. MSRI Publications No. 5, Cambridge University Press, Cambridge (1998)
Brin, M.G.: Higher dimensional Thompson groups. Geom. Dedicata 108, 163–192 (2004)
Brookfield, G.: Cancellation in primely generated refinement monoids. Algebra Universalis 46(3), 343–371 (2001)
Cartan, H., Eilenberg, S.: Homological Algebra. Princeton University Press, Princeton (1956)
Chen, X.W.: Irreducible representations of Leavitt path algebras. Forum Math. (to appear; published online 12/14/2012)
Cohn, P.M.: Some remarks on the invariant basis property. Topology 5, 215–228 (1966)
Cuntz, J.: Simple C-algebras generated by isometries. Commun. Math. Phys. 57(2), 173–185 (1977)
Cuntz, J.: The structure of multiplication and addition in simple C-algebras. Math. Scand. 40, 215–233 (1977)
Cuntz, J.: -theory for certain C-algebras. Ann. Math. 113, 181–197 (1981)
Cuntz, J., Krieger, W.: A class of C-algebras and topological Markov chains. Invent. Math. 56(3), 251–268 (1980)
Dicks, W., Martínez-Pérez, C.: Isomorphisms of Brin–Higman–Thompson groups. Isr. J. Math. 199, 189–218 (2014)
Dixmier, J.: Sur les C-algebres. Bull. Soc. Math. France 88, 95–112 (1960)
Dixmier, J.: Les C*-algebres et leurs representations. Gauthier-Villars, Paris (1969)
Fowler, N.J., Laca, M., Raeburn, I.: The C-algebras of infinite graphs. Proc. Am. Math. Soc. 8, 2319–2327 (2000)
Franks, J.: Flow equivalence of subshifts of finite type. Ergod. Theory Dyn. Syst. 4(1), 53–66 (1984)
Gabe, J., Ruiz, E., Tomforde, M., Whalen, T.: -theory for Leavitt path algebras: computation and classification (2014). arXiV:1407.5094v1
Goodearl, K.R.: Leavitt path algebras and direct limits. In: Rings, Modules and Representations, pp. 165–188. Contemporary Mathematics Series, vol. 480. American Mathematical Society, Providence (2009)
Goodearl, K.R., Warfield Jr, R.B.: Algebras over zero-dimensional rings. Math. Ann. 223(2), 157–168 (1976)
Hazrat, R.: The graded Grothendieck group and the classification of Leavitt path algebras. Math. Ann. 355(1), 273–325 (2013)
Hazrat, R.: A note on the isomorphism conjectures for Leavitt path algebras. J. Algebra 375, 33–40 (2013)
Jacobson, N.: Some remarks on one-sided inverses. Proc Am. Math. Soc. 1, 352–355 (1950)
Jeong, J.A., Park, G.H.: Graph C-algebras with real rank zero. J. Funct. Anal. 188, 216–226 (2002)
Krause, G.R., Lenagan, T.H.: Growth of Algebras and Gelfand–Kirillov Dimension, Revised edn. Graduate Studies in Mathematics, vol. 22. American Mathematical Society, Providence (2000)
Kumjian, A., Pask, D.: Higher rank graph C-algebras. N. Y. J. Math. 6, 1–20 (2000)
Kumjian, A., Pask, D., Raeburn, I.: Cuntz–Krieger algebras of directed graphs. Pac. J. Math. 184(1), 161–174 (1998)
Kumjian, A., Pask, D., Raeburn, I., Renault, J.: Graphs, groupoids, and Cuntz–Krieger algebras. J. Funct. Anal. 144(2), 505–541 (1997)
Leavitt, W.G.: The module type of a ring. Trans. Am. Math. Soc. 103, 113–130 (1962)
Leavitt, W.G.: The module type of homomorphic images. Duke Math. J. 32, 305–311 (1965)
Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)
Nǎstǎsescu, C., Torrecillas, B., Van Oystaeyen, F.: IBN for graded rings. Commun. Algebra 28(3), 1351–1360 (2000)
Nǎstǎsescu, C., Van Oystaeyen, F.: Methods of Graded Rings. Lecture Notes in Mathematics, vol. 1836. Springer, Berlin (2004)
Nicholson, W.K.: Lifting idempotents and exchange rings. Trans. Am. Math. Soc. 229, 269–278 (1977)
Pardo, E.: The isomorphism problem for Higman–Thompson groups. J. Algebra 344, 172–183 (2011)
Pardo, E.: (private communication)
Paschke, W.L., Salinas, N.: Matrix algebras over . Mich. Math. J. 26(1), 3–12 (1979)
Phillips, N.C.: A classification theorem for nuclear purely infinite simple C-algebras. Doc. Math. 5, 49–114 (2000)
Raeburn, I.: Graph Algebras. CBMS Regional Conference Series in Mathematics, vol. 103. American Mathematical Society, Providence (2005)
Rangaswamy, K.M.: On simple modules over Leavitt path algebras. J. Algebra 423, 239–258 (2015)
Rørdam, M.: A short proof of Elliott’s theorem. C.R. Math. Rep. Acad. Sci. Can. 16, 31–36 (1994)
Rowen, L.H.: Ring Theory, vol. 1. Pure and Applied Mathematics, vol. 127. Academic Press, Boston (1988)
Ruiz, E., Tomforde, M.: Classification of unital simple Leavitt path algebras of infinite graphs. J. Algebra 384, 45–83 (2013)
Schofield, A.H.: Representations of Rings Over Skew Fields. London Mathematical Society Lecture Notes Series, vol. 92. Cambridge University Press, Cambridge (1985)
Smith, C.: A description of the Parry–Sullivan Number of a graph using circuits (2009). arXiV:0903.2000v1
Smith, S.P.: The space of Penrose tilings and the non-commutative curve with homogeneous coordinate ring . J. Noncommut. Geom. 8, 541–586 (2014)
Smith, S.P.: Category equivalences involving graded modules over path algebras of quivers. Adv. Math. 230, 1780–1810 (2012)
Smith, S.P.: (private communication)
Stafford, J.T., Van den Bergh, M.: Noncommutative curves and noncommutative surfaces. Bull. Am. Math. Soc. 38, 171–216 (2001)
Tomforde, M.: Uniqueness theorems and ideal structure for Leavitt path algebras. J. Algebra 318(1), 270–299 (2007)
Tomforde, M.: Leavitt path algebras with coefficients in a commutative ring. J. Pure Appl. Algebra 215(4), 471–484 (2011)
Tomforde, M.: Graph C-algebras: theory, technique, and examples (in preparation)
Watatani, Y.: Graph theory for C-algebras. In: Operator algebras and applications, Part I (Kingston, Ont., 1980), pp. 195–197. Proceedings of Symposia in Pure Mathematics, vol. 38. American Mathematical Society, Providence (1982)
Acknowledgments
This work was partially supported by Simons Foundation Collaboration Grant #20894. The author is grateful to the editors of this journal for extending to him an invitation to contribute this survey article. The author thanks P. N. Ánh, Pere Ara, Zachary Mesyan, Paul Muhly, Enrique Pardo, and Mark Tomforde for helping to clarify some of the historical aspects of the subject. The author is extremely grateful to S. Paul Smith for providing a summary of germane ideas related to noncommutative algebraic geometry, and for a number of suggestions which clarified the presentation. Finally, the author warmly thanks the referee for providing significant, valuable feedback on the original version of this article.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Efim Zelmanov.
Appendices
Appendix 1: Some properties of and which suggest the existence of a Rosetta Stone
It has become apparent that there is a strong, but mysterious, relationship between the structure of the Leavitt path algebra and the corresponding graph C-algebra . In this context it is helpful to keep in mind that while may always be viewed as a dense -subalgebra of (see Proposition 1), the two algebras are in general clearly different as rings: indeed, they coincide only when is finite and acyclic.
We focus in this Appendix on finite graphs, so that the corresponding Leavitt path algebra or graph C-algebra is unital (and is separable as well). But many of the observations we make here hold more generally.
Any C-algebra wears two hats: not only is a ring, but comes equipped with a topology as well, so that one may view the ring-theoretic structure of from a topological/analytic viewpoint. The standard example is this: one may define the (algebraic) simplicity of the C-algebra either as a ring (no nontrivial two-sided ideals), or the (topological) simplicity as a topological ring (no nontrivial closed two-sided ideals). In general, the algebraic and topological properties of a given C-algebra need not coincide.
The graph is called cofinal in case every vertex of connects to every cycle and every sink of . (This turns out to be equivalent to having the property that the only hereditary saturated subsets of are and .)
As a reminder: has Condition (L) if every cycle in has an exit; has Condition (K) if there is no vertex of which has exactly one simple closed path based at ; and is downward directed if for each pair of vertices of there exists a vertex for which and .
Property 1: Simplicity
Algebraic: No nontrivial two-sided ideals.
Analytic: No nontrivial closed two-sided ideals.
By Theorem 8, is simple if and only if is cofinal and has Condition (L).
By [47, Proposition 5.1] (for the case without sources), and [86] (for the general case), is (topologically) simple if and only if is cofinal and has Condition (L).
By [57, p. 215], for any unital C-algebra , is topologically simple if and only if is algebraically simple.
Result: These are equivalent for any finite graph :
-
1.
is simple.
-
2.
is (topologically) simple.
-
3.
is (algebraically) simple.
-
4.
is cofinal, and satisfies Condition (L).
Property 2: The-monoid
(Much of this discussion is taken directly from [36, Sections 2 and 7].)
Algebraic: For a ring , is the monoid of isomorphism classes of finitely generated projective left -modules, with operation . By [50, Chapter 3], can be viewed as the set of equivalence classes of idempotents in the (nonunital) infinite matrix ring , with operation
Analytic: For an operator algebra , is the monoid of Murray - von Neumann equivalence classes of projections in .
By [50, 4.6.2 and 4.6.4], whenever is a C-algebra, then agrees with .
By [36, Theorem 7.1], the natural inclusion induces a monoid isomorphism .
By [36, Theorem 3.5], the monoid is independent of the field ; specifically, , the graph monoid of .
Result: For any finite graph and any field , the following semigroups are isomorphic.
-
1.
the graph monoid
-
2.
-
3.
-
4.
Property 3: Purely infinite simplicity
Algebraic: is purely infinite simple in case is simple and every nonzero right ideal of contains an infinite idempotent. (Source: [35, Definitions 1.2].)
Analytic: The simple C-algebra is called purely infinite (simple) if for every positive , the subalgebra contains an infinite projection. (Source: [58, p. 186].)
By [35, Theorem 1.6], (algebraic) purely infinite simplicity for unital rings is equivalent to: is not a division ring, and for all nonzero there exist for which .
By [50, Proposition 6.11.5], (topological) purely infinite simplicity for unital C-algebras is equivalent to: and for every in there exist for which . (Remark: Blackadar defines purely infinite simplicity this way, and then shows this definition is equivalent to Cuntz’ definition given in [58].) Easily, for any graph , is a division ring if and only if is a single vertex, in which case .
Thus we have, for graph C-algebras, is (algebraically) purely infinite simple if and only if is (topologically) purely infinite simple.
By [8, Theorem 11], is purely infinite simple if and only if is simple, and has the property that every vertex connects to a cycle.
By [47, Proposition 5.3], is (topologically) purely infinite simple if and only if is simple, and has the property that every vertex connects to a cycle.
Result: These are equivalent for any finite graph :
-
1.
is purely infinite simple.
-
2.
is (topologically) purely infinite simple.
-
3.
is (algebraically) purely infinite simple.
-
4.
is cofinal, every cycle in has an exit, and every vertex in connects to a cycle.
Property 4: Exchange
Algebraic: is an exchange ring if for any there exists an idempotent for which and . (Note: The original definition of exchange ring was given by Warfield, in terms of a property on direct sum decomposition of modules; this property clarifies the genesis of the name exchange. The definition given here is equivalent to Warfield’s; this equivalence was shown independently by Goodearl and Warfield in [67, discussion on p. 167], and by Nicholson in [81, Theorem 2.1].)
Analytic: For every there exists a projection such that and . (We call this condition “topological exchange”. Note: There does not seem to be an explicit definition of “topological exchange ring” in the literature.)
By [43, Theorem 4.5]. is an exchange ring if and only if satisfies Condition (K).
By [71, Theorem 4.1] has real rank zero if and only if satisfies Condition (K).
By [33, Theorem 7.2], for a unital C-algebra , has real rank zero if and only if is a topological exchange ring if and only if is an exchange ring. (See also [34].)
Result: These are equivalent for a finite graph :
-
1.
is an exchange ring.
-
2.
is a (topological) exchange ring.
-
3.
is an (algebraic) exchange ring.
-
4.
satisfies Condition (K).
Property 5: Primitivity
Algebraic: is (left) primitive if there exists a simple faithful left -module.
Analytic: is (topologically) primitive if there exists an irreducible faithful -representation of . (That is, there is a faithful irreducible representation for a Hilbert space .)
It is shown in [44, Theorem 4.6] that is left (and/or right) primitive if and only if is downward directed and satisfies Condition (L).
It is shown in [46, Proposition 4.2] that is (topologically) primitive if and only if is downward directed and satisfies Condition (L).
It is shown in [62, Corollary to Theorem 2.9.5] that a C-algebra is algebraically primitive if and only if it is topologically primitive.
Result: These are equivalent for finite graphs:
-
1.
is primitive.
-
2.
is (topologically) primitive.
-
3.
is (algebraically) primitive.
-
4.
is downward directed and satisfies Condition (L).
(We note that the first three properties have been shown to be equivalent for arbitrary graphs as well, with the fourth condition being replaced by: satisfies Condition (L), is downward directed, and has the Countable Separation Property. See Theorem 29 and [19].)
It is interesting to note that in the situations in which we have a result which suggests the existence of a Rosetta Stone, the algebraic and topological conditions on are identical. Perhaps there is something in this observation which will lead to a deeper understanding of why there seems to be such a strong relationship between the properties of and .
There are indeed situations where the analogies between the Leavitt path algebras and graph C algebras are not as tight as those presented above.
A property for which the algebraic and analytic results are not identical: Primeness
Algebraic: is a prime ring in case is a prime ideal of ; that is, in case for any two-sided ideals of , if and only if or .
Analytic: is a prime C-algebra in case is a prime ideal of ; that is, in case for any closed two-sided ideals of , if and only if or .
In [44, Corollary 3.10] it is shown that is prime if and only if is downward directed.
But by [61, Corollaire 1], any separable C-algebra is (topologically) prime if and only if it is (topologically) primitive. So (for finite ) is prime if and only if is primitive, which by the previous discussion is if and only if is downward directed and satisfies Condition (L). (We note that since implies , it is straightforward to show that is algebraically prime if and only if is analytically prime.)
So for example if is the graph with one vertex and one loop, then is prime (it’s an integral domain, in fact), but is not prime. (It’s not hard to write down nonzero continuous functions on the circle which are orthogonal.)
There are a few other situations where the properties of and do not match up exactly. For instance, the only possible values of the (algebraic) stable rank of are , and ; as well, the only possible values of the (topological) stable rank of are , and . But among individual graphs, the values may be different: if , then the stable rank of is , while the stable rank of is .
In addition, we have seen in Sect. 3.5 that , but .
Summary of Appendix1. A “Rosetta Stone for graph algebras” refers to an overarching principle which would allow an understanding as to why there is such an extremely tight (but not perfect) relationship between various properties of Leavitt path algebras and graph C-algebras, as suggested by the examples given in this section. Does such a Rosetta Stone exist?
Appendix 2: A number-theoretic observation
Let denote the Leavitt algebra of order ; so has the property that as left -modules. By Theorem 12 we have
Indeed, when the appropriate number-theoretic condition is satisfied then the isomorphism may be explicitly constructed.
The key to constructing such an isomorphism lies in considering a partition of into two nonempty disjoint subsets , described as follows.
Suppose is an integer having . Write with . As we get .
For the current discussion we focus only on . Note we have . Let . Since we easily see . Now consider the sequence , given by
of integers, interpreted . (Here we interpret as .) Since , elementary number theory gives that, as a set, the elements of form a complete set of residues .
In particular, for some () we have .
Now consider these two sequences:
So is just the first elements of , and is the remaining elements.
We can also consider the partition of which corresponds to the elements of these two sequences:
So in particular and . Clearly . But as well, since . This is because the first element of is always , as .
For notational convenience, if are fixed then we drop the superscript in the sequences and subsets.
Example 11
The case . . .
The sequence starts at 1, and increases by each step, and we interpret (). So we get the sequence Since , we get
and so
Example 12
The case . . .
The sequence starts at 1, and increases by each step, and we interpret (). So we get the sequence Since , we get
and so
Example 13
The case . . .
The sequence starts at 1, and increases by each step, and we interpret (). So we get the sequence Since , we get
and so
By solving the congruence , we easily get
Lemma 3
.
In particular, if we have for which , then the two partitions and of are necessarily different (since is in , and the sizes of and are unequal).
Given , there exist (Euler -function) remainders which are relatively prime to . So there exist distinct partitions of which arise as for some having .
We note that for any we always get these two partitions arising in the form :
It is easy to see that there are ways to partition the set into two nonempty subsets for which . Since for , we see that not all such two-nonempty-set partitions of can arise as for some having . For example, when , the partition of does not arise in this way.
We are interested in two related questions regarding the sequences described in this Appendix.
-
1.
For fixed having , do the sequences and arise in contexts other than that of isomorphisms between matrix rings over Leavitt algebras?
-
2.
Do the partitions of of the form (for some having ) play a special role in any sorts of number-theoretic investigations?
Remark 2
Referring back to how these sequences and partitions arose in the context of Theorem 12, in that setting we start with having , write with , and then consider the partition of . We then use this partition of to build a partition of by simply extending the partition , . So, for instance, if , then we get . We then consider the partition , as described in Example 11. This then yields the partition of by simply extending .
Specifically, in the proof of Theorem 12, the ordering properties of the sequences and are not utilized, rather, only the partition of as sets is used.
Appendix 3: The graph moves
We give in this Appendix the formal definitions of each of the six “graph moves” which arise in the symbolic dynamics analysis associated to the Restricted Algebraic Kirchberg Phillips Theorem. We conclude by presenting the “source elimination” process as well.
Definition 21
Let be a directed graph. For each with , partition the set into disjoint nonempty subsets where . (If is a sink, then we put .) Let denote the resulting partition of . We form the out-split graph from using the partition as follows:
and define for each by
Conversely, if and are graphs, and there exists a partition of for which , then is called an out-amalgamation of .
Definition 22
Let be a directed graph, and let . Let and be symbols not in . We form the expansion graph from at as follows:
Conversely, if and are graphs, and there exists a vertex of for which , then is called a contraction of .
Definition 23
Let be a directed graph. For each with , partition the set into disjoint nonempty subsets where . (If is a source then we put .) Let denote the resulting partition of . We form the in-split graph from using the partition as follows:
and define by
Conversely, if and are graphs, and there exists a partition of for which , then is called an in-amalgamation of .
Definition 24
Let be a directed graph with at least two vertices, and let be a source. We form the source elimination graph of as follows:
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
About this article
Cite this article
Abrams, G. Leavitt path algebras: the first decade. Bull. Math. Sci. 5, 59–120 (2015). https://doi.org/10.1007/s13373-014-0061-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13373-014-0061-7