This paper introduces Cohn-Leavitt path algebras for bi-separated graphs, generalizing Leavitt path algebras, and explores their algebraic properties and K-theory, especially for hypergraph cases.
Contribution
It defines a new class of algebras for bi-separated graphs, studies their categorical properties, and analyzes their K-theory and IBN property for hypergraph cases.
Findings
01
Normal forms of the algebras are computed.
02
The lattice of order-ideals is characterized by graph data.
03
A matrix criterion for IBN property is established.
Abstract
The purpose of this paper is to provide a common framework for studying various generalizations of Leavitt algebras and Leavitt path algebras. This paper consists of two parts. In part I we define Cohn-Leavitt path algebras of a new class of graphs with an additional structure called bi-separated graphs, which generalize the constructions of Leavitt path algebras of various types of graphs. We define and study the category \textbf{BSG} of bi-separated graphs with appropriate morphisms so that the functor which associates a bi-separated graph to its Cohn-Leavitt path algebra is continuous. We also characterize a full subcategory of \textbf{BSG} whose objects are direct limits of finite complete subobjects. We compute normal forms of these algebras and apply them to study some algebraic theoretic properties in terms of bi-separated graph-theoretic properties. In part II we specialize…
{(EA˙=(E,(C,S),(D,T))A,↪)∣Ais a finite subset ofE0⊔E1}.
{(EA˙=(E,(C,S),(D,T))A,↪)∣Ais a finite subset ofE0⊔E1}.
{(Ei˙=(Ei,(Ci,Si),(Di,Ti)),↪)∣i∈I}
{(Ei˙=(Ei,(Ci,Si),(Di,Ti)),↪)∣i∈I}
vw=δv,wv.
vw=δv,wv.
ve=δv,s(e)e,
ve=δv,s(e)e,
ev=δv,r(e)e,
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Operator Algebra Research · Advanced Topics in Algebra · Homotopy and Cohomology in Algebraic Topology
Full text
Cohn-Leavitt path algebras of bi-separated graphs
Mohan. R and B. N. Suhas
Statistics and Mathematics Unit, Indian Statistical Institute Bangalore, India
The purpose of this paper is to provide a common framework for studying various generalizations of Leavitt algebras and Leavitt path algebras. This paper consists of two parts. In part I we define Cohn-Leavitt path algebras of a new class of graphs with an additional structure called bi-separated graphs, which generalize the constructions of Leavitt path algebras of various types of graphs. We define and study the category BSG of bi-separated graphs with appropriate morphisms so that the functor which associates a bi-separated graph to its Cohn-Leavitt path algebra is continuous. We also characterize a full subcategory of BSG whose objects are direct limits of finite complete subobjects. We compute normal forms of these algebras and apply them to study some algebraic theoretic properties in terms of bi-separated graph-theoretic properties.
In part II we specialize our attention to Cohn-Leavitt path algebras of a special class of bi-separated graphs called B-hypergraphs. We investigate their non-stable K-theory and show that the lattice of order-ideals of V-monoids of these algebras is determined by bi-separated graph-theoretic data. Using this information we study representations of Leavitt path algebras of regular hypergraphs and also find a matrix criterion for Leavitt path algebras of finite hypergraphs to have IBN property.
A unital ring R is said to have Invariant Basis Number (IBN) property if whenever the free left modules Rm and Rn are isomorphic for some natural numbers m and n, then m=n. In a series of papers [20, 21, 22, 23], W.G. Leavitt studied rings which do not satisfy IBN property. For natural numbers m,n with m<n, a non-IBN ring R is said to have module type(m,n) if m and n are the least positive integers such that Rm≅Rn. For any arbitrary field K and natural numbers m,n with m<n, Leavitt constructed ‘universal’ K-algebras LK(m,n) of module type (m,n) (now called Leavitt algebras).
LK(m,n) is presented as a unital K-algebra with generators xij,xij∗ where 1≤i≤m,1≤j≤n, and relations
[TABLE]
Leavitt also proved that LK(m,n) is simple if and only if m=1, and that LK(m,n) is a domain for all m>1.
In a seemingly unrelated development, J. Cuntz constructed and studied in [11] and [12], a class of C∗-algebras, now known as Cuntz algebrasOn, which are generated by n isometries S1,S2,…,Sn such that ∑i=1nSiSi∗=1. It turns out that the Leavitt algebra LC(1,n) of type (1,n) is a dense ∗-subalgebra of the Cuntz algebra On. Brown [10], and McClanahan [24, 25], studied C∗-algebras U(m,n)nc which are the C∗-analogs of LK(m,n).
Cuntz and Krieger [13] generalized the construction of On by considering a class of C∗-algebras, known as Cuntz-Krieger algebras associated to an n×n matrix with entries in {0,1}. In a subsequent development, in [19], Cuntz-Krieger algebras were realized as special cases of a broader class of C∗-algebras arising from directed graphs called graph C∗-algebras. The interested reader is referred to [30] for further information on this important class of C∗-algebras.
Algebraic analogs of graph C∗-algebras were defined and studied for row-finite graphs independently in [3] and [5], and for arbitrary graphs in [1] and [31], under the name Leavitt path algebrasLK(E). These algebras generalize Leavitt algebras LK(1,n) in a similar way as the graph C∗-algebras generalize Cuntz algebras On. The interested reader may consult the book [2] and the references provided there.
In [4] and [7], Ara and Goodearl initiated the study of a much larger class of algebras called Cohn-Leavitt path algebras and their C∗-analogs based on the concept of separated graphs(E,C). The Cohn-Leavitt path algebras extend the existing version of Leavitt path algebras and graph C∗-algebras for a particular choice of C. It was shown that any free product of algebras LK(1,n) appears as LK(E,C) for a suitable separated graph (E,C). Also, for any n≥m≥1, there is a separated graph (E,C) such that LK(E,C)≅Mm+1(LK(m,n))≅Mn+1(LK(m,n)) and the corner of LK(E,C) corresponding to one vertex of E is isomorphic to LK(m,n) itself. Similarly, free products of Cuntz algebra On and matrix C∗-algebras Mm+1(U(m,n)nc) appear as C∗(E,C) for suitable separated graphs (E,C). However, their motivation to study Cohn-Leavitt path algebras of separated graphs was of K-theoretic nature and towards developing techniques to answer realization problem for von Neumann regular rings (cf. [6]). Using Bergman’s machinery [8], they describe the V-monoid of LK(E,C) and study the lattice of trace ideals of Cohn-Leavitt path algebras in terms of separated graph theoretic data.
Independently, in [14], Hazrat defined the concept of weighted Leavitt path algebrasLK(E,w) of weighted graphs as a graph theoretic generalization of Leavitt algebras of type (m,n) for any natural numbers m,n. The Gröbner–Shirshov bases of LK(E,w) (called normal forms) were found, and as an application, the characterization of LK(E,w) which are domains was studied in [15]. As another application of normal forms, Gelfand-Kirillov dimensions of weighted Leavitt path algebras were studied in [28]. However, Cohn-Leavitt path algebras and weighted Leavitt path algebras are not special cases of each other.
In [29], Raimund defined and studied Leavitt path algebras associated to hypergraphs. He showed that Leavitt path algebras of separated graphs and vertex weighted Leavitt path algebras of row-finite vertex-weighted graphs are examples of hypergraphs.
In this article, we initiate the study of bi-separated graphs E˙=(E,(C,S),(D,T)) and the associated Cohn-Leavitt path algebras AK(E˙). With a particular choice of (C,S) and/or (D,T), we show that the Leavitt path algebras, Cohn-Leavitt path algebras of separated graphs, weighted Leavitt path algebras and Leavitt path algebras of hypergraphs are special cases of AK(E˙).
In section 2 we recall some preliminaries on graphs and their Leavitt path algebras. We also recall the definitions of various generalizations of Leavitt path algebras and some of their properties. The part I of this paper begins with section 3, where we define the Cohn-Leavitt path algebras of bi-separated graphs and state some very basic results
that follow from the definitions. We also show how the various generalizations of Leavitt path algebras introduced in the previous section are special cases of AK(E˙). In section 4, we define the category BSG of bi-separated graphs and show that every object in this category is a direct limit of countable complete sub-objects (see Proposition 4.7). However, this statement does not hold if we replace countable by finite. We then define a new sub-category of BSG, which we call “tame category tBSG” and show that this category characterizes all objects of BSG which are direct limits of finite complete sub-objects. Section 5 deals with computation of normal forms of AK(E˙) using Bergman’s diamond lemma and some of their applications. In particular we find bi-separated graph theoretic conditions to study algebraic properties of Cohn-Leavitt path algebras such as simplicity, semiprimitivity, von Neumann regularity, finiteness etc and also characterize the algebras which are domains.
In part II of this paper we focus our attention to the study of B-hypergraphs. In section 6 we define B-hypergraphs (E˙,Λ) and their H-monoids and we show that H-monoids are isomorphic to the V-monoids of the corresponding Cohn-Leavitt path algebras. In section 7, we introduce the partially ordered set of admissible triples AT(E˙,Λ) for each B-hypergraph (E˙,Λ) and show that this poset is a lattice. We further show that the lattice of order-ideals of H-monoid of (E˙,Λ) is isomorphic to the lattice AT(E˙,Λ), which establishes that AT(E˙,Λ) is isomorphic to the complete lattice of trace ideals of Cohn-Leavitt path algebra of (E˙,Λ). In section 8 we study the representations of Leavitt path algebras of regular hypergraphs and show that the category of unital right modules of these algebras is a full subcategory and a retract of quiver representations of underlying graphs of the hypergraphs. Also, we give a characterization of Leavitt path algebras of regular hypergraphs having a finite dimensional representation in terms of their H-monoids. Finally in section 9 we provide a matrix criteria for a Leavitt path algebra of a finite hypergraph having invariant basis number.
Notation 1.1**.**
Throughout this paper, K denotes a fixed field; Z denotes the set of integers; Z+ denotes the set of non-negative integers; N denotes the set of positive integers. δ is Kronecker delta (i.e δij=0 if i=j and δij=1 if i=j). By a ring (resp. K-algebra) we mean an associative (not necessarily commutative or unital) ring (resp. K-algebra).
2. Preliminaries
In this section we recall some preliminary definitions and propositions and fix some conventions which will be used throughout the article.
A graph (or * quiver*) E=(E0,E1,r,s) consists of two sets E0,E1 called the set of vertices and the set of edges respectively, and two functions r,s:E1→E0 called the range map and the source map respectively. We place no restriction on the cardinalities of E0 and E1 or on the properties of the functions r and s. We say a graph is finite if both E0 and E1 are finite. A vertex v∈E0 is called a source (resp. sink) if r−1(v)=∅ (resp. s−1(v)=∅).
A subgraphF=(F0,F1,rF,sF) of E=(E0,E1,rE,sE) is defined by F0⊆E0, F1⊆E1 and rF is the restriction of rE on F1 and sF is the restriction of sE on F1. Let V be a subset of E0. The induced subgraph on V is the subgraph EV=(V,EV1,rV,sV) such that EV1:=s−1(V)∩r−1(V), rV and sV are restrictions of rE and sE on EV1 respectively. A subgraph is full if it is induced on its set of vertices.
A graph morphism
[TABLE]
is a pair of maps ϕ0:F0→E0 and ϕ1:F1→E1 such that rE(ϕ1(e))=ϕ0(rF(e)) and sE(ϕ1(e))=ϕ0(sF(e)), for every e∈F1.
We denote the category of graphs along with graph morphisms by Gra. Given a family of graphs {Ei}i∈I in Gra, we define their disjoint union i∈I⨆Ei to be the graph whose vertex set is i∈I⨆Ei0, edge set is i∈I⨆Ei1, and the source and range maps are trivial extensions of si and ri respectively for all i∈I.
A pathμ in a graph E is either a vertex v∈E0 or a finite sequence of edges μ=e1e2…en such that r(ei)=s(ei+1), for i=1,…,n−1. The set of all paths in E is denoted by E⋆. We define the length function l:E⋆→Z+ by
[TABLE]
We denote the set of all paths in E of length n by En, and hence E⋆=⋃n≥0En. The source and range functions s,r can be extended to E⋆ as follows:
[TABLE]
[TABLE]
The (free) path categoryCE of a graph E is the small category with Ob(CE):=E0 and for v,w∈E0, Mor(v,w):={μ∈E⋆∣s(μ)=v,r(μ)=w}. In other words, the elements of CE are paths in E and the partial multiplication is defined by path concatenation. The path [math]-semigroupS0(E) of a graph E is the set E⋆⊔{0} along with multiplication defined by extension of partial multiplication of CE by [math]. That is
[TABLE]
Definition 2.1**.**
Let E be a graph. The Path K-algebra of E, denoted by K(E), is defined to be the quotient of the free associative K-algebra generated by E0∪E1 modulo the following relations:
(1)
vw=δvwv, for all v,w∈E0,
2. (2)
s(e)e=er(e)=e, for all e∈E1.
In other words, the path K-algebra of E is obtained as the contracted K-algebra of the graph [math]-semigroup S0(E) (i.e, the zero of K(E) and S0(E) are identified). The following proposition follows from an application of Bergman’s diamond lemma [9].
Proposition 2.2**.**
Let E be a graph. Then E⋆ is a linear K-basis for K(E).
We recall that an associative ring R is said to have a set of local unitsU if U is a set of idempotents in R having the property that, for each finite subset r1,…,rn of R, there exists a u∈U for which uriu=ri, for 1≤i≤n. Also, an associative ring R is said to have enough idempotents if there exists a set of nonzero orthogonal idempotents I in R for which the set F of finite sums of distinct elements of I is a set of local units for R. We denote a ring with ring with enough idempotents by (R,I). For any graph E note that (K(E),E0) is a K-algebra with enough idempotents. Moreover, K(E) is unital if and only if E0 is finite in which case ∑v∈E0v is the unit.
By K-Alg we mean the category whose objects are K-algebras with enough idempotents and whose morphisms are K-algebra morphisms which map local units to local units. We note that K(_) is not a functor from Gra to K-Alg. This is because a graph morphism ϕ:F→E can map two distinct vertices v,w∈F0 to a same vertex in E, in which case K(ϕ)(vw)=0 in K(E), but vw=0 in K(F). However, if Gr denotes the category whose objects are graphs and morphisms are graph morphisms ϕ=(ϕ0,ϕ1) such that ϕ0 is injective. Then it is easy to verify that K(_) is a continuous functor from Gr to K-Alg (i.e, K(_) maps direct limits to direct limits).
Definition 2.3**.**
Given a graph E, the double of E, denoted by E, is defined to be the graph (E0,E1⊔E1,r,s), where E1={e∗∣e∈E1}, and the functions r and s are such that
r∣E1=r,s∣E1=s, r(e∗)=s(e) and s(e∗)=r(e), for all e∈E1.
A path μ∈E⋆ is called a generalized path. We say a graph E is connected if its double E is connected. That is, for any v,w∈E0, there is a generalized path μ∈E⋆ such that s(μ)=v and r(μ)=w. The connected components of E are the graphs {Ej}j∈J such that E=j∈J⨆Ej, where every Ej is connected.
A K-algebra R is called a G-graded algebra if R=g∈G⨁Rg, where G is a group and each Rg is a K-subspace of R and RgRh⊆Rgh for all g,h∈G. The set RH=⋃g∈GRg is called the set of homogeneous elements of R. Rg is called the g-component of R and the nonzero elements of Rg are called homogeneous of degree g. We write deg(r)=g if r∈Ag−{0}. Note that for any graph E we can define Z-grading on K(E) by defining deg(v)=0 for every v∈E0, deg(e)=1 and deg(e∗)=−1.
A ∗-ring is an associative unital ring R with an antiautomorphism ∗:R→R that is also an involution. That is, ∗ satisfies the following properties: for every x,y∈R, (x+y)∗=x∗+y∗, (xy)∗=y∗x∗, (x∗)∗=x and 1∗=1. Let K be a ∗-field with involution A:K→K. A ∗-algebra is a K-algebra R that is also a ∗-algebra such that (kr)∗=kr∗ for every k∈K and r∈R. Note that for any graph E and a ∗-field K with involution A:K→K, K(E) is a ∗-algebra with respect to the involution defined (on the generators) by (v)↦v for every v∈E0, e↦e∗ for every e∈E1 and e∗↦e for each e∗∈E1.
2.1. Leavitt path algebras and their generalizations
In this subsection we recall the definitions of Leavitt path algebras and their various generalizations.
Recall that a vertex v∈E0 is called regular if 0<∣s−1(v)∣<∞. The set of all row regular vertices in E is denoted by Reg(E).
Definition 2.4** (Cohn-Leavitt path algebras of graphs).**
Let E be a graph and S be any subset of row regular vertices Reg(E) of E. The Cohn-Leavitt path algebraCLKS(E) of Erelative toS is obtained from PK(E) by imposing the following (Cuntz-Krieger) relations:
CK1:
e∗f=δe,fr(e) for every e,f∈E1,
2. CK2:
v=e∈s−1(v)∑ee∗ for every v∈S.
In particular, CLK∅(E) is called Cohn path algebra of E and denoted by CK(E). The algebra CLKReg(E)(E) is called Leavitt path algebra of E and denoted by LK(E).
Definition 2.5** (Cohn-Leavitt path algebras of separated graphs).**
A separated graph is a pair (E,C), where E is a graph and C=⨆v∈E0Cv, Cv being a partition of s−1(v), for each vertex v∈E0. Let Cfin={X∈C∣∣X∣<∞} and S⊂Cfin. Then the Cohn-Leavitt path algebraCLK(E,C,S) of (E,C)relative toS is defined as the quotient of PK(E) obtained by imposing the following relations:
SCK1:
e∗f=δe,fr(e), for all e,f∈X,X∈C,
2. SCK2:
v=∑e∈Xee∗, for every X∈S,v∈E0.
If S=Cfin, the Cohn-Leavitt path algebra is simply called Leavitt path algebra of (E,C) and denoted by LK(E,C).
Let E be a row-finite graph and w:E1→N be a (weight) function. We define the (associated) weighted graphEw to be a graph (Ew0,Ew1,rw,sw), where Ew0=E0, Ew1={ei∣e∈E1,1≤i≤w(e)}, rw(ei)=r(e) and sw(ei)=s(e), for all e∈E1,1≤i≤w(e). Set w(v)=max{w(e)∣e∈s−1(v)}. (Note that w(v) is well-defined since E is row-finite). The weighted Leavitt path algebraWLK(Ew) of the weighted graph Ew is the quotient of PK(Ew) obtained by going modulo the following relations:
wCK1:
1≤i≤w(v)∑ei∗fi=δe,fr(e), for every e,f∈E1 and s(e)=s(f)=v∈E0,
2. wCK2:
e∈s−1(v)∑eiej∗=δi,jv, for each v∈E0,1≤i,j≤w(v),
where we set ei and ei∗ to be zero whenever i>w(e).
Definition 2.7** (Leavitt path algebras of Hypergraphs).**
Let I and X be sets. Recall that a function x:I→X, given by i↦xi=x(i) is called a family of elements in X indexed by I. We denote a family x of elements in X indexed by I by (xi)i∈I.
A hypergraph is a quadruple H=(H0,H1,s,r) where H0 and H1 are sets called the set of vertices and the set of hyperedges respectively. For each h∈H1 there exists a pair of non-empty indexing sets Ih,Jh such that s(h):Ih→H0, and r(h):Jh→H0 are families of vertices.
Let H be a hypergraph. A hyperedge h∈H1 is called source regular (resp. range regular) if Ih is finite (resp. Jh is finite). The set of all source regular hyperedges of H is denoted by Hsreg1 and the set of all range regular hyperedges of H is denoted by Hrreg1. The hypergraph H is said to be regular if H1=Hsreg1=Hsreg1.
The Leavitt path algebra LK(H) of the hypergraph H is the K-algebra presented by the generating set {v,hij,hij∗∣v∈H0,h∈H1,i∈Ih,j∈Jh} and the relations
(1)
uv=δu,vu, for every u,v∈H0,
2. (2)
s(h)ihij=hij=hijr(h)j and r(h)jhij∗=hij∗=hij∗s(h)i, for every h∈H1, i∈Ih, and j∈Jh
3. (3)
j∈Jh∑hijhkj∗=δiks(h)i, for every h∈Hsreg1 and i,k∈Ih,
4. (4)
i∈Ih∑hij∗hik=δjkr(h)j, for every h∈Hrreg1 and 1≤j,k∈Jh.
Remark 2.8*.*
Let L denote any one of the K-algebras appearing in the definitions 2.4-2.7. Then note that L satisty the following properties.
(1)
The algebra L is unital if and only if the set of vertices V in the underlying graph is finite. In this case, the unit is the sum of vertices. In general (L,V) is a K-algebra with enough idempotents.
2. (2)
If A:K→K is an involution on the field K, then L is a ∗-algebra (with respect to the involution ∗:L→L).
3. (3)
L is a graded quotient algebra of K(E) with respect to standard Z-grading given by length of paths.
PART I
3. Cohn-Leavitt path algebras of bi-separated graphs
Definition 3.1**.**
A bi-separated graph is a triple E˙=(E,C,D) such that
(1)
E=(E0,E1,r,s) is a graph,
2. (2)
C=⨆v∈E0Cv, where Cv is a partition of s−1(v) for every non-sink v∈E0,
3. (3)
D=⨆v∈E0Dv, where Dv is a partition of r−1(v) for every non-source v∈E0,
4. (4)
∣X∩Y∣≤1, for every X∈C and Y∈D,
In the above definition, C is called row-separation of E, D is called column-separation of E and (C,D) is called bi-separation of E. The elements of C are called rows and the elements of D are called columns. Let Cfin:={X∈C∣∣X∣<∞} and Dfin:={Y∈D∣∣Y∣<∞}. A bi-separated graph E˙ is called finitely row-separated (resp. finitely column-separated) if C=Cfin (resp. if D=Dfin) and is called finitely bi-separated if both C=Cfin and D=Dfin.
In the above definition we follow the convention that if S is a set, by a partition P of S we mean a family of pairwise disjoint nonempty subsets of S, whose union is S. For any non-empty set S, there always exist two trivial partitions: the partition P1 on S, called the discrete partition, where every element of P1 is a singleton and the partition PS, called the full partition, where S is the only element of PS.
Example 3.2**.**
(Standard bi-separation of a simple graph)
Let E be a simple graph (that is, e,f∈E1 such that s(e)=s(f) and r(e)=r(f) implies e=f. In other words, there are no multiedges between any two vertices). We can obtain a canonical bi-separation on E by considering both Cv and Dv to be full partitions. In other words, by defining Cv={s−1(v)} for every non-sink v∈E0 and Dv={r−1(v)} for every non-source v∈E0. This bi-separation is called standard.
In the following examples, E denotes an arbitrary graph.
Example 3.3**.**
(Trivial bi-separation of a graph)
By trivial bi-separation on a graph E, we mean both Cv and Dv are discrete partitions.
Example 3.4**.**
(Cuntz-Krieger bi-separation of a graph)
We can obtain another canonical bi-separation on E by combining full row-separation and discrete column-separation on E as follows: Consider Cv={s−1(v)} for every non-sink v∈E0 and Dv={{e}∣e∈r−1(v)} for every non-source v∈E0.
Example 3.5**.**
(Separated graphs)
A bi-separated graph (E,C,D) in which the column-separation is discrete is called a row-separated graph or simply separated graph (cf. definition 2.5). Separated graphs are denoted by (E,C).
Example 3.6**.**
(Weighted graphs)
Let E be a row-finite graph and w:E1→N be a weight map on E. Consider the weighted graph Ew=(Ew0,Ew1,rw,sw). We associate a bi-separation on Ew as follows: For every non-sink v∈E0 and 1≤i≤w(v) define Xvi:={ei∣e∈s−1(v)}. For every v∈E0 and e∈s−1(v) define Yve:={ei∣1≤i≤w(e)}. Now consider Cv:={Xvi∣1≤i≤w(v)} and Dv:=⨆w∈E0Dvw where Dvw={Yve∣e∈s−1(v)∩r−1(w)}. Here C=Cfin, since E is row-finite and D=Dfin, since w takes natural numbers as values.
Example 3.7**.**
(Hypergraphs)
We show that any hypergraph H can be associated to bi-separated graph E˙=(E,C,D) as follows: Define E=(H0,E1,s′,r′), where E1={hij∣h∈H1,i∈Ih,j∈Jh}, s′(hij)=s(h)i and r′(hij)=r(h)j. For an arbitrary h∈H1, if i∈Ih then Xhi:={hij∣j∈Jh} and if j∈Jh then Yhj:={hij∣i∈Ih}. For v∈E0, define Cv={Xhi∣h∈H1,v∈s(h)} and Dv={Yhj∣h∈H1,v∈r(h)}. By construction, C=Cfin and D=Dfin.
Notation 3.8**.**
Given a bi-separated graph E˙=(E,C,D), the maps s and r can be extended to C and D respectively in well-defined manner as follows: For X∈C, define s(X):=s(e) where e∈X and for Y∈D, define r(Y):=r(e) where e∈Y.
Also, for each X∈C and Y∈D we set
[TABLE]
We interchangeably use XY and X∩Y, wherever there is no cause for confusion.
Definition 3.9**.**
Let E˙=(E,C,D) be a bi-separated graph. The Leavitt path algebra of E˙ with coefficients over K, denoted by LK(E˙), is the quotient of K(E) obtained by imposing the following relations:
L1:
for every X,X′∈Cfin,
[TABLE]
2. L2:
for every Y,Y′∈Dfin,
[TABLE]
Example 3.10**.**
(Leavitt path algebra of a standard bi-separated simple graph)
Let E be a simple graph and consider the standard bi-separation (C,D) on E. Let the set of all non-sinks of E be denoted by Eα and the set of all non-sources be denoted by Eω. Then ∣C∣=∣Eα∣ and ∣D∣=∣Eω∣. Recall that a vertex v∈E0 is called row-regular if 0<∣s−1(v)∣<∞ and w∈E0 is called column-regular if 0<∣r−1(w)∣<∞. The set of all row-regular vertices is denoted by RReg(E) and the set of all column regular vertices is denoted by CReg(E). Note that ∣Cfin∣=∣RReg(E)∣ and ∣Dfin∣=∣CReg(E)∣.
Let A be a ∣Cfin∣×∣D∣ matrix over K(E) with entries
[TABLE]
where v∈RReg(E) and w∈Eω. Let A∗ denote the ‘adjoint transpose’ of A. Similiarly, let B be a ∣C∣×∣Dfin∣ matrix over K(E) with entries
[TABLE]
where v∈Eα and w∈CReg(E). Let B∗ denote the ‘adjoint transpose’ of B.
Then the defining relations L1 and L2 of Leavitt path algebras are obtained by imposing the following matrix relations:
[TABLE]
where V is the ∣RReg(E)∣×∣RReg(E)∣ diagonal matrix with diagonal entries V(v,v)=s(v) and and U is the ∣CReg(E)∣×∣CReg(E)∣ diagonal matrix with diagonal entries U(w,w)=r(w).
In particular, if E is finite simple graph, then the matrix A (resp. the matrix B) is obtained from the adjacency matrix of E by removing the zero rows (resp. zero columns) and replacing 1’s with corresponding edges. We illustrate this with a few examples below.
(1)
For n≥1, let Σn be the following line graph with n vertices and n−1 edges:
Then the adjacency matrix of Γn has at least two entries and at most three entries in both rows and columns, i.e.,
[TABLE]
where ∗’s are nonzero entries filled by the corresponding edges. In this case, though, the explicit description of the Leavitt path algebra LK(Γn˙) is not known.
Example 3.11**.**
(Groupoid algebra of a free groupoid)
Let E be a graph and consider the trivial bi-separation (C,D) on E. The defining relations of Leavitt path algebra of (E,C,D) turns the free path category of E into a free groupoid and hence LK(E,C,D) is the groupoid algebra of this free groupoid.
In particular if E has only one vertex then with respect to trivial bi-separation, the Leavitt path algebra is the group algebra of the free group with generators E1 (Here we identified the vertex with the group identity).
Example 3.12**.**
(Leavitt path algebra of a graph)
Let E be any graph and E˙ be the associated bi-separated graph with respect to Cuntz-Kreiger bi-separation on E. Then we have LK(E˙)≅LK(E).
Example 3.13**.**
(Leavitt path algebra of a separated graph)
Let E˙=(E,C) be a (row) separated graph. Then it is direct that LK(E˙)≅LK(E,C).
Example 3.14**.**
(Weighted Leavitt path algebra of a weighted graph)
Let E be a row-finite graph and w:E1→N be a weight map. Consider E˙=(E,C,D) where (C,D) is the weighted bi-separation on E as in example 3.6. Then it is immediate that LK(E˙)≅WLK(Ew).
It has been noted in [7, page 171] that neither weighted Leavitt path algebras nor Leavitt path algebras of separated graphs are particular cases of the each other. One can mix the above two examples and construct new algebras as follows:
Example 3.15** (Weighted Cohn-Leavitt path algebras of finitely separated graphs).**
Let (E,C) be a finitely row-separated graph (i.e. a separated graph in which C=Cfin). Let w:E1→N be a function and Ew be the associated weighted graph. For X∈C, set w(X)=max{w(e)∣e∈X}. The weighted Cohn-Leavitt path algebra CLK(Ew,C) of (Ew,C) can be defined as the quotient of PK(Ew) by factoring out the following relations:
wSCK1:
1≤i≤w(X)∑ei∗fi=δe,fr(e), for every e,f∈X and X∈C,
2. wSCK2:
e∈X∑eiej∗=δi,js(e), for each X∈C,1≤i,j≤w(X),
where we set ei and ei∗ to be zero whenever i>w(e).
Given a weighted finitely separated graph (Ew,C), we get a canonical bi-separated graph as follows: For X∈C and 1≤i≤w(X), define Xi={ei∣e∈X} and set Cv={Xi∣X∈Cvand1≤i≤w(X)}. Here C=Cfin, since E is finitely separated. Now, for e∈X, define YXe={ei∣1≤i≤w(e)} and Dvw={YXe∣e∈X}. Observe that D=Dfin, since w is natural number valued. Now setting E˙=(E,C,D), we immediately get
[TABLE]
Example 3.16** (Leavitt path algebra of a hypergraph).**
Given any hypergraph H, consider the associated bi-separated graph EH˙ as in example 3.7. Then we have LK(E˙)≅LK(H).
Definition 3.17**.**
Let E˙=(E,C,D) be bi-separated graph. Let S⊆Cfin and T⊆Dfin be two distinguished sets. The Cohn-Leavitt path algebra of E˙ with coefficients over K relative to (S,T), denoted by AK(E,(C,S),(D,T)), is the quotient of K(E) obtained by imposing the following relations:
A1:
for every X,X′∈S,
[TABLE]
2. A2:
for every Y,Y′∈T,
[TABLE]
For notational convenience we denote the bi-separated graph with given distinguished subsets as in the above definition as a 5-tuple E˙=(E,(C,S),(D,T)) and again call it bi-separated graph if there is no confusion and denote the Cohn-Leavitt path algebra also as AK(E˙). Whenever we want to distinguish the case that S=Cfin and T=Dfin we simply call the Cohn-Leavitt path algebra as Leavitt path algebra.
Proposition 3.18** (Universal property of AK(E˙)).**
Let E˙=(E,(C,S),(D,T)) be a bi-separated graph. Suppose A is a K-algebra which contains a set of pairwise orthogonal idempotents {Av∣v∈E0}, two sets {Ae∣e∈E1}, {Be∣e∈E1} for which the following hold.
(1)
As(e)Ae=AeAr(e)=Ae, and Ar(e)Be=BeAs(e)=Be for all e∈E1.
2. (2)
for every X,X′∈S, Y∈D∑AXYBYX′=δXX′As(X),
3. (3)
for every Y,Y′∈T, X∈C∑BYXAXY′=δYY′Ar(X)
then there exists a unique map ψ:AK(E˙)→A such that ψ(v)=Av, ψ(e)=Ae, and ψ(e∗)=Be for all v∈E0 and e∈E1.
Example 3.19** (Cohn-Leavitt path algebra of a graph).**
Let E be a graph and let S⊆RReg(E). Then the Cohn-Leavitt path algebra CLKS(E) of E can be realized as Cohn-Leavitt path algebra AK(E˙) of the bi-separated graph E˙=(E,(C,S),(D,T)), where (C,D) is the Cuntz-Krieger bi-separation on E, RReg(E)=Cfin and T=D.
Example 3.20**.**
(Cohn-Leavitt path algebra of a separated graph)
Let (E,C) be a separated graph and S⊆Cfin. Set E˙=(E,(C,S),(D,T)), where T=Dfin=D. Then from definition it is clear that AK(E˙)≅CLK(E,C,S).
We say a bi-separated graph E˙=(E,(C,S),(D,T)) is connected if the underlying graph E is connected. Because of the following proposition, we assume henceforth that every bi-separated graph is connected.
Proposition 3.21**.**
Let E˙ be a bi-separated graph. Suppose E˙=j∈J⨆Ej is a decomposition of E˙ into its connected components. Then AK(E˙)≅j∈J⨁AK(Ej˙), where Ej˙ is the bi-separated graph structure on Ej induced by the bi-separated graph structure on E.
Proof.
Follows from universal property of AK(E˙).
∎
Lemma 3.22**.**
Let E˙ be a bi-separated graph.
(1)
The algebra AK(E˙) is unital if and only if E0 is finite. In this case,
[TABLE]
2. (2)
For each α∈AK(E˙), there exists a finite set of distinct vertices V(α) for which α=fαf, where f=v∈V(α)∑v. Moreover, the algebra (AK(E˙),E0) is a ring with enough idempotents.
3. (3)
Let A:K→K be an involution on the field K. Then with respect to the involution ∗:AK(E˙)→AK(E˙), AK(E˙) is a ∗-algebra.
4. (4)
AK(E˙)* is a graded quotient algebra of K(E) with respect to standard Z-grading given by length of paths.*
Proof.
The proof follows on similiar lines of [2, Lemma 1.2.12].
∎
Now, the linear extension of ∗ in paths induces a grade reversing involution. Hence for any E˙, AK(E˙) are Z-graded ∗-algebras and the (graded) categories of left modules and right modules for any of Cohn-Leavitt path algebras of bi-separated graphs are equivalent.
Let Γ be any group with identity ε and we can consider a Γ-grading on AK(E˙) with E0⊔E1 being homogeneous. Since v2=v for each v∈E0, we are forced to define deg(v)=ε. Since the relations A1 and A2 are homogeneous we can conclude that all e∗ in E1 are also homogeneous with deg(e∗)=(deg(e))−1. As a result, any function from E1 to Γ defines a unique Γ-grading on AK(E˙) with deg(v)=ε for all v∈E0 and deg(e∗)=(deg(e))−1. A refinement or a morphism from a Γ-grading to Γ′-grading on an algebra A is given by a group homomorphism ϕ:Γ→Γ′ such that for all γ′∈Γ′, Aγ′=ϕ(γ)=γ′⨁Aγ where Aγ:={a∈A∣degΓ(a)=γ}∪{0}. There is a universal Γ-grading on AK(E˙) which is a refinement of all others:
Proposition 3.23**.**
Let Γ:=FE1, the free group on E1 with identity ε. The Γ-grading defined by degΓ(v)=ε and degΓ(e)=e is an initial universal object in the category of group gradings of AK(E˙) with E0⊔E1 being homogeneous.
Proof.
For any Γ′-grading let ϕ:Γ→Γ′ be the group homomorphism given by ϕ(e)=degΓ′(e).
∎
4. The categories BSG and tBSG
In this section we introduce two categories BSG of bi-separated graphs and the category tBSG of tame bi-separated graphs. We show that the functor AK() from BSG to K-Alg is continuous. We also show that each object of tBSG is a direct limit of sub-objects based on finite graphs, from which we obtain every Cohn-Leavitt path algebra of tame bi-separated graph as a direct limit of unital Cohn-Leavitt path algebras.
Definition 4.1**.**
We define a category BSG of bi-separated graphs as follows: The objects of BSG are bi-separated graphs (with distinguished subsets) E˙=(E,(C,S),(D,T)). A morphism ϕ:E˙→E˙ in BSG is a triple ϕ=(ϕ0,ϕ1,ϕ2) satisfying the following conditions:
(1)
ϕ0:E→E is graph morphism such that ϕ00,ϕ01 are injective.
2. (2)
ϕ1:C→C is a map such that X∈Cv⟹ϕ1(X)∈Cϕ00(v).
3. (3)
ϕ1(S)⊂S. Moreover ϕ01X:X→X is a bijection, for every X∈S.
4. (4)
ϕ2:D→D is a map such that Y∈Dv⟹ϕ1(Y)∈Dϕ00(v).
5. (5)
ϕ2(T)⊂T. Moreover ϕ01Y:Y→Y is a bijection, for every Y∈T.
6. (6)
If X∈S,Y∈T then X∩Y=∅⟹X∩Y=∅.
Proposition 4.2**.**
The category BSG admits arbitrary direct limits.
Proof.
The proof is similar to [7, Proposition 3.3]. The only addition is that we have to define D and T analogous to the way we define C and S.
∎
Recall that a functor is continuous if it preserves direct limits.
Proposition 4.3**.**
The assignment E˙⇝AK(E˙) extends to a continuous covariant functor AK()) from BSG to K-Alg.
We say a morphism ϕ:E˙→E˙ in BSG is complete if ϕ1−1(S)=S and ϕ2−1(T)=T.
Definition 4.5**.**
Let E˙ be an object in BSG. A sub-object of E˙ is an object E′˙=(E′,(C′,S′),(D′,T′)) such that E′ is a sub-graph of E and the following conditions hold:
[TABLE]
Definition 4.6**.**
Let E˙ be an object in BSG. A complete sub-object of E˙ is a sub-object E′˙ such that the inclusion is a complete morphism.
Proposition 4.7**.**
Any object in BSG is a direct limit of countable complete sub-objects.
Proof.
Let E˙ be an object in BSG. For a finite subset A⊂E0⊔E1, let EA be the graph generated by A, i.e.,
EA1=A∩E1 and EA0=(A∩E0)∪sE−1(EA1)∪rE−1(EA1).
If the graph E0 generated by EA0⊔v∈EA0⨆E0v is a complete sub-object of the given object, we are done. If not, define
E1v to be E0v∪X∈S∩CvX∩E0v=∅⋃X∪Y∈T∩DvY∩E0v=∅⋃Y.
If the graph E1 generated by E00⊔v∈E00⨆E1v is a complete sub-object of the given object we are done. If not define E2v similarly and continue this process.
Hence we have a chain E0→E1→E2→….
Let E be the direct limit of this chain, i.e., let E˙=(E,(C,S),(D,T)) be the direct limit of the directed system {Ei˙=(Ei,(Ci,Si),(Di,Ti))}, where i∈N∪{0}.
Observe that for i≥0,Si={X∈S∣X∩Ei−11=∅} and Ci={X∈Ei1∣X∈C∖S,X∩Ei1=∅}⊔Si, where E−1 means A. Similar statements hold for Di and Ti.
Since the vertex set and edge set of E are countable union of finite sets, it is a countable sub-graph of E.
We claim that E˙ is a complete sub-object of E˙. For, let X∈S and X∩E1=∅. Then X∩Ei1=∅, for some i∈N∪{0}. This implies X∈Si+1, which in turn means X∈S. Similarly one can start with X∈C∖S and prove that whenever X∩E1=∅, the set X∩E1∈C∖S. Repeating the analogous arguments for T, we can conclude that for each finite subset A⊂E0⊔E1, there exists a countable complete sub-object E˙ of E˙. Now by keeping the set of all finite subsets of E0⊔E1 as the indexing set, we get a directed system of countable complete sub-objects whose direct limit is E˙.
∎
We emphasize that a general object in BSG cannot be written as a direct limit of finite complete sub-objects as the following example illustrates:
Example 4.8**.**
Consider the following simple graph Γ∞ on countably infinite vertices.
Observe that Γ∞ is a simple graph. Consider the standard bi-separation (C,D) on Γ∞ and let S=Cfin=C and T=Dfin=D. Then C∞ cannot be written as a direct limit of finite complete sub-objects. For, if there is a complete sub-object of Γ∞, then by definition we are forced to include all the edges and so, it will no more be finite.
4.1. The category of tame bi-separated graphs
Let E˙ be an object in BSG. Set
[TABLE]
We define a relation ∼T on S1 as follows: For X,X′∈S1, define X∼TX′ if either X=X′ or there exists a finite sequence X0,Y1,X1,Y2,X2,…,Yn−1,Xn−1,Yn,Xn such that for each 0≤i≤n, Xi∈S,Yi∈T, and X0=X, Xn=X′, Xi∩Yi+1=∅ and Yi∩Xi=∅. It is not hard to see that ∼T is an equivalence relation on S1. Let S1=λ∈Λ⨆Xλ be the partition of S1 induced by ∼T.
Define ∼S on T1 similarly and let T1=λ′∈Λ′⨆Yλ′ be the partition induced by ∼S.
We claim that the indexing sets Λ and Λ′ are in bijection. To see this, start with λ∈Λ. Let X∈Xλ be an arbitrarily fixed element. This means, there exists a λ′∈Λ′ and Y∈Yλ′ such that X∩Y=∅. If X′=X is another element of Xλ, and if there is a Y′∈T such that X′∩Y′=∅, then Y′∼SY because X′∼TX. So Y′ belongs to the same Yλ′ as Y. Also if there is another element Y1∈T such that X∩Y1=∅, then clearly Y1∼SY and so Y1 also lies in same Yλ′. This implies that the map Λ→Λ′ defined by λ↦λ′ is well-defined. Similarly one can define a map Λ′→Λ. It is not hard to see that these maps are inverses of each other which proves the claim. Therefore, we have the following proposition:
Proposition 4.9**.**
Let E˙ be an object in BSG and let S1,T1 be as defined in equations 1 and 3 above. Then there exist canonical partitions S1=λ∈Λ⨆Xλ and T1=λ′∈Λ′⨆Yλ′ of S1 and T1 respectively such that the indexing sets Λ and Λ′ are bijective.
Remark 4.10*.*
Because of the above proposition, we will denote the indexing sets of the canonical partitions of both S1 and T1 by Λ.
Definition 4.11**.**
A bi-separated graph E˙ is called tame if ∣Xλ∣<∞ and ∣Yλ∣<∞, for each λ∈Λ. The tame bi-separated graphs along with complete morphisms form a category which we call a tame (sub)category of bi-separated graphs. It will be denoted by tBSG.
Note that any finite bi-separated graph is tame. Also, the class of bi-separated graphs in examples 3.4, 3.5, 3.6, and 3.7 are all tame.
Proposition 4.12**.**
Let E˙ be a tame bi-separated graph such that S=Cfin=C, T=Dfin=D and ∣E0∣=1. For λ∈Λ, let Eλ be the subgraph of E with edge set e∈XX∈Xλ⋃{e} and consider the bi-separation Cλ={X∈Xλ}, and Dλ={Y∈Yλ} . Then
AK(E˙) is isomorphic to the free-product of algebras AK(Eλ˙), where λ varies over the indexing set Λ.
Let (E,C) be a separated graph with ∣E0∣=1. Then LK(E,C) is isomorphic to the free-product of algebras LK(1,∣X∣), where LK(1,∣X∣) is the Leavitt algebra of type (1,∣X∣) and X varies over C.
Theorem 4.14**.**
Every object E˙ in tBSG is a direct limit of finite (complete) sub-objects. Conversely, if E˙ in BSG is a direct limit of finite complete sub-objects then it belongs to tBSG.
Proof.
Let E˙ be an object in tBSG. By exactly same arguments as in Proposition 4.7, E˙ is a direct limit of the directed system
[TABLE]
It follows from the definition of tame bi-separated graphs that EA˙ is finite, for each finite subset A of E0⊔E1.
Conversely, let E˙ be a direct limit of the directed system
[TABLE]
of finite complete sub-objects. We know that S and T can be partitioned as S1⊔S2 and T1⊔T2 respectively (see equations 1 to 4 before the proposition 4.9). If S1=∅, then T1=∅ and clearly E˙ is tame.
Suppose S1=∅. Then we have S1=λ∈Λ⨆Xλ and T1=λ∈Λ⨆Yλ. That each ∣Xλ∣ and ∣Yλ∣ is finite follows from the fact that the directed system consists of finite objects and the morphisms involved are complete.
∎
Corollary 4.15**.**
Let E˙ be an object in tBSG. Then the Cohn-Leavitt path algebra AK(E˙) is the direct limit of the directed system of unital algebras {AK(E˙i)}i∈I such that whenever j≥i, the map AK(E˙i)→AK(E˙j) is a monomorphism, where
{E˙i}i∈I is a directed system of finite complete sub-objects of E˙ whose direct limit is E˙.
Proof.
By the previous theorem, E˙ is a direct limit of a directed system {E˙i}i∈I consisting of its finite complete sub-objects. Therefore, by proposition 4.3 and Theorem 5.3, AK(E˙) is the direct limit of the directed system of algebras {AK(E˙i)}i∈I.
∎
By corollary 4.15 (Cohn-)Leavitt path algebras of the classes of bi-separated graphs in examples 3.4-3.7 are direct limits of unital sub-(Cohn-)Leavitt path algebras of same type.
5. Normal forms and their applications
Definition 5.1**.**
For each pair X,X′∈S, if there exists Y∈D such that X∩Y=∅ and X′∩Y=∅, then we choose and fix one such Y (this may vary with X,X′) and call (XY)(YX′)∗ a forbidden word of type I.
Similarly for each pair Y,Y′∈T, if there exists X∈D such that Y∩X=∅ and Y′∩X=∅, then we choose and fix one such X and call (YX)∗(XY′) a forbidden word of type II.
Definition 5.2**.**
A generalized path μ∈E⋆ is called normal if it does not contain any forbidden subword of types I or II. An element of K(E) is called normal if it lies in the K-linear span of generalized normal paths.
We will show that any element of AK(E˙) has precisely one normal representative in K(E). For this, we need to use Bergman’s diamond lemma. We refer the reader to [9, pp. 180-182] for the statement of the lemma and basic terminologies.
Theorem 5.3**.**
Let E˙ be a bi-separated graph . Then AK(E˙) has a basis consisting of normal generalized paths.
Proof.
In order to apply Bergman’s diamond lemma, we
replace the defining relations by the following:
1′:
For any v,w∈E0,
[TABLE]
2. 2′:
For any v∈E0,e∈E1,
[TABLE]
[TABLE]
[TABLE]
[TABLE]
3. 3′:
For any e,f∈E1,
[TABLE]
[TABLE]
[TABLE]
[TABLE]
4. A′1:
For each X,X′∈S for which there exists Y∈D such that X∩Y=∅ and X′∩Y=∅,
[TABLE]
5. A′2:
For each Y,Y′∈T for which there exists X∈C such that X∩Y=∅ and X∩Y′=∅,
[TABLE]
(i.e. In A′1 and A′2, LHS contains forbidden words).
Denote by Σ the reduction system consisting of all pairs σ=(wσ,fσ), where wσ equals the LHS of an equation above and fσ the corresponding RHS. Let ⟨Pˉ⟩ be the monoid consisting of all words formed by letters in E0∪E1∪E1 and ⟨P⟩ be the semi-group obtained by removing the identity element of ⟨Pˉ⟩. We define a partial order on ⟨P⟩ as follows:
Let A=x1x2…xn∈⟨P⟩. Set l(A)=n and
[TABLE]
Define a partial order ≤ on ⟨P⟩ by A≤B if and only if one of the following holds:
(1)
A=B,
2. (2)
l(A)<l(B) or
3. (3)
l(A)=l(B),and for eachG,H∈⟨Pˉ⟩,m(GAH)<m(GBH).
Clearly ≤ is a semigroup partial order on ⟨P⟩ compatible with Σ and also the descending chain condition is satisfied. It remains to show that all ambiguities of Σ are resolvable. Recall from Proposition 2.2 that E⋆ is a linear K-basis for K(E). Hence it is sufficient to show that the following ambiguities are resolvable:
[TABLE]
[TABLE]
We note that there are no inclusion ambiguities. We only show how to resolve ambiguity of type A′1−A′2 and the other case follows similarly.
This proves the confluence condition. The final expression written above is a finite sum as X∈S and Y∈T. If some terms in this expression contain forbidden words, we further reduce them as above. But this process has to terminate in finitely many stages (again since X∈S and Y∈T). Also, it should be noted that in this sequence of reductions, the same forbidden word cannot appear more than once at different stages. For, that would mean that a single relation is contributing more than one forbidden words, which is a contradiction. This proves the reduction finiteness as well.
∎
Corollary 5.4**.**
Let E˙ be a bi-separated graph. Then the natural homomorphism from the path algebra K(E) to the algebra AK(E˙) is an inclusion.
Proof.
From the theorem, it follows that each path μ∈E⋆ is a part of a basis of AK(E˙) as μ does not contain any forbidden word.
∎
In the following subsections we give some applications of normal forms of Cohn-Leavitt path algebras. To be precise, we find bi-separated graph theoretic properties that correspond to algebraic properties. One needs to be careful in the sense that in the general setting of bi-separated graphs, finding conditions only on underlying graphs are not enough. We also need suitable conditions on (S,T) which give the defining relations of Cohn-Leavitt path algebras. In the following subsections we recall some definitions and propositions from the theory of rings with enough idempotents. Then we give their applications to the case of Cohn-Leavitt path algebras. We note that the reasoning is very similar to that of [29]. Wherever some care is required we provide complete proofs else the reader is refered to [29] for proofs.
5.1. Local valuations and their applications
Definition 5.5**.**
Let (R,I) be a ring with enough idempotents. A local valuation on (R,I) is a map ν:R→Z+∪{−∞} such that
(1)
ν(x)=−∞if and only ifx=0,
2. (2)
ν(x−y)≤max{ν(x),ν(y)} for any x,y∈R and
3. (3)
ν(xy)=ν(x)+ν(y) for any e∈I, x∈Re and y∈eR.
A local valuation ν on (R,I) is called trivial if ν(x)=0 for each x∈R−{0}.
Let R be a ring. A left ideal a of R is called essential if a∩b=0⇒b=0 for any left ideal b of R. For any x∈R recall the left annihilator ideal of x is Ann(x):={y∈R∣yx=0}. A ring R is called left non-singular if for any x∈R, Ann(x) is essential ⇔x=0. A right non-singular ring is defined similarly. A ring is non-singular is if it is both left and right non-singular.
Proposition 5.6**.**
[29, Proposition 37]**
Let (R,I) be a ring with enough idempotents which admits a local valuation. Then R is non-singular.
A non-zero ring R is called a prime ring if ab=0⇒a=0 or b=0 for any ideals a and b of R. A ring with enough idempotents (R,I) is connected if eRf=0 for any e,f∈I.
Proposition 5.7**.**
[29, Proposition 38]**
Let (R,I) be a nonzero, connected ring with enough idempotents which admits a local valuation. Then R is a prime ring.
A ring R is said to be von Neumann regular if for any x∈R there exists y∈R such that xyx=x.
Proposition 5.8**.**
[29, Proposition 39]**
Let (R,I) be a ring with enough idempotents that has a nontrivial local valuation. Then R is not von Neumann regular.
Recall that the Jacobson radical of a ring R is the ideal consisting of those elements in R that annihilate all simple (right or left) R-modules. A ring is called semiprimitive if its Jacobson radical is the zero ideal.
Proposition 5.9**.**
[29, Proposition 40]**
Let (R,I) be a connected K-algebra with enough idempotents which admits a local valuation ν such that ν(x)=0 if and only if x is a nonzero K-linear combination of elements in I. Then R is semiprimitive.
Now we find conditions on a bi-separated graph E˙ for which the corresponding Cohn-Leavitt path algebra admits a local valuation.
Definition 5.10**.**
A bi-separated graph E˙=(E,(C,S),(D,T)) is said to satisfy Condition LV if one of the following holds:
(LV1) :
∣S∣≤1 , ∣T∣≤1 and if X∈S (resp. Y∈T), then ∣X∣>1 (resp. Y>1).
2. (LV2) :
∣S∣>1 or ∣T∣>1, and the following two conditions are satisfied:
(a)
For any X1,X2∈S, either there is no Y∈D such that X1∩Y=∅andX2∩Y=∅
or ∃Y1,Y2∈D,Y1=Y2 such that Xi∩Yj=∅ for each 1≤i,j≤2.
2. (b)
For any Y1,Y2∈T, either there is no X∈C such that Y1∩X=∅ and Y2∩X=∅
or ∃X1,X2∈C,X1=X2 such that Xi∩Yj=∅ for each 1≤i,j≤2.
We say E˙ satisfies Domain condition if either ∣S∣≤1,∣T∣≤1 or (LV2) holds.
Proposition 5.11**.**
Let E˙ be a bi-separated graph and for any a∈AK(E˙), let supp(a) denote the set of all normal generalized paths occuring in NF(a) with nonzero coefficients, where NF(a) is the unique normal representative of a. If E˙ satisfies condition LV, then the map
ν:AK(E˙)→Z+∪{−∞} defined by
[TABLE]
is a local valuation on AK(E˙).
Proof.
The first two conditions of a local valuation are obvious. It remains to show ν(ab)=ν(a)+ν(b), for any v∈E0,a∈AK(E˙)v and b∈vAK(E˙). If one of ν(a) and ν(b) is [math] or −∞, then the result is clear. Suppose now ν(a),ν(b)≥1. Since any reduction preserves or decreases the length of a generalized path, it follows that ν(ab)≤ν(a)+ν(b). So it remains to show that ν(ab)≥ν(a)+ν(b). Let
[TABLE]
be the elements of supp(a) with length ν(a) and
[TABLE]
be the elements of supp(b) with length ν(b). We assume that the pk’s are pairwise distinct and so are ql’s. Since NF is a linear map, we can make the following conclusions:
(1)
If xν(a)ky1l is not of type I or II, then
NF(pkql)=pkql.
2. (2)
If xν(a)ky1l is of type I, then there are X,X′∈S and Y∈D such that xν(a)ky1l=(XY)(X′Y)∗ and (XY)(X′Y)∗ is forbidden. So
[TABLE]
3. (3)
If xν(a)kyν(b)l is of type II, then there are Y,Y′∈T and X∈C such that xν(a)kyν(b)l=(XY)∗(XY′) and (XY)∗(XY′) is forbidden. So
[TABLE]
Case1: Assume that xν(a)ky1l is not of type I or II, for any k, l.
Then pkql∈supp(a), for any k, l. So ν(ab)≥∣pkql∣=ν(a)+ν(b).
Case2: Assume that there are k and l such that xν(a)kyν(b)l is of type I.
Then there are X,X′∈S and Y∈D such that xν(a)ky1l=(XY)(X′Y)∗ and (XY)(X′Y)∗ is forbidden. Since E˙ is an LV-object, there is at least one more element Y∈D other than Y such that XY=0 and X′Y=0.
Case2.1: Assume pk′ql′=x1k…xν(a)−1k(XY)(X′Y)∗y2l…yν(b)l, for any k′,l′.
Then x1k…xν(a)−1k(XY)(X′Y)∗y2l…yν(b)l∈supp(ab), since it does not cancel with any other term. So we are done.
Case2.2: Assume pk′ql′=x1k…xν(a)−1k(XY)(X′Y)∗y2l…yν(b)l, for some k′,l′. In this case, pkql′=x1k…xν(a)−1k(XY)(X′Y)∗y2l…yν(b)l∈supp(ab) and so we are done.
Case3: Assume that there are k and l such that xν(a)ky1l is of type II.
Then there are Y,Y′∈T and X∈C such that xν(a)ky1l=(XY)∗(XY′) and (XY)∗(XY′) is forbidden. Again since E˙ is an LV-object, there is at least one more element X∈C other than X such that XY=0 and XY′=0. The proof now follows in exactly the same way as in Cases2.1 and 2.2.
∎
Corollary 5.12**.**
Let E˙ be a bi-separated graph satifying condition LV. Then
(1)
AK(E˙)* is nonsingular.*
2. (2)
E˙* is connected implies AK(E˙) is semiprimitive.*
3. (3)
E˙* is connected and non-empty implies AK(E˙) is prime.*
4. (4)
∣E1∣≥1* implies AK(E˙) is not von Neumann regular.*
Theorem 5.13**.**
Let E˙ be a bi-separated graph. Then AK(E˙) is a domain if and only if E˙ satisfies domain condition.
Proof.
If E˙ satisfies domain condition, then we consider the two following cases:
Case1: Assume that X∈S⇒∣X∣>1 and Y∈T⇒∣Y∣>1. If both S and T are empty, then AK(E˙) is a free unital K-algebra and hence a domain (since K is a field). Otherwise, by the proposition 5.11, there is a local valuation on AK(E˙). So if ab=0 in AK(E˙), then ν(ab)=−∞, which implies ν(a)+ν(b)=−∞. This means that ν(a)=−∞ or ν(b)=−∞. Hence a=0 or b=0. Therefore AK(E˙) is a domain.
Case2: The only remaining cases to be considered are when S={X} with X={e} or T={Y} with Y={f}. In both these cases the relations imposed on K(E) are not of the form ab=0.
For converse,
if ∣E0∣>1, then obviously AK(E˙) is not a domain. Otherwise, we consider the following cases separately:
Case1: Assume that there are two distinct elements X,X′∈S which have only one common Y∈D such that XY=0, X′Y=0. Then (XY)(X′Y)∗=δXX′s(X)=0. So we are done.
Case2: Assume that there are two distinct elements Y,Y′∈T which have only one common X∈C such that XY=0, XY′=0. Then (XY)∗(XY′)=δYY′r(Y)=0.
This completes the proof.
∎
5.2. The Gelfand-Kirillov dimension
We first recall some basic facts on the growth of algebras from [18]. Suppose B is a finitely generated K-algebra. Choose a finite generating set of B and let V be the K-subspace of B spanned by this chosen generating set. For each natural number n, let Vn denote the K-subspace of B spanned by all words in V of length less than or equal to n. In particular, V1=V. Then we have an ascending chain
K⊆V1⊆V2⊆…⊆Vn⊆…
of finite dimensional K-subspaces of B such that B=⋃n∈N0Vn, where, by convention, V0=K. Clearly, the sequence {dimK(Vn)} is a montonically increasing sequence and the asymptotic behaviour (see the definition 5.14) of this sequence provides an invariant of the algebra B, called the Gelfand-Kirillov dimension of B, which is defined to be
[TABLE]
Definition 5.14**.**
Given two eventually monotonically increasing functions ϕ,ψ:N→R+, we say ϕ⪯ψ if there are natural numbers a and b such that ϕ(n)≤aψ(bn), for almost all n∈N. We say ϕ* is asymptotically equivalent to ψ*, if both ϕ⪯ψ and ψ⪯ϕ. If ϕ and ψ are asymptotically equivalent, we write ϕ∼ψ.
Coming back to GK dimension of algebras, if a K-algebra B has two distinct finite generating sets, and if V and W are the finite dimensional subspaces of B spanned by these sets, then setting ϕ(n)=dimK(Vn) and ψ(n)=dimK(Wn), one can show that ϕ∼ψ [18, Lemma 1.1]. In this notation, if ϕ⪯nm for some m∈N, then B is said to have polynomial growth and in this case GKdim(B)≤m. If on the other hand, ϕ∼an for some a∈R such that a>1, then B is said to have exponential growth and in this case GKdim(B)=∞.
Definition 5.15**.**
A bi-separated graph E˙ is said to satisfy Condition (A′) if
(A′1):
S=T=∅ implies either ∣E1∣>0 or ∣E0∣=∞.
2. (A′2):
S=∅ or T=∅ implies at least one of the following holds:
(a)
∃X1,X2∈S,X1=X2, s(X1)=s(X2) and Y∈D such that for i∈{1,2},Xi∩Y=∅ and (XiY),(XiY)∗ are not part of any forbidden word.
2. (b)
∃Y1,Y2∈T,Y1=Y2, r(Y1)=r(Y2) and X∈C such that for i∈{1,2},Yi∩X=∅ and (YiX),(YiX)∗ are not part of any forbidden word.
3. (c)
∃X∈S,Y∈D such that X∩Y=∅, s(X)=r(Y) and (XY),(XY)∗ are not part of any forbidden word.
4. (d)
∃Y∈T,X∈C such that X∩Y=∅, s(X)=r(Y) and (XY),(XY)∗ are not part of any forbidden word.
Proposition 5.16**.**
If E˙ is a finite bi-separated graph and satisfies condition A′ then AK(E˙) has exponential growth.
Definition 5.17**.**
[29, Definition 20,21]
Let E˙ be a bi-separated graph. A quasi-cycle is a normal generalized path p in E such that p2 is normal and none of the sub-words of p2 of length less than ∣p∣ is normal. A quasi-cycle p is called self-connected if there is a normal path o in E such that p is not a prefix of o and pop is normal.
Theorem 5.18**.**
Let E˙ be a finite bi-separated graph. Then AK(E˙) has exponential growth if and only if there is a self-connected quasi-cycle.
Remark 5.19*.*
Let E˙ be a tame bi-separated graph and suppose that {E˙λ∣λ∈Λ} is a directed system of all finite sub bi-separated graphs of E˙. By results of [26, Section 3] we have GKdim(AK(E˙)=λsupGKdim(AK(E˙λ)).
5.3. Additional applications of Linear bases
In this subsection we fix the following notations. Let (R,I) be a K-algebra with enough idempotents. An element a∈R is called homogeneous if a∈vRw for some v,w∈I. Let B denote a K-basis for R which consists of homogeneous elements and contains I. Let l:B→Z+ be a map such that l(b)=0⇔b∈I.
Definition 5.20**.**
An element b∈B∩vRw is called left adhesive if ab∈B for any a∈B∩Rv and right adhesive if bc∈B for any c∈B∩wR. A left valuative basis element is a left adhesive element b∈B∩eR such that l(ab)=l(a)+l(b) for any a∈B∩Rv. A right valuative basis element is defined similarly. A valuative basis element is an adhesive element b∈B∩vRw such that l(abc)=l(a)+l(b)+l(c) for any a∈B∩Rv and c∈B∩wR.
Proposition 5.21**.**
[29, Proposition 53]**
Suppose there exists a valuative basis element b∈(B−I)∩vRv. Then dimK(R)=∞, R is not simple, neither left nor right Artinian and not von Newmann regular.
Definition 5.22**.**
A bi-separated graph E˙=(E,(C,S),(D,T)) is said to satisfy Condition (A) if
(A1):
S=T=∅ implies ∣E0∣=∞ or ∣E1∣>0
2. (A2):
S=∅ or T=∅ implies at least one of the following holds:
(a)
∃X∈S,Y∈D such that X∩Y=∅, (XY)(XY)∗ and (XY)∗(XY) are not forbidden words.
2. (b)
∃Y∈T,X∈C such that X∩Y=∅, (XY)(XY)∗ and (XY)∗(XY) are not forbidden words.
Let B denote the set of all normal generalized paths of AK(E˙). Let l:B→Z+ denote the map which maps a path to its length. If E˙ satisfy Condition (A2) then we can choose either X∈S,Y∈D or Y∈T,X∈C such that X∩Y=∅ and (XY)(XY)∗ is not forbidden. Set b=(XY)(XY)∗, then b is a valuative basis element. Hence we have the following corollary.
Corollary 5.23**.**
Let E˙ be a bi-separated graph that satisfies Condition (A). Then dimK(AK(E˙))=∞, AK(E˙) is not simple, neither left nor right Artinian and not von Neumann regular.
Definition 5.24**.**
Let b∈B∩vRw and b′∈B∩v′Rw′. We say that b and b′ have no common left multiple if there are no a∈B∩Rv,a′∈B∩Rv′ such that ab=a′b′. We say that b and b′ have no common right multiple if there are no c∈B∩wR,c′∈B∩w′R such that bc=b′c′.
An element b∈B∩vRw is called right cancellative if ab=cb⇒a=c for any a,c∈B∩Rv and left cancellative if ba′=bc′⇒a′=c′ for any a′,c′∈B∩wR.
Proposition 5.25**.**
[29, Proposition 56]**
If there are elements b,b′∈B∩vRv such that b is adhesive and right cancellative, b′ is left adhesive and b and b′ have no common left multiple, then R is not left Noetherian.
If there are elements c,c′∈B∩vRv such that c is adhesive and left cancellative, c′ is right adhesive and c and c′ have no common left multiple, then R is not right Noetherian.
We have the following corollary which gives a necessary condition for AK(E˙) to be a left or right Noetherian in terms of E˙.
Corollary 5.26**.**
Let E˙ be a bi-separated graph that satisfies Condition (A′). Then AK(E˙) is neither left nor right Noetherian.
Proof.
We prove the statement only for conditions (A′2)(a) and (A′2)(c) leaving the other simple cases to the reader.
Suppose there exist X1,X2∈S, X1=X2, s(X1)=s(X2)=v and Y∈D such that for i∈{1,2}, Xi∩Y=∅ and (XiY), (XiY)∗ are part of forbidden words. Then set b1:=(X1Y)(X1Y)∗, b2:=(X1Y)(X2Y)∗ and b3:=(X2Y)(X1Y)∗. Then b1,b2,b3∈(B−E0)∩vAK(E˙)v. It is easy to check that b1 is adhesive and both left and right cancellative, b2 is left adhesive, b3 is right adhesive, b1,b2 have no common left multiple and b1,b3 have no common right multiple. Thus AK(E˙) is neither left nor right Noetherian.
Now suppose that there exist X∈S and Y∈D such that X∩Y=∅, s(X)=r(Y)=v and (XY),(XY)∗ are not part of any forbidden word. Then both (XY),(XY) are in (B−E0)∩vAK(E˙)v, they are adhesive, both left and right cancellative and have neither left nor right common multiple. Therefore AK(E˙) is neither left nor right Noetherian.
∎
PART II
In this part we specialize our attention to hypergraphs and study their Cohn-Leavitt path algebras.
6. B-hypergraphs and their H-monoids
We would like to recast the definition of hypergraphs in terms of bi-separated graphs (with distinguished subsets) so that we can study their Cohn-Leavitt path algebras. We note that a hyperegde h, for which both Ih and Jh are infinite, does not contribute to relations in the Leavitt path algebra. We ignore such hyperedges and all other hyperedges which do not contribute to Cohn-Leavitt path algebra relations from the definition of hypergraph. Hence we modify the definition of hypergraphs as follows.
Definition 6.1**.**
A B-hypergraph is a pair (E˙,Λ), where E˙=(E,(C,S),(D,T)) is a bi-separated graph and Λ is a nonempty indexing set whose elements are called the B-hyperedges, such that for each λ∈Λ there exists Xλ⊆C and Yλ⊆D which further satisfy the following conditions:
(1)
X∈/S and Y∈/T⟹X∩Y=∅,
2. (2)
for any α,β∈Λ with α=β, X∈Xα and Y∈Yβ⟹X∩Y=∅,
3. (3)
for any λ∈Λ, X∈Xλ and Y∈Yλ⟹X∩Y=∅,
4. (4)
Λ=ΛTS⊔ΛfinS⊔Λ∞S⊔ΛTfin⊔ΛT∞, and
[TABLE]
Remark 6.2*.*
(1)
It is easy to check that B-hypergraphs are tame and that B-hypergraphs, along with complete morphisms form a category. This category will be denoted by BHG.
2. (2)
Note that given a B-hypergraph (E˙,Λ) with S=Cfin and T=Dfin we can identify (E˙,Λ) with a hypergraph H as follows: H0=E0, H1=Λ, and for each λ∈Λs(λ)=(s(X))X∈Xλ and r(λ)=(r(Y))Y∈Yλ.
Notation 6.3**.**
For λ∈ΛT, set
[TABLE]
For λ∈ΛS, set
[TABLE]
Definition 6.4**.**
Given a B-hypergraph (E˙,Λ), its H-monoid H(E˙,Λ) is defined as the abelian monoid generated by
E0⊔Q⊔P modulo the following relations:
(1)
For λ∈ΛT and qZ∈Qλ,
[TABLE]
2. (2)
For λ∈ΛS and pW∈Pλ,
[TABLE]
3. (3)
For λ∈ΛT and qZ1,qZ2∈Qλ with Z1⊊Z2
[TABLE]
4. (4)
For λ∈ΛS and pW1,pW2∈Pλ with W1⊊W2
[TABLE]
5. (5)
for λ∈ΛTS,
[TABLE]
If (E˙,Λ) is B-hypergraph then H(E˙,Λ) is a conical monoid. This is easy to see from the relations defining H(E˙,Λ) because these relations ensure that (x+y)=0 whenever x=0 or y=0, for x,y∈H(E˙,Λ).
Definition 6.5**.**
Let R be a ring, and let M∞(R) denote the set of all ω×ω matrices over R with finitely many nonzero entries, where ω varies over N. For idempotents e,f∈M∞(R), the Murray-von Neumann equivalence∼ is defined as follows: e∼f if and only if there exists x,y∈M∞(R) such that xy=e and yx=f.
Let V(R) denote the set of all equivalence classes [e], for idempotents e∈M∞(R). Define [e]+[f]=[e⊕f], where e⊕f denotes the block diagonal matrix (e00f). Under this operation, V(R) is an abelian monoid, and it is conical, that is, a+b=0 in V(R) implies a=b=0. Also V(_):Rings→Mon is a continuous functor.
Let R be a unital ring and let U(R) be the set of all isomorphic classes of finitely generated projective left R-modules, endowed with direct sum as binary operation. Then (U(R),⊕) is an abelian monoid. We also have U(R)≅V(R).
Theorem 6.6**.**
There is an isomorphism Γ:H→V∘AK of funtors BHG→Mon.
Proof.
We first define the map Γ as follows: For each object E˙ in BHG,
[TABLE]
is the monoid homomorphism sending
[TABLE]
[TABLE]
and
[TABLE]
where v∈E0, Z is any non-empty finite subset of Yλ, diag(s(X)) is the diagonal matrix of order ∣Xλ∣ with diagonal entries coming from the set s(Xλ) in any order (without repetition), diag(r(Y)) is the diagonal matrix of order ∣Yλ∣ with diagonal entries coming from the set r(Yλ) in any order (without repetition), B is the ∣Xλ∣×∣Z∣ matrix whose columns are precisely the ones in Z and whose ith row consists elements of X if and only if the diagonal entry in the ith row of diag(s(X)) is s(X), and N is the ∣W∣×∣Yλ∣ matrix whose rows are precisely the ones in W and whose jth column has elements from Y if and only if the diagonal entry in the jth column of diag(r(Y)) is r(Y).
It is not hard to see that the above map is well defined. Also the fact that every element in BHG is a direct sum of its finite complete subobjects and the continuity of the functors involved will suggest that it is enough to prove the results for finite subobjects. For the finite case, we use induction on ∣Λ∣. For Λ=∅, the result is trivial. So, suppose that the result holds for all finite objects (F˙,ΛF˙) in BHG with ∣ΛF˙∣≤(n−1), for some n≥1. Let (E˙,ΛE˙) be a finite object with ∣ΛE˙∣=n. Fix an element λ∈ΛE˙. We can now apply induction to the object F˙ obtained from the E˙ by deleting all the edges in Xλ and leaving the remaining structure as it is, keeping F0=E0.
First suppose that λ∈ΛTS. Then H(E˙,ΛE˙) is obtained from H(F˙,ΛF˙) by going modulo the relation X∈Xλ∑s(X)=Y∈Yλ∑r(Y). Also, the algebra AK(E˙,ΛE˙) is the Bergman algebra obtained from AK(F˙,ΛF˙) by adjoining a universal isomorphism between the finitely generated projective modules X∈Xλ⨁AK(F˙,ΛF˙)s(X) and Y∈Yλ⨁AK(F˙,ΛF˙)r(Y). So by [8, Theorem 5.2], V(AK(E˙,ΛE˙)) is the quotient of V(AK(F˙,ΛF˙)) modulo the relation
[TABLE]
Since the map
[TABLE]
is an isomorphism by induction hypothesis, the desired result follows.
Now suppose λ does not belong to ΛTS. Then it is either in ΛT∞ or in Λ∞S. Let us first assume that λ∈ΛT∞. In this case, H(E˙,ΛE˙) is obtained from H(F˙,ΛF˙) by adjoining a new generator qYλ and going modulo the relation
[TABLE]
On the algebra side, AK(E˙,ΛE˙) is obtained from AK(F˙,ΛF˙) in two steps by
(1)
first adjoining the mutually perpendicular idempotents diag(s(X))−BB∗ and qYλ′, and going modulo the relation
[TABLE]
thereby, getting a new algebra R and then
2. (2)
adjoining a universal isomorphism between the left module corresponding to [BB∗] and the left module Y∈Yλ⨁Rr(Y).
So, by [8, Theorems 5.1, 5.2], V(AK(E˙,ΛE˙)) is obtained from V(AK(F˙,ΛF˙)) by adjoining a new generator qYλ′′ and going modulo the relation
[TABLE]
This, along with the induction hypothesis, proves the theorem for the considered case.
Finally suppose λ∈Λ∞S. Again H(E˙,ΛE˙) is obtained from H(F˙,ΛF˙) by adjoining a new generator pXλ and going modulo the relation
[TABLE]
On the other hand, analogous to the previous case, the algebra AK(E˙,ΛE˙) is obtained from AK(F˙,ΛF˙) in two steps by
(1)
first adjoining the mutually perpendicular idempotents diag(r(Y))−N∗N and pXλ′, and going modulo the relation
[TABLE]
thereby, getting a new algebra R′ and then
2. (2)
adjoining a universal isomorphism between the left module corresponding to [N∗N] and the left module X∈Xλ⨁R′s(X).
So, by [8, Theorems 5.1, 5.2], V(AK(E˙,ΛE˙)) is obtained from V(AK(F˙,ΛF˙)) by adjoining a new generator pXλ′′ and going modulo the relation
[TABLE]
thereby completing the proof (using induction hypothesis).
∎
Remark 6.7*.*
We note that if M is any conical abelian monoid then there exists a B-hypergraph (E˙,ΛE˙) such that M≅H(E˙,Λ)≅V(AK(E˙,ΛE˙)). For two different proofs of this fact, we refer the reader to [7, Proposition 4.4] or [29, Proposition 62].
7. Ideal lattices and Simplicity
In this section (E˙,Λ) always denotes a B-hypergraph. Throughout this section we use the following notation: For λ∈Λ,
[TABLE]
7.1. The lattice of admissible triples in (E˙,Λ)
Definition 7.1**.**
A subset V of E0 is called bisaturated if for each λ∈ΛTS,
[TABLE]
The set of all bisaturated subsets of E0 is denoted by BS(E˙,Λ).
Note that empty set and E0 are always elements of BS(E˙,Λ). It is easy to check that BS(E˙,Λ) is closed under arbitrary intersections.
If V is a subset of E0, the bisaturated closure of V, denoted V, is the smallest bisaturated subset of E0 containing V. Since the intersection of bisaturated subsets of E0 is again bisaturated, V is well defined.
For V⊆E0, V can be explicitly constructed as follows:
Define V0=V. If n is odd positive integer, define
[TABLE]
and if n is even positive integer, define
[TABLE]
Then V=⋃n≥0Vn.
Definition 7.2**.**
Let V⊆E0 be bisaturated and for any λ∈Λ, set
[TABLE]
Then set
[TABLE]
where
[TABLE]
Let V⊆E0 be a bisaturated set, Σ⊆ΛfinS/V⊔Λ∞S/V and Θ⊆ΛTfin/V⊔ΛT∞/V.
A triple (V,Σ,Θ) is called an admissible triple and the set of all admissible triples in (E˙,Λ) is denoted by AT(E˙,Λ).
We define a relation ≤ in AT(E˙,Λ) as follows:
(V1,Σ1,Θ1)≤(V2,Σ2,Θ2) if
[TABLE]
[TABLE]
[TABLE]
We note that (E0,∅,∅) is the maximum and (∅,∅,∅) is the minimum in AT(E˙,Λ).
Definition 7.3**.**
Let V be a bisaturated subset of E0, Σ⊆ΛS(V)⊔ΛfinS/V⊔Λ∞S/V, and Θ⊆ΛT(V)⊔ΛTfin/V⊔ΛT∞/V. The (Σ,Θ)-bisaturation of V is defined as the smallest bisaturated subset V(Σ,Θ) of E0 containing H such that
(1)
If λ∈Σ and s(λ)⊆V(Σ,Θ), then r(λ)⊆V(Σ,Θ) and
2. (2)
If λ∈Θ and r(λ)⊆V(Σ,Θ), then s(λ)⊆V(Σ,Θ).
We can construct (Σ,Θ)-saturation of V as follows- Define V0(Σ,Θ)=V.
If n is odd positive integer, define
[TABLE]
and if n is even positive integer, define
[TABLE]
Then V(Σ,Θ)=⋃n≥0Vn(Σ,Θ).
Proposition 7.4**.**
(AT(E˙,Λ),≤)* is a lattice, with supremum ∨ and infimum ∧ given by*
[TABLE]
where
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
where
[TABLE]
[TABLE]
[TABLE]
Proof.
Clearly, (V,Σ,Θ)∈ AT(E˙,Λ) and is greater than (Vi,Σi,Θi) for i=1,2. Now let (V,Σ,Θ)∈ AT(E˙,Λ) such that (Vi,Σi,Θi)≤(V,Σ,Θ) for i=1,2. It is enough to prove that V⊆V for all n∈Z+. We do this inductively. Define Vn=(V1∪V2)n(Σ1∪Σ2,Θ1∪Θ1). For n=0 the claim is clear by assumption. Now assume that n≥1 and that Vn−1⊆V. Let v∈Vn. If v∈s(λ) or v∈r(λ) for λ∈ΛTS, then v∈V because V is bisaturated. Now suppose v∈s(λ) for λ∈Θ1∪Θ2. By definition and the induction hypothesis, we have
r(λ)⊆Vm⊆V, where m is largest even integer less than n. In particular, this implies that λ∈/Θ. Since λ∈Θ1∪Θ2⊆ΛT(V)∪Θ we conclude that v∈H, which completes the induction step. The inclusion (Θ1∪Θ2)−ΛT(V)⊆Θ follows. Similar arguments shows that if v∈r(λ) for λ∈Σ1∪Σ2, then v∈V and (Θ1∪Θ2)−ΛT(V)⊆Θ.
It is clear that (V,Σ,T)∈ AT(E˙,Λ) and (V,Σ,T)≤(Vi,Σi,Θi) for i=1,2. If (V,Σ,Θ)∈ AT(E˙,Λ) such that (V,Σ,Θ)≤(Vi,Σi,Θi) for i=1,2, then clearly V⊆V. Consider λ∈Θ−ΛT(V). Then there exists v∈s(λ)−V, so v∈/Vj for some j∈{1,2}, and λ∈/ΛT(Vj). Let us fix j=1. Since (V,Σ,Θ)≤(V1,Σ1,Θ1), it follows that λ∈Θ1. Hence, Yλ/V1 is nonempty, hence Yλ/V is nonempty. On the other hand, λ∈Θ implies that Yλ/V is finite, hence Yλ/V is finite. Thus λ∈ΛTfin/V⊔ΛT∞/V. We also have λ∈Θi⊔ΛT(Vi) for i=1,2, because (V,Σ,Θ)≤(Vi,Σi,Θi) for i=1,2, and consequently λ∈Θ. This shows Θ⊆Θ⊔ΛT(V). Similarly we can show that Σ⊆Σ⊔ΛS(V) proving that (V,Σ,Θ)≤(V,Σ,Θ). This shows that (V,Σ,Θ) is the infimum required.
Hence AT(E˙Λ) is a lattice.
∎
7.2. The lattice of order-ideals in H(E˙,Λ)
Definition 7.5**.**
An order-ideal of a monoid M is a submonoid I of M such that x+y∈I for some x,y∈M implies that both x and y belong to I.
Every monoid M is equipped with a pre-order ≤ as follows: for x,y∈M, x≤y if and only if there exists z∈M such that x+z=y. Hence an equivalent definition of an order-ideal I is as follows: For each x,y∈M, if x≤y and y∈I then x∈I.
Let L(M) denote the set of all order-ideals of M. We note that L(M) is closed under arbitrary intersections. For a submonoid J of M, let ⟨J⟩ consists of those elements x∈M such that x≤y for some y∈J. Then ⟨J⟩ denote the order-ideal generated by J. Then L(M) can be shown to a complete lattice with respect to inclusion. For, an arbitrary family {Ii} of order-ideals of M, the supremum is given by ⟨∑Ii⟩.
We want to study the lattice of order-ideals of H(E˙,Λ). For convenience we modify some notations in the previous section as follows.
Notation 7.6**.**
[TABLE]
[TABLE]
Note that the above sums are finite.
[TABLE]
[TABLE]
Also,
[TABLE]
[TABLE]
[TABLE]
Finally set
[TABLE]
[TABLE]
Definition 7.7**.**
Let F be the free abelian monoid on E0⊔Q0⊔P0. We identify H(E˙,Λ) with F/∼, where ∼ is the congruence on F generated by the relations
[TABLE]
and
[TABLE]
for Z1,Z2∈Z with Z1⊊Z2, and
qZ1∼qZ2+r(Z2−Z1),
and for W1,W2∈W with W1⊊W2, and
pW1∼pW2+s(W2−W1).
Lemma 7.8**.**
If I is an oder-ideal of H(E˙,Λ), then the set V=I∩E0 is bisaturated.
Proof.
Let λ∈ΛTS and r(λ)⊆V, then r(λ)=s(λ)∈I. Since I is order-ideal, and s(X)≤s(λ) for each X∈Xλ, we have s(X)∈I for each X∈Xλ, and hence s(λ)⊆V. Converse follows similarly.
∎
Definition 7.9**.**
Let V be a bisaturated subset of E0.
[TABLE]
[TABLE]
If I is an order-ideal of V(E˙,Λ), set ψ(I)=(V,Σ,Θ), where
[TABLE]
Conversely, for any (V,Σ,Θ)∈AT(E˙,Λ), let I(V,Σ,Θ) denote the submonoid of H(E˙,Λ) generated by the set V⊔Q(Θ)⊔P(Σ), where
[TABLE]
and ⟨I(V,Σ,Θ)⟩ be the order-ideal generated by I(V,Σ,Θ). Set ϕ(V,Σ,Θ)=⟨I(V,Σ,Θ)⟩.
Lemma 7.10**.**
If I is any order-ideal of H(E˙,Λ), then I=ϕψ(I).
Proof.
Let ψ(I)=(V,Σ,Θ) and I(V,Σ,Θ)=J so that ϕψ(I)=⟨J⟩. It is clear that J⊆I and therefore ⟨J⟩⊆I. For converse, consider a nonzero element x∈I. Then x=∑ivi+∑jqαj+∑kpβk+∑lqZl+∑mpWm for some vi∈E0, αj∈ΛTfin, βk∈ΛfinS, Zl∈Z, and Wm∈W. Since I is an order ideal, vi,qαj,pβk,qZl,pWm∈I, and so to prove that x∈⟨J⟩, it is enough to show that v,qα,pβ,qZ,pW for all v∈E0,α∈ΛTfin,β∈ΛfinS,Z∈Z and W∈W.
Case 1
If v∈E0∩I, then v∈V by definition of H, hence v∈J.
Case 2
Let α∈ΛTfin such that qα∈I.
Subcase 2.1
If r(α)⊆V, then r(α)∈I and so
s(α)=r(α)+qα∈I.
Hence s(X)∈V for each X∈Xα, and so s(α)∈J. Since qα≤s(α), it follows that qα∈⟨J⟩.
Subcase 2.2
If r(α)⊆V, then by definition α∈Θ∩ΛTfin/V. Hence qα∈J.
Case 3
Let λ∈ΛT∞ and Z∈Zλ such that qZ∈I.
Subcase 3.1Yλ/V=∅. This is equivalent to r(λ)⊆V and the argument follows similar to subcase 2.1.
Subcase 3.20<∣Yλ/V∣<∞. In this case, we have
[TABLE]
It follows that r(Yλ/V−Z)∈I and so r(Yλ/V−Z)⊆H. Hence Yλ/V⊆Z. Since r(Z−Yλ/V)⊆H, we get
qλ/V=r(Z−Yλ/V)+qZ∈I,
so that λ∈Θ by definition, and since qZ≤qλ/V, we get qZ∈⟨J⟩.
Subcase 3.3∣Yλ/V∣=∞. Then there exists Y∈Yλ/V−Z, and we have
[TABLE]
But this implies that r(Y)∈I and so r(Y)∈V, which contradicts Y∈Yλ/H. Thus qZ∈⟨J⟩.
The remaining cases are proved analogously.
∎
Construction 7.11**.**
Let (E˙,Λ) be a B-hypergraph and (V,Σ,Θ)∈AT(E˙,Λ). For A⊆E1, define
[TABLE]
We define the quotient B-hypergraph (E˙,Λ) as follows: E˙ is given by
[TABLE]
rE and sE are restriction maps of rE and sE respectively.
For v∈E0, set
[TABLE]
Let Λ be defined as follows:
[TABLE]
We note that if π:M1→M2 is a monoid homomorphism and M2 is conical, then ker π:=π−1(0) is an order-ideal of M1.
Theorem 7.12**.**
Let (E˙,Λ) be a B-hypergraph, (V,Σ,Θ)∈AT(E˙,Λ) and (E˙,Λ) is the corresponding quotient B-hypergraph. Suppose that I:=⟨I(V,Σ,Θ)⟩ is the order ideal in M:=H(E˙,Λ). Then there exists a monoid homomorphism π:M→M:=M(E˙) such that I=kerπ.
Proof.
We begin by defining v,qα,pβ,qZ,pW∈M for v∈E0, α∈ΛTfin, β∈ΛfinS, Z∈Z, and W∈W. For v∈E0, set
[TABLE]
For α∈ΛTfin, we define qα as follows:
(1)
If s(α)⊆V or r(α)⊆V, qα=0
2. (2)
If s(α)⊆V and r(α)⊆V, qα={0ifα∈Θandqαifα∈/Θ.
For β∈ΛfinS, we define pβ as follows:
(1)
If s(β)⊆V or r(β)⊆V, pβ=0.
2. (2)
If s(β)⊆V and r(β)⊆V, pβ={0ifβ∈Σandpβifβ∈/Σ.
For λ∈ΛT∞, and Z∈Zλ, we define qZ as follows:
(1)
If s(λ)⊆V, qZ=0.
2. (2)
If s(λ)⊆V, set Z={Ys(V)∈Yλ∣Y∈Z}.
(a)
If λ∈ΘqZ=r(Yλ−Z),
2. (b)
If λ∈/Θ and r(Z)⊆H, qZ=s(λ)
3. (c)
If λ∈/Θ, r(Z)⊆V and λ∈/ΛT∞/V, qZ=qZ and
4. (d)
If λ∈/Θ, r(Z)⊆V, and λ∈ΛT∞/V. qZ=qλ+r(Yλ−Z).
For λ∈Λ∞S, and W∈Wλ, we define pW as follows:
(1)
If r(λ)⊆V, pW=0.
2. (2)
If r(λ)⊆V set W={Xr(V)∈Xλ∣X∈W}.
(a)
If λ∈Σ,
pW=s(Xλ−W),
2. (b)
If r(λ)⊆V, λ∈/Σ and s(W)⊆V, pW=r(λ),
3. (c)
If r(λ)⊆V, λ∈/Σ, s(W)⊆V and λ∈/Λ∞S/V, pW=pW and
4. (d)
If r(λ)⊆V, λ∈/Σ, s(W)⊆V, and λ∈Λ∞S/V, pW=pλ+s(Xλ−W).
We define π:M→M by mapping generators v↦v, for all v∈E0, qα↦qα, for all α∈ΛTfin, pβ↦pβ for all β∈ΛfinS, qZ↦qZ for all Z∈Z, and pW↦pW for all W∈W. To show that π defines a homomorphism we need to verify that images of the generators satisfy all the defining relations. Here we only show for λ∈ΛT and the argument follows analogously for λ∈ΛS.
Let λ∈ΛT. We introduce a new notation
[TABLE]
Suppose that λ∈ΛTS. If s(λ)⊆V, then r(λ)⊆V, and we get
[TABLE]
If s(λ)⊆V then r(λ)⊆V, and we get
[TABLE]
Suppose that λ∈ΛTfin. If s(λ)⊆V, then Yλ/V=∅. If s(λ)⊆V, and r(λ)⊆V, then Xλ/V=∅. In both of the above cases we have
[TABLE]
So let s(λ)⊆V and r(λ)⊆V. If λ∈Θ then
[TABLE]
If λ∈/Θ then
[TABLE]
Now suppose that λ∈ΛT∞, and Z∈Zλ. If s(λ)⊆V, then Yλ/V=∅, and hence r(Z)=∅. Then we have
[TABLE]
Hence we assume that s(λ)⊆V for rest of the step. If λ∈Θ then λ∈ΛTS and we have
[TABLE]
If λ∈/Θ and r(Z)⊆V then we have
[TABLE]
If λ∈/Θ, r(Z)⊆V and λ∈/ΛT∞/V then we have
[TABLE]
If λ∈/Θ, r(Z)⊆V and λ∈ΛT∞/V then we have
[TABLE]
Now assume that for λ∈ΛT∞ let Z1,Z2∈Zλ and Z1⊊Z2. If s(λ)⊆V then we have
[TABLE]
So we may assume that s(λ)⊆V.
If λ∈Θ,
[TABLE]
Only remaining case is when λ∈/Θ. If λ∈ΛT∞/V−Θ, then
[TABLE]
Hence, we may assume that λ∈/ΛT∞/V.
If r(Z2)⊆V then we have
[TABLE]
If r(Z1)⊆V but r(Z2)⊆V, we have
[TABLE]
Finally, if r(Z1)⊆V, then we have
[TABLE]
Thus we have shown that π is a monoid homomorphism.
Now we show that I⊆kerπ. Since kerπ is order-ideal, it suffices to show that I(V,Σ,Θ)⊆kerπ. For v∈H we have π(v)=v=0. For λ∈Θ∩ΛTfin, we have π(qλ)=qλ=0. If λ∈Θ∩ΛT∞, then π(qλ/V)=qλ/V=0. Similarly we can verify that if λ∈Σ∩ΛfinS then π(qλ)=0 and if λ∈Σ∩Λ∞S then π(qλ/V)=0.
We claim that ψ(kerπ)=(V,Σ,Θ). For, let ψ(kerπ)=(V,Σ,Θ). It follows from definition that V=I∩E0=V and by the previous paragraph Σ⊆Σ and Θ⊆Θ. Consider λ∈ΛTfin/V⊔ΛT∞/V. If Yλ is finite and λ∈/Θ, then π(qλ)=qλ=0. Hence qλ∈/kerπ and so λ∈/Θ. If Yλ is infinite and λ∈/Θ, then π(qYλ/V)=qYλ/V=0. Thus λ∈/Θ. Hence Θ=Θ. Similarly Σ=Σ.
Finally, since ψ(kerπ)=(V,Σ,Θ) and I=ϕ∘ψ(I), we have that ker π=⟨I(V,Σ,Θ)⟩=I.
∎
Corollary 7.13**.**
If (V,Σ,Θ)∈AT(E˙,Λ), then (V,Σ,Θ)=ψ∘ϕ(V,Σ,Θ).
Theorem 7.14**.**
Let E˙ be a B-hypergraph. Then there are mutually inverse lattice isomorphisms
[TABLE]
where ϕ(V,Σ,Θ)=⟨I(V,Σ,Θ)⟩ for (V,Σ,Θ)∈AT(E˙,Λ) and ψ is defined as in definition 7.9.
Proof.
The maps ψ and ϕ are well defined by definition and by Lemma 7.10ϕ∘ψ is the identity map on L(H(E˙,Λ)) and by Corollary 7.13ψ∘ϕ is the identity map on AT(E˙,Λ). We only to have to show that ψ and ϕ are order-preserving.
Suppose I1⊆I2 are order-ideals of H(E˙,Λ) and (Vj,Σj,Θj)=ψ(Ij) for j=1,2. Clearly V1⊆V2. We only show that Θ1⊆Θ2⊔ΛT(V2). Let λ∈Θ1. First suppose that λ∈ΛTfin/V1 and qλ∈I1. If λ∈ΛTfin/V2, then λ∈Θ2. Otherwise, r(λ)⊆V2 and so s(λ)∈I2, which implies s(λ)∈V2 and λ∈ΛT(V2). Now suppose that λ∈ΛY∞/V2 and qλ/V1∈I1. If λ∈ΛT∞/V2, then qλ/V2 is defined and also
[TABLE]
so λ∈Θ2. Otherwise, r(λ)⊆V2 and so r(λ/V1)∈I2, hence s(λ)∈I2, again giving λ∈ΛT(V2). Σ1⊆Σ2⊔ΛS(V2) follows on similar lines.
Finally, let (V1,Σ1,Θ1) and (V2,Σ2,Θ2) are elements of AT(E˙,Λ) such that (V1,Σ1,Θ1)≤(V2,Σ2,Θ2). Clearly V1⊆I(V2,Σ2,Θ2). Consider λ∈Θ1∩ΛTfin. If λ∈Θ2, then qλ∈I(V2,Σ2,Θ2) by definition of I(V2,Σ2,Θ2). If λ∈ΛT(V), then
[TABLE]
and so qλ∈⟨I(V2,Σ2,Θ2)⟩. Now consider λ∈Θ1∩ΛT∞. If λ∈Θ2, then qλ/V2∈I(V2,Σ2,Θ2) and since
[TABLE]
it follows that qλ/V1∈⟨I(V2,Σ2,Θ2)⟩. If λ∈Λ(V), then
[TABLE]
and again qλ/V1∈⟨I(V2,Σ2,Θ2)⟩. A similar arguments shows that Σ1⊆Σ2⊔ΛS(V). Therefore all the generators of I(V1,Σ1,Θ1 lie in ϕ(V2,Σ2,Θ2), and we conclude that ϕ(V1,Σ1,Θ1)⊆ϕ(V2,Σ2,Θ2). Hence ϕ is order-preserving.
∎
7.3. The lattice of trace-ideals in AK(E˙,Λ)
Definition 7.15**.**
Let R be an arbitrary ring and Idem(M∞(R)) denote the set of idempotents in M∞(R)). An ideal I of R is called a trace-ideal provided I can be generated by the entries of the matrices in some subset of Idem(M∞(R)). We denote by Tr(R) the set of all trace ideals of R. Since Tr(R) is closed under arbitrary sums and arbitrary intersections, it forms a complete lattice with respect to inclusion.
Proposition 7.16**.**
[7, Proposition 10.10]**
For any ring R there are mutually inverse lattice isomorphisms
[TABLE]
given by
[TABLE]
[TABLE]
Lemma 7.17**.**
Let (E˙,Λ) be a B-hypergraph. Then the trace ideals of A:=AK(E˙,Λ) are precisely the idempotent generated ideals and the lattice isomorphism
Φ:L(V(A))→Tr(A) is expressed as
[TABLE]
Proof.
The proof goes exactly similar to [7, Proposition 6.2], except that in the present case, the V-monoid V(AK(E˙)) is generated by
[TABLE]
(Here, because of Theorem 6.6, we are using the notation [qZ′] and [pW′] for the generators of V(AK(E˙)). Strictly speaking, [qz′] and [pW′] stand for images of qZ and pW respectively under the map Γ defined in Theorem 6.6).
∎
Theorem 7.18**.**
Let (E˙.Λ) be a B-hypergraph and A=AK(E˙,Λ). Then there exist mutually inverse lattice isomorphisms
[TABLE]
Proof.
Set M:=H(E˙,Λ) and let Γ:M→V(A) be the monoid isomorphism. By abuse of notation we also use Γ to denote the induced lattice isomorphism L(M)→L(V(A)). Due to Theorem 7.14 and Proposition 7.16, we have mutually inverse lattice isomorphisms
[TABLE]
More explicitly, if J∈Tr(A), then ζ(J)=(H,Σ,Θ), where
[TABLE]
[TABLE]
[TABLE]
For converse, let (H,Σ,Θ)∈AT(E˙,Λ). First define ξ(H,Σ,Θ)=⟨H⊔P(Σ)⊔Q(Θ)⟩, where P(Σ) and Q(Θ) are defined as in Definition 7.9.
Then define J(H,Σ,Θ) to be the order-ideal of V(A) generated by the set H′⊔P′(Σ)⊔Q′(Σ), where
If e is an idempotent in A such that [e]∈J(H,Σ,Θ), then
[TABLE]
where vi∈H, αj∈Σ∩ΛfinS, βk∈Σ∩Λ∞S, γl∈Θ∩ΛTfin and δm∈Θ∩ΛT∞. Therefore e is equivalent to some idempotent
e′≤D where D is a diagonal matrix with entries vi,pαj,pβk/H,qγl, and qδm/H.Thus it follows that e lies in these vi,pαj,pβk/H,qγl, and qδm/H. Hence ΦΓϕ=ξ.
∎
7.4. Simplicity
A non-zero conical monoid M is simple if its only order-ideals are {0} and M.
Theorem 7.19**.**
Let (E˙,Λ) be a B-hypergraph. Then the following conditions are equivalent
(1)
The only trace ideals of AK(E˙,Λ) are [math] and AK(E˙,Λ).
2. (2)
H(E˙,Λ)* is a simple monoid.*
3. (3)
S=Cfin, T=Dfin and the only bisaturated subsets of E0 are ∅ and E0.
(2)⇒(3): Observe that (ΛfinS/∅)⊔(Λ∞S/∅)=Cfin−S and (ΛTfin/∅)⊔(ΛT∞/∅)=Dfin−T. Similarly, (ΛfinS/E0)⊔(Λ∞S/E0)=∅ and (ΛTfin/E0)⊔(ΛT∞/E0)=∅. By Theorem 7.14, the only members of AT(E˙,Λ) are (∅,∅,∅) and (E0,∅,∅). If λ∈ΛfinS, then (∅,{λ},∅)∈AT(E˙,Λ). This proves that S=Cfin. Similarly T=Dfin. If H is any bisaturated subset of E0, then (H,∅,∅)∈AT(E˙,Λ) and hence the only bisaturated subsets of E0 are E0 and ∅.
(3)⇒(2): In this case AT(E˙,Λ)={(E0,∅,∅),(∅,∅,∅)}. The result follows at once from Theorem 7.14.
∎
Although the characterization of simplicity of AK(E˙,Λ) is quite difficult, from theorem 7.19 we can easily conclude the following necessary condition.
Corollary 7.20**.**
Let (E˙,Λ) be a hypergraph and suppose LK(E˙,Λ) is simple then
the only trace ideals of LK(E˙,Λ) are [math] and LK(E˙,Λ).
8. Representations of Leavitt path algebras of regular hypergraphs
Given a graph E, the category of quiver representations of E is the category of functors from the path category CE to the category of K-vector spaces. A morphism of quiver representations is a natural transformation between two such functors. In other words, a quiver representation ρ assigns a (possibly infinite dimensional) K-vector space ρ(v) to each v∈E0 and a linear transformation ρ(e):ρ(s(e))→ρ(r(e)) to each e∈E1. And a morphism of quiver representations ϕ:ρ→ρ′ is a family of linear transformations {ϕv∣ρ(v)→ρ′(v)}v∈E0 such that for each e∈E1 the following diagram commutes:
[TABLE]
This section generalizes the results of [17]. Throughout this section, a hypergraph always means a regular hypergraph. We will work in the category ML of unital (right) modules over L:=LK(E˙,Λ) where (E˙,Λ) is a hypergraph. The category ML is closed under taking quotients, submodules, extensions and arbitrary sums and hence it is an abelian category with sums. Note however that it is not closed under infinite product if E0 is infinite.
Lemma 8.1**.**
Let M be a right L-module. Then X∈Xλ⨁Ms(X) is isomorphic (as vector space) to Y∈Yλ⨁Mr(Y) for every λ∈Λ.
Proof.
For each λ∈Λ, let [λ] be the rectangular matrix of size ∣Yλ∣×∣Xλ∣ whose entry in Yth row and Xth column is the edge YX. Then [λ]:X∈Xλ⨁Ms(X)→Y∈Yλ⨁Mr(Y)given by
[TABLE]
is a well defined linear map, where μ(XY) is right multiplication by the edge XY. We show that [λ] is an isomorphism with the inverse [λ]∗, which is the adjoint transpose matrix of [λ].
Note that [λ]∗:Y∈Yλ⨁Mr(Y)→X∈Xλ⨁Ms(X) is given by
[TABLE]
We check their compositions:
[TABLE]
Similarly by L1, we get
[TABLE]
which establishes the result.
∎
Remark 8.2*.*
If M is unital, then for any m∈M, we have m=∑k=1lmkvk for some vertices vk∈E0. Hence M=v∈E0∑Mv. When considered as paths, the vertices of E form a set of orthogonal idempotents, hence the above sum is direct. Therefore we have
[TABLE]
Theorem 8.3**.**
The category ML is equivalent to the full subcategory of quiver representations ρ of E satisfying:
[TABLE]
Proof.
Let M be a right L-module. We define a quiver representation ρM as follows: ρM(v)=Mv for each v∈E0 and ρM(e):Ms(e)→Mr(e) is given by ms(e)ρM(e):=ms(e)e=me=mr(e). By Lemma 8.1, (H) is satisfied.
If φ:M→N is an L-module homomorphism then φv is the linear transformation making the following diagram commtative.
[TABLE]
Since right multiplication by an edge e commutes with φ, this defines a homomorphism of quiver representations.
Given a quiver representation ρ, we define the correspoding module Mρ:=v∈E0⨁ρ(v). To get an L-module structure on Mρ, we define the following projections and inclusions: For each v∈E0, define
[TABLE]
and for each λ∈Λ, X∈Xλ and Y∈Yλ, define
[TABLE]
[TABLE]
Now let mv:=mpviv, m(XY):=mps(X)iX[ρ(λ)]pYir(Y), and m(YX)∗:=mpr(Y)iY[ρ(λ)]∗pXis(X). To keep track of the last defining relations, we draw the following diagram:
Here the composition of the upper arrows correspond to right multiplication by (XY) and the composition by lower arrows correspond to right multiplication by (YX)∗. Verifying that the above defining relation satisfy defining relations of L is left to the reader.
Now we show that the above constructions give equivalance of categories. By Remark 8.2, we have MρM=v∈E0⨁Mv=M and their L-module structures also match. Given a module homomorphism φ:M→N, we have φ=v∈E0⨁φv:v∈E0⨁Mv→v∈E0⨁N.
For the composition in the other order ρMρ(v)=Mρv=(w∈E0⨁ρ(w))v=ρ(v) and ρ(e)=ρMρ(e):Mρs(e)→Mρr(e). For, let e=(XY) for some X∈Xλ and Y∈Yλ, then the following diagram commutes.
[TABLE]
Finally, for any homomorphism {φv:ρ(v)→σ(v)}v∈E0 from ρ to σ, the v-component of w∈E0⨁φw is φv:ρMρ(v)=ρ(v)→σMσ(v)=σ(v).
∎
Remark 8.4*.*
We note that the full subcategory of graded quiver representations with respect to standard Z-grading satisfying condition (H) is equivalent to the category of graded unital L-modules. The proof follows on similar lines of proof of Theorem 8.3.
Theorem 8.5**.**
The composition of the forgetful functor from ML to ME with ⊗K(E)L from ME to ML is naturally equivalent to the identity functor on ML.
Proof.
We note that both forgetful functor and ⊗K(E)L send unital modules to unital modules.
Let the composition of forgetful functor with ⊗K(E)L be denoted by F and the identity functor on ML be denoted by I. If M is an L-module, the L-module homomorphism M⊗K(E)L→M given by m⊗a↦ma defines an natural transformation from F to I. To see that this is an isomorphism, we define its inverse M→M⊗K(E)L by m↦v∈E0mv=0∑m⊗v. Observe that this sum is finite since M is unital.
To check that the above inverse map defines an L-linear map, we need to check on generators. For every w∈E0 and m∈M we have ∑mu⊗v=m⊗u=(∑m⊗v)u, since E0 is a set of orthogonal idempotents. For all λ∈Λ, X∈Xλ, Y∈Yλ and m∈M we have
[TABLE]
Similarly ∑m(YX)∗⊗v=(∑m⊗v)(YX)∗.
The composition m↦∑m⊗v↦∑mv=m. Since elements of the form m⊗v with m∈Mv generate M⊗L as an L-module and for such elements we have m⊗v↦mv↦mv⊗v=m⊗v, the other composition is also identity.
∎
Recall that the universal localizationΣ−1A of an algebra A with respect to a set Σ={σ:Pσ→Qσ} of homomorphisms between finitely generated projective A-modules, is an initial object among algebra homomorphisms f:A→B such that σ⊗idB:Pσ⊗AB→Qσ⊗AB is an isomorphism for every σ∈Σ.
Theorem 8.6**.**
L* is the universal localization of K(E) with respect to*
[TABLE]
[TABLE]
Proof.
Since v∈E0 is an idempotent, the cyclic module vK(E) is projective. For each λ∈Λ, σλ⊗idL is an isomorphism with inverse σλ∗, where (aX)X∈Xλσλ∗(X∈Xλ∑(YX)∗aX)Y∈Yλ. If f:K(E)→B is an algebra homomorphism, then f(v)2=f(v) and vK(E)⊗K(E)B≅f(v)B by a⊗b↦f(a)b and b↦v⊗b.
Let f:K(E)→B be an algebra homomorphism such that σλ⊗idB is an isomorphism for all λ∈Λ then the composition f(s(X))B≅(s(X))K(E)⊗K(E)Bis(X)⊗idB(X∈Xλ⨁s(X)K(E))⊗K(E)Bσλ∗⊗idB(Y∈Yλ⨁r(Y)K(E))⊗K(E)Bpr(Y)⊗idBr(Y)K(E)⊗K(E)B≅f(r(Y))B is uniquely and completely determined, which we call f((YX)∗). Now f~(v):=f(v) for all v∈E0, f~((XY)):=f((XY)) for all λ∈Λ, X∈Xλ and Y∈Yλ defines the unique homomorphism f~:L→B factoring f through K(E)→L.
∎
Proposition 8.7**.**
Let (E˙,Λ) be hypergraph. If d:E0→N∪{∞} satisfies
[TABLE]
then there is an L-module M with dimK(Mv)=d(v).
Proof.
Define the quiver representation ρ by ρ(v)=Kd(v) if d(v)<∞ and ρ(v)=K(N) otherwise. Then by definition of d we can find isomorphism θλ:X∈Xλ⨁ρ(s(X))→Y∈Y−λ⨁ρ(r(Y)) for all λ∈Λ. Let ρ(XY):=is(X)θλpr(Y) for all λ∈Λ, X∈Xλ and Y∈Yλ. Condition (H) is satisfied by construction and the corresponding L-module M of Theorem 8.3 has dimK(Mv)=dimKρ(v)=d(v).
∎
Definition 8.8**.**
A dimension function of a hypergraph (E˙,Λ) is a function d:E0→N satisfying X∈Xλ∑s(X)=Y∈Yλ∑r(Y) for all λ∈Λ.
Remark 8.9*.*
If the L-module M is finitary, i.e, dim(Mv)<∞ for all v∈E0 then by Lemma 8.1, d(v):=dim(Mv) is a dimension function. By Proposition 8.7, the converse also holds. that is, every dimension function is realizable. Moreover, since dim(M)=v∈E0∑dim(Mv), d(v):=dim(Mv) has finite support if M is finite dimensional.
8.1. Support subgraphs and the hypergraph monoid
Let H=(E˙,Λ) be a hypergraph and E′ be a full subgraph of E. Then there is a natural (hyper) bi-separation induced on E′ from H as follows: For each X∈C, if s(X)∈(E′)0, define X′=X⋂(E′)1 and similarly for each Y∈D, if r(Y)∈(E′)0, define Y′=Y⋂(E′)0. Also for each λ∈Λ, define λ′ using the following data: Xλ′={X′∣X∈Xλ} and Yλ′={Y′∣Y∈Yλ}. Finally define Λ′={λ′∣λ∈Λ,Xλ=∅andλ=∅}. We call H′=(E′˙,Λ′)full sub-hypergraph of H (hyper-induced from E′).
Definition 8.10**.**
Let H=(E˙,Λ) be a hypergraph. A full sub-hypergraph H′=(E′˙,Λ′) is called co-bisaturated if the following conditions are satisfied:
For every λ′∈Λ′,
(1)
if s(X)∈(E′)0, then X∩(E′)1=∅, where X∈Xλ′,
2. (2)
if r(Y)∈(E′)0, then Y∩(E′)1=∅, where Y∈Yλ′.
We note that a full sub-hypergraph E′˙ of E˙ is a co-bisaturated if and only if E0−(E′)0 is a bisaturated subset of E0.
Let H=(E˙,Λ) be a hypergraph and M be a right L(H)-module. The support subgraph of M, denoted by EM, is the full subgraph of E induced on VM:={v∈E0∣Mv=0}. The hypergraph HM=(E˙M,ΛM), which is the full sub-hypergraph of H hyper-induced from EM, is called the support sub-hypergraph of M.
Lemma 8.11**.**
Let H=(E˙,Λ) be a hypergraph and H′=(E′˙,Λ′) be a full sub-hypergraph of H. Then the following are equivalent:
(1)
H′=HM, is the support sub-hypergraph of a unital L(H)-module M.
2. (2)
H′* is co-bisaturated.*
3. (3)
The map θ:L(H)→L(H′) defined (on generators) by
[TABLE]
extends to an onto algebra homomorphism.
Proof.
(1)⇒(2): Let λ′∈Λ′ and X∈Xλ′. Assume s(X)∈(EM)0, then 0=Ms(X)↪X∈Xλ⨁Ms(X)≅Y∈Yλ⨁Mr(Y) implies that there exists Y∈Yλ such that X∩Y=∅ which is equivalent to X∩(E′)1=∅. Similarly, if Y∈Yλ′ and r(Y)∈(EM)0, then Y∩(E′)1=∅.
(2)⇒(3): We check that θ preserves the defining relations of L(H). It is direct that path algebra relations are satisfied. Let λ′∈Λ′, X1,X2∈Xλ′ and Y1,Y2∈Yλ′. If s(Xi),r(Yi)∈(E′)0 then Xi∩(E′)1=∅ and Y1∩(E′)1=∅. Hence the image of X∈Xλ∑(Y1X)∗(XY2)=δY1Y2r(Y) is X∈Xλ′∑(Y1X)∗(XY2)=δY1Y2r(Y). Similarly, the image of Y∈Yλ∑(X1Y)(YX2)∗=δX1X2s(X) is Y∈Yλ′∑(X1Y)(YX2)∗=δX1X2s(X).
(3)⇒(1): Let M:=L(H′)≅L(H)/Kerθ. Now v∈(E′)0 if and only if θ(v)=0 and Mv=L(H′)v=0. Hence the vertex set of EM is (E′)0. It is routine to check that H′ is full sub-hypergraph and hence HM=H′.
∎
Proposition 8.12**.**
If M is a unital L(H)-module then M also has the structure of a unital L(HM)-module induced through the epimorphism θ:L(H)→L(HM).
Moreover, Kerθ is generated by E0−VM={v∈E0∣Mv=0} and Kerθ⊆AnnM.
Proof.
Let ρM be the quiver representation of E corresponding to M as defined in the proof of Theorem 8.3. We claim that the restriction of ρM to EM satisfies (H). That is, if ρ′:=ρM∣EM, then for all λ′∈ΛM,
[TABLE]
For,
[TABLE]
Let M′ be the unital L(HM)-module corresponding to ρ′. Now M′ is also an L(H)-module via θ:L(H)→L(HM). As vector spaces M′=v∈VM⨁Mv≅⨁v∈E0Mv=M. We can define an L(HM)-module structure on M via this isomorphism. The action of the generators on M and M′ is compatible with this isomorphism, so M≅M′ as L(H)-modules. Thus the L(H)-module structure of M is induced from the L(HM)-module structure via θ.
For the second part, Let IM be the ideal generated by E0−VM. We show that L(HM)≅L(H)/Kerθ and L(H)/IM are isomorphic. Since, E0−VM⊆Kerθ, we have a surjection from L(H)/IM to L(HM). Let φ:L(HM)→L(H)/I be defined on generators by x↦x+I where x∈E0⊔E1⊔E1. It is not hard to show that φ is a homomorphism and the inverse of the above surjection.
∎
Recall that given a hypergraph H=(E˙,Λ), its hypergraph monoid H(H) is defined as the additive monoid generated by
E0 modulo the following relations:
[TABLE]
Therefore, dimension functions of H correspond exactly to monoid homomorphisms from H(H) to N.
Since H(H) is isomorphic to the monoid V(L(H)), the generator v of H(H) corresponds to the (right) projective L(H)-module vL(H). The corresponding relations among the isomorphism classes of the cyclic projective modules was shown to hold in the proof of Theorem 8.6. We can now reinterpret the existence of a nonzero finite dimensional represenatation in terms of the nonstable K-theory of L(H).
Theorem 8.13**.**
L(H)* has a nonzero finite dimensional representation if and only if E˙ has a finite, full co-bisaturated sub-hypergraph G with a nonzero monoid homomorphism from V(L(G)) to N.*
Proof.
By Remark 8.9, L(H) has a nonzero finite dimensional representation if and only if H has a nonzero dimension function of finite support. The support of such dimension function defines a finite, full, co-bisaturated sub-hypergraph G and its restriction gives a nonzero dimension function on G and thus a nonzero monoid homomorphism from V(L(G)) to N as well. Conversely, since G is co-bisaturated, any nonzero dimension function on G can be extended by [math] to a dimension function on H and this gives a nonzero dimension function of finite support on H.
∎
9. Some remarks on Cohn-Leavitt path algebras of B-hypergraphs with Invariant Basis Number
Let H=(E˙,Λ) be a finite B-hypergraph and let H:=H(H) be the H-monoid of H. Let the Cohn-Leavitt path algebra AK(H) be denoted simply by L and its Grothendieck group by K0(L). Let U(L) denote the submonoid of the V-monoid V(L) generated by the element [L]∈V(L). Then L has IBN property if and only if U(L) has infinite order. Now suppose G(U(L)) denotes the Grothendieck group of U(L). Then one can show that the natural map G(U(L))→K0(L) induced by the inclusion U(L)↪V(L) is an embedding (see [16, Proposition 7]). So [L], treated as an element in the group K0(L), has infinite order. This means that the element [L]⊗1 in K0(L)⊗Q is nonzero. We know that [L]∈V(L) corresponds to the element [∑v∈E0v]∈H under the isomorphism of functors proved in Theorem 6.6. So, if G(H) denotes the Grothendieck group of H, from the above arguments we can conclude that L has IBN if and only if ∑v∈E0v is nonzero in G(H)⊗Q, which is equivalent saying that ∑v∈E0v is not in the Q− linear span of the elements of R in QΩ (cf. [16, Theorem 13]), where Ω is the set E0⊔Q⊔P (Q and P are as in the Definition 6.4) and
[TABLE]
9.1. A Matrix criterion for Leavitt path algebra of a finite hypergraph having IBN
In this subsection we generalize the main result of [27, Section 3]. Let (E˙,Λ) be a finite hypergraph such that ∣Λ∣=h and E0=n. Then by theorem 6.6, the V-monoid of LK(E˙) is generated by the set E0 modulo h relations of the form
[TABLE]
one corresponding to each element of Λ. Let A and B be the coefficient matrices corresponding to the LHS and RHS respectively of the h relations (6). Then it is clear that both A and B are h×n matrices with entries as non-negative integers. Let T be a free abelian monoid on the set of all vertices. For each element x∈T, and for each i such that 1≤i≤h, let Mi(x) denote the element of T which results by applying to x the relation (6) corresponding to the element λi∈Λ. For any sequence σ taken from the set {1,2,…,h}, and any x∈T, let Δσ(x)∈T be the element obtained by applying Mi operations in the order specified by σ.
Definition 9.1**.**
Suppose for each pair x,y∈T, [x]=[y] in the V-monoid if and only if there are two sequences σ and σ′ taken from the set {1,2,…,h} such that Δσ(x)=Δσ′(y) in T. Then we say that the confluence condition holds in T.
Theorem 9.2**.**
Let (E˙,Λ) be a finite hypergraph such that ∣Λ∣=h and E0=n. Suppose A and B are the coefficient matrices corresponding to LHS and RHS respectively of the h relations of the V-monoid of LK(E˙). Also suppose that the confluence condition holds in T, the free abelian monoid on E0. Then LK(E˙) has Invariant Basis Number if and only if rank(Bt−At)<rank([Bt−Atc]), where c is the column matrix of order n×1 with all its entries equal to 1.
Proof.
Suppose that rank(Bt−At)<rank(Bt−Atc). We prove that if m and p are positive integers such that
[TABLE]
in the V-monoid,then m=p. So let us assume that the equation (7) holds for some positive integers m and p. Since the confluence condition holds in T, there are two sequences σ and σ′ taken from {1,2,…,h} such that Δσ(m∑i=1nvi)=Δσ′(p∑i=1nvi)=γ(say) in T. Now suppose Mj is invoked kj times in Δσ and kj′ times in Δσ′. Then we have
[TABLE]
Also
[TABLE]
Let mi=(ki′−ki) for i=1,…,h. From the above two equations, we have the following system of equations-
[TABLE]
So (m1,…,mh)∈Zh is a solution of the linear system (Bt−At)x=(m−p)c, where x=(x1,…,xh)t and c is the column matrix mentioned in the statement of the theorem. This means rank(Bt−At)=rank(Bt−At(m−p)c). We know that if m=p, then rank(Bt−At(m−p)c)=rank(Bt−Atc). This would mean that rank(Bt−At)=rank(Bt−Atc) whenever m=p, contrary to our initial assumption. This proves the first part.
Conversely, assume that rank(Bt−At)=rank(Bt−Atc):=r. We will prove that there exists a pair of distinct positive integers m and p such that m[∑i=1nvi]=p[∑i=1nvi] in the V-monoid of AK(E˙).
The fact that rank(Bt−Atc)=r means that after finite number of elementary row operations, (Bt−Atc) can be brought to the form
[TABLE]
where the entries are integers, d1j1d2j2…drjr=0 and ∑i=1rci2=0.
So it is clear that one particular solution for the linear system (Bt−At)x=c is the column vector (d1j1c1,d2j2c2,…,drjrcr,0,…,0)t.
Now let
[TABLE]
[TABLE]
[TABLE]
From the above definitions, it is clear that (m−p)>0. So the h-tuple (m1,m2,…,mh) is a solution for the linear system (Bt−At)x=(m−p)c. This, from the first part of the proof, is equivalent to showing that m[∑i=1nvi]=p[∑i=1nvi]. This means that AK(E˙) does not have Invariant Basis Number, thereby completing the proof.
∎
Acknowledgement
The authors would like to thank Ramesh Sreekantan, Roozbeh Hazrat and Pere Ara for their valuable suggestions and comments.
The first named author gratefully acknowledges the Department of Atomic Energy (DAE), India for financial support through PhD scholarship.
The second named author was a visitor of Indian Statistical Institute Bangalore Center during the preparation of this manuscript. He would like to thank the institute for providing conducive environment for research. He thanks B. Venkatesh for his kind support.
He also gratefully acknowledges the Department of Atomic Energy (DAE), India for financial support through Postdoctoral Fellowship.
Bibliography31
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] G. Abrams and G. Aranda Pino. The Leavitt path algebras of arbitrary graphs. Houston J. Math. , 34(2):423–442, 2008.
2[2] Gene Abrams, Pere Ara, and Mercedes Siles Molina. Leavitt path algebras , volume 2191 of Lecture Notes in Mathematics . Springer, London, 2017.
3[3] Gene Abrams and Gonzalo Aranda Pino. The Leavitt path algebra of a graph. J. Algebra , 293(2):319–334, 2005.
4[4] P. Ara and K. R. Goodearl. C ∗ superscript 𝐶 ∗ C^{\ast} -algebras of separated graphs. J. Funct. Anal. , 261(9):2540–2568, 2011.
5[5] P. Ara, M. A. Moreno, and E. Pardo. Nonstable K 𝐾 K -theory for graph algebras. Algebr. Represent. Theory , 10(2):157–178, 2007.
6[6] Pere Ara. The realization problem for von Neumann regular rings. In Ring theory 2007 , pages 21–37. World Sci. Publ., Hackensack, NJ, 2009.
7[7] Pere Ara and Kenneth R. Goodearl. Leavitt path algebras of separated graphs. J. Reine Angew. Math. , 669:165–224, 2012.
8[8] George M. Bergman. Coproducts and some universal ring constructions. Trans. Amer. Math. Soc. , 200:33–88, 1974.