In mathematics, a Leavitt path algebra is a universal algebra constructed from a directed graph.  Leavitt path algebras generalize Leavitt algebras and may be considered as algebraic analogues of graph C*-algebras.
History
Leavitt path algebras were simultaneously introduced in 2005 by Gene Abrams and Gonzalo Aranda Pino[1] as well as by Pere Ara, María Moreno, and Enrique Pardo,[2] with neither of the two groups aware of the other's work.[3]  Leavitt path algebras have been investigated by dozens of mathematicians since their introduction, and in 2020 Leavitt path algebras were added to the Mathematics Subject Classification with code 16S88 under the general discipline of Associative Rings and Algebras.[4]
The basic reference is the book Leavitt Path Algebras.[5] 
Graph terminology
The theory of Leavitt path algebras uses terminology for graphs similar to that of C*-algebraists, which differs slightly from that used by graph theorists.  The term graph is typically taken to mean a directed graph  consisting of a countable set of vertices
 consisting of a countable set of vertices  , a countable set of edges
, a countable set of edges  , and maps
, and maps  identifying the range and source of each edge, respectively.  A vertex
 identifying the range and source of each edge, respectively.  A vertex  is called a sink when
 is called a sink when  ; i.e., there are no edges in
; i.e., there are no edges in  with source
 with source  .  A vertex
.  A vertex  is called an infinite emitter when
 is called an infinite emitter when  is infinite; i.e., there are infinitely many edges in
 is infinite; i.e., there are infinitely many edges in  with source
 with source  .  A vertex is called a singular vertex if it is either a sink or an infinite emitter, and a vertex is called a regular vertex if it is not a singular vertex.  Note that a vertex
.  A vertex is called a singular vertex if it is either a sink or an infinite emitter, and a vertex is called a regular vertex if it is not a singular vertex.  Note that a vertex  is regular if and only if the number of edges in
 is regular if and only if the number of edges in  with source
 with source  is finite and nonzero.  A graph is called row-finite if it has no infinite emitters; i.e., if every vertex is either a regular vertex or a sink.
 is finite and nonzero.  A graph is called row-finite if it has no infinite emitters; i.e., if every vertex is either a regular vertex or a sink.
A path is a finite sequence of edges  with
 with  for all
 for all  .  An infinite path is a countably infinite sequence of edges
.  An infinite path is a countably infinite sequence of edges  with
 with  for all
 for all  .    A cycle is a path
.    A cycle is a path  with
 with  , and an exit for a cycle
, and an exit for a cycle  is an edge
 is an edge  such that
 such that  and
 and  for some
 for some  .  A cycle
.  A cycle  is called a simple cycle if
 is called a simple cycle if  for all
 for all  .
.
The following are two important graph conditions that arise in the study of Leavitt path algebras.
Condition (L):  Every cycle in the graph has an exit.
Condition (K): There is no vertex in the graph that is on exactly one simple cycle.  Equivalently, a graph satisfies Condition (K) if and only if each vertex in the graph is either on no cycles or on two or more simple cycles.
The Cuntz–Krieger relations and the universal property
Fix a field  .  A Cuntz–Krieger
.  A Cuntz–Krieger  -family is a collection
-family is a collection  in a
 in a  -algebra such that the following three relations (called the Cuntz–Krieger relations) are satisfied:
-algebra such that the following three relations (called the Cuntz–Krieger relations) are satisfied:
- (CK0)  for all for all , ,
- (CK1)  for all for all , ,
- (CK2)  whenever whenever is a regular vertex, and is a regular vertex, and
- (CK3)  for all for all . .
The Leavitt path algebra corresponding to  , denoted by
, denoted by  , is defined to be the
, is defined to be the  -algebra generated by a Cuntz–Krieger
-algebra generated by a Cuntz–Krieger  -family that is universal in the sense that whenever
-family that is universal in the sense that whenever  is a Cuntz–Krieger
 is a Cuntz–Krieger  -family in a
-family in a  -algebra
-algebra  there exists a
 there exists a  -algebra homomorphism
-algebra homomorphism  with
 with  for all
 for all  ,
,  for all
 for all  , and
, and  for all
 for all  .
.   
We define  for
 for  , and for a path
, and for a path  we define
 we define  and
 and  .  Using the Cuntz–Krieger relations, one can show that
.  Using the Cuntz–Krieger relations, one can show that 
 
Thus a typical element of  has the form
 has the form  for scalars
 for scalars  and paths
 and paths  in
 in  .  If
