Next Article in Journal
Equilibrium Resolution Mechanism for Multidimensional Conflicts in Farmland Expropriation Based on a Multistage Van Damme’s Model
Next Article in Special Issue
On Rings of Weak Global Dimension at Most One
Previous Article in Journal
A Low Dissipative and Stable Cell-Centered Finite Volume Method with the Simultaneous Approximation Term for Compressible Turbulent Flows
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Gröbner–Shirshov Bases Theory for Trialgebras

School of Mathematical Sciences, South China Normal University, Guangzhou 510631, China
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(11), 1207; https://doi.org/10.3390/math9111207
Submission received: 22 April 2021 / Revised: 11 May 2021 / Accepted: 24 May 2021 / Published: 26 May 2021

Abstract

:
We establish a method of Gröbner–Shirshov bases for trialgebras and show that there is a unique reduced Gröbner–Shirshov basis for every ideal of a free trialgebra. As applications, we give a method for the construction of normal forms of elements of an arbitrary trisemigroup, in particular, A.V. Zhuchok’s (2019) normal forms of the free commutative trisemigroups are rediscovered and some normal forms of the free abelian trisemigroups are first constructed. Moreover, the Gelfand–Kirillov dimension of finitely generated free commutative trialgebra and free abelian trialgebra are calculated, respectively.

1. Introduction

The notion of a trialgebra (trioid also known as trisemigroup) was introduced by Loday [1] and investigated in many papers (see, for example, [1,2,3,4,5]). There are several motivations for the study of trialgebras. First, trialgebras and trioids are closely related to Leibniz 3-Algebras [6], and Rota–Baxter operators [7]. Secondly, many results obtained for trialgebras can be applied to trioids. In addition, lastly, if the operation ⊥ coincides with ⊣ or ⊢, then we obtain a dialgebra (dimonoid) [8]. If all operations of a trialgebra (trioid) coincide, we obtain an associative algebra (semigroup). Thus, trialgebras are generalizations of dialgebras and associative algebras. The classes of dialgebras and dimonoids were studied by various authors (see, for instance, [9,10,11,12,13]). Loday [1] constructed a free one generator trialgebra and a free trioid of rank 1. A.V. Zhuchok [2,3] constructed the free trioids of an arbitrary rank and the free commutative trioids.
Gröbner or Gröbner–Shirshov bases theory was first introduced by Buchberger [14] for commutative algebras and independently by Shirshov [15] for non-associative algebras [16,17] and Lie algebras [16]. Then, it was developed for various kind of algebras and widely used in different branches of mathematics. Gröbner bases and Gröbner–Shirshov bases theories have become an effective computational tool for solving the following classical problems about: rewriting system; normal form; word problem; growth function; conjugacy problem; embedding theorem; PBW-type theorem; extension, etc. See, for example, the books [18,19,20,21,22] and the survey [23,24,25,26,27].
The key in establishing Gröbner–Shirshov bases theory for certain algebras is to establish the “Composition-Diamond lemma (CD lemma)” for such algebras. The name “CD lemma” combines the Neuman Diamond Lemma [28], the Shirshov Composition Lemma [17], and the Bergman Diamond Lemma [29].
Trialgebras are generalizations of dialgebras and associative algebras, so it is natural to ask what kind of properties of associative algebras and dialgebras remain valid for trialgebras. For instance, CD lemma for dialgebras has been established by Bokut, Chen, and Liu in 2010 [12] and by Zhang and Chen in 2017 [13]. Thus, we shall establish the CD lemma for trialgebras and thus offer a way of constructing normal forms of elements of an arbitrary trisemigroup. Moreover, we prove that every ideal of a free trialgebra has a unique reduced Gröbner–Shirshov basis. The method we used is similar to what was done for dialgebras in [12,13]. However, the extension is not obvious because more operations are involved and the difficulty increases. First, we must ensure that a well ordering on monomials is more or less compatible with trialgebraic operations. Second, a trialgebra has one more operation than dialgebra, so difficulty in the proof of some critical lemmas increases naturally. These reasons make us encounter more difficulties in the process of proving CD lemma for the trialgebra case.
The paper is organized as follows: in Section 2, we first recall the linear basis constructed by Loday and Ronco [1] of the free trialgebra. In Section 3, we elaborate the method of Gröbner–Shirshov bases for trialgebras. We show that, for an arbitrary monomial-centers ordering on the linear basis, there is a unique reduced Gröbner–Shirshov basis for every ideal of free trialgebra. In Section 4, we give a detailed method to construct a set of normal form for an arbitrary trisemigroup; in particular, we give another approach to normal forms of elements of a free commutative trisemigroup that is constructed by [2]. Moreover, we apply the method of Gröbner–Shirshov bases for certain trialgebras and trisemigroups to obtain normal forms and their Gelfand–Kirillov dimensions.

2. Preliminaries

