
TL;DR
This paper introduces a new class of Leavitt path algebras for hypergraphs, extending existing frameworks, and explores their algebraic properties, K-theory, and dimensions, providing new insights into their structure.
Contribution
It defines Leavitt path algebras of hypergraphs, generalizing previous models, and analyzes their algebraic and K-theoretic properties, including bases, dimensions, and regularity.
Findings
Linear bases for the algebras are found.
Gelfand-Kirillov dimension is computed.
Results on simplicity, regularity, and Noetherian properties are obtained.
Abstract
We define Leavitt path algebras of hypergraphs generalizing simultaneously Leavitt path algebras of finitely separated graphs and Leavitt path algebras of row-finite vertex-weighted graphs. We find linear bases for those algebras, compute their Gelfand-Kirillov dimension, obtain some results on ring-theoretic properties like simplicity, von Neumann regularity and Noetherianess and investigate their K-theory and graded K-theory. By doing so we obtain new results on the Gelfand-Kirillov dimension and graded K-theory of Leavitt path algebras of separated graphs and on the graded K-theory of weighted Leavitt path algebras.
| (1’) | (2’) | (3’) | (4’) | (5’) | |
| (1’) | , | - | - | - | |
| (2’) | , | , , etc. | , etc. | ||
| (3’) | - | , etc. | , etc. | , | , |
| (4’) | - | , | - | ||
| (5’) | - | , | - |
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.
Leavitt path algebras of hypergraphs
Raimund Preusser
Department of Mathematics, University of Brasilia, Brazil
Abstract.
We define Leavitt path algebras of hypergraphs generalizing simultaneously Leavitt path algebras of finitely separated graphs and Leavitt path algebras of row-finite vertex-weighted graphs. We find linear bases for those algebras, compute their Gelfand-Kirillov dimension, obtain some results on ring-theoretic properties like simplicity, von Neumann regularity and Noetherianess and investigate their -theory and graded -theory. By doing so we obtain new results on the Gelfand-Kirillov dimension and graded -theory of Leavitt path algebras of separated graphs and on the graded -theory of weighted Leavitt path algebras.
Key words and phrases:
Graph algebras, hypergraphs, K-theory
2000 Mathematics Subject Classification:
16S10, 16W10, 16W50, 16D70
Contents
- 1 Introduction
- 2 Notation
- 3 Leavitt path algebras of hypergraphs
- 4 Direct limits
- 5 Linear bases
- 6 The Gelfand-Kirillov dimension
- 7 Valuations and local valuations
- 8 Additional applications of the linear bases
- 9 The -monoid
- 10 The graded -monoid
1. Introduction
In a series of papers [13, 14, 15, 16] William Leavitt studied algebras that are now denoted by and have been coined Leavitt algebras. Let and be and matrices consisting of symbols and , respectively. Then for a field , is the associative, unital -algebra generated by all and subject to the relations and . Leavitt established that the algebra has module type . Furthermore he showed that the algebras are simple and the algebras , domains. Recall that a ring has module type if and are the least positive integers such that as left -modules.
Leavitt path algebras were introduced by G. Abrams and G. Aranda Pino in 2005 [1] and independently by P. Ara, M. Moreno and E. Pardo in 2007 [5] as -algebras associated to directed graphs. For the directed graph with one vertex and loops one recovers the Leavitt algebra . The definition and the development of the theory were inspired on the one hand by Leavitt’s construction of and on the other hand by the Cuntz algebras [9] and the Cuntz-Krieger algebras in -algebra theory [20]. The Cuntz algebras and later Cuntz-Krieger type -algebras revolutionised -theory, leading ultimately to the astounding Kirchberg-Phillips classification theorem [17]. The Leavitt path algebras have created the same type of stir in the algebraic community. The development of Leavitt path algebras and its interaction with graph -algebras have been well-documented in several publications and we refer the reader to [2] and the references therein.
Since their introductions, there have been several attempts to introduce a generalisation of the Leavitt path algebras which would cover the algebras for any , as well. P. Ara and K. Goodearl introduced Leavitt path algebras of separated graphs in 2012 [4]. They showed that any Leavitt algebra is a corner ring of a Leavitt path algebra of a finitely separated graph. Weighted Leavitt path algebras were introduced by R. Hazrat in 2013 [10]. For the weighted graph with one vertex and loops of weight one recovers the Leavitt algebra . If the weights of all the edges are , then the weighted Leavitt path algebras reduce to the usual Leavitt path algebras.
In this paper we define and investigate Leavitt path algebras of hypergraphs. A (directed) hypergraph can be thought of as a directed graph where the edges are allowed to have multiple sources and ranges. Usually the source and the range of an edge in a hypergraph (a “hyperedge”) are required to be nonempty, finite subsets of the vertex set. In this paper we use a slightly modified definition of a hypergraph. We only require that the source and the range of a hyperedge are multisets over the vertex set with finite, nonempty support. Hence a vertex may appear in the source (resp. range) of a hyperedge more than once.
The rest of the paper is organised as follows.
In Section 2 we recall some standard notation which used throughout the paper.
In Section 3 we define the Leavitt path algebra of a hypergraph . We show that these algebras generalise the Leavitt path algebras of finitely separated graphs and row-finite vertex-weighted graphs. Moreover, we prove that a Leavitt path algebra of a hypergraph is an involutary -graded algebra with local units where is the supremum over all the cardinalities of sources of hyperedges in (the cardinality of a multiset with finite, nonempty support is defined in the first paragraph of Section 3).
In Section 4 we show that the category of hypergraphs admits arbitrary direct limits. The main result of the section is Proposition 14 which says that for any hypergraph its Leavitt path algebra is a direct limit of a direct system of Leavitt path algebras of finite hypergraphs.
In Section 5 we find linear bases for the Leavitt path algebras of hypergraphs. These bases play an important role in Sections 6, 7 and 8.
In Section 6 we compute the Gelfand-Kirillov dimension of a Leavitt path algebra of a hypergraph. The GK dimension of a Leavitt path algebra of a row-finite weighted graph was already known, see [18]. But the result for the GK dimension of a Leavitt path algebra of a finitely separated graph seems to be new.
In Section 7 we show that the Leavitt path algebra has a “local valuation” provided the hypergraph satisfies Condition (LV), i.e. for any hyperedge the cardinalities of and are at least . We deduce that if is a connected hypergraph which satisfies Condition (LV) and has at least one hyperedge, then is prime, nonsingular, not von Neumann regular and semiprimitive. Furthermore we classify the hypergraphs such that is a domain.
In Section 8 we show that a Leavitt path algebra that is finite-dimensional as a -vector space or simple or left Artinian or right Artininan or von Neumann regular is isomorphic to a Leavitt path algebra of a finitely separated graph. We also prove a result on the Noetherianess of .
In Section 9 we compute the monoid for any hypergraph . Recall that for a ring with local units, is the set of all isomorphism classes of unital finitely generated projective left -modules which becomes an abelian monoid by defining . The Grothendieck group is the group completion of .
In Section 10 we compute the monoid with respect to any grading on induced by an “admissible weight map” (we show that for example the standard -grading on defined in Section 3 is induced by an admissible weight map). To the best knowledge of the author, the graded -monoid of a Leavitt path algebra of a finitely separated graph or a row-finite vertex-weighted graph had not been computed before. Recall that for a graded ring with graded local units, is the set of all isomorphism classes of graded unital finitely generated projective left -modules which becomes an abelian monoid by defining . The graded Grothendieck group is the group completion of .
2. Notation
Throughout the paper denotes a field. By a ring resp. -algebra we mean an associative (but not necessarily commutative or unital) ring resp. -algebra. By an ideal of a ring we mean a twosided ideal. denotes the set of positive integers, the set of nonnegative integers, the set of integers and the set of positive real numbers.
3. Leavitt path algebras of hypergraphs
Recall that a multiset is a modification of the concept of a set that, unlike a set, allows for multiple instances for each of its elements. Formally a multiset over a set is a function . If , then is called the multiplicity of . The set is called the support of . We denote by the set of all multisets over that have finite, nonempty support. For an element we set .
Definition 1**.**
A (directed) hypergraph is a quadruple where and are sets and are maps. The elements of are called vertices and the elements of hyperedges. is called finite if and are finite sets and empty if . In this article all hypergraphs are assumed to be nonempty.
Definition 2**.**
Let be a hypergraph. For any write and . The -algebra presented by the generating set
[TABLE]
and the relations
- (i)
, 2. (ii)
, 3. (iii)
and 4. (iv)
is called the Leavitt path algebra of and is denoted by .
Remark 3**.**
- (a)
One checks easily that the isomorphism class of the algebra does not depend on the chosen ordering of the elements of the multisets and (). 2. (b)
Let be a hypergraph. Define a directed graph by , , and . The graph is called the directed graph associated to . Let be the double graph of and the path -algebra of (see for example [2, Remark 1.2.4]). Then is isomorphic to the quotient of by the ideal of generated by relations (iii) and (iv) in Definition 2. 3. (c)
Let be a hypergraph and a -algebra which contains a set such that
- (i)
the ’s are pairwise orthogonal idempotents, 2. (ii)
, 3. (iii)
and 4. (iv)
.
We call an -family in . By the relations defining , there exists a unique -algebra homomorphism such that , and for all , , and . We will refer to this as the Universal Property of .
Example 4**.**
Consider the hypergraph where , , and . We visualize as follows:
h
The Leavitt path algebra of is the -algebra presented by the generating set
[TABLE]
and the relations
- (i)
, 2. (ii)
, 3. (iii)
and 4. (iv)
.
Example 5**.**
Let be a finitely separated graph (see [4]). Write each as . Define a hypergraph by , , and . Then .
By a vertex-weighted graph we mean a weighted graph in the sense of [19] such that edges emitted by the same vertex have the same weight. By [19, Examples 5,6] the class of Leavitt path algebras of row-finite vertex-weighted graphs is big enough to contain all Leavitt path algebras of row-finite directed graphs and all Leavitt algebras .
Example 6**.**
Let be a row-finite vertex-weighted graph. Let denote the set of all vertices in that emit at least one edge. For each write . Define a hypergraph by , , and . Then .
Recall that a ring is said to have a set of local units in case is a set of idempotents in having the property that for each finite subset there exists an such that for any .
Proposition 7**.**
Let be a hypergraph. Then:
- (i)
* has a set of local units, namely the set of all finite sums of distinct elements of . If is finite, then is a unital ring with as multiplicative identity.* 2. (ii)
There is an involution on mapping , , and for any , , , and . 3. (iii)
Set (note that might be infinity). One can define a -grading on by setting , and for any , , and . Here denotes the element of whose -th component is and whose other components are [math].
Proof.
- (i)
Follows from the fact that the elements of are mutually orthogonal idempotents in such that . 2. (ii)
Set and let denote the free -algebra generated by . Clearly there is a uniquely determined involution on mapping , , and for any , , , and . Since the set of the relations (i)-(iv) in Definition 2 is clearly invariant under , the involution induces an involution on . 3. (iii)
Let be defined as above. Clearly there is a -grading on defined by , and for any , , and . Since the relations (i)-(iv) in Definition 2 are clearly homogeneous, the -grading on induces a -grading on .
∎
Remark 8**.**
In the following we will refer to the grading defined in Proposition 7 (iii) as the standard grading of . The isomorphisms and in Examples 5 and 6 are graded isomorphisms with respect to the standard gradings of , and (see [4, Remark 2.13] and [10, Proposition 5.7]).
4. Direct limits
If and are sets, is a map and is a multiset over , then we define as the multiset over such that . Note that if , then and .
Definition 9**.**
Let and be hypergraphs. A hypergraph homomorphism consists of two maps and such that and for any . We denote by the category whose objects are all hypergraphs and whose morphisms are all hypergraph homomorphisms.
Proposition 10**.**
The category admits arbitrary direct limits.
Proof.
Let be a direct system in . For any we define as the direct limit of the ’s in the category of sets. We identify with the set where . For a we set
[TABLE]
and
[TABLE]
One checks easily that one gets well-defined maps . Set . For any let and be the canonical maps and set . It is routine to check that is a hypergraph homomorphism for any and that is a direct limit of the direct system . ∎
Definition 11**.**
Let and be a hypergraphs. Then is called a subhypergraph of if , and and are the restrictions of resp. to .
Proposition 12**.**
Let be a hypergraph. Then is a direct limit of the direct system of all finite subhypergraphs of .
Proof.
Straightforward. ∎
Definition 13**.**
In Definition 2 we associated to any hypergraph a -algebra . If is a morphism in , then there is a unique -algebra homomorphism such that , and for any , , and (follows from the Universal Property of , see Remark 3 (c)). Let denote the category of -algebras with local units. One checks easily that is a functor that commutes with direct limits.
Proposition 14**.**
Let be a hypergraph. Then is a direct limit of a direct system of Leavitt path algebras of finite hypergraphs.
Proof.
Follows from Proposition 12 and the fact that commutes with direct limits. ∎
5. Linear bases
Throughout this section denotes a hypergraph. Our goal is to find a basis for the -vector space . We denote the directed graph associated to by and the double graph of by (see Remark 3 (b)). We set , and . Together with juxtaposition is a semigroup and a monoid. If , then we call a subword of if there are such that . We denote by the free -algebra generated by (i.e. is the -vector space with basis which becomes a -algebra by linear extending the juxtaposition of words). Note that is the quotient of by the relations (i)-(iv) in Definition 2.
Definition 15**.**
Let be a directed graph. A path in is a nonempty word over the alphabet such that either and or and . By definition, the length of is in the first case and [math] in the latter case. We set and (here we use the convention for any ).
We call a path in a d-path. While the d-paths form a basis for the path algebra , a basis for the Leavitt path algebra is formed by the nod-paths, which we will define next.
Definition 16**.**
The words
[TABLE]
in are called forbidden. A normal d-path or nod-path is a d-path such that none of its subwords is forbidden. An element of is called normal if it lies in the linear span of all nod-paths.
Theorem 17**.**
Any element of has precisely one normal representative. Moreover, the map which associates to each element of its normal representative is an isomorphism of -vector spaces.
Proof.
In order to be able to apply [11, Theorem 15], we replace the relations (i)-(iv) in Definition 2 by the relations (i’)-(v’) below.
- (i’)
For any ,
[TABLE] 2. (ii’)
For any , , and ,
[TABLE] 3. (iii’)
For any , , , and ,
[TABLE] 4. (iv’)
For all and ,
[TABLE] 5. (v’)
For all and ,
[TABLE]
Clearly the relations (i’)-(v’) above generate the same ideal of as the relations (i)-(iv) in Definition 2. Denote by the reduction system for defined by the relations (1’)-(5’) (i.e. is the set of all pairs where equals the left hand side of an equation in (i’)-(v’) and the corresponding right hand side).
For any set and m(A):=\big{|}\{i\in\{1,\dots,n-1\}|x_{i}x_{i+1}\text{ is forbidden}\}\big{|}. Define a partial ordering on by
[TABLE]
Clearly is a semigroup partial ordering on compatible with and the descending chain condition is satisfied.
It remains to show that all ambiguities of are resolvable. In the table below we list all types of ambiguities which may occur.
Note that there are no inclusion ambiguities. The (4’)-(5’) and (5’)-(4’) ambiguities and are the ones which are most difficult to resolve. We show how to resolve the ambiguity (where , and ) and leave the other ambiguities to the reader.
[TABLE]
(note that ). It follows from [11, Theorem 15], that is a set of representatives for the elements of . Clearly .
Clearly the map which associates to each element of its normal representative is bijective. That is linear follows from [7, Lemma 1.1] (note that ). ∎
Corollary 18**.**
The images of the nod-paths in form a basis of the -vector space .
Proof.
By Theorem 17, the map is an isomorphism of -vector spaces. Its inverse is the map induced by the inclusion map . Since the nod-paths form a -basis for , the assertion of the corollary follows. ∎
6. The Gelfand-Kirillov dimension
First we want to recall some general facts on the growth of algebras. Let be a finitely generated -algebra. Let be a finite-dimensional generating subspace of , i.e. a finite-dimensional subspace of that generates as a -algebra. For let denote the linear span of the set . Then
[TABLE]
Given functions , we write if there is a such that for all . If and , then the functions are called asymptotically equivalent and we write . If is another finite-dimensional generating subspace of , then . The Gelfand-Kirillov dimension or GK dimension of is defined as
[TABLE]
The definition of the GK dimension does not depend on the choice of the finite-dimensional generating subspace . If for some , then is said to have polynomial growth and we have . If for some real number , then is said to have exponential growth and we have . If does not happen to be finitely generated over , then the GK dimension of is defined as
[TABLE]
Definition 19**.**
Let be a hypergraph. Let and be nod-paths. If there is a nod-path such that is not a prefix of and is a nod-path, then we write . If is a nod-path or , then we write .
Definition 20**.**
Let be a hypergraph. A nod2-path is a nod-path such that is a nod-path. A quasi-cycle is a nod2-path such that none of the subwords of of length is a nod2-path. A quasi-cycle is called selfconnected if .
Remark 21**.**
- (a)
Let be a quasi-cycle. Assume that for some . Then we get the contradiction that is a nod2-path of length . Hence for all . It follows that there is only a finite number of quasi-cycles if is finite. 2. (b)
If is a nonempty word over some alphabet, then we call the words shifts of . One checks easily that any shift of a quasi-cycle is a quasi-cycle (note that if is a shift of , then any subword of of length is also a subword of ). If and are quasi-cycles, then we write iff is a shift of . Clearly is an equivalence relation on the set of all quasi-cycles. 3. (c)
Let be a quasi-cycle. Then is a quasi-cycle.
The following lemma shows, that quasi-cycles behave like cycles in a way (one cannot “take a shortcut”).
Lemma 22**.**
Let be a hypergraph, a quasi-cycle and . Then is a nod-path iff and or and .
Proof.
If and or and , then clearly is a nod-path. Suppose now that is a nod-path.
case 1 Suppose . Assume that . Then we get the contradiction that is a nod2-path which is a subword of of length . Hence and we have .
case 2 Suppose . Then is a nod2-path which is a subword of of length . It follows that .
case 3 Suppose . Then is a nod2-path which is a subword of of length . It follows that and . ∎
Lemma 23**.**
Let be a finite hypergraph. If there is a selfconnected quasi-cycle , then has exponential growth.
Proof.
Let be a nod-path such that is not a prefix of and is a nod-path. Let . Consider the nod-paths
[TABLE]
where satisfy
[TABLE]
Let and be different solutions of (2). Assume that and define the same nod-path in (1). After cutting out the common beginning, we can assume that the nod-path defined by starts with and the nod-path defined by with or vice versa. Since is not a prefix of , it follows that . Write . Since the next letter after an must be a , we get which contradicts Remark 21(a). Hence different solutions of (2) define different nod-paths in (1). Let denote the finite-dimensional generating subspace of spanned by the set . By Theorem 17 the nod-paths in (1) are linearly independent in . The number of solutions of (2) is and hence has exponential growth. ∎
In Definition 24 below, we introduce the Condition (A’) for hypergraphs. This condition will be used again in Section 9.
We call a multiset a set and identify it with if for any . If the multiset is not a set, then we call it a proper multiset.
Definition 24**.**
satisfies Condition (A’) if there is an such that and moreover is a proper multiset or is a proper multiset or and are sets with nonempty intersection.
Corollary 25**.**
If is a finite hypergraph that satisfies Condition (A’), then has exponential growth.
Proof.
Since satisfies Condition (A’), we can choose an such that and is a proper multiset or is a proper multiset or and are sets with nonempty intersection.
First suppose that . By Remark 3 (a) we may assume that . Clearly is a quasi-cycle. Further is a nod-path and therefore is selfconnected. Hence, by the previous lemma, has exponential growth.
Now suppose that and is a proper multiset. Choose such that . Clearly is a quasi-cycle. Further is a nod-path and therefore is selfconnected. Hence, by the previous lemma, has exponential growth. The case that and is a proper multiset can be handled similarly. ∎
If is a hypergraph, then we denote by the subset of consisting of all the elements which are not a letter of a quasi-cycle. We denote by the set of all nod-paths which are composed from elements of .
Lemma 26**.**
Let be a finite hypergraph. Then .
Proof.
Let . Assume that there are such that . Then is a nod2-path. Since for any nod2-path which is not a quasi-cycle there is a shorter nod2-path such that any letter of already appears in , we get a contradiction. Hence the ’s are pairwise distinct. It follows that since . ∎
Let be a hypergraph. A sequence of quasi-cycles such that for any is called a chain of length if . We call a nod-path trivial if for some and nontrivial otherwise.
Lemma 27**.**
Let be a hypergraph. If there is no selfconnected quasi-cycle, then any nontrivial nod-path can be written as
[TABLE]
where , is the empty word or , is a chain of quasi-cycles, is a nonnegative integer , and is a prefix of .
Proof.
Let be a nontrivial nod-path. Then . Let be minimal such that (if such an does not exist, then and (3) holds with and ). Then is either the empty word or . Since , we have that is a letter of a quasi-cycle, say . By Remark 21(b) we may assume that is the first letter of . Let be minimal such that is not a letter of . Then are letters of . It follows from Lemma 22 that for some and that is a prefix of . Let be minimal such that and set . Then is either the empty word or . Since , we have that is a letter of a quasi-cycle, say , and we may assume that starts with . Let be minimal such that is not a letter of . Then for some and that is a prefix of (see above).
By repeating the procedure described in the previous paragraph one gets that can be written as in Equation (3) where , is the empty word or , are quasi-cycles, is a nonnegative integer , and is a prefix of . It remains to show that is a chain of quasi-cycles.
First we show that for any . Because of (3) we know that is a nod-path. If is the empty word, then by the definition of . Otherwise is not a prefix of since is the empty word or and is the empty word or . Hence we get again .
Now assume that for some . Write . Then for some . Because of (3) we have that is a nod-path. It follows that
[TABLE]
is a nod-path. By the construction in the first paragraph of this proof, the first letter in after is not a letter of . Hence is not a prefix of and hence we get the contradiction . Therefore for any and thus is a chain of quasi-cycles. ∎
Theorem 28**.**
Let be a finite hypergraph. Then:
- (i)
* has polynomial growth iff there is no selfconnected quasi-cycle.* 2. (ii)
If has polynomial growth, then where is the maximal length of a chain of quasi-cycles.
Proof.
If there is a selfconnected quasi-cycle, then has exponential growth by Lemma 23. Suppose now that there is no selfconnected quasi-cycle. Let denote the finite-dimensional generating subspace of spanned by . By Theorem 17 the nod-paths of length form a basis for . By Lemma 27 we can write any nontrivial nod-path of length as
[TABLE]
where , is the empty word or , is a chain of quasi-cycles, is a nonnegative integer , and is a prefix of . Clearly
[TABLE]
since . Now fix a chain of quasi-cycles and further ’s and ’s as above. The number of solutions of (5) is . This implies that the number of nod-paths of length or less that can be written as in (4) (corresponding to the choice of the ’s, ’s and ’s) is . Since there are only finitely many quasi-cycles and finitely many choices for the ’s and ’s (note that by Lemma 26), the number of nod-paths of length or less is .
On the other hand, choose a chain of length . Then is a nod-path for some such that for any , is either the empty word or a nod-path such that is not a prefix of . Consider the nod-paths
[TABLE]
where satisfy
[TABLE]
Let and be different solutions of (7). Assume that and define the same nod-path in (6). After cutting out the common beginning, we can assume that the nod-path defined by starts with for some and the nod-path defined by with or . If is the empty word, then we get the contradiction , since and are quasi-cycles. Suppose now that is not the empty word. Since is not a prefix of , it follows that . Further (otherwise would be a subword of of length ). Write and .
case 1 Assume that . Then and for some . By Remark 21(b), is a quasi-cycle. It follows that . Hence we get the contradiction .
case 2 Assume that . Then and for some and . But this yields the contradiction that is a subword of of length .
Hence different solutions of (7) define different nod-paths in (6). The number of solutions of (7) is and thus the number of nod-paths of length or less. ∎
Remark 29**.**
Let be a nonfinite hypergraph. One can use Theorem 28 to determine as follows. Let be the direct system of all finite subhypergraphs of . Then by Proposition 14. By [12, Theorem 3.1] we have .
In general it is not so easy to read off the quasi-cycles from a finite hypergraph. But there is the following algorithm to find all the quasi-cycles: For any vertex list all the d-paths starting and ending at and having the property that for any (there are only finitely many of them). Now delete from that list any such that is not a nod-path. Next delete from the list any such that has a subword of length such that is a nod-path. The remaining d-paths on the list are precisely the quasi-cycles starting (and ending) at .
Example 30**.**
Consider again the hypergraph
h
from Example 4. By applying the algorithm described in the paragraph right before this example we find that the only quasi-cycles are and . Clearly . It follows from Theorem 28 that .
7. Valuations and local valuations
7.1. General results
Definition 31**.**
Let be a ring. A valuation on is a map such that
- (i)
for any , 2. (ii)
for any and 3. (iii)
for any .
We use the conventions for any and for any .
Remark 32**.**
One checks easily that condition (ii) in Definition 31 is satisfied iff the conditions (iia) and (iib) below are satisfied.
- (iia)
for any . 2. (iib)
for any .
Recall that a domain is a nonzero ring without zero divisors.
Lemma 33**.**
Let be a nonzero ring that has a valuation. Then is a domain.
Proof.
Let be a valuation on . Let such that . Then and hence or . Thus or . ∎
Definition 34**.**
A ring with enough idempotents is a pair where is a ring and is a set of nonzero orthogonal idempotents in for which the set of finite sums of distinct elements of is a set of local units for . Note that if is a ring with enough idempotents, then as additive groups. A ring with enough idempotents is called connected if for any .
Definition 35**.**
Let be a ring with enough idempotents. A local valuation on is a map such that
- (i)
for any , 2. (ii)
for any and 3. (iii)
for any , and .
A local valuation on is called trivial if for any and nontrivial otherwise.
Let be a ring. Recall that a left ideal of is called essential if for any left ideal of . If is an essential left ideal of , then we write . For any define the left ideal . The ring is called left nonsingular, if for any . A right nonsingular ring is defined similarly. is called nonsingular if it is left and right nonsingular.
Proposition 36**.**
Let be a ring with enough idempotents that has a local valuation. Then is nonsingular.
Proof.
We show only left singularity of and leave the right singularity to the reader. Let be a local valuation on and . Choose an such that . Suppose that for some . Then
[TABLE]
and hence . This shows that . But since . Hence is not essential. ∎
Recall that a nonzero ring is called a prime ring if for any ideals and of . Equivalently, is a prime ring if for any .
Proposition 37**.**
Let be a nonzero, connected ring with enough idempotents that has a local valuation. Then is a prime ring.
Proof.
Let be a local valuation on and . Clearly there are such that . Since is connected, we can choose a . Clearly
[TABLE]
Hence and thus . ∎
Recall that a ring is called von Neumann regular if for any there is a such that .
Proposition 38**.**
Let be a ring with enough idempotents that has a nontrivial local valuation. Then is not von Neumann regular.
Proof.
Let be a nontrivial local valuation on . Choose an such that . By condition (ii) in Definition 35 we may assume that for some . Let . Clearly
[TABLE]
It follows that either (if ) or (if ). Thus . ∎
Recall that a ring is called semiprimitive if its Jacobson radical is the zero ideal.
Proposition 39**.**
Let be a connected ring with enough idempotents. Suppose is a -algebra and there is a local valuation on such that iff where denotes the linear subspace of spanned by . Then is semiprimitive.
Proof.
Let be the local valuation on such that iff . Assume that the Jacobson radical of is not zero. Since , there are and an . Since is connected, we can choose an element . Then since . Since does not contain any nonzero idempotents, it follows that (if , then for some and hence contains the nonzero idempotent ). Since , we have that is left quasi-regular, i.e. there is a such that . By multiplying from the right and from the left one gets . Hence we may assume that . It follows that
[TABLE]
This implies that and hence for some . It follows that . But this yield a contradiction since but either , if , or , if (note that ). Thus the Jacobson radical of is zero. ∎
7.2. Applications to Leavitt path algebras of hypergraphs
In this subsection denotes a hypergraph. Note that is a ring with enough idempotents. Set . Let be the free algebra generated by and the subspace of generated by the nod-paths. By Theorem 17 there is an isomorphism of -vector spaces. Note that for an , its normal representative can be obtained by taking an arbitrary representative of in and then applying reductions corresponding to the relations (i’)-(v’) in the proof of Theorem 17 (i.e. replacing an occurrence of a word in the representative of that equals a LHS of one the relations (i’)-(v’) by the correponding RHS) in an arbitrary order until it is no longer possible. For an we define its support as the set of all nod-paths which appear in with nonzero coefficient. Recall that if is a nod-path, then its length is if and [math] if and .
Definition 40**.**
satisfies Condition (LV) if for any .
Theorem 41**.**
If satisfies Condition (LV), then the map
[TABLE]
is a local valuation on . Here we use the convention .
Proof.
Obviously conditions (i) and (ii) in Definition 35 are satisfied. It remains to show that condition (iii) is satisfied. Let , and . If one of the terms and equals [math] or , then clearly . Suppose now . Clearly since a reduction preserves or decreases the length of a monomial. It remains to show that . Let
[TABLE]
be the elements of with maximal length (namely ) and
[TABLE]
be the elements of with maximal length (namely ). We assume that the ’s are pairwise distinct and also that the ’s are pairwise distinct. Note that for any since . Since is a linear map, we have
[TABLE]
- Case 1
Assume that is not forbidden for any .
Then for any . It follows that . 2. Case 2
Assume that there are such that for some and .
- Case 2.1
*Assume for any .
*Then
[TABLE]
since it does not cancel with another term. It follows that . 2. Case 2.2
*Assume for some .
*One checks easily that in this case
[TABLE]
It follows that . 3. Case 3
Assume that there are such that for some and .
- Case 3.1
*Assume for any .
*Then
[TABLE]
since it does not cancel with another term. It follows that . 2. Case 3.2
*Assume for some .
*One checks easily that in this case
[TABLE]
It follows that .
Hence condition (iii) also is satisfied and thus is a local valuation on . ∎
Corollary 42**.**
Suppose that satisfies Condition (LV). Then is nonsingular.
Proof.
Follows from Proposition 36 and Theorem 41. ∎
Recall that a d-path is a path in the double graph of the directed graph associated to . We call connected, if for any there is a d-path such that and .
Corollary 43**.**
Suppose that satisfies Condition (LV) and is connected. Then is a prime ring.
Proof.
Cleary is not the zero ring since is not the empty hypergraph. Let . Since is connected, there is a d-path such that and . Let be the local valuation on defined in Theorem 41. Clearly since for any and for any , and . Hence for any and therefore is a connected ring with enough idempotents. It follows from Proposition 37 that is a prime ring. ∎
Corollary 44**.**
Suppose that satisfies Condition (LV) and that . Then is not von Neumann regular.
Proof.
Let be the local valuation on defined in Theorem 41. Choose an . Then and therefore is nontrivial. It follows from Proposition 38 that is not von Neumann regular. ∎
Corollary 45**.**
Suppose that satisfies Condition (LV) and is connected. Then is semiprimitive.
Proof.
Let be the local valuation on defined in Theorem 41. Then clearly iff where denotes the linear subspace of spanned by . Moreover, is connected since is connected (see the proof of Corollary 43). It follows from Proposition 39 that semiprimitive. ∎
Example 46**.**
Consider again the hypergraph
h
from Examples 4 and 30. As shown in Example 30, . Clearly satisfies Condition (LV) and is connected. It follows from the Corollaries 42, 43, 44 and 45 that is nonsingular, prime, not von Neumann regular and semiprimitive. Since is a finitely generated prime algebra of GK dimension one, is fully bounded Noetherian and finitely generated as a module over its center (see [21]). It follows that is a PI-ring.
7.3. Classification of the hypergraphs such that is a domain
Definition 47**.**
A hypergraph satisfies Condition (B) if any has the property that either or .
Theorem 48**.**
Let be a hypergraph, then is a domain iff and satisfies Condition (B).
Proof.
If there are distinct . Then in by relation (i) in Definition 2. But in by Theorem 17 (note that and are nod-paths). Hence is not a domain.
Suppose now that Condition (B) is not satisfied. Then there is an such that or . We only consider the first case and leave the second to the reader. Choose (possible since ). Then by relation (iv) in Definition 2. But in by Theorem 17 (note that and are nod-paths). Hence is not a domain.
Now suppose that and satisfies Condition (B). For any define a hypergraph by , , and . If , then satisfies Condition (LV) and hence is a domain by Lemma 33 and Theorem 41 (the local valuation is in fact a valuation since ). If , then is isomorphic to the Laurent polynomial ring , which is a domain. Hence all the algebras are domains. One checks easily that is the coproduct (sometimes also called “free product”) of the -algebras . It follows from [8, Theorem 3.2] that is a domain (note that a “-fir” is the same as a domain). ∎
8. Additional applications of the linear bases
8.1. General results
In this subsection denotes a -algebra with enough idempotents, i.e. is a -algebra and is a ring with idempotents. We call an element homogeneous if for some (recall that ). denotes a -basis for which consists of homogeneous elements and contains . Moreover, denotes a map which has the property that .
Definition 49**.**
An element is called left adhesive if for any and right adhesive if for any . An element is called adhesive if it is left and right adhesive. A left valuative basis element is a left adhesive element such that for any . A right valuative basis element is a right adhesive element such that for any . A valuative basis element is an adhesive element such that for any and .
If is a subset, then we denote by the left ideal of generated by , by the right ideal of generated by and by the ideal of generated by . The following lemma is straightforward to check.
Lemma 50**.**
The following is true:
- (i)
If is a set of left adhesive basis elements, then is free with basis . 2. (ii)
If is a set of right adhesive basis elements, then is free with basis . 3. (iii)
If is a set of adhesive basis elements, then is free with basis .
Lemma 51**.**
Distinct left valuative basis elements generate distinct left ideals, distinct right valuative basis elements generate distinct right ideals and distinct valuative basis elements generate distinct ideals.
Proof.
Let and be valuative basis elements. W.l.o.g assume that . Assume that . By the previous lemma, is a basis for . Hence where almost all are zero. Since is valuative, for any . It follows that for any and . Thus . The other assertions of the lemma can be shown similarly. ∎
Proposition 52**.**
Suppose there exists a valuative basis element . Then , is not simple (in fact it has infinitely many ideals), neither left nor right Artinian and not von Neumann regular.
Proof.
Clear since is valuative. Hence if (note that since ). Therefore . Lemma 51 implies that we have an infinite descending chain of ideals (note that is valuative for any since valuative). Hence is neither left nor right Artinian. Now assume that for some . Clearly we may assume that . Write where almost all are zero. Then . But for any and hence we arrived at a contradiction. Thus is not von Neumann regular. ∎
Definition 53**.**
We say that two basis elements and have no common left multiple if there are no such that . We say that and have no common right multiple if there are no such that .
Definition 54**.**
An element is called right cancellative if for any and left cancellative if for any .
Proposition 55**.**
If there are elements such that is adhesive and right cancellative, is left adhesive and and have no common left multiple, then is not left Noetherian. If there are elements such that is adhesive and left cancellative, is right adhesive and and have no common right multiple, then is not right Noetherian.
Proof.
For any set . Then clearly for any . Now assume that for some . By Lemma 50 the set is a basis for (note that is adhesive for any since is adhesive and is left adhesive). It follows that for some and . This implies since is right cancellative. But this contradicts the assumption that and have no common left multiple. Hence for any and therefore is not left Noetherian. Similarly one can prove the second assertion of the proposition. ∎
8.2. Applications to Leavitt path algebras of hypergraphs
Definition 56**.**
A hypergraph satisfies Condition (A) if there is an such that .
Remark 57**.**
- (a)
If is a hypergraph that does not satisfy Condition (A), then is isomorphic to a Leavitt path algebra of a finitely separated graph, cf. Example 5. 2. (b)
If is a hypergraph, then
[TABLE]
The theorem below shows that a Leavitt path algebra that is finite-dimensional as a -vector space or simple or left Artinian or right Artininan or von Neumann regular is isomorphic to a Leavitt path algebra of a finitely separated graph.
Theorem 58**.**
Let be a hypergraph that satisfies Condition (A). Then , is not simple (in fact it has infinitely many ideals), neither left nor right Artinian and not von Neumann regular.
Proof.
Let be the basis for consisting of all nod-paths. Clearly consists of elements that are homogeneous with respect to and contains . Define a map by for any nod-path . Then clearly iff . Since satisfies Condition (A), we can choose an such that . Set . One checks easily that is a valuative basis elements (note that and do not appear in a forbidden word, see Definition 16). The assertion of the theorem follows now from Proposition 52. ∎
Example 46 shows that there is a hypergraph which satisfies Condition (A) (even Condition (LV)) such that is Noetherian. But the next theorem shows that if a hypergraph satisfies Condition (A’), then cannot be left or right Noetherian.
Theorem 59**.**
Let be a hypergraph that satisfies Condition (A’). Then is neither left nor right Noetherian.
Proof.
Define and as in the proof of the previous theorem. Since satisfies Condition (A’), we can choose an such that and is a proper multiset or is a proper multiset or and are sets with nontrivial intersection.
First suppose that is a proper multiset. Choose such that . Set , and . Then clearly where . One checks easily that is adhesive and both left and right cancellative, is left adhesive, is right adhesive, and have no common left multiple and and have no common right multiple (note that and do not appear in a forbidden word, see Definition 16). It follows from Proposition 55 that is neither left nor right Noetherian. The case that is a proper multiset can be handled similarly.
Now suppose that and are sets with nontrivial intersection. By Remark 3 (a) we may assume that . Set and . Then clearly where . One checks easily that and are adhesive and both left and right cancellative and that and have neither a common left multiple nor a common right multiple (note that and do not appear in a forbidden word, see Definition 16). It follows from Proposition 55 that is neither left nor right Noetherian. ∎
9. The -monoid
Let be a ring. Recall that a left -module is called unital if . We denote by - the category of unital left -modules. Furthermore we denote by - the full subcategory of - whose objects are the projective objects of - that are finitely generated as a left -module. When has local units, then
[TABLE]
see e.g. [3, Subsection 4A]. becomes an abelian monoid by defining .
Recall from Section 4 that denotes the category of hypergraphs, the category of -algebras with local units and that is a functor that commutes with direct limits. We denote the category of abelian monoids by . One checks easily that defines a continuous functor in a canonical way. In Subsection 10.1 we define a functor . In Subsection 10.2 we recall some universal ring constructions by G. Bergman which will be used in the proof of the main result of this section, namely Theorem 61. In Subsection 10.3 we prove Theorem 61 which states that and that is left and right hereditary provided is finite.
9.1. The functor
Definition 60**.**
For any hypergraph let be the abelian monoid presented by the generating set and the relations where and . If is a morphism in , then there is a unique monoid homomorphism such that for any . One checks easily that is a functor that commutes with direct limits.
9.2. Some universal ring constructions by G. Bergman
In this subsection all rings are assumed to be unital. Let be a commutative ring and a -algebra (i.e. is a ring given with a homomorphism of into its center). A -ringk is a -algebra given with a -algebra homomorphism . By an -module we mean a right -module. In [6], G. Bergman described the following two key constructions:
- •
ADJOINING MAPS Let be any -module and a finitely generated projective -module. Then there exists -ringk , having a universal module homomorphism , see [6, Theorem 3.1]. can be obtained by adjoining to a family of generators subject to certain relations, see [6, Proof of Theorem 3.1].
- •
IMPOSING RELATIONS Let be any -module, a projective -module and any module homomorphism. Then there exists an -ringk such that and universal for that property. can be chosen to be a quotient of , see [6, Proof of Theorem 3.2].
Using the key constructions above Bergman described more complicated constructions. One of them is used in this paper:
- •
ADJOINING ISOMORPHISMS Given two finitely generated projective -modules and , one can adjoin a universal isomorphism between and by first freely adjoining maps and (via ADJOINING MAPS) and then setting and equal to [math] (via IMPOSING RELATIONS), see [6, p. 38]. Bergman denoted the resulting -ringk by .
Set . Bergman proved the following (for these results he required that is a field and that and are nonzero): The abelian monoid may be obtained from by imposing one relation . Further the right global dimension of equals the right global dimension of , unless the right global dimension of is [math], in which case the right global dimension of is . See [6, Theorem 5.2 and last paragraph of p. 48].
It is easily seen that Bergman’s results mentioned above also apply to left -modules.
9.3. The monoid
Theorem 61**.**
. Moreover, if is a finite hypergraph, then is left and right hereditary.
Proof.
We have divided the proof into two parts, Part I and Part II. In Part I we define a natural transformation . In Part II we show that is a natural isomorphism and further that is left and right hereditary provided that is finite.
Part I Let be a hypergraph and the free abelian monoid generated by . There is a unique monoid homomorphism such that for any . In order to show that induces a monoid homomorphism we have to check that for any , i.e. that
[TABLE]
Given let be the -matrix whose entry at position is and the -matrix whose entry at position is . It follows from relations (iii) and (iv) in Definition 2 that
[TABLE]
Hence defines an isomorphism by right multiplication (its inverse is defined by ). Thus (8) holds and therefore induces a monoid homomorphism . It is an easy exercise to show that is a natural transformation.
Part II We want to show that the natural transformation defined in Part I is a natural isomorphism, i.e. that is an isomorphism for any hypergraph . By Proposition 12 any hypergraph is a direct limit of a direct system of finite hypergraphs. Hence it is sufficient to show that is an isomorphism for any finite hypergraph (note that , and commute with direct limits).
Let be a finite hypergraph. Set . We denote by the element of whose -component is and whose other components are [math]. Write . We inductively define -algebras as follows. Let and assume that has already been defined. Set (see [6, p. 38]) where
[TABLE]
Investigating the proofs of Theorems 3.1 and 3.2 in [6] we see that . By [6, Theorems 5.1, 5.2], the abelian monoid is isomorphic to . The monoid isomorphism one gets in this way is precisely .
Furthermore, the left global dimension of is by [6, Theorems 5.1, 5.2], i.e. is left hereditary. Since is a ring with involution by Proposition 7 (ii), we have . Thus is also right hereditary. ∎
Recall that a monoid is called conical if for any . It is easy to see that is conical for any hypergraph . The proposition below shows that conversely one can find for any conical abelian monoid a hypergraph such that (follows also from Example 5 and [4, Proposition 4.4]).
Proposition 62**.**
For any conical abelian monoid there is a hypergraph such that .
Proof.
Choose a presentation of with a nonempty set of generators and a nonempty set of relations
[TABLE]
where for each almost all but not all are zero and similarly almost all but not all are zero. The relations can be chosen with these restrictions because is conical, see [4, Proof of Proposition 4.4]. Define a hypergraph by , , and (here we consider and as maps associating to each its multiplicity in resp. ). It follows from Theorem 61 that . ∎
10. The graded -monoid
Throughout this section denotes a group with identity . Let be a -graded ring. Recall that a left -module is called -graded if there is a decomposition such that for any . We denote by - the category of -graded unital left -modules with morphisms the -module homomorphisms that preserve grading. Furthermore we denote by - the full subcategory of - whose objects are the projective objects of - that are finitely generated as a left -module. If has graded local units, then
[TABLE]
cf. [3, Subsections 2A,4A]. becomes an abelian monoid by defining .
10.1. Smash products
Definition 63**.**
Let be a -graded ring. The smash product ring is defined as the set of all formal sums where for any and the ’s are symbols. Addition is defined component-wise and multiplication is defined by linear extension of the rule where and .
Recall that if is a ring, then - denotes the category of unital left -modules and - the full subcategory of - whose objects are the projective objects of - that are finitely generated as a left -module. When has local units, then .
Proposition 64**.**
Let be a -graded ring with graded local units. Then the categories - and - are isomorphic. It follows that .
Proof.
Fix a set of graded local units for . By [3, Proposition 2.5], there is an isomorphism of categories which is defined on objects as follows. If is an object in , then as abelian groups. The left- action on is defined by for any , and . The inverse functor of is defined on objects as follows. If is an object in , then as abelian groups. For each set . Then . The left -action on is defined by for any , and . One can show that for any and and hence is a graded left -module. Below we show that restricts to a functor and that restricts to a functor .
Let . Then is a projective object in since is an isomorphism of categories. Since is finitely generated as a left -module, there are such that . Clearly we can assume that the ’s are homogeneous (replace each by its homogeneous components). Let where . Then in . This shows that is finitely generated by the ’s as a left -module. Thus -.
Let now . Then is a projective object in since is an isomorphism of categories. Since is finitely generated as a left -module, there are such that . Clearly we can assume that the ’s are homogeneous with respect to the grading on . Let where . For write where for any . Then in (note that if since ). This shows that is finitely generated by the ’s as a left -module. Thus .
By the previous two paragraphs, restricts to a functor and restricts to a functor . Clearly and since and . Thus is an isomorphism of categories. We leave it to the reader to deduce that the map
[TABLE]
is a monoid isomorphism. ∎
10.2. Admissible weight maps
Definition 65**.**
Let be a hypergraph and the directed graph associated to (see Remark 3 (b)). Let be a map such that for any , and . Then is called an admissible weight map for .
Remark 66**.**
Let be a hypergraph. Set . Clearly there is a - correspondence between the set of all maps and the set of all admissible weight maps for .
Lemma 67**.**
Let be a hypergraph and an admissible weight map for . Then
- (i)
* for any , and and* 2. (ii)
* for any , and .*
Proof.
Straightforward computation. ∎
Lemma 68**.**
Let be a hypergraph and an admissible weight map for . Then induces a -grading on such that , and for any and .
Proof.
Set and let denote the free -algebra generated by . Clearly there is a -grading on defined by , and for any , , and . It follows from Lemma 67 that the relations (i)-(iv) in Definition 2 are homogeneous. Hence the -grading on induces a -grading on . ∎
Example 69**.**
Let be a hypergraph. Set . Define a map by where denotes the element of whose -th component is and whose other components are [math]. The map induces the standard grading of .
Example 70**.**
Let be a hypergraph. Set and . Define a map by where is defined as in the previous example. One checks easily that is an admissible weight map for and therefore it induces a -grading on .
10.3. Covering hypergraphs
Definition 71**.**
Let be a hypergraph and an admissible weight map for . Define a hypergraph by , ,
[TABLE]
and
[TABLE]
The hypergraph is called the covering hypergraph of defined by .
Proposition 72**.**
Let be a hypergraph and an admissible weight map for . Let be the covering hypergraph of defined by . Then there is an isomorphism such that
[TABLE]
for any , , , , .
Proof.
Set , and for any , , , . In order to show that
[TABLE]
is an -family in one has to show that the relations (i)-(iv) in Remark 3 (c) are satisfied. We leave (i) and (ii) to the reader and show only (iii) and (iv).
Let and . Clearly
[TABLE]
and hence (iii) holds. Let now and . Clearly
[TABLE]
and hence (iv) holds. Thus is an -family in and therefore there is a unique -algebra homomorphism such that
[TABLE]
for any , , , , .
Clearly the image of contains the set . But generates as a -algebra and therefore is surjective. It remains to show that is injective. Let denote the set of all nod-paths for and the set of all nod-paths for . It is an easy exercise to show that there is an injective map , that has the property that . Now let where almost all coefficients are zero. Then . Assume now that . Then in for any . But since is injective, we have for any such that and . It follows from Theorem 17 that for any and hence . Thus is injective. ∎
10.4. The monoid
In this subsection denotes a hypergraph. We fix an admissible weight map for . Recall that induces a -grading on .
Definition 73**.**
We define as the abelian monoid presented by the generating set and the relations
[TABLE]
Theorem 74**.**
.
Proof.
Set and where is the covering hypergraph of defined by . By Propositions 64 and 72 we have . By Theorem 61 we have . Thus . ∎
Corollary 75**.**
Let be a finitely separated graph. Then the abelian monoid defined with respect to the standard -grading of is presented by the generating set and the relations
[TABLE]
where denotes the common source of the edges in .
Corollary 76**.**
Let be a row-finite vertex-weighted graph. Then the abelian monoid defined with respect to the standard -grading of (where is the supremum of the set of all weights) is presented by the generating set and the relations
[TABLE]
where denotes the element of whose -th component is and whose other components are zero and denotes the set of all vertices in which emit at least one edge.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Abrams, G. Aranda Pino, The Leavitt path algebra of a graph , J. Algebra 293 (2005), no. 2, 319–334.
- 2[2] G. Abrams, P. Ara, M. Siles Molina, Leavitt path algebras, Lecture Notes in Mathematics 2191 , Springer, 2017.
- 3[3] P. Ara, R. Hazrat, H. Li, A. Sims, Graded Steinberg algebras and their representations , Algebra Number Theory 12 (2018), no. 1.
- 4[4] P. Ara, K. Goodearl, Leavitt path algebras of separated graphs , J. reine angew. Math. 669 (2012), 165–224.
- 5[5] P. Ara, M.A. Moreno, E. Pardo, Nonstable K 𝐾 K -theory for graph algebras , Algebr. Represent. Theory 10 (2007), no. 2, 157–178.
- 6[6] G.M. Bergman, Coproducts and some universal ring constructions , Trans. Amer. Math. Soc. 200 (1974), 33–88.
- 7[7] G.M. Bergman, The diamond lemma for ring theory , Adv. in Math. 29 (1978), no. 2, 178–218.
- 8[8] P.M. Cohn, On the free product of associative rings. III , J. Algebra 8 (1968), 376–383.