.  If  is a field with an involution
 is a field with an involution  (e.g., when
 (e.g., when  ), then one can define a *-operation on
), then one can define a *-operation on  by
 by  that makes
 that makes  into a *-algebra.
 into a *-algebra.
Moreover, one can show that for any graph  , the Leavitt path algebra
, the Leavitt path algebra  is isomorphic to a dense *-subalgebra of the graph C*-algebra
 is isomorphic to a dense *-subalgebra of the graph C*-algebra  .
.
Examples
Leavitt path algebras has been computed for many graphs, and the following table shows some particular graphs and their Leavitt path algebras.  We use the convention that a double arrow drawn from one vertex to another and labeled  indicates that there are a countably infinite number of edges from the first vertex to the second.
 indicates that there are a countably infinite number of edges from the first vertex to the second.
| Directed graph  | Leavitt path algebra   | 
|  |  , the underlying field | 
|  | ![{\displaystyle K[x,x^{-1}]}](./_assets_/37dfa9a185560b60712d4b417d0b2a3a849ca283.svg) , the Laurent polynomials with coefficients in   | 
|  |  , the  matrices with entries in   | 
|  |  , the countably indexed, finitely supported matrices with entries in   | 
|  | ![{\displaystyle M_{n}(K[x,x^{-1}])}](./_assets_/fd403d50e080c7d7dd88aedff8defd501e8b80c6.svg) , the  matrices with entries in ![{\displaystyle K[x,x^{-1}]}](./_assets_/37dfa9a185560b60712d4b417d0b2a3a849ca283.svg)  | 
|  | the Leavitt algebra   | 
|  |  , the unitization of the algebra   | 
Correspondence between graph and algebraic properties
As with graph C*-algebras, graph-theoretic properties of  correspond to algebraic properties of
 correspond to algebraic properties of  .  Interestingly, it is often the case that the graph properties of
.  Interestingly, it is often the case that the graph properties of  that are equivalent to an algebraic property of
 that are equivalent to an algebraic property of  are the same graph properties of
 are the same graph properties of  that are equivalent to corresponding C*-algebraic property of
 that are equivalent to corresponding C*-algebraic property of  , and moreover, many of the properties for
, and moreover, many of the properties for  are independent of the field
 are independent of the field  .
.
The following table provides a short list of some of the more well-known equivalences.  The reader may wish to compare this table with the corresponding table for graph C*-algebras.
| Property of  | Property of   | 
|  is a finite, acylic graph. |  is finite dimensional. | 
| The vertex set  is finite. |  is unital (i.e.,  contains a multiplicative identity). | 
|  has no cycles. |  is an ultramatrical  -algebra (i.e., a direct limit of finite-dimensional  -algebras). | 
|  satisfies the following three properties: Condition (L),for each vertex  and each infinite path  there exists a directed path from  to a vertex on  , andfor each vertex  and each singular vertex  there exists a directed path from  to 
 |  is simple. | 
|  satisfies the following three properties: Condition (L),for each vertex  in  there is a path from  to a cycle.
 | Every left ideal of  contains an infinite idempotent. (When
  is simple this is equivalent to  being a purely infinite ring.) | 
The grading
For a path  we let
 we let  denote the length of
 denote the length of  .  For each integer
.  For each integer  we define
 we define  .  One can show that this defines a
.  One can show that this defines a  -grading on the Leavitt path algebra
-grading on the Leavitt path algebra  and that
 and that  with
 with  being the component of homogeneous elements of degree
 being the component of homogeneous elements of degree  .  It is important to note that the grading depends on the choice of the generating Cuntz-Krieger
.  It is important to note that the grading depends on the choice of the generating Cuntz-Krieger  -family
-family  .  The grading on the Leavitt path algebra
.  The grading on the Leavitt path algebra  is the algebraic analogue of the gauge action on the graph C*-algebra
 is the algebraic analogue of the gauge action on the graph C*-algebra  , and it is a fundamental tool in analyzing the structure of
, and it is a fundamental tool in analyzing the structure of  .
.
The uniqueness theorems
There are two well-known uniqueness theorems for Leavitt path algebras: the graded uniqueness theorem and the Cuntz-Krieger uniqueness theorem.  These are analogous, respectively, to the gauge-invariant uniqueness theorem and Cuntz-Krieger uniqueness theorem for graph C*-algebras.  Formal statements of the uniqueness theorems are as follows:
The Graded Uniqueness Theorem:  Fix a field  .  Let
.  Let  be a graph, and let
 be a graph, and let  be the associated Leavitt path algebra.  If
 be the associated Leavitt path algebra.  If  is a graded
 is a graded  -algebra and