Throughout the paper, we fix a field k . For a nonempty set X, we denote by X + the free semigroup generated by X, which consists of all associative words on X. Then, we denote by X * = X + { ε } the free monoid generated by X, where ε is the empty word. For every u = x 1 x 2 x n X + , where x 1 , , x n X , we define the length  ( u ) of u to be n. For convenience, we define ( ε ) = 0 .
Definition 1
([1]). An associative trialgebra (resp. trisemigroup), trialgebra for short, is a k -module T (resp. a set T) equipped with three binary associative operations:called left,called right, andcalled middle, satisfying the following eight identities:
a ( b c ) = a ( b c ) , ( a b ) c = ( a b ) c , a ( b c ) = ( a b ) c , a ( b c ) = a ( b c ) , ( a b ) c = ( a b ) c , a ( b c ) = ( a b ) c , a ( b c ) = ( a b ) c , a ( b c ) = ( a b ) c
for all a , b , c T .
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 x X , the expression ( x ) is a triword over X of length 1;
(ii) 
For all triwords ( v ) and ( w ) of lengths n and m, respectively, all monomials ( ( v ) ( w ) ) , ( ( v ) ( w ) ) and ( ( v ) ( w ) ) are triwords over X of length n + m .
Recall that, for every trialgebra T, for all b 1 , , b m T , every parenthesizing of
( b 1 b m 1 1 ) ( b m 1 b m 2 1 ) ( b m 2 b m 3 1 ) ( b m r b m )
gives the same element in T [1], and we denote such an element by [ b 1 b m ] U , where U is defined to be the set { m i 1 i r } . In particular, assume that T is the free trialgebra generated by X. Then, the triword (with an arbitrary bracketing way)
( x i 1 x i m 1 1 ) ( x i m 1 x i m 2 1 ) ( x i m r x i m r + t r )
over X can be determined by the sequence u : = x i 1 x i m r + t r and the set of index
U : = { m i 1 i r } .
Therefore, we call such a triword a normal triword over X and denote it by [ u ] U , and call x m 1 , x m 2 , , x m r the middle entries of [ u ] U . In case we would like to emphasize the middle entries, we also denote
[ u ] U : = x i 1 x i m 1 1 x ˙ i m 1 x i m 2 1 x ˙ i m r x i m r + t r .
We call u the associative word of the triword [ u ] U . Let P ( N ) be the power set of the positive integers N . We define
[ X + ] P ( N ) : = { [ u ] U u X + , U { 1 , . . . , ( u ) } }
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 [ X + ] P ( N ) of all normal triwords over X forms a linear basis of the free trialgebra generated by X.
For every integer k Z and U P ( N ) , we define
U + k = { m + k m U }
and define [ ε ] = ε . For convenience, when we write a set U = { m 1 , m 2 , , m r } P ( N ) , we always assume m 1 < m 2 < < m r . Moreover, the cardinality of the set U is denoted by | U | , and we simply denote [ u ] { m } by [ u ] m .
Let T r i X be the free trialgebra generated by X. Then, by [1], T r i X is the free k -module with a k -basis [ X + ] P ( N ) and for all [ u ] U , [ v ] V [ X + ] P ( N ) , we have
[ u ] U [ v ] V = [ u v ] ( u ) + V , [ u ] U [ v ] V = [ u v ] U , [ u ] U [ v ] V = [ u v ] U ( ( u ) + V ) .
Moreover, with the above products, ( [ X + ] P ( N ) , , , ) forms the free trisemigroup generated by X [3]. Though [ ε ] is not an element in [ X + ] P ( N ) , we still extend the operations ⊢ and ⊣ involving [ ε ] to make formulas in the sequel simplified. More precisely, we extend them with the following convention:
[ ε ] [ u ] U = [ u ] U [ ε ] = [ u ] U [ ε ] = [ ε ] [ u ] U = [ u ] U
for every [ u ] U [ X + ] P ( N ) .
The following lemma shows that every triword can be written as a leftnormed product of triwords.
Lemma 1.
Let [ u ] U = [ u 1 u 2 u n ] U [ X + ] P ( N ) with u 1 , , u n X + . Then, there exist some operations δ 1 , , δ n 1 { , , } such that
[ u ] U = ( ( ( [ u 1 ] U 1 δ 1 [ u 2 ] U 2 ) δ 2 [ u 3 ] U 3 ) ) δ n 1 [ u n ] U n ( l e f t n o r m e d   b r a c k e t i n g ) .
Proof. 
We use induction on n to prove the claim. For n = 1 , there is nothing to prove. Assume n > 1 and U = { m 1 , , m r } . There are several subcases to consider:
Case 1. If ( u 1 u n 1 ) m r , then we have [ u ] U = [ u 1 u n 1 ] U [ u n ] 1 . By induction hypothesis, we obtain
[ u ] U = ( ( ( [ u 1 ] U 1 δ 1 [ u 2 ] U 2 ) δ 2 [ u 3 ] U 3 ) ) [ u n ] 1 .
Case 2. If ( u 1 u n 1 ) < m 1 , then we have [ u ] U = [ u 1 u n 1 ] 1 [ u n ] ( u 1 u n 1 ) + U . By induction hypothesis, we obtain
[ u ] U = ( ( ( [ u 1 ] U 1 δ 1 [ u 2 ] U 2 ) δ 2 [ u 3 ] U 3 ) ) [ u n ] ( u 1 u n 1 ) + U .
Case 3. If m i ( u 1 u n 1 ) < m i + 1 for some i { 1 , , r 1 } , then we have
[ u ] U = [ u 1 u n 1 ] { m 1 , , m i } [ u n ] ( u 1 . . . u n 1 ) + { m i + 1 , . . . , m r } .
By induction hypothesis, we obtain
[ u ] U = ( ( ( [ u 1 ] U 1 δ 1 [ u 2 ] U 2 ) δ 2 [ u 3 ] U 3 ) ) [ u n ] ( u 1 . . . u n 1 ) + { m i + 1 , . . . , m r } .
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, [ X + ] P ( N ) forms a linear basis of the free trialgebra T r i X generated by X.
We first introduce a good ordering on X + . Let X be a well-ordered set. We define the deg-lex ordering on X + as the following: for u = x j 1 x j 2 x j n , v = x i 1 x i 2 x i m X + , where x i l , x j t X , we define
u > v if ( ( u ) , x j 1 , x j 2 , , x j n ) > ( ( v ) , x i 1 , x i 2 , , x i m ) lexicographically .
A well ordering > on X + is called monomial if, for all u , v , w X + , we have
u > v u w > v w and u > v w u > w v .
Clearly, the above deg-lex ordering on X + is monomial.
We proceed to define a well ordering on P ( N ) { } . For all U = { m 1 , , m r } and V = { n 1 , , n t } P ( N ) { } , we define
U > V if ( r , m 1 , , m r ) > ( t , n 1 , , n t ) lexicographically .
Fix a monomial ordering > on X + . Then, we define an order on [ X + ] P ( N ) as follows.
Definition 3.
For all [ u ] U , [ v ] V [ X + ] P ( N ) ,
[ u ] U > [ v ] V i f ( u , U ) > ( v , V ) l e x i c o g r a p h i c a l l y ,
where we compare u and v by the fixed ordering on X + . This order is called the monomial-centers ordering.
Though we use the same notation > for orderings on X + , P ( N ) { } and [ X + ] P ( N ) , 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 [ X + ] P ( N ) . Finally, if > is the deg-lex ordering on X + , then we call the ordering defined by (2) the deg-lex-centers ordering on [ X + ] P ( N ) .
For all [ u ] U , [ v ] V , [ u ] U , [ v ] V [ X + ] P ( N ) and δ , δ { , , } , assume [ u ] U δ [ v ] V = [ w ] W and [ u ] U δ [ v ] V = [ w ] W . Then, by [ u ] U δ [ v ] V > [ u ] U δ [ v ] V , we mean [ w ] W > [ w ] W .
From now on, we always assume that > is a monomial-centers ordering > on [ X + ] P ( N ) .
We observe that the monomial-centers ordering > on [ X + ] P ( N ) is monomial in the following sense:
Lemma 2.
Let [ u ] U , [ v ] V and [ w ] W [ X + ] P ( N ) with [ u ] U > [ v ] V . Then, we have
[ w ] W [ u ] U > [ w ] W [ v ] V , [ u ] U [ w ] W > [ v ] V [ w ] W , [ u ] U [ w ] W > [ v ] V [ w ] W , [ w ] W [ u ] U > [ w ] W [ v ] V , [ u ] U [ w ] W [ v ] V [ w ] W , [ w ] W [ u ] U [ w ] W [ v ] V .
Moreover, if u > v , then [ u ] U [ w ] W > [ v ] V [ w ] W and [ w ] W [ u ] U > [ w ] W [ v ] V .
For every polynomial f = i = 1 n α i [ u i ] U i T r i X , where 0 α i k , [ u i ] U i [ X + ] P ( N ) and [ u 1 ] U 1 > [ u 2 ] U 2 > > [ u n ] U n , we call [ u 1 ] U 1 the leading monomial of f, denoted by f ¯ , and we denote by f ˜ the associative word of f ¯ ; finally, α 1 the leading coefficient of f ¯ , denoted by l c ( f ) ; A polynomial f is called monic if l c ( f ) = 1 , and a nonempty subset S of T r i X is called monic if every element in S is monic. We call a nonzero polynomial f T r i X strong if f ˜ > r f ˜ , where r f : = f l c ( f ) f ¯ .
For convenience, we define 0 ¯ = 0 ˜ = 0 , 0 ˜ < u and 0 ¯ < [ u ] U for any [ u ] U [ X + ] P ( N ) .
From Lemma 2, it follows that
Lemma 3.
Let 0 h T r i X and [ w ] W [ X + ] P ( N ) . Then, we have
( [ w ] W h ) ¯ = [ w ] W h ¯ , ( h [ w ] W ) ¯ = h ¯ [ w ] W , ( [ w ] W h ) ¯ = [ w ] W h ¯ , ( h [ w ] W ) ¯ = h ¯ [ w ] W , ( [ w ] W h ) ¯ [ w ] W h ¯ , ( h [ w ] W ) ¯ h ¯ [ w ] W .
Moreover, if h is strong, then we obtain ( [ w ] W h ) ¯ = [ w ] W h ¯ and ( h [ w ] W ) ¯ = h ¯ [ w ] W .
Now, we begin to study elements of an ideal generated by a subset of T r i X . We begin with the following notation. For every [ u ] U = [ x i 1 x i t x i n ] U [ X + ] P ( N ) such that x i 1 , , x i n lie in X, by Lemma 1, we may assume that [ u ] U = ( [ v ] V δ 1 x i t ) δ 2 [ w ] W . Then, for every polynomial f T r i X , we define
[ u ] U | x i t f = ( [ v ] V δ 1 f ) δ 2 [ w ] W ,
where, by convention, if exactly one of [ u ] U and [ v ] V is [ ε ] , then we define [ u ] U δ [ v ] V = [ u v ] U V , in particular, the formula (3) makes sense. Clearly, the resulting polynomial ( [ v ] V δ 1 f ) δ 2 [ w ] W is independent of the choice of [ v ] V ,   [ w ] W and δ 1 , δ 2 . For simplicity, we usually denote by ( v f w ) a polynomial of the form (3).
Definition 4.
Let S be a monic subset of T r i X . Then, for every [ u ] U = [ x i 1 x i t x i n ] U in [ X + ] P ( N ) such that x i 1 , , x i n lie in X and for every s S , [ u ] U | x i t s is called ans-polynomial orS-polynomial, and it is called normal if either t U or s is strong.
Remark 1.
By Lemma 1 and Definition 4, it follows that
(i) 
Every S-polynomial ( a s b ) has an expression:
( a s b ) = ( [ a ] A δ 1 s ) δ 2 [ b ] B
for some δ 1 , δ 2 { , , } and a , b X * . In (4), by convention, we always assume δ 1 { , } (resp. δ 2 { , } ) in case [ a ] A = [ ε ] (resp. [ b ] B = [ ε ] ). Then, ( [ a ] A δ 1 s ) δ 2 [ b ] B is a normal S-polynomial if and only if one of the following conditions holds:
(a) 
δ 1 { , } and δ 2 { , } hold;
(b) 
s is strong.
Moreover, if ( [ a ] A δ 1 s ) δ 2 [ b ] B is normal and ( [ a ] A δ 1 s ) δ 2 [ b ] B ¯ = [ w ] W , then we denote
[ a s b ] W : = ( [ a ] A δ 1 s ) δ 2 [ b ] B .
(ii) 
If ( a s b ) = ( [ a ] A δ 1 s ) δ 2 [ b ] B is a normal S-polynomial, then ( [ u ] U δ 1 s ) δ 2 [ v ] V is still a normal S-polynomial for all [ u ] U , [ v ] V [ X + ] P ( N ) .
(iii) 
Let ( [ a ] A δ 1 s ) δ 2 [ b ] B be a normal S-polynomial and assume that s is not strong. Then, both
[ a ] A δ 3 ( ( [ a ] A δ 1 s ) δ 2 [ b ] B ) a n d ( [ a ] A δ 1 s ) δ 2 [ b ] B ) δ 4 [ b ] B
are normal S-polynomials if and only if δ 3 { , } and δ 4 { , } .
The following lemma follows from the definition of normal S-polynomials.
Lemma 4.
Let ( a s b ) = ( [ a ] A δ 1 s ) δ 2 [ b ] B be a normal S-polynomial. Assume s ¯ = [ u ] U and ( a s b ) ¯ = [ w ] W . Then, we have
( ( a ) + U ) W ( { 1 , , ( a ) , ( a s ˜ ) + 1 , , ( a s ˜ ) + ( b ) } ( ( a ) + U ) ) ,
or
W { 1 , , ( a ) , ( a s ˜ ) + 1 , , ( a s ˜ ) + ( b ) } .
Moreover, if W is a nonempty subset of { 1 , , ( a ) , ( a s ˜ ) + 1 , , ( a s ˜ ) + ( b ) } , then s is strong. Finally, for every such a set W satisfying the above conditions, there exists a normal S-polynomial ( a s b ) such that ( a s b ) ¯ = [ w ] W .
In view of Lemma 4, for every normal S-polynomial ( a s b ) = ( [ a ] A δ 1 s ) δ 2 [ b ] B with s ¯ = [ u ] U and ( a s b ) ¯ = [ w ] W , we define P ( [ a s b ] ) to be the set of all the possible W for a normal S-polynomial of the form ( a s b ) as in Lemma 4; in other words, we have
P ( [ a s b ] ) = { ( ( a ) + U ) W , W W { 1 , . . . , ( a ) , ( a s ˜ ) + 1 , . . . , ( a s ˜ ) + ( b ) } } { } , if   s   is   strong ; { ( ( a ) + U ) W W { 1 , , ( a ) , ( a s ˜ ) + 1 , , ( a s ˜ ) + ( b ) } } , if   s   is   not   strong .
In particular, we have P ( s ) = U .
By Lemma 2, we immediately obtain the following lemma.
Lemma 5.
Let ( a s b ) be a normal s-polynomial and [ u ] U , [ v ] V [ X + ] P ( N ) . Then,
[ u ] U [ a s b ] C [ v ] V = [ u a s b v ] ( u ) + C , [ u ] U [ a s b ] C [ v ] V = [ u a s b v ] ( ( u ) + C ) ( u a s ˜ b ) + V )
[ u ] U [ a s b ] C [ v ] V = [ u a s b v ] U ( ( u ) + C ) , [ u ] U [ a s b ] C [ v ] V = [ u a s b v ] U ( ( u ) + C ) ( ( u a s ˜ b ) + V ) .
The following lemma shows that the set
  • I r r ( S ) : = { [ v ] V [ X + ] P ( N ) [ v ] V [ c s d ] L ¯ for any normal S-polynomial [ c s d ] L }
