2. Preliminaries
Throughout the paper, we fix a field . For a nonempty set X, we denote by the free semigroup generated by X, which consists of all associative words on X. Then, we denote by the free monoid generated by X, where is the empty word. For every , where , we define the length of u to be n. For convenience, we define .
Definition 1 ([
1])
. An associative trialgebra
(resp. trisemigroup
), trialgebra for short, is a -module T (resp. a set T) equipped with three binary associative operations: ⊣
called left
, ⊢
called right
, and ⊥
called middle
, satisfying the following eight identities:for all . Note that, in [
1,
2,
3], the authors call trisemigroups trioids, and, in [
30], they are called trisemigroups. Here, we follow the terminology of [
30].
Definition 2. For an arbitrary set X, the triwords over X are defined inductively as follows:
- (i)
For every , the expression is a triword over X of length 1;
- (ii)
For all triwords and of lengths n and m, respectively, all monomials , and are triwords over X of length .
Recall that, for every trialgebra
T, for all
, every parenthesizing of
gives the same element in
T [
1], and we denote such an element by
, where
U is defined to be the set
. In particular, assume that
T is the free trialgebra generated by
X. Then, the triword (with an arbitrary bracketing way)
over
X can be determined by the sequence
and the set of index
Therefore, we call such a triword a
normal triword over
X and denote it by
, and call
the middle entries of
. In case we would like to emphasize the middle entries, we also denote
We call
u the
associative word of the triword
. Let
be the power set of the positive integers
. We define
to be the set of all normal triwords on
X.
In [
1], Loday and Ronco constructed a linear basis for a one-generated free trialgebra, which can be easily generalized for the construction of a linear basis for an arbitrary free trialgebra, see also [
3].
Proposition 1 ([
1])
. The set of all normal triwords over X forms a linear basis of the free trialgebra generated by X. For every integer
and
, we define
and define
. For convenience, when we write a set
, we always assume
. Moreover, the cardinality of the set
U is denoted by
, and we simply denote
by
.
Let
be the free trialgebra generated by
X. Then, by [
1],
is the free
-module with a
-basis
and for all
, we have
Moreover, with the above products,
forms the free trisemigroup generated by
X [
3]. Though
is not an element in
, we still extend the operations ⊢ and ⊣ involving
to make formulas in the sequel simplified. More precisely, we extend them with the following convention:
for every
.
The following lemma shows that every triword can be written as a leftnormed product of triwords.
Lemma 1. Let with . Then, there exist some operations such that Proof. We use induction on n to prove the claim. For , there is nothing to prove. Assume and . There are several subcases to consider:
Case 1. If
, then we have
By induction hypothesis, we obtain
Case 2. If
, then we have
By induction hypothesis, we obtain
Case 3. If
for some
, then we have
By induction hypothesis, we obtain
The proof is completed. □
3. Composition-Diamond Lemma for Trialgebras
In this section, we establish a method of Gröbner–Shirshov bases for trialgebras. By Proposition 1, forms a linear basis of the free trialgebra generated by X.
We first introduce a good ordering on
. Let
X be a well-ordered set. We define the
deg-lex ordering on
as the following: for
, where
, we define
A well ordering > on
is called
monomial if, for all
, we have
Clearly, the above deg-lex ordering on is monomial.
We proceed to define a well ordering on
. For all
and
, we define
Fix a monomial ordering > on . Then, we define an order on as follows.
Definition 3. For all ,where we compare u and v by the fixed ordering on . This order is called the monomial-centers ordering. Though we use the same notation > for orderings on
,
and
, no confusion will arise because the monomials under consideration are always clear. It is clear that a monomial-centers ordering is a well ordering on
. Finally, if > is the deg-lex ordering on
, then we call the ordering defined by (
2) the
deg-lex-centers ordering on
.
For all and , assume and . Then, by , we mean .
From now on, we always assume that > is a monomial-centers ordering > on .
We observe that the monomial-centers ordering > on is monomial in the following sense:
Lemma 2. Let and with . Then, we haveMoreover, if , then and . For every polynomial , where , and , we call the leading monomial of f, denoted by , and we denote by the associative word of ; finally, the leading coefficient of , denoted by ; A polynomial f is called monic if , and a nonempty subset S of is called monic if every element in S is monic. We call a nonzero polynomial strong if , where .
For convenience, we define and for any .
From Lemma 2, it follows that
Lemma 3. Let and . Then, we haveMoreover, if h is strong, then we obtain and . Now, we begin to study elements of an ideal generated by a subset of
. We begin with the following notation. For every
such that
lie in
X, by Lemma 1, we may assume that
. Then, for every polynomial
, we define
where, by convention, if exactly one of
and
is
, then we define
, in particular, the formula (
3) makes sense. Clearly, the resulting polynomial
is independent of the choice of
and
. For simplicity, we usually denote by
a polynomial of the form (
3).
Definition 4. Let S be a monic subset of . Then, for every in such that lie in X and for every , is called ans-polynomial orS-polynomial, and it is called normal if either or s is strong.
Remark 1. By Lemma 1 and Definition 4, it follows that
- (i)
Every S-polynomial has an expression:for some and In (4), by convention, we always assume (resp. ) in case (resp. ). Then, is a normal S-polynomial if and only if one of the following conditions holds: - (a)
and hold;
- (b)
s is strong.
Moreover, if is normal and , then we denote - (ii)
If is a normal S-polynomial, then is still a normal S-polynomial for all .
- (iii)
Let be a normal S-polynomial and assume that s is not strong. Then, bothare normal S-polynomials if and only if and .
The following lemma follows from the definition of normal S-polynomials.
Lemma 4. Let be a normal S-polynomial. Assume and . Then, we haveorMoreover, if W is a nonempty subset of , then s is strong. Finally, for every such a set W satisfying the above conditions, there exists a normal S-polynomial such that . In view of Lemma 4, for every normal
S-polynomial
with
and
, we define
to be the set of all the possible
W for a normal
S-polynomial of the form
as in Lemma 4; in other words, we have
In particular, we have
By Lemma 2, we immediately obtain the following lemma.
Lemma 5. Let be a normal s-polynomial and . Then, The following lemma shows that the set
is a linear generating set of the quotient trialgebra , where is the ideal of generated by S.
Lemma 6. Let S be a monic subset of . Then, for every nonzero polynomial , we havefor some , and . Proof. Let . If , then we define . If , then we obtain for some normal S-polynomial . In addition, we define . In both cases, we have and the result follows by induction on . □
Now, we shall introduce some conditions such that the set is a linear basis of a . Our first step is to introduce the notation of composition.
Definition 5. Let S be a monic subset of . For all , we define compositions as follows:
- (i)
If g is not strong, then, for all and , we call a left multiplication composition of g and call a right multiplication composition of g.
- (ii)
Let be a normal S-polynomial and suppose that for some words .
- (a)
If , then we callan inclusion composition
of S. - (b)
If and both g and h are strong, then, for every , we calla left multiplicative inclusion composition
of S, and call a right multiplicative inclusion composition of S.
- (iii)
Let be a normal g-polynomial and let be a normal h-polynomial. Suppose that there exists a word for some words such that .
- (a)
If , then, for every we callan intersection composition
of S. - (b)
If and both g and h are strong, then, for every , we calla left multiplicative intersection composition
of S, and calla right multiplicative intersection composition
of S.
For all , we denote byif where each and (resp. ). Furthermore, f is called trivial modulo
S (resp. ), if A monic set S is said to be closed under left (resp. right ) multiplication compositions if every left (resp. right) multiplication composition (resp. ) of S is trivial modulo S. A monic set S is called a Gröbner–Shirshov basis in if S is closed under left and right multiplication compositions and every composition of S is trivial modulo S.
We shall prove that, to some extent, the ordering < is compatible with the normal S-polynomials and normal triwords.
Lemma 7. Let S be a monic subset of that is closed under left multiplication compositions and assume . If g is not strong, then, for every , we have .
Proof. We shall use induction on
to prove the claim. If
, then it is clear. Assume
and
,
,
. Then,
can be written as a linear combination of
S-polynomials of the form
where
and
. Thus, we obtain
If
s is strong, then
is already a normal
S-polynomial, and we are done. Now, we assume that
s is not strong. If
c is the empty word, then we have
and
. If
c is not the empty word, then we have
, where
lies in
. Thus, we obtain
and
. Since
, we obtain
and
. By induction,
is a linear combination of
S-polynomials of the form
, where
and
. By Lemma 5,
is a normal
S-polynomial. Thus, we deduce
The proof is completed. □
Let be a polynomial that is not strong, and assume that is trivial modulo S for every . Then, the following example shows that may not be trivial modulo S for some .
Example 1 ([
13] Example 3.12)
. Let . Assume that the characteristic of the underlying field is not 2. Let , where , , . These three polynomials are not strong. By a direct calculation, we have , , , and . However, is not trivial modulo S because is not normal, and, for every polynomial , we have . Lemma 8. Let S be a monic subset of that is closed under left and right multiplication compositions. Then, for all normal S-polynomial and normal triword , we havewhere . Moreover, for every normal triword , if , then we havewhere . Proof. By Lemma 5, it suffices to show that and are trivial modulo S, where s is not strong. Thus, we assume that s is not strong.
We first prove that
is trivial modulo
S. By Lemma 1, obviously we have
where
and
with
and
. If
, then we have
by convention. By Lemmas 7, 5 and 2, the result follows. Moreover, if
, then we obtain
where
. Therefore, we deduce
.
The proof for the case of
is similar to the above case. More precisely, by Lemma 1, we have
where
and
with
,
. Since
S is closed under right multiplication compositions, the results follow by Lemmas 5 and 2. Moreover, if
, then we have
where
. Therefore, we deduce
. □
The following corollary is useful in the sequel, which shows that, if we replace certain “subtriword” in a triword with a “small” normal S-polynomial, then we shall obtain a linear combination of “small” normal S-polynomials.
Corollary 1. Let S be a monic subset of that is closed under left and right multiplication compositions. Let be a normal triword such that , and let f be a normal S-polynomial with . If , or if and , then we have Proof. If
and
, then by Lemmas 5 and 2,
is a normal
S-polynomial with
the result follows.
Now, we assume . By Lemma 8, can be written as a linear combination of S-polynomials of the form where and . In addition, for every S-polynomial by Lemma 8 and by the fact that , we have . □
Now, we show that, if a monic set S is closed under left and right multiplication compositions, then the elements of the ideal of can be written as linear combinations of normal S-polynomials.
Corollary 2. Let S be a monic subset of that is closed under left and right multiplication compositions. Then, every S-polynomial has an expression of the form:where each . Proof. Let
be a triword such that
. In addition, assume
and
. Then, by Corollary 1, we obtain
The proof is completed. □
Lemma 9. Let S be a Gröbner–Shirshov basis in . Suppose that are two normal S-polynomials with . Then, we have Proof. Since , we obtain and . We have to consider the following three cases:
Case 1. Without loss of generality, we can assume
and
; here,
a may be the empty word. Assume
and
. Then, by Lemma 1, we have
for some
.
If
and
are both strong, then all the resulting polynomials
are normal
S-polynomials; if neither
nor
are strong, then, by Remark 1, we deduce
,
and
, which implies that the above resulting
S-polynomials are normal; If only one of
and
is not strong, say,
is not strong, then, by Remark 1, we deduce
and
. It follows that the resulting
S-polynomials are normal. In all subcases, by Lemmas 2 and 3, the leading monomials of the resulting normal
S-polynomials are less than
.
Case 2. Without loss of generality, we may assume that
,
and
. If
, then, since
S is a Gröbner–Shirshov basis, we may assume
satisfying
for every
i. Thus, we have
If one of
and
is not strong, then we deduce
and
; and, if
and
are strong, then we obtain
for all
i. In either of these subcases, by Corollary 1, we obtain
If
, then we deduce that
are strong and
. Thus, we have either
or
where we have
and
for some words
Then, by the fact that
S is a Gröbner–Shirshov basis and by Lemmas 5 and 8, we deduce
Case 3. Without loss of generality, we assume
,
and
. If
, then, since
S is a Gröbner–Shirshov basis, we may assume
satisfying
for every
i. Thus, we have
If one of
and
is not strong, then we deduce
and
; and, if
and
are strong, then we obtain
for all
i. In either of these subcases, by Corollary 1, we obtain
If
, then we deduce that
are strong and
. Thus, we have either
or
where we have
,
for some
Then, by the fact that
S is a Gröbner–Shirshov basis and by Lemmas 5 and 8, we deduce
The proof is completed. □
Theorem 1. (Composition-Diamond lemma for trialgebras) Let > be a monomial-center ordering on , and let S be a monic subset of and the ideal of generated by S. Then, the following statements are equivalent.
- (i)
S is a Gröbner–Shirshov basis in .
- (ii)
for some normal S-polynomial .
- (iii)
is a -basis of the quotient trialgebra .
Proof. (i) ⇒ (ii) Let
. Then, by Corollary 2, we may assume
where each
. Define
,
. Then, we may assume without loss of generality that
Now, we use induction on
to show
for some normal
S-polynomial
For
, there is nothing to prove. For
, we have
and
where each
is a normal
S-polynomial and
by Lemma 9. Thus, the result follows by induction hypothesis.
(ii) ⇒ (iii) By Lemma 6, the set is a linear generator of the space . Assume that in , where , for every i and . This implies that . Then, for every i. Otherwise, for some j, which is a contradiction.
(iii) ⇒ (i) Assume that g is a composition of elements of S. We have . By Lemma 6, where each , and . Clearly, . By (iii), we obtain for every i, and thus we have . □
Shirshov algorithm If a monic subset is not a Gröbner–Shirshov basis, then one can add to S all nontrivial compositions. Continuing this process repeatedly, we finally obtain a Gröbner–Shirshov basis that contains S and generates the same ideal, that is, .
Similarly, we may introduce the Gröbner–Shirshov bases for trirings, which may be useful when one would like to construct an R-basis for some trisemigroup-trirings over an associative and commutative ring R with a unit.
Definition 6. A triring
is a quinary such that all of , and are associative rings such that the identities in (1) hold in E. Let
be a trisemigroup, and
T the free left
R-module with
R-basis
E. Then,
is a triring equipped with the following operations:
for all
. Such a triring, denoted by
, is called a
trisemigroup-triring of
E over
R.
Let be the free trisemigroup generated by X; then, we obtain a trisemigroup-triring of over R, denoted by , which is also called the free triring over R generated by X. In particular, is the free trialgebra generated by X when is a field.
An ideal I of is an R-submodule of such that for every and .
The proof of the following Theorem 2 is similar to Theorem 1.
Theorem 2. (Composition-Diamond lemma for trirings) Let R be an associative and commutative ring with a unit. Let > be a monomial-centers ordering on , and let S be a monic subset of and the ideal of generated by S. Then, the following statements are equivalent.
- (i)
S is a Gröbner–Shirshov basis in .
- (ii)
for some normal S-polynomial .
- (iii)
for any normal S-polynomial } is an R-basis of the quotient triring , i.e., is a free R-module with R-basis .
Remark 2. The Shirshov algorithm does not work generally in .
We now turn to the question on how to recognize whether two ideals of are the same or not. We begin with the notion of a minimal (resp. reduced) Gröbner–Shirshov basis.
Definition 7. A Gröbner–Shirshov basis S in is minimal
(resp. reduced
) if, for every , we have (resp. ), where for .
Suppose that I is an ideal of and . If S is a reduced (resp. minimal) Gröbner–Shirshov basis in , then we call S a reduced (resp. minimal) Gröbner–Shirshov basis for the ideal I or for the quotient dialgebra .
It is known that every ideal of associative algebras (dialgebras) has a unique reduced Gröbner–Shirshov basis. Now, we show that an analogous result holds for trialgebras.
Lemma 10. Let I be an ideal of and S a Gröbner–Shirshov basis for I. For every , if , then E is also a Gröbner–Shirshov basis for I.
Proof. For every , since and S a Gröbner–Shirshov basis for I, by Theorem 1, we obtain for some . Thus, we obtain and . By induction on , we deduce that g is a linear combination of normal E-polynomials, i.e., . This shows that . Now, the result follows from Theorem 1. □
Let
S be a subset of
and
. We set
Theorem 3. There is a unique reduced Gröbner–Shirshov basis for every ideal of the free trialgebra .
Proof. Let
I be a ideal of
. We first prove the existence. It is clear that
is a Gröbner–Shirshov basis for
I. For each
, we fix a polynomial
in
S such that
. Define
Then, the leading monomials of elements in are pairwise different. Since and , we have . By Lemma 10, is a Gröbner–Shirshov basis for I.
Moreover, we may assume that, for every
, we have
i.e.,
. If
for some
, then set
. Then, there exists an element
such that
. Note that
and
, where
is the coefficient of
in
s. Replace
s by
in
. Then,
or
. Since > is a well ordering on
, this process will terminate.
Noting that, for every
, there exists a unique
such that
. Set
with
. Define
. Suppose that
and
has been defined for every
with
. Define
Then, for every , we have .
We first claim that . Since , it suffices to show . Assume that there exists a normal triword such that and . Since , it follows that for some . If , then , a contradiction. If , then for some . This implies that , a contradiction. Therefore, . By Lemma 10, is a Gröbner–Shirshov basis for I.
If
, then we have
. Thus, we deduce
and
, a contradiction. Thus,
is a minimal Gröbner–Shirshov basis for
I. By (
5), for every
, we have
, so
is a reduced Gröbner–Shirshov basis for
I.
Now, we prove the uniqueness. Suppose that
T is an arbitrary reduced Gröbner–Shirshov basis for
I. Let
and
, where
. By Theorem 1, we have
for some
. Similarly,
. Thus, we deduce
. We claim that
. Otherwise, we have
. By the above argument again, we obtain that
for some
, a contradiction. Thus, we have
For every with , assume that . To prove , it suffices to show that . For every , we have for some . Now, we claim that . Otherwise, we have . Then, and . However, , which contradicts with the fact that is a reduced Gröbner–Shirshov basis. Now, we show . If , then . By Theorem 1, for some with . Thus, we deduce and . Noting that , we may assume that . As is a reduced Gröbner–Shirshov basis, we have , which contradicts with the fact that , where . Thus, . Therefore, we obtain . It follows that we have . Similarly, we have , which proves the uniqueness. □
Remark 3. It is known that every Gröbner–Shirshov basis for an ideal of associative (polynomial) algebras can be reduced to a reduced Gröbner–Shirshov basis. However, this is neither the case for dialgebras ([13] Example 3.24), nor the case for trialgebras. It suffices to consider the trialgebra defined by the same generators and relations as those in ([13] Example 3.24) because the relations form a Gröbner–Shirshov basis for the considered trialgebra. By using Theorem 3, we have the following theorem.
Theorem 4. Let be two ideals of . Then, if and only if and have the same reduced Gröbner–Shirshov basis.
4. Applications
In this section, we apply Theorem 1 to give a method to find normal forms of elements of an arbitrary trisemigroup. As applications, we reconstruct normal forms of elements of a free commutative trisemigroup which is obtained in [
2] and construct normal forms of elements of a free abelian trisemigroup. We also give some characterizations of the Gelfand–Kirillov dimensions of some trialgebras.
Denote by
the free trisemigroup generated by
X [
1,
3]. Clearly, every trisemigroup
T is a quotient of some free trisemigroup, say
for some set
X and
, where
is the congruence on
generated by
S. Thus, it is natural to ask the question: how can normal forms of elements of an arbitrary quotient trisemigroup of the form
be found?
Let > be a monomial-centers ordering on
and
Consider the trialgebra
, where we identify the set
S with the set
. By the Shirshov algorithm, we have a Gröbner–Shirshov basis
in
and
. It is clear that each element in
is of the form
. Let
Then, is obviously a trialgebra isomorphism. Noting that, by Theorem 1, is a linear basis of , we have that is a linear basis of . It follows that is exactly a set of normal forms of elements of the trisemigroup .
Therefore, we obtain the following theorem.
Theorem 5. Let > be a monomial-centers ordering on and , where is a subset of . Then, is a set of normal forms of elements of the trisemigroup .
If we can construct a set of normal forms of certain trialgebra, then we can know how fast the trialgebra grows by the tool of Gelfand–Kirillov dimension. The Gelfand–Kirillov dimension measures the asymptotic growth rate of algebras. Since it provides important structural information, this invariant has become one of the important tools in the study of algebras. In this section, we shall calculate some interesting examples and show how we can apply Gröbner–Shirshov bases in the calculation of Gelfand–Kirillov dimensions of certain trialgebras.
Let
T be a trialgebra, and let
and
be vector subspaces of
T. We first define
Then, we define
and
for every integer number
. Finally, we define
Now, we are ready to introduce the Gelfand–Kirillov dimension of a trialgebra.
Definition 8. Let T be a trialgebra over . Then, the Gelfand–Kirillov dimension of a trialgebra T is defined to bewhere the supremum is taken over all finite dimensional subspaces of T. We have the following obvious observation, which is well-known in the context [
31], for example.
Lemma 11. Let T be a trialgebra generated by a finite set X and the subspace of T spanned by X. Then, we have Let . It is well known that and , where (resp. ) is the free associative algebra (resp. dialgebra) generated by X. Note that a normal triword of length n in is of the form , where U is a nonempty subset of . Thus, by a direct calculation, we have .
We shall show in
Section 4.1 and
Section 4.2 that the Gelfand–Kirillov dimensions of finitely generated free commutative trialgebras and those of finitely generated free abelian trialgebras are positive integers.
From now on, let X be a well-ordered set and > the deg-lex-centers ordering on .
4.1. Normal Forms of Free Commutative Trisemigroups
The commutative trisemigroups are introduced and the free commutative trisemigroup generated by a set is constructed by [
2]. In this subsection, we give another approach to normal forms of elements of a free commutative trisemigroup.
Definition 9 ([
2])
. A trisemigroup (trialgebra) is commutative
if ⊣
, ⊢
and ⊥
are commutative. Let
be the subset of
consisting of the following polynomials:
where
. Then,
is clearly the free commutative trialgebra generated by
X. In particular, a linear basis of
consisting of normal triwords over
X is exactly a set of normal forms of elements of the free commutative trisemigroup generated by
X.
Let
be a well-ordered set. For every
, we define
where
is a reordering of
satisfying
.
For is a normal triword, while is called a commutative normal triword. For instance, assume and assume , where . Then, we have , .
Proposition 2. Let be a well-ordered set. Then, we have the following:
- (i)
, where consists of the following polynomials: - (ii)
is a Gröbner–Shirshov basis in .
- (iii)
forms a -basis of the free commutative trialgebra .
Proof. (i) It suffices to show
and
, where
consists of the elements described in (
6). We first show
. Since
and ⊥ are commutative, we have
where
. It remains to prove that
There are two cases to consider:
Case 1. If
, we assume
for some
. Then, in
, we have
Assume
with
and
. Then, in
, we obtain
It follows that
Case 2. If
, then, by Lemma 1, we may assume
with
,
,
and
. Then, in
, we have
It follows that
Now, we show
. Clearly, we have
where
. Suppose that
with
. Then, in
, we have
and
This shows that and (i) holds.
(ii) It is easy to check that all possible left (right) multiplication compositions in
are equal to zero. For an arbitrary composition
in
, we have
,
,
and
, where
,
. Assume that
and
. Then, we deduce
if and only if
. It follows that
Then, all the compositions in are trivial. Thus, is a Gröbner–Shirshov basis in .
(iii) The claim follows immediately from Theorem 1. □
From Theorem 1, Lemma 10 and Proposition 2, it follows that
Corollary 3. Let be a well-ordered set and be a set consisting of the following polynomials: Then, is the reduced Gröbner–Shirshov basis for the free commutative trialgebra .
Now, by using Theorem 5 and Proposition 2, we have the following corollary.
Corollary 4 ([
2])
. Let , where is defined as in Proposition 2. Then, is the free commutative trisemigroup generated by X, where the operations ⊢, ⊣ and ⊥ are as follows: for any with , By Lemma 11 and Proposition 2, we can easily obtain the Gelfand–Kirillov dimension of for every finite set X.
Corollary 5. Let and be the free commutative trialgebra generated by X. Then, we have .
4.2. Normal Forms of Free Abelian Trisemigroups
In this subsection, we first introduce a notion of abelian trisemigroups which is an analogy of abelian disemigroups introduced in [
11]. Then, we construct a set of normal forms of elements of the free abelian trisemigroups.
Definition 10. A trisemigroup (trialgebra) is abelian if and for all .
Let
X be an arbitrary set and
the subset of
consisting of the following:
where
. Let
be the set consisting of elements of the form
where
. Then,
is clearly the free abelian trisemigroup generated by
X, and
is the free abelian trialgebra generated by
X. By Theorem 5, a linear basis of
consisting of normal triwords is a set of normal forms of elements of
.
Now, we shall try to construct a linear basis of by the method of Gröbner–Shirshov bases. We introduce a method of writing down a new normal triword from a given one. Let be a well-ordered set, and let be a copy of X, where by we mean a new symbol. We extend the ordering on X to a well-ordering on in the following way: (i) , (ii) implies , , .
We note that has a one-to-one correspondence with , and we denote this correspondence by . More precisely, maps an arbitrary normal triword to a word in in , such that, if , then , and if , then, for every . For instance, . Thus, we can identity elements in with those in .
Recall that, for every
, where each
lies in
, we have
where
is a reordering of
satisfying
. Define
Roughly speaking, reorders the letters in such that the middle entries are preserved. Therefore, we immediately deduce that such a map satisfies some useful properties, the proof of which is quite easy and thus is omitted.
Lemma 12. For all , we have , and .
Proposition 3. Let be a well-ordered set, the subset of consisting of the elements described in (7). Then, we have - (i)
, where ;
- (ii)
is a Gröbner–Shirshov basis in ;
- (iii)
The set is a -basis of the free abelian trialgebra .
Proof. (i) It suffices to show
and
. We first show
. In
, for all
, clearly we have
Now, we show
. Note that, for an arbitrary normal triword, say
for some letters
such that
, the normal triword
contains the same letters (with repetitions) as those of
; moreover, the middle entries are preserved. Thus, it suffices to show that we can reorder
and
with middle entries preserved. By Lemma 1, we may assume
where, if
, then
, and, if
, then
. Then, by the relations in
, we clearly can reorder
and
with middle entries preserved. It follows that
.
(ii) Clearly all possible left and right multiplication compositions in
are equal to zero. Assume for every composition
in
, where
and
. We may assume
,
. Then, we have
Thus, all the compositions in are trivial, and thus is a Gröbner–Shirshov basis in .
(iii) By Theorem 1, we get the result. □
From Theorem 1, Lemma 10, and Proposition 3, it follows that
Corollary 6. Let be a well-ordered set and be a set consisting of the following polynomials:Then, is the reduced Gröbner–Shirshov basis for the free abelian trialgebra . From Lemma 11 and Proposition 3, it follows that
Corollary 7. Let and let be the free abelian trialgebra generated by X. Then, we have Proof. Let
be a copy of
X, and let
be the commutative ploynomial algebra generated by
. It is obvious that
is isomorphism to
as a vector space. Thus, we obtain
The proof is completed. □