-algebra and  is a graded algebra homomorphism with
 is a graded algebra homomorphism with  for all
 for all  , then
, then  is injective.
 is injective.
The Cuntz-Krieger Uniqueness Theorem:   Fix a field  .  Let
.  Let  be a graph satisfying Condition (L), and let
 be a graph satisfying Condition (L), and let  be the associated Leavitt path algebra.  If
 be the associated Leavitt path algebra.  If  is a
 is a  -algebra and
-algebra and  is an algebra homomorphism with
 is an algebra homomorphism with  for all
 for all  , then
, then  is injective.
 is injective.
Ideal structure
We use the term ideal to mean "two-sided ideal" in our Leavitt path algebras.  The ideal structure of  can be determined from
 can be determined from  .  A subset of vertices
.  A subset of vertices  is called hereditary if for all
 is called hereditary if for all  ,
,  implies
 implies  .  A hereditary subset
.  A hereditary subset  is called saturated if whenever
 is called saturated if whenever  is a regular vertex with
 is a regular vertex with  , then
, then  .  The saturated hereditary subsets of
.  The saturated hereditary subsets of  are partially ordered by inclusion, and they form a lattice with meet
 are partially ordered by inclusion, and they form a lattice with meet  and join
 and join  defined to be the smallest saturated hereditary subset containing
 defined to be the smallest saturated hereditary subset containing  .
.
If  is a saturated hereditary subset,
 is a saturated hereditary subset,  is defined to be two-sided ideal in
 is defined to be two-sided ideal in  generated by
 generated by  .  A two-sided ideal
.  A two-sided ideal  of
 of  is called a graded ideal if the
 is called a graded ideal if the  has a
 has a  -grading
-grading  and
 and  for all
 for all  .  The graded ideals are partially ordered by inclusion and form a lattice with meet
.  The graded ideals are partially ordered by inclusion and form a lattice with meet  and joint
 and joint  defined to be the ideal generated by
 defined to be the ideal generated by  .  For any saturated hereditary subset
.  For any saturated hereditary subset  , the ideal
, the ideal  is graded.
 is graded.
The following theorem describes how graded ideals of  correspond to saturated hereditary subsets of
 correspond to saturated hereditary subsets of  .
.
Theorem:  Fix a field  , and let
, and let  be a row-finite graph.  Then the following hold:
 be a row-finite graph.  Then the following hold:
- The function  is a lattice isomorphism from the lattice of saturated hereditary subsets of is a lattice isomorphism from the lattice of saturated hereditary subsets of onto the lattice of graded ideals of onto the lattice of graded ideals of with inverse given by with inverse given by . .
- For any saturated hereditary subset  , the quotient , the quotient is is -isomorphic to -isomorphic to , where , where is the subgraph of is the subgraph of with vertex set with vertex set and edge set and edge set . .
- For any saturated hereditary subset  , the ideal , the ideal is Morita equivalent to is Morita equivalent to , where , where is the subgraph of is the subgraph of with vertex set with vertex set and edge set and edge set . .
- If  satisfies Condition (K), then every ideal of satisfies Condition (K), then every ideal of is graded, and the ideals of is graded, and the ideals of are in one-to-one correspondence with the saturated hereditary subsets of are in one-to-one correspondence with the saturated hereditary subsets of . .
References
- ^ Abrams, Gene; Aranda Pino, Gonzalo; The Leavitt path algebra 
of a graph. J. Algebra 293 (2005), no. 2, 319–334.
- ^ Pere Ara, María A. Moreno, and Enrique Pardo. Nonstable K-theory for 
graph algebras. Algebr. Represent. Theory 10(2):157–178, 2007.
- ^ Sec. 1.7 of Leavitt Path Algebras, Springer, London, 2017. Online Copy (PDF)
- ^ 2020 Mathematics Subject Classification (PDF)
- ^  Gene Abrams, Pere Ara, Mercedes Siles Molina (2017), Leavitt Path Algebras, Lecture Notes in Mathematics, vol. 2191, Springer, London, doi:10.1007/978-1-4471-7344-1, ISBN 978-1-4471-7343-4{{citation}}:  CS1 maint: multiple names: authors list (link)