is a linear generating set of the quotient trialgebra T r i X | S : = T r i X / I d ( S ) , where I d ( S ) is the ideal of T r i X generated by S.
Lemma 6.
Let S be a monic subset of T r i X . Then, for every nonzero polynomial h T r i X , we have
h = α i [ v i ] V i + β j [ a j s j b j ] C j ,
for some [ v i ] V i I r r ( S ) , α i , β j k , a j , b j X * , s j S , [ v i ] V i h ¯ and [ a j s j b j ] C j ¯ h ¯ .
Proof. 
Let h = l c ( h ) h ¯ + r h . If h ¯ I r r ( S ) , then we define h 1 = h l c ( h ) h ¯ . If h ¯ I r r ( S ) , then we obtain h ¯ = [ a s b ] C ¯ for some normal S-polynomial [ a s b ] C . In addition, we define h 1 = h l c ( h ) [ a s b ] C . In both cases, we have h 1 ¯ < h ¯ and the result follows by induction on h ¯ . □
Now, we shall introduce some conditions such that the set I r r ( S ) is a linear basis of a T r i X | S . Our first step is to introduce the notation of composition.
Definition 5.
Let S be a monic subset of T r i X . For all g , h S , g h , we define compositions as follows:
(i) 
If g is not strong, then, for all x X and [ u ] ( u ) [ X + ] P ( N ) , we call x g a left multiplication composition of g and call g [ u ] ( u ) a right multiplication composition of g.
(ii) 
Let ( c h d ) be a normal S-polynomial and suppose that w = g ˜ = c h ˜ d for some words c , d X * .
(a) 
If P ( g ) P ( [ c h d ] ) , then we call
( g , h ) g ¯ = g [ c h d ] P ( g )
an inclusion composition of S.
(b) 
If P ( g ) P ( [ c h d ] ) and both g and h are strong, then, for every x X , we call
( g , h ) [ x w ] 1 = [ x g ] 1 [ x c h d ] 1
a left multiplicative inclusion composition of S, and call
( g , h ) [ w x ] ( w x ) = [ g x ] ( w x ) [ c h d x ] ( w x )
a right multiplicative inclusion composition of S.
(iii) 
Let ( g a ) be a normal g-polynomial and let ( c h ) be a normal h-polynomial. Suppose that there exists a word w = g ˜ a = c h ˜ for some words a , c X * such that | g ˜ | + | h ˜ | > ( w ) .
(a) 
If P ( [ g a ] ) P ( [ c h ] ) , then, for every W P ( [ g a ] ) P ( [ c h ] ) , we call
( g , h ) [ w ] W = [ g a ] W [ c h ] W
an intersection composition of S.
(b) 
If P ( [ g a ] ) P ( [ c h ] ) = and both g and h are strong, then, for every x X , we call
( g , h ) [ x w ] 1 = [ x g a ] 1 [ x c h ] 1
a left multiplicative intersection composition of S, and call
( g , h ) [ w x ] ( w x ) = [ g a x ] ( w x ) [ c h x ] ( w x )
a right multiplicative intersection composition of S.
For all f , f T r i X , [ w ] W [ X + ] P ( N ) , we denote by
f f m o d ( S ) ( r e s p . m o d ( S , [ w ] W ) ) ,
if f f = α i [ a i s i b i ] C i , where each α i k , s i S , a i , b i X * and [ a i s i b i ] C i ¯ f f ¯ (resp. [ a i s i b i ] C i ¯ < [ w ] W ). Furthermore, f is called trivial modulo S (resp. ( S , [ w ] W ) ), if
f 0 m o d ( S ) ( r e s p . m o d ( S , [ w ] W ) ) .
A monic set S is said to be closed under left (resp. right ) multiplication compositions if every left (resp. right) multiplication composition x g (resp. g [ u ] ( u ) ) of S is trivial modulo S. A monic set S is called a Gröbner–Shirshov basis in T r i X if S is closed under left and right multiplication compositions and every composition ( g , h ) [ u ] U 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 T r i X that is closed under left multiplication compositions and assume g S . If g is not strong, then, for every [ v ] 1 [ X + ] P ( N ) , we have [ v ] 1 g 0 m o d ( S ) .
Proof. 
We shall use induction on ( v g ˜ , ( v ) ) to prove the claim. If ( v ) = 1 , then it is clear. Assume ( v ) 2 and [ v ] 1 = [ u x ] 1 , u X + , x X . Then, [ v ] 1 g = [ u ] 1 ( x g ) can be written as a linear combination of S-polynomials of the form [ u ] 1 [ c s d ] L , where s S and [ c s ˜ d ] L ( x g ) ¯ . Thus, we obtain
( [ u ] 1 [ c s d ] L ) ¯ [ u ] 1 [ c s ˜ d ] L [ u ] 1 ( x g ) ¯ = ( [ v ] 1 g ) ¯ and c s ˜ d x g ˜ .
If s is strong, then [ u ] 1 [ c s d ] L 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
[ u ] 1 [ c s d ] L = ( [ u ] 1 s ) [ d ] 1
and ( u s ˜ , ( u ) ) < ( v g ˜ , ( v ) ) . If c is not the empty word, then we have [ c s d ] L = [ c ] 1 δ [ s d ] ( c ) + L , where δ lies in { , } . Thus, we obtain
[ u ] 1 [ c s d ] L = ( [ u c ] 1 s ) [ d ] 1
and L > { 1 } . Since [ c s ˜ d ] L [ x g ˜ ] 1 , we obtain c s ˜ d < x g ˜ and ( u c s ˜ , ( u c ) ) < ( v g ˜ , ( v ) ) . By induction, [ u ] 1 [ c s d ] L is a linear combination of S-polynomials of the form [ a s b ] L [ d ] 1 , where s S and [ a s ˜ b ] L ( [ u c ] 1 s ) ¯ . By Lemma 5, [ a s b ] L [ d ] 1 is a normal S-polynomial. Thus, we deduce
[ a s ˜ b ] L [ d ] 1 ( [ u c ] 1 s ) ¯ [ d ] 1 = ( [ u ] 1 [ c s d ] L ) ¯ ( [ v ] 1 g ) ¯ .
The proof is completed. □
Let g S be a polynomial that is not strong, and assume that g x is trivial modulo S for every x X . Then, the following example shows that g [ u ] ( u ) may not be trivial modulo S for some u X + .
Example 1
([13] Example 3.12). Let X = { x 1 , x 2 } , x 1 > x 2 . Assume that the characteristic of the underlying field k is not 2. Let S = { f , g , h } , where f = [ x 1 x 2 ] 2 + [ x 1 x 2 ] 1 , g = [ x 1 x 2 x 1 ] 3 1 2 [ x 1 x 2 x 1 ] 2 1 2 [ x 1 x 2 x 1 ] 1 , h = [ x 1 x 2 x 2 ] 3 1 2 [ x 1 x 2 x 2 ] 2 1 2 [ x 1 x 2 x 2 ] 1 . These three polynomials are not strong. By a direct calculation, we have g x i = 0 , h x i = 0 , i = 1 , 2 , and f x 1 = 2 g + f x 1 0 m o d ( S ) , f x 2 = 2 h + f x 2 0 m o d ( S ) . However, f [ x 1 x 1 ] 2 = 2 [ x 1 x 2 x 1 x 1 ] 4 is not trivial modulo S because f [ x 1 x 1 ] 2 is not normal, and, for every polynomial f { g , h } , we have f x 1 = 0 .
Lemma 8.
Let S be a monic subset of T r i X that is closed under left and right multiplication compositions. Then, for all normal S-polynomial [ a s b ] C and normal triword [ u ] U [ X + ] P ( N ) , we have
[ u ] U δ [ a s b ] C 0 m o d ( S ) a n d [ a s b ] C δ [ u ] U 0 m o d ( S ) ,
where δ { , , } . Moreover, for every normal triword [ w ] W [ X + ] P ( N ) , if a s ˜ b < w , then we have
[ u ] U δ [ a s b ] C 0 m o d ( S , [ u ] U δ [ w ] W ) a n d [ a s b ] C δ [ u ] U 0 m o d ( S , [ w ] W δ [ u ] U ) ,
where δ { , , } .
Proof. 
By Lemma 5, it suffices to show that [ u ] U [ a s b ] C and [ a s b ] C [ u ] U are trivial modulo S, where s is not strong. Thus, we assume that s is not strong.
We first prove that [ u ] U [ a s b ] C is trivial modulo S. By Lemma 1, obviously we have
[ u ] U [ a s b ] C = ( ( [ u ] U [ a ] A ) s ) [ b ] B = ( ( [ u 1 ] U 1 δ 1 [ u 2 ] 1 ) s ) ) [ b ] B = ( [ u 1 ] U 1 δ 1 ( [ u 2 ] 1 s ) ) [ b ] B ,
where δ 1 { , } and u a = u 1 u 2 with u 1 X * and u 2 X + . If [ u 1 ] U 1 = [ ε ] , then we have δ 1 = by convention. By Lemmas 7, 5 and 2, the result follows. Moreover, if a s ˜ b < w , then we obtain
u a s ˜ b < u w and ( [ u ] U δ [ a s b ] C ) ¯ < [ u ] U δ [ w ] W ,
where δ { , , } . Therefore, we deduce [ u ] U δ [ a s b ] C 0 m o d ( S , [ u ] U δ [ w ] W ) .
The proof for the case of [ a s b ] C [ u ] U is similar to the above case. More precisely, by Lemma 1, we have
[ a s b ] C [ u ] U = [ a ] A ( s ( [ b ] B [ u ] U ) ) = [ a ] A ( ( s [ u 1 ] ( u 1 ) ) δ 2 [ u 2 ] U 2 ) ,
where δ 2 { , } and b u = u 1 u 2 with u 1 X + , u 2 X * . Since S is closed under right multiplication compositions, the results follow by Lemmas 5 and 2. Moreover, if a s ˜ b < w , then we have
a s ˜ b u < w u and ( [ a s b ] C δ [ u ] U ) ¯ < [ w ] W δ [ u ] U ,
where δ { , , } . Therefore, we deduce [ a s b ] C δ [ u ] U 0 m o d ( S , [ w ] W δ [ u ] U ) . □
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 T r i X that is closed under left and right multiplication compositions. Let [ w ] W be a normal triword such that ( [ a ] A δ 1 [ u ] U ) δ 2 [ b ] B = [ w ] W , and let f be a normal S-polynomial with f ¯ < [ u ] U . If f ˜ < u , or if δ 1 { , } and δ 2 { , } , then we have
( [ a ] A δ 1 f ) δ 2 [ b ] B 0 m o d ( S , [ w ] W ) .
Proof. 
If δ 1 { , } and δ 2 { , } , then by Lemmas 5 and 2, ( [ a ] A δ 1 f ) δ 2 [ b ] B is a normal S-polynomial with
( [ a ] A δ 1 f ) δ 2 [ b ] B ¯ < ( [ a ] A δ 1 [ u ] U ) δ 2 [ b ] B = [ w ] W ,
the result follows.
Now, we assume f ˜ < u . By Lemma 8, ( [ a ] A δ 1 f ) δ 2 [ b ] B can be written as a linear combination of S-polynomials of the form [ c s d ] L δ 2 [ b ] B , where s S and c s ˜ d < a u . In addition, for every S-polynomial [ c s d ] L δ 2 [ b ] B , by Lemma 8 and by the fact that c s ˜ d b < a u b = w , we have [ c s d ] L δ 2 [ b ] B 0 m o d ( S , [ w ] W ) . □
Now, we show that, if a monic set S is closed under left and right multiplication compositions, then the elements of the ideal I d ( S ) of T r i X can be written as linear combinations of normal S-polynomials.
Corollary 2.
Let S be a monic subset of T r i X that is closed under left and right multiplication compositions. Then, every S-polynomial ( a s b ) has an expression of the form:
( a s b ) = α i [ a i s i b i ] C i ,
where each α i k , s i S , a i , b i X * .
Proof. 
Let [ u ] U be a triword such that s ¯ < [ u ] U . In addition, assume ( a s b ) = ( [ a ] A δ 1 s ) δ 2 [ b ] B and [ w ] W = ( [ a ] A δ 1 [ u ] U ) δ 2 [ b ] B . Then, by Corollary 1, we obtain
( a s b ) = ( [ a ] A δ 1 s ) δ 2 [ b ] B 0 m o d ( S , [ w ] W ) .
The proof is completed. □
Lemma 9.
Let S be a Gröbner–Shirshov basis in T r i X . Suppose that [ a 1 s 1 b 1 ] C 1 , [ a 2 s 2 b 2 ] C 2 are two normal S-polynomials with [ a 1 s 1 b 1 ] C 1 ¯ = [ a 2 s 2 b 2 ] C 2 ¯ = [ w ] W . Then, we have
[ a 1 s 1 b 1 ] C 1 [ a 2 s 2 b 2 ] C 2 0 m o d ( S , [ w ] W ) .
Proof. 
Since [ w ] W = [ a 1 s 1 b 1 ] C 1 ¯ = [ a 2 s 2 b 2 ] C 2 ¯ , we obtain w = a 1 s 1 ˜ b 1 = a 2 s 2 ˜ b 2 and W = C 1 = C 2 . We have to consider the following three cases:
Case 1. Without loss of generality, we can assume b 1 = a s 2 ˜ b 2 and a 2 = a 1 s 1 ˜ a ; here, a may be the empty word. Assume s 1 = s 1 ¯ + β i [ u i ] U i and s 2 = s 2 ¯ + β j [ v j ] V j . Then, by Lemma 1, we have
[ a 1 s 1 b 1 ] C 1 [ a 2 s 2 b 2 ] C 2 = [ a 1 s 1 a s 2 ˜ b 2 ] W [ a 1 s 1 ˜ a s 2 b 2 ] W = ( ( ( [ a 1 ] A 1 δ 1 s 1 ) δ 2 [ a ] A ) δ 3 s 2 ¯ ) δ 4 [ b 2 ] B 2 ( ( ( [ a 1 ] A 1 δ 1 s 1 ¯ ) δ 2 [ a ] A ) δ 3 s 2 ) δ 4 [ b 2 ] B 2 = ( ( ( [ a 1 ] A 1 δ 1 s 1 ) δ 2 [ a ] A ) δ 3 ( s 2 ¯ s 2 ) ) δ 4 [ b 2 ] B 2 ( ( ( [ a 1 ] A 1 δ 1 ( s 1 ¯ s 1 ) ) δ 2 [ a ] A ) δ 3 s 2 ) δ 4 [ b 2 ] B 2 = β j ( ( ( [ a 1 ] A 1 δ 1 s 1 ) δ 2 [ a ] A ) δ 3 [ v j ] V j ) δ 4 [ b 2 ] B 2 + β i ( ( ( [ a 1 ] A 1 δ 1 [ u i ] U i ) δ 2 [ a ] A ) δ 3 s 2 ) δ 4 [ b 2 ] B 2
for some δ 1 , δ 2 , δ 3 , δ 4 { , , } .
If s 1 and s 2 are both strong, then all the resulting polynomials
( ( ( [ a 1 ] A 1 δ 1 s 1 ) δ 2 [ a ] A ) δ 3 [ v j ] V j ) δ 4 [ b 2 ] B 2 and ( ( ( [ a 1 ] A 1 δ 1 [ u i ] U i ) δ 2 [ a ] A ) δ 3 s 2 ) δ 4 [ b 2 ] B 2
are normal S-polynomials; if neither s 1 nor s 2 are strong, then, by Remark 1, we deduce δ 3 = , δ 1 { , } and δ 2 , δ 4 { , } , which implies that the above resulting S-polynomials are normal; If only one of s 1 and s 2 is not strong, say, s 1 is not strong, then, by Remark 1, we deduce δ 1 { , } and δ 2 , δ 3 , δ 4 { , } . 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 [ w ] W .
Case 2. Without loss of generality, we may assume that s 1 ˜ = a s 2 ˜ b , a 2 = a 1 a and b 2 = b b 1 . If P ( s 1 ) P ( [ a s 2 b ] ) , then, since S is a Gröbner–Shirshov basis, we may assume
s 1 [ a s 2 b ] P ( s 1 ) = α i [ c i s i d i ] L i
satisfying [ c i s i d i ] L i ¯ s 1 [ a s 2 b ] P ( s 1 ) ¯ < s 1 ¯ for every i. Thus, we have
[ a 1 s 1 b 1 ] C 1 [ a 2 s 2 b 2 ] C 2 = ( [ a 1 ] A 1 δ 1 ( s 1 [ a s 2 b ] P ( s 1 ) ) ) δ 2 [ b 1 ] B 1 = α i ( [ a 1 ] A 1 δ 1 [ c i s i d i ] L i ) δ 2 [ b 1 ] B 1 .
If one of s 1 and s 2 is not strong, then we deduce δ 1 { , } and δ 2 { , } ; and, if s 1 and s 2 are strong, then we obtain c i s i ˜ d i < s 1 ˜ for all i. In either of these subcases, by Corollary 1, we obtain
[ a 1 s 1 b 1 ] C 1 [ a 2 s 2 b 2 ] C 2 = α i ( [ a 1 ] A 1 δ 1 [ c i s i d i ] L i ) δ 2 [ b 1 ] B 1 0 m o d ( S , [ w ] W ) .
If P ( s 1 ) P ( [ a s 2 b ] ) , then we deduce that s 1 , s 2 are strong and ( a 1 ) + ( b 1 ) 1 . Thus, we have either
[ a 1 s 1 b 1 ] C 1 [ a 2 s 2 b 2 ] C 2 = ( [ a 1 ] A 1 δ 1 ( [ x s 1 ] 1 [ x a s 2 b ] 1 ) ) δ 2 [ b 1 ] B 1
or
[ a 1 s 1 b 1 ] C 1 [ a 2 s 2 b 2 ] C 2 = ( [ a 1 ] ( a 1 ) δ 1 ( [ s 1 y ] ( s 1 ˜ y ) [ a s 2 b y ] ( s 1 ˜ y ) ) ) δ 2 [ b 1 ] B 1 ,
where we have a 1 = a 1 x and b 1 = y b 1 for some words a 1 , b 1 X * and x , y X . Then, by the fact that S is a Gröbner–Shirshov basis and by Lemmas 5 and 8, we deduce
[ a 1 s 1 b 1 ] C 1 [ a 2 s 2 b 2 ] C 2 0 m o d ( S , [ w ] W ) .
Case 3. Without loss of generality, we assume a 2 = a 1 a , b 1 = b b 2 and w = s 1 ˜ b = a s 2 ˜ . If P ( [ s 1 b ] ) P ( [ a s 2 ] ) , then, since S is a Gröbner–Shirshov basis, we may assume
[ s 1 b ] C [ a s 2 ] C = α i [ c i s i d i ] L i
satisfying [ c i s i d i ] L i ¯ [ s 1 b ] C [ a s 2 ] C ¯ < [ w ] C for every i. Thus, we have
[ a 1 s 1 b 1 ] C 1 [ a 2 s 2 b 2 ] C 2 = ( [ a 1 ] A 1 δ 1 ( [ s 1 b ] C [ a s 2 ] C ) ) δ 2 [ b 2 ] B 2 = α i ( [ a 1 ] A 1 δ 1 [ c i s i d i ] L i ) δ 2 [ b 2 ] B 2 .
If one of s 1 and s 2 is not strong, then we deduce δ 1 { , } and δ 2 { , } ; and, if s 1 and s 2 are strong, then we obtain c i s i ˜ d i < w ˜ for all i. In either of these subcases, by Corollary 1, we obtain
[ a 1 s 1 b 1 ] C 1 [ a 2 s 2 b 2 ] C 2 = α i ( [ a 1 ] A 1 δ 1 [ c i s i d i ] L i ) δ 2 [ b 2 ] B 2 0 m o d ( S , [ w ] W ) .
If P ( [ s 1 b ] ) P ( [ a s 2 ) = , then we deduce that s 1 , s 2 are strong and ( a 1 ) + ( b 1 ) 1 . Thus, we have either
[ a 1 s 1 b 1 ] C 1 [ a 2 s 2 b 2 ] C 2 = ( [ a 1 ] A 1 δ 1 ( [ x s 1 b ] 1 [ x a s 2 ] 1 ) ) δ 2 [ b 2 ] B 2
or
( [ a 1 ] ( a 1 ) δ 1 ( [ s 1 b y ] ( w y ) [ a s 2 y ] ( w y ) ) ) δ 2 [ b 2 ] B 2 ,
where we have a 1 = a 1 x , b 2 = y b 2 for some a 1 , b 2 X * and x , y X . Then, by the fact that S is a Gröbner–Shirshov basis and by Lemmas 5 and 8, we deduce
[ a 1 s 1 b 1 ] C 1 [ a 2 s 2 b 2 ] C 2 0 m o d ( S , [ w ] W ) .
The proof is completed. □
Theorem 1.
(Composition-Diamond lemma for trialgebras) Let > be a monomial-center ordering on [ X + ] P ( N ) , and let S be a monic subset of T r i X and I d ( S ) the ideal of T r i X generated by S. Then, the following statements are equivalent.
(i) 
S is a Gröbner–Shirshov basis in T r i X .
(ii) 
0 h I d ( S ) h ¯ = [ c s d ] L ¯ for some normal S-polynomial [ c s d ] L .
(iii) 
I r r ( S ) = { [ v ] V [ X + ] P ( N ) [ v ] V [ c s d ] L ¯ f o r a n y n o r m a l S p o l y n o m i a l [ c s d ] L } is a k -basis of the quotient trialgebra T r i X | S = T r i X / I d ( S ) .
Proof. 
(i) ⇒ (ii) Let 0 h I d ( S ) . Then, by Corollary 2, we may assume h = i = 1 n α i [ c i s i d i ] L i , where each α i k , c i , d i X * , s i S . Define [ u i ] L i = [ c i s i d i ] L i ¯ = [ c i s i ˜ d i ] L i , 1 i n . Then, we may assume without loss of generality that
[ u 1 ] L 1 = [ u 2 ] L 2 = = [ u l ] L l > [ u l + 1 ] L l + 1 [ u l + 2 ] L l + 2 .
Now, we use induction on [ u 1 ] L 1 to show h ¯ = [ c s d ] L ¯ for some normal S-polynomial [ c s d ] L . For [ u 1 ] L 1 = h ¯ , there is nothing to prove. For [ u 1 ] L 1 > h ¯ , we have i = 1 l α i = 0 and
h = i = 1 l α i [ c i s i d i ] L i + i = l + 1 n α i [ c i s i d i ] L i = ( i = 1 l α i ) [ c 1 s 1 d 1 ] L 1 i = 2 l α i ( [ c 1 s 1 d 1 ] L 1 [ c i s i d i ] L i ) + i = l + 1 n α i [ c i s i d i ] L i = 0 + β j [ a j s j b j ] C j + i = l + 1 n α i [ c i s i d i ] L i ,
where each [ a j s j b j ] C j is a normal S-polynomial and [ a j s j b j ] C j ¯ < [ u 1 ] L 1 by Lemma 9. Thus, the result follows by induction hypothesis.
(ii) ⇒ (iii) By Lemma 6, the set I r r ( S ) is a linear generator of the space T r i X | S . Assume that g = α i [ v i ] V i = 0 in T r i X | S , where α i k , [ v i ] V i I r r ( S ) for every i and [ v 1 ] V 1 > [ v 2 ] V 2 > . This implies that g I d ( S ) . Then, α i = 0 for every i. Otherwise, g ¯ = [ v j ] V j for some j, which is a contradiction.
(iii) ⇒ (i) Assume that g is a composition of elements of S. We have g I d ( S ) . By Lemma 6, g = i α i [ v i ] V i + j β j [ c j s j d j ] L j , where each α i , β j k , c j , d j X * , [ v i ] V i I r r ( S ) , s j S , and [ v i ] V i g ¯ , [ c j s j d j ] L j ¯ g ¯ . Clearly, i α i [ v i ] V i I d ( S ) . By (iii), we obtain α i = 0 for every i, and thus we have g 0 m o d ( S ) . □
Shirshov algorithm If a monic subset S T r i X 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 S c o m p that contains S and generates the same ideal, that is, I d ( S c o m p ) = I d ( S ) .
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 ( E , + , , , ) such that all of ( E , + , ) , ( E , + , ) and ( E , + , ) are associative rings such that the identities in (1) hold in E.
Let ( E , , , ) be a trisemigroup, and T the free left R-module with R-basis E. Then, ( T , + , , , ) is a triring equipped with the following operations:
g h : = i , j r i r j ( u i v j ) , f g : = i , j r i r j ( u i v j ) , g h : = i , j r i r j ( u i v j ) ,
for all g = i r i u i , h = j r j v j T , r i , r j R , u i , v j E . Such a triring, denoted by T r i R ( E ) , is called a trisemigroup-triring of E over R.
Let T r i s g p X be the free trisemigroup generated by X; then, we obtain a trisemigroup-triring of T r i s g p X over R, denoted by T r i R X , which is also called the free triring over R generated by X. In particular, T r i k X = T r i X is the free trialgebra generated by X when k is a field.
An ideal I of T r i R X is an R-submodule of T r i R X such that g h , h g , g h , h g , g h , h g I for every g T r i R X and h I .
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 [ X + ] P ( N ) , and let S be a monic subset of T r i R X and I d ( S ) the ideal of T r i R X generated by S. Then, the following statements are equivalent.
(i) 
S is a Gröbner–Shirshov basis in T r i R X .
(ii) 
0 f I d ( S ) f ¯ = [ c s d ] L ¯ for some normal S-polynomial [ c s d ] L .
(iii) 
I r r ( S ) = { [ v ] V [ X + ] P ( N ) [ v ] V [ c s d ] L ¯ for any normal S-polynomial [ c s d ] L } is an R-basis of the quotient triring T r i R X | S : = T r i R X / I d ( S ) , i.e., T r i R X | S is a free R-module with R-basis I r r ( S ) .
Remark 2.
The Shirshov algorithm does not work generally in T r i R X .
We now turn to the question on how to recognize whether two ideals of T r i X 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 T r i X is minimal (resp. reduced ) if, for every s S , we have s ¯ I r r ( S { s } ) (resp. s u p p ( s ) I r r ( S { s } ) ), where
s u p p ( s ) : = { [ u 1 ] U 1 , , [ u n ] U n }
for s = α 1 [ u 1 ] U 1 + + α n [ u n ] U n , 0 α i k , [ u i ] U i [ X + ] P ( N ) .
Suppose that I is an ideal of T r i X and I = I d ( S ) . If S is a reduced (resp. minimal) Gröbner–Shirshov basis in T r i X , then we call S a reduced (resp. minimal) Gröbner–Shirshov basis for the ideal I or for the quotient dialgebra T r i X / I .
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 T r i X and S a Gröbner–Shirshov basis for I. For every E S , if I r r ( E ) = I r r ( S ) , then E is also a Gröbner–Shirshov basis for I.
Proof. 
For every g I , since I r r ( E ) = I r r ( S ) and S a Gröbner–Shirshov basis for I, by Theorem 1, we obtain g ¯ = [ c s d ] L ¯ = [ a f b ] L ¯ for some s S , f E , a , b , c , d X * . Thus, we obtain g 1 = g l c ( g ) [ a f b ] L I and g 1 ¯ < g ¯ . By induction on g ¯ , we deduce that g is a linear combination of normal E-polynomials, i.e., g I d ( E ) . This shows that I = I d ( E ) . Now, the result follows from Theorem 1. □
Let S be a subset of T r i X and [ u ] U [ X + ] P ( N ) . We set
S ¯ : = { s ¯ [ X + ] P ( N ) s S } , S [ u ] U : = { s S s ¯ = [ u ] U } , S < [ u ] U : = { s S s ¯ < [ u ] U } .
Theorem 3.
There is a unique reduced Gröbner–Shirshov basis for every ideal of the free trialgebra T r i X .
Proof. 
Let I be a ideal of T r i X . We first prove the existence. It is clear that S = { l c ( g ) 1 g 0 g I } is a Gröbner–Shirshov basis for I. For each [ u ] U S ¯ , we fix a polynomial g [ u ] U in S such that g [ u ] U ¯ = [ u ] U . Define
S 0 = { g [ u ] U S [ u ] U S ¯ } .
Then, the leading monomials of elements in S 0 are pairwise different. Since I S S 0 and I ¯ = S ¯ = S 0 ¯ , we have I r r ( S 0 ) = I r r ( S ) = [ X + ] P ( N ) S ¯ . By Lemma 10, S 0 is a Gröbner–Shirshov basis for I.
Moreover, we may assume that, for every s S 0 , we have
s u p p ( s s ¯ ) I r r ( S 0 ) ,
i.e., s u p p ( s s ¯ ) [ X + ] P ( N ) S 0 ¯ . If s u p p ( s s ¯ ) S 0 ¯ for some s S 0 , then set [ w ] W = max { s u p p ( s s ¯ ) S 0 ¯ } . Then, there exists an element g S 0 such that g ¯ = [ w ] W . Note that s ¯ > [ w ] W = g ¯ and s α g ¯ = s ¯ , where α is the coefficient of [ w ] W in s. Replace s by s α g in S 0 . Then, s u p p ( s α g s α g ¯ ) S 0 ¯ = or max { s u p p ( s α g s α g ¯ ) S 0 ¯ } < [ u ] U . Since > is a well ordering on [ X + ] P ( N ) , this process will terminate.
Noting that, for every [ u ] U S 0 ¯ , there exists a unique g S 0 such that [ u ] U = g ¯ . Set min { S 0 ¯ } = s 0 ¯ with s 0 S 0 . Define S s 0 ¯ : = { s 0 } . Suppose that g S 0 , s 0 ¯ < g ¯ and S h ¯ has been defined for every h S 0 with h ¯ < g ¯ . Define
S g ¯ : = S < g ¯ if g ¯ I r r ( S < g ¯ ) , S < g ¯ { g } if g ¯ I r r ( S < g ¯ ) , where S < g ¯ : = h ¯ < g ¯ , h S 0 S h ¯ .
Let
S 1 : = g S 0 S g ¯ .
Then, for every g S 0 , we have g S 1 g ¯ I r r ( S < g ¯ ) g S g ¯ .
We first claim that I r r ( S 1 ) = I r r ( S 0 ) . Since S 1 S 0 , it suffices to show I r r ( S 1 ) I r r ( S 0 ) . Assume that there exists a normal triword [ u ] U [ X + ] P ( N ) such that [ u ] U I r r ( S 1 ) and [ u ] U I r r ( S 0 ) . Since S 0 ¯ = I ¯ , it follows that [ u ] U = g ¯ for some g S 0 S 1 . If g ¯ I r r ( S < g ¯ ) , then g S g ¯ S 1 , a contradiction. If g ¯ I r r ( S < g ¯ ) , then g ¯ = [ a s b ] C ¯ for some s S < g ¯ S 1 , a , b X * . This implies that g ¯ I r r ( S 1 ) , a contradiction. Therefore, I r r ( S 1 ) = I r r ( S 0 ) . By Lemma 10, S 1 is a Gröbner–Shirshov basis for I.
If g , h S 1 , g h , g ¯ = [ a h b ] C ¯ , then we have h ¯ < g ¯ , h S h ¯ S < g ¯ . Thus, we deduce g ¯ I r r ( S < g ¯ ) and g S 1 , a contradiction. Thus, S 1 is a minimal Gröbner–Shirshov basis for I. By (5), for every s S 1 , we have s u p p ( s ) I r r ( S 1 { s } ) , so S 1 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 s 0 ¯ = min S 1 ¯ and t 0 ¯ = min T ¯ , where s 0 S 1 , t 0 T . By Theorem 1, we have s 0 ¯ = [ a t b ] C ¯ t ¯ t 0 ¯ for some t T , a , b X * . Similarly, t 0 ¯ s 0 ¯ . Thus, we deduce t 0 ¯ = s 0 ¯ . We claim that t 0 = s 0 . Otherwise, we have 0 t 0 s 0 I . By the above argument again, we obtain that t 0 ¯ > t 0 s 0 ¯ t ¯ t 0 ¯ for some t T , a contradiction. Thus, we have
S 1 s 0 ¯ = { s 0 } = { t 0 } = T t 0 ¯ .
For every [ u ] U S 1 ¯ T ¯ with [ u ] U > t 0 ¯ , assume that S 1 < [ u ] U = T < [ u ] U . To prove T = S 1 , it suffices to show that S 1 [ u ] U T [ u ] U . For every s S 1 [ u ] U , we have s ¯ = [ c t d ] L ¯ t ¯ for some t T , c , d X * . Now, we claim that [ u ] U = s ¯ = t ¯ . Otherwise, we have [ u ] U = s ¯ > t ¯ . Then, t T < [ u ] U = S 1 < [ u ] U and t S 1 { s } . However, s ¯ = [ c t d ] L ¯ , which contradicts with the fact that S 1 is a reduced Gröbner–Shirshov basis. Now, we show s = t T [ u ] U . If s t , then 0 s t I . By Theorem 1, s t ¯ = [ a t 1 b ] L 1 ¯ = [ c s 1 d ] L 1 ¯ for some t 1 T , s 1 S 1 , a , b , c , d X * with t 1 ¯ , s 1 ¯ s t ¯ < s ¯ = t ¯ . Thus, we deduce s 1 S 1 { s } and t 1 T { t } . Noting that s t ¯ s u p p ( s ) s u p p ( t ) , we may assume that s t ¯ s u p p ( s ) . As S 1 is a reduced Gröbner–Shirshov basis, we have s t ¯ I r r ( S 1 { s } ) , which contradicts with the fact that s t ¯ = [ c s 1 d ] L 1 ¯ , where s 1 S 1 { s } . Thus, s = t . Therefore, we obtain S 1 [ u ] U T [ u ] U . It follows that we have S T . Similarly, we have T S , 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 I 1 , I 2 be two ideals of T r i X . Then, I 1 = I 2 if and only if I 1 and I 2 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
T r i s g p X : = ( [ X + ] P ( N ) , , , )
the free trisemigroup generated by X [1,3]. Clearly, every trisemigroup T is a quotient of some free trisemigroup, say
T = T r i s g p X | S : = [ X + ] P ( N ) / ρ ( S )
for some set X and S [ X + ] P ( N ) × [ X + ] P ( N ) , where ρ ( S ) is the congruence on ( [ X + ] P ( N ) , , , ) 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 T r i s g p X | S be found?
Let > be a monomial-centers ordering on [ X + ] P ( N ) and
S = { ( [ v i ] V i , [ w i ] W i ) [ v i ] V i > [ w i ] W i , i I } .
Consider the trialgebra T r i X | S , where we identify the set S with the set { [ v i ] V i [ w i ] W i | i I } . By the Shirshov algorithm, we have a Gröbner–Shirshov basis S c o m p in T r i X and I d ( S c o m p ) = I d ( S ) . It is clear that each element in S c o m p is of the form [ u ] U [ v ] V , [ u ] U , [ v ] V [ X + ] P ( N ) . Let
σ : T r i X | S T r i k ( [ X + ] P ( N ) / ρ ( S ) ) , α i [ u i ] U i + I d ( S ) α i [ u i ] U i ρ ( S ) , α i k , [ u i ] U i [ X + ] P ( N ) .
Then, σ is obviously a trialgebra isomorphism. Noting that, by Theorem 1, I r r ( S c o m p ) is a linear basis of T r i X | S , we have that σ ( I r r ( S c o m p ) ) is a linear basis of T r i k ( [ X + ] P ( N ) / ρ ( S ) ) . It follows that I r r ( S c o m p ) is exactly a set of normal forms of elements of the trisemigroup T r i s g p X | S .
Therefore, we obtain the following theorem.
Theorem 5.
Let > be a monomial-centers ordering on [ X + ] P ( N ) and T = T r i s g p X | S , where S = { ( [ v i ] V i , [ w i ] W i ) [ v i ] V i > [ w i ] W i , i I } is a subset of [ X + ] P ( N ) × [ X + ] P ( N ) . Then, I r r ( S c o m p ) is a set of normal forms of elements of the trisemigroup T r i s g p X | S .
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 W , W 1 and W 2 be vector subspaces of T. We first define
W 1 W 2 = Span k { a b a W 1 , b W 2 } , W 1 W 2 = Span k { a b a W 1 , b W 2 } ,
and   W 1 W 2 = Span k { a b a W 1 , b W 2 } .
Then, we define W 1 = W and W n = 1 i n 1 ( W i W n i + W i W n i + W i W n i ) for every integer number n 2 . Finally, we define
W n : = W 1 + W 2 + + W n .
Obviously, we have
W n = Span k { [ a 1 a n ] U U { 1 , , n } , a 1 , , a n W }
and
W n = Span k { [ a 1 a m ] U U { 1 , , m } , m N , m n , a 1 , , a m W } .
Now, we are ready to introduce the Gelfand–Kirillov dimension of a trialgebra.
Definition 8.
Let T be a trialgebra over k . Then, the Gelfand–Kirillov dimension of a trialgebra T is defined to be
GKdim ( T ) = sup W lim n ¯ log n dim ( W n ) ,
where the supremum is taken over all finite dimensional subspaces W 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 k X the subspace of T spanned by X. Then, we have
GKdim ( T ) = lim n ¯ log n dim ( ( k X ) n ) .
Let X = { x } . It is well known that GKdim ( k X ) = 1 and GKdim ( D i X ) = 2 , where k X (resp. D i X ) is the free associative algebra (resp. dialgebra) generated by X. Note that a normal triword of length n in T r i X is of the form [ x x ] U , where U is a nonempty subset of { 1 , , n } . Thus, by a direct calculation, we have GKdim ( T r i X ) = + .
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 [ X + ] P ( N ) .

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) ( T , , , ) is commutative if,andare commutative.
Let T c be the subset of T r i X consisting of the following polynomials:
[ u ] U [ v ] V [ v ] V [ u ] U , [ u ] U [ v ] V [ v ] V [ u ] U , [ u ] U [ v ] V [ v ] V [ u ] U ,
where [ u ] U , [ v ] V [ X + ] P ( N ) . Then,
T r i [ X ] : = T r i X | T c
is clearly the free commutative trialgebra generated by X. In particular, a linear basis of T r i [ X ] consisting of normal triwords over X is exactly a set of normal forms of elements of the free commutative trisemigroup generated by X.
Let X = { x i i I } be a well-ordered set. For every u = x i 1 x i 2 x i n X + , x i k X , we define
u = x i 1 x i 2 x i n : = x j 1 x j 2 x j n ,
where x j 1 x j 2 x j n is a reordering of x i 1 x i 2 x i n satisfying x j 1 x j 2 x j n .
We define
X + : = { u u X + } ; u U : = [ u ] U , U { 1 , , ( u ) } ;
X + P ( N ) : = { u U u X + , U { 1 , , ( u ) } } .
For u X + , [ u ] U is a normal triword, while u U is called a commutative normal triword. For instance, assume u = x 2 x 1 x 2 x 1 x 2 x 1 X + and assume x 1 < x 2 , where x 1 , x 2 X . Then, we have u = x 1 x 1 x 1 x 2 x 2 x 2 , u { 3 , 5 } = [ x 1 x 1 x 1 x 2 x 2 x 2 ] { 3 , 5 } .
Proposition 2.
Let X = { x i i I } be a well-ordered set. Then, we have the following:
(i) 
T r i [ X ] = T r i X | S c , where S c consists of the following polynomials:
[ u ] U u U ( [ u ] U [ X + ] P ( N ) , ( u ) = 2 o r | U | = ( u ) 3 ) ,
[ v ] V v 1 ( [ v ] V [ X + ] P ( N ) , ( v ) 3 a n d | V | < ( v ) ) .
(ii) 
S c is a Gröbner–Shirshov basis in T r i X .
(iii) 
The set
X + c : = { v 1 v X + } { u 2 u X + , ( u ) = 2 } { u { 1 , 2 , . . . , ( u ) } u X + } .
forms a k -basis of the free commutative trialgebra T r i [ X ] .
Proof. 
(i) It suffices to show S c I d ( T c ) and T c I d ( S c ) , where T c consists of the elements described in (6). We first show S c I d ( T c ) . Since , and ⊥ are commutative, we have
[ x i x j ] 2 x i x j 2 I d ( T c ) , [ u ] { 1 , , ( u ) } u { 1 , , ( u ) } I d ( T c ) and [ v ] 1 v 1 I d ( T c ) ,
where x i , x j X , u , v X + , | u | , | v | 2 . It remains to prove that
[ v ] V v 1 I d ( T c ) , where [ v ] V [ X + ] P ( N ) , ( v ) 3 , | V | < ( v ) and V { 1 } .
There are two cases to consider:
Case 1. If 1 V , we assume [ v ] V = [ v 0 ] ( v 0 ) [ v 1 ] V 1 for some v 0 , v 1 X + . Then, in T r i X | T c , we have
[ v ] V v ( v ) = [ v 1 ] V 1 [ v 0 ] ( v 0 ) v ( v ) = [ v 1 v 0 ] ( v ) v ( v ) = 0 .
Assume v ( v ) = ( v 1 x ) y with x , y X and v X + . Then, in T r i X | T c , we obtain
v ( v ) v 1 = ( [ v ] ( | v | ) x ) y v 1 = ( v 1 x ) y v 1 = y ( v 1 x ) v 1 = x ( y v 1 ) v 1 = 0 .
It follows that [ v ] V v 1 I d ( T c ) .
Case 2. If 1 V , then, by Lemma 1, we may assume [ v ] V = ( [ v 0 ] V 0 [ z a ] 1 ) δ [ v 1 ] V 1 with z X , a X + , v 0 , v 1 X * and δ { , } . Then, in T r i X | T c , we have
[ v ] V v 1 = [ v 0 ] V 0 ( [ z a ] 1 δ [ v 1 ] V 1 ) v 1 = [ v 0 ] V 0 ( [ v 1 ] V 1 δ [ z a ] 1 ) v 1 = ( [ v 0 ] V 0 [ v 1 ] V 1 ) δ ( z [ a ] 1 ) v 1 = ( ( [ v 0 ] V 0 [ v 1 ] V 1 ) δ z ) [ a ] 1 v 1 = [ a v 0 v 1 z ] 1 v 1 = 0 .
It follows that [ v ] V v 1 I d ( T c ) .
Now, we show T c I d ( S c ) . Clearly, we have
x y y x I d ( S c ) , x y y x I d ( S c ) , x y y x I d ( S c ) ,
where x , y X . Suppose that [ u ] U , [ v ] V [ X + ] P ( N ) with ( u v ) > 2 . Then, in T r i X | S c , we have
[ u ] U [ v ] V [ v ] V [ u ] U = [ u v ] ( u ) + V [ v u ] ( v ) + U = u v 1 v u 1 = 0 , U [ v ] V [ v ] V [ u ] U = [ u v ] U [ v u ] V = u v 1 v u 1 = 0 ,
and [ u ] U [ v ] V [ v ] V [ u ] U = [ u v ] U ( ( u ) + V ) [ v u ] V ( ( v ) + U )
= u v { 1 , 2 , . . . , ( u v ) } v u { 1 , 2 , . . . , ( u v ) } = 0 , if | U | = ( u ) and | V | = ( v ) , u v 1 v u 1 = 0 , otherwise .
This shows that I d ( T c ) = I d ( S c ) and (i) holds.
(ii) It is easy to check that all possible left (right) multiplication compositions in S c are equal to zero. For an arbitrary composition ( f , g ) [ w ] W in S c , we have r f , r g [ X + ] P ( N ) , ( w ) 3 , [ w ] W = [ a f b ] W ¯ = [ c g d ] W ¯ and w = a r f ˜ b = c r g ˜ d , where f = f ¯ + r f , g = g ¯ + r g , a , b , c , d X * . Assume that [ a f b ] W = [ a f ˜ b ] W [ a r f ˜ b ] W 1 and [ c g d ] W = [ c g ˜ d ] W [ c r g ˜ d ] W 2 . Then, we deduce | W | = ( w ) if and only if | W 1 | = ( w ) = | W 2 | . It follows that
( f , g ) [ w ] W = [ a f b ] W [ c g d ] W = [ a r f ˜ b ] W 1 + [ c r g ˜ d ] W 2
a r f ˜ b 1 + c r g ˜ d 1 0 mod ( S c ) if | W | < ( w ) , a r f ˜ b { 1 , . . . , ( w ) } + c r g ˜ d { 1 , . . . , ( w ) } 0 mod ( S c ) if | W | = ( w ) .
Then, all the compositions in S c are trivial. Thus, S c is a Gröbner–Shirshov basis in T r i X .
(iii) The claim follows immediately from Theorem 1. □
From Theorem 1, Lemma 10 and Proposition 2, it follows that
Corollary 3.
Let X = { x i i I } be a well-ordered set and S c T r i X be a set consisting of the following polynomials:
[ x j x k ] 2 [ x k x j ] 2 , [ x j x k ] 1 [ x k x j ] 1 , [ x j x k ] { 1 , 2 } [ x k x j ] { 1 , 2 } ( j , k I , j > k ) ; [ x j x k x l ] 2 [ x j x k x l ] 1 , [ x j x k x l ] 3 [ x j x k x l ] 1 , [ x j x k x l ] { 1 , 2 } [ x j x k x l ] 1 , [ x j x k x l ] { 1 , 3 } [ x j x k x l ] 1 , [ x j x k x l ] { 2 , 3 } [ x j x k x l ] 1 ( j , k , l I , j k l ) .
Then, S c is the reduced Gröbner–Shirshov basis for the free commutative trialgebra T r i [ X ] .
Now, by using Theorem 5 and Proposition 2, we have the following corollary.
Corollary 4
([2]). Let T r i s g p [ X ] : = ( X + c , , , ) , where X + c is defined as in Proposition 2. Then, T r i s g p [ X ] is the free commutative trisemigroup generated by X, where the operations ⊢, ⊣ and ⊥ are as follows: for any x , x X , u U , v V X + c with ( u ) ( v ) > 1 ,
v V u U = u U v V = u U v V = v V u U = u v 1 ; v V u U = u U v V = u v { 1 , 2 , . . . , ( u v ) } i f | U | = ( u ) a n d | V | = ( v ) ; v V u U = u U v V = u v 1 i f | U | < ( u ) o r | V | < ( v ) ; x x = x x = x x 1 , x x = x x = x x 2 , x x = x x = x x { 1 , 2 } .
By Lemma 11 and Proposition 2, we can easily obtain the Gelfand–Kirillov dimension of T r i [ X ] for every finite set X.
Corollary 5.
Let X = { x 1 , , x r } and T r i [ X ] be the free commutative trialgebra generated by X. Then, we have GKdim ( T r i [ X ] ) = r .

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) ( T , , , ) is abelian if c d = d c and c d = d c for all c , d T .
Let X be an arbitrary set and T a b the subset of [ X + ] P ( N ) × [ X + ] P ( N ) consisting of the following:
( [ v ] V [ w ] W , [ w ] W [ v ] V ) , ( [ v ] V [ w ] W , [ w ] W [ v ] V ) ,
where [ v ] V , [ w ] W [ X + ] P ( N ) . Let T a b be the set consisting of elements of the form
[ v ] V [ w ] W [ w ] W [ v ] V , [ v ] V [ w ] W [ w ] W [ v ] V ,
where [ v ] V , [ w ] W [ X + ] P ( N ) . Then, T r i s g p X | T a b is clearly the free abelian trisemigroup generated by X, and T r i X | T a b is the free abelian trialgebra generated by X. By Theorem 5, a linear basis of T r i X | T a b consisting of normal triwords is a set of normal forms of elements of T r i s g p X | T a b .
Now, we shall try to construct a linear basis of T r i X | T a b by the method of Gröbner–Shirshov bases. We introduce a method of writing down a new normal triword from a given one. Let X = { x i i I } be a well-ordered set, and let X ˙ = { x ˙ x X } be a copy of X, where by x ˙ we mean a new symbol. We extend the ordering on X to a well-ordering on X X ˙ in the following way: (i) x ˙ i < x i , (ii) x i < x j implies x ˙ i < x ˙ j , x ˙ i < x j , x i < x ˙ j .
We note that [ X + ] P ( N ) has a one-to-one correspondence with ( X X ˙ ) + , and we denote this correspondence by φ . More precisely, φ maps an arbitrary normal triword [ x i 1 x i m ] U to a word in y 1 y m in ( X X ˙ ) + , such that, if i t U , then y t = x ˙ i t , and if i t U , then, y t = x i t for every t m . For instance, φ ( [ x 1 x 2 x 2 x 1 x 3 ] { 2 , 4 } ) = x 1 x ˙ 2 x 2 x ˙ 1 x 3 . Thus, we can identity elements in [ X + ] P ( N ) with those in ( X X ˙ ) + .
Recall that, for every y 1 y 2 y t ( X X ˙ ) + , where each y i lies in X X ˙ , we have
y 1 y 2 y t = y i 1 y i 2 y i t ,
where y i 1 , y i 2 , , y i t is a reordering of y 1 , y 2 , , y t satisfying y i 1 y i 2 y i t . Define
π : ( X X ˙ ) + ( X X ˙ ) + , y j 1 y j 2 y j t y j 1 y j 2 y j t .
Finally, define
τ : = φ 1 π φ : [ X + ] P ( N ) [ X + ] P ( N ) .
For instance,
τ ( [ x 1 x 2 x 2 x 1 x 3 ] { 2 , 4 } ) = φ 1 π φ ( [ x 1 x 2 x 2 x 1 x 3 ] { 2 , 4 } ) = φ 1 π ( x 1 x ˙ 2 x 2 x ˙ 1 x 3 ) = φ 1 ( x ˙ 1 x 1 x ˙ 2 x 2 x 3 ) = [ x 1 x 1 x 2 x 2 x 3 ] { 1 , 3 } .
Roughly speaking, τ reorders the letters in [ u ] U 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 [ u ] U , [ v ] V [ X + ] P ( N ) , we have τ ( [ u v ] U ( ( u ) + V ) ) = τ ( [ v u ] V ( ( v ) + U ) ) , τ ( [ u v ] ( u ) + V ) = τ ( [ v u ] V ) and τ ( τ ( [ u ] U ) ) = τ ( [ u ] U ) .
Proposition 3.
Let X = { x i i I } be a well-ordered set, T a b the subset of T r i X consisting of the elements described in (7). Then, we have
(i) 
T r i X | T a b = T r i X | S a b , where S a b = { [ u ] U τ ( [ u ] U ) [ u ] U [ X + ] P ( N ) , ( u ) 2 } ;
(ii) 
S a b is a Gröbner–Shirshov basis in T r i X ;
(iii) 
The set { τ ( [ u ] U ) [ u ] U [ X + ] P ( N ) } is a k -basis of the free abelian trialgebra T r i X | T a b .
Proof. 
(i) It suffices to show T a b I d ( S a b ) and S a b I d ( T a b ) . We first show T a b I d ( S a b ) . In T r i X | S a b , for all [ u ] U , [ v ] V [ X + ] P ( N ) , clearly we have
[ u ] U [ v ] V [ v ] V [ u ] U = [ u v ] ( u ) + V [ v u ] V = τ ( [ u v ] ( u ) + V ) τ ( [ v u ] V ) , = 0 , U [ v ] V [ v ] V [ u ] U = [ u v ] U ( ( u ) + V ) [ v u ] V ( ( v ) + U ) = τ ( [ u v ] U ( ( u ) + V ) ) τ ( [ v u ] V ( ( v ) + U ) ) = 0 .
Now, we show S a b I d ( T a b ) . Note that, for an arbitrary normal triword, say [ u ] U = [ x i 1 x i n ] U for some letters x i 1 , , x i n X such that n 2 , the normal triword τ ( [ u ] U ) contains the same letters (with repetitions) as those of [ u ] m ; moreover, the middle entries are preserved. Thus, it suffices to show that we can reorder x i t and x i t + 1 with middle entries preserved. By Lemma 1, we may assume
[ u ] U = ( [ v ] V δ 1 ( x i t δ 2 x i t + 1 ) ) δ 3 [ w ] W ,
where, if [ v ] V = [ ε ] , then δ 1 { , } , and, if [ w ] W = [ ε ] , then δ 3 { , } . Then, by the relations in T a b , we clearly can reorder x i t and x i t + 1 with middle entries preserved. It follows that S a b I d ( T a b ) .
(ii) Clearly all possible left and right multiplication compositions in S a b are equal to zero. Assume for every composition ( f , g ) [ w ] W in S a b , where f = [ u ] U τ ( [ u ] U ) and g = [ v ] V τ ( [ v ] V ) . We may assume [ a f b ] W = ( [ a ] A δ 1 f ) δ 2 [ b ] B , [ c g d ] W = ( [ c ] C δ 3 g ) δ 4 [ d ] D . Then, we have
[ a f b ] W ¯ = [ c g d ] W ¯ = ( [ a ] A δ 1 [ u ] U ) δ 2 [ b ] B = ( [ c ] C δ 3 [ v ] V ) δ 4 [ d ] D .
It follows that
τ ( ( [ a ] A δ 1 τ ( [ u ] U ) ) δ 2 [ b ] B ) = τ ( ( [ c ] C δ 3 τ ( [ v ] V ) ) δ 4 [ d ] D ) .
Thus, we obtain
( f , g ) [ w ] W = [ a f b ] W [ c g d ] W = ( [ a ] A δ 1 τ ( [ u ] U ) ) δ 2 [ b ] B ( [ c ] C δ 3 τ ( [ v ] V ) ) δ 4 [ d ] D τ ( ( [ a ] A δ 1 τ ( [ u ] U ) ) δ 2 [ b ] B ) τ ( ( [ c ] C δ 3 τ ( [ v ] V ) ) δ 4 [ d ] D ) 0 mod ( S a b ) .
Thus, all the compositions in S a b are trivial, and thus S a b is a Gröbner–Shirshov basis in T r i X .
(iii) By Theorem 1, we get the result. □
From Theorem 1, Lemma 10, and Proposition 3, it follows that
Corollary 6.
Let X = { x i i I } be a well-ordered set and W a b T r i X be a set consisting of the following polynomials:
[ x i x j ] 2 [ x j x i ] 1 , [ x i x j ] 1 [ x j x i ] 2 , [ x i x i ] 2 [ x i x i ] 1 , [ x i x j ] { 1 , 2 } [ x j x i ] { 1 , 2 } , ( i , j I , i > j ) .
Then, W a b is the reduced Gröbner–Shirshov basis for the free abelian trialgebra T r i X | T a b .
From Lemma 11 and Proposition 3, it follows that
Corollary 7.
Let X = { x 1 , , x r } and let T r i X | T a b be the free abelian trialgebra generated by X. Then, we have
GKdim ( T r i X | T a b ) = 2 r .
Proof. 
Let X ˙ = { x ˙ x X } be a copy of X, and let k [ X X ˙ ] be the commutative ploynomial algebra generated by X X ˙ . It is obvious that k [ X X ˙ ] is isomorphism to T r i X | T a b as a vector space. Thus, we obtain
GKdim ( T r i X | T a b ) = GKdim ( k [ X X ˙ ] ) = 2 r .
The proof is completed. □

Author Contributions

Supervision, Y.C.; writing—original draft preparation, J.H.; writing—review and editing, J.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Natural Science Foundation of China grant number 12071156.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors are grateful to Yuxiu Bai for useful discussions and comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Loday, J.-L.; Ronco, M.O. Trialgebras and families of polytopes. Comtemp. Math. 2004, 346, 369–398. [Google Scholar]
  2. Zhuchok, A.V. Free commutative trioids. Semigroup Forum 2019, 98, 355–368. [Google Scholar] [CrossRef]
  3. Zhuchok, A.V. Trioids. Asian Eur. J. Math. 2015, 8, 1550089-1–1550089-23. [Google Scholar] [CrossRef]
  4. Zhuchok, Y.V. Free n-nilpotent trioids. Mat. Stud. 2015, 43, 3–11. [Google Scholar] [CrossRef]
  5. Zhuchok, Y.V. Free retangular tribands. Bul. Acad. Stiinte Repub. Mold. Mat. 2015, 78, 61–73. [Google Scholar]
  6. Casas, J.M. Trialgebras and Leibniz 3-algebras. Bol. Soc. Mat. Mex. 2006, 12, 165–178. [Google Scholar]
  7. Ebrahimi-Fard, K.J. Loday-type algebras and the Rota–Baxter relation. Lett. Math. Phys. 2002, 61, 139–147. [Google Scholar] [CrossRef] [Green Version]
  8. Loday, J.-L.; Frabetti, A.; Chapoton, F.; Goichot, F. Dialgebras and Related Operads, Lecture Notes in Math; Springer: Berlin, Germany, 2001; Volume 1763. [Google Scholar]
  9. Kolesnikov, P.S. Varieties of dialgebras and conformal algebras. Sib. Mat. Zhurnal 2008, 49, 322–339. [Google Scholar] [CrossRef] [Green Version]
  10. Zhuchok, A.V. Structure of relatively free dimonoids. Comm. Algebra 2017, 45, 1639–1656. [Google Scholar] [CrossRef]
  11. Zhuchok, Y.V. Free abelian dimonoids. Algebra Discrete Math. 2015, 20, 330–342. [Google Scholar]
  12. Bokut, L.A.; Chen, Y.; Liu, C. Gröbner-Shirshov bases for dialgebras. Int. J. Algebra Comput. 2010, 20, 391–415. [Google Scholar] [CrossRef] [Green Version]
  13. Chen, Y.; Zhang, G. A new Composition-Diamond lemma for dialgebras. Algebra Colloq. 2017, 24, 323–350. [Google Scholar]
  14. Buchberger, B. An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, Translated from the 1965 German original by Michael P. Abramson. J. Symbolic Comput. 2006, 41, 475–511. [Google Scholar] [CrossRef] [Green Version]
  15. Shirshov, A.I. Some algorithmic problems for Lie algebras. Sib. Mat. Zhurnal 1962, 3, 292–296. [Google Scholar]
  16. Shirshov, A.I. Selected Works of A. I. Shirshov; Bokut, L.A., Latyshev, V., Shestakov, I., Zelmanov, E., Eds.; Birkhäuser Verlag: Basel, Switzerland, 2009. [Google Scholar]
  17. Shirshov, A.I. Some algorithmic problems for ε-algebras. Sib. Mat. Zhurnal 1962, 3, 132–137. [Google Scholar]
  18. Bokut, L.A.; Kukin, G.P. Algorithmic and Combinatorial Algebra; Mathematics and its Applications; Kluwer Academic Publishers Group: Dordrecht, The Netherlands, 1994; Volume 255. [Google Scholar]
  19. Buchberger, B.; Collins, G.; Loos, R.; Albrecht, R. Computer Algebra, Symbolic and Algebraic Computation; Computing Supplementum; Springer: New York, NY, USA, 1982; Volume 4. [Google Scholar]
  20. Buchberger, B.; Winkler, F. Gröbner Bases and Applications; London Mathematical Society Lecture Note Series; Cambridge University Press: Cambridge, UK, 1998; Volume 251. [Google Scholar]
  21. Cox, D.A.; Little, J.; O’Shea, D. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 4th ed.; Undergraduate Texts in Mathematics; Springer: Cham, Switzerland, 2015. [Google Scholar]
  22. Eisenbud, D. Commutative Algebra: With a View toward Algebraic Geometry; Graduate Texts in Mathematics; Springer: New York, NY, USA, 1995; Volume 150. [Google Scholar]
  23. Bokut, L.A.; Chen, Y. Gröbner-Shirshov bases: Some new results. In Advance in Algebra and Combinatorics; Shum, K.P., Zelmanov, E., Zhang, J., Li, S., Eds.; World Scientific: Singapore, 2008; pp. 35–56. [Google Scholar]
  24. Bokut, L.A.; Chen, Y. Gröbner–Shirshov bases and their calculation. Bull. Math. Sci. 2014, 4, 325–395. [Google Scholar] [CrossRef] [Green Version]
  25. Bokut, L.A.; Fong, Y.; Ke, V.F.; Kolesnikov, P.S. Gröbner and Gröbner-Shirshov bases in algebra, and conformal algebras. Fundam. Prikl. Mat. 2000, 6, 669–706. [Google Scholar]
  26. Bokut, L.A.; Kolesnikov, P.S. Gröbner-Shirshov bases: From inception to the present time. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 2000, 345, 26–67. [Google Scholar]
  27. Bokut, L.A.; Kolesnikov, P.S. Gröbner-Shirshov bases, conformal algebras. and pseudo-algebras. J. Math. Sci. 2005, 131, 5962–6003. [Google Scholar] [CrossRef]
  28. Newman, M.H.A. On theories with a combinatorial definition of “equivalence”. Ann. Math. 1942, 43, 223–243. [Google Scholar] [CrossRef]
  29. Bergman, G.M. The diamond lemma for ring theory. Adv. Math. 1978, 29, 178–218. [Google Scholar] [CrossRef] [Green Version]
  30. Biyogmam, G.R.; Tcheka, C. From Trigroups to Leibniz 3-algebras. arXiv 2019, arXiv:1904.12030v1. [Google Scholar]
  31. Krause, G.; Lenagan, T. Growth of Algebras and Gelfand–Kirillov Dimension; Graduate Studies in Mathematics; AMS: Providence, RI, USA, 2000; Volume 22. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Huang, J.; Chen, Y. Gröbner–Shirshov Bases Theory for Trialgebras. Mathematics 2021, 9, 1207. https://doi.org/10.3390/math9111207

AMA Style

Huang J, Chen Y. Gröbner–Shirshov Bases Theory for Trialgebras. Mathematics. 2021; 9(11):1207. https://doi.org/10.3390/math9111207

Chicago/Turabian Style

Huang, Juwei, and Yuqun Chen. 2021. "Gröbner–Shirshov Bases Theory for Trialgebras" Mathematics 9, no. 11: 1207. https://doi.org/10.3390/math9111207

APA Style

Huang, J., & Chen, Y. (2021). Gröbner–Shirshov Bases Theory for Trialgebras. Mathematics, 9(11), 1207. https://doi.org/10.3390/math9111207

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop