Gr\"obner-Shirshov bases and linear bases for free multi-operated algebras over algebras with applications to differential Rota-Baxter algebras and integro-differential algebras | Tomesphere
arXiv:2302.14221·math.RA·March 29, 2023
Gr\"obner-Shirshov bases and linear bases for free multi-operated algebras over algebras with applications to differential Rota-Baxter algebras and integro-differential algebras
This paper develops a comprehensive theory of Gr"obner-Shirshov bases for free multi-operated algebras, providing explicit linear bases and applications to differential Rota-Baxter and integro-differential algebras.
Contribution
It extends the theory of Gr"obner-Shirshov bases to multiple operators, offering new monomial orders and linear bases for complex operated algebras.
Findings
01
Established Gr"obner-Shirshov bases for free differential Rota-Baxter algebras
02
Constructed linear bases for free integro-differential algebras
03
Introduced new monomial orders for multi-operator cases
Abstract
Quite much recent studies has been attracted to the operated algebra since it unifies various notions such as the differential algebra and the Rota-Baxter algebra. An Ω-operated algebra is a an (associative) algebra equipped with a set Ω of linear operators which might satisfy certain operator identities such as the Leibniz rule. A free Ω-operated algebra B can be generated on an algebra A similar to a free algebra generated on a set. If A has a Gr\"{o}bner-Shirshov basis G and if the linear operators Ω satisfy a set Φ of operator identities, it is natural to ask when the union G∪Φ is a Gr\"{o}bner-Shirshov basis of B. A previous work answers this question affirmatively under a mild condition, and thereby obtains a canonical linear basis of B. In this paper, we answer this question in the general case of multiple linear operators.…
u\leq_{\operatorname{PD}}v\Leftrightarrow\left\{\begin{array}[]{lcl}u\leq_{\mathrm{D}}v,\text{or }\\
u=_{\mathrm{D}}v\text{ and }u\leq_{\mathrm{P}}v,\text{or }\\
u=_{\mathrm{D}}v,u=_{\mathrm{P}}v\text{ and }u\leq_{\mathrm{dZ}}v,\text{or }\\
u=_{\mathrm{D}}v,u=_{\mathrm{P}}v,u=_{\mathrm{dZ}}v\text{ and }u\leq_{\mathrm{GD}}v,\text{or }\\
u=_{\mathrm{D}}v,u=_{\mathrm{P}}v,u=_{\mathrm{dZ}}v,u=_{\mathrm{GD}}v\text{ and }u\leq_{\mathrm{GP}}v,\text{or }\\
u=_{\mathrm{D}}v,u=_{\mathrm{P}}v,u=_{\mathrm{dZ}}v,u=_{\mathrm{GD}}v,u=_{\mathrm{GP}}v\text{ and }u\leq_{\mathrm{Dlex}}v.\end{array}\right.
u\leq_{\operatorname{PD}}v\Leftrightarrow\left\{\begin{array}[]{lcl}u\leq_{\mathrm{D}}v,\text{or }\\
u=_{\mathrm{D}}v\text{ and }u\leq_{\mathrm{P}}v,\text{or }\\
u=_{\mathrm{D}}v,u=_{\mathrm{P}}v\text{ and }u\leq_{\mathrm{dZ}}v,\text{or }\\
u=_{\mathrm{D}}v,u=_{\mathrm{P}}v,u=_{\mathrm{dZ}}v\text{ and }u\leq_{\mathrm{GD}}v,\text{or }\\
u=_{\mathrm{D}}v,u=_{\mathrm{P}}v,u=_{\mathrm{dZ}}v,u=_{\mathrm{GD}}v\text{ and }u\leq_{\mathrm{GP}}v,\text{or }\\
u=_{\mathrm{D}}v,u=_{\mathrm{P}}v,u=_{\mathrm{dZ}}v,u=_{\mathrm{GD}}v,u=_{\mathrm{GP}}v\text{ and }u\leq_{\mathrm{Dlex}}v.\end{array}\right.
u\leq_{\alpha_{1},\dots,\alpha_{k}}v\Leftrightarrow\left\{\begin{array}[]{l}u<_{\alpha_{1}}v,\text{ or }\\
u=_{\alpha_{1}}v\text{ and }u\leq_{\alpha_{2},\dots,\alpha_{k}}v.\end{array}\right.
u\leq_{\alpha_{1},\dots,\alpha_{k}}v\Leftrightarrow\left\{\begin{array}[]{l}u<_{\alpha_{1}}v,\text{ or }\\
u=_{\alpha_{1}}v\text{ and }u\leq_{\alpha_{2},\dots,\alpha_{k}}v.\end{array}\right.
(x_{1},\cdots,x_{k})\leq_{\text{clex}}(y_{1},\cdots,y_{k})\Leftrightarrow\left\{\begin{array}[]{l}x_{1}<_{\alpha_{1}}y_{1},\text{or }\\
x_{1}=_{Z_{1}}y_{1}\text{ and }\left(x_{2},\cdots,x_{k}\right)\leq_{\rm{clex}}\left(y_{2},\cdots,y_{k}\right),\end{array}\right.
(x_{1},\cdots,x_{k})\leq_{\text{clex}}(y_{1},\cdots,y_{k})\Leftrightarrow\left\{\begin{array}[]{l}x_{1}<_{\alpha_{1}}y_{1},\text{or }\\
x_{1}=_{Z_{1}}y_{1}\text{ and }\left(x_{2},\cdots,x_{k}\right)\leq_{\rm{clex}}\left(y_{2},\cdots,y_{k}\right),\end{array}\right.
v1≥PDv2≥PDv3≥PD⋯∈SΩ(Z)
v1≥PDv2≥PDv3≥PD⋯∈SΩ(Z)
degD(vN)=degD(vN+1)=degD(vN+2)=⋯=:k,
degD(vN)=degD(vN+1)=degD(vN+2)=⋯=:k,
degP(vN)=degP(vN+1)=degP(vN+2)=⋯=:p,
degP(vN)=degP(vN+1)=degP(vN+2)=⋯=:p,
degZ(vN)=degZ(vN+1)=degZ(vN+2)=⋯
degZ(vN)=degZ(vN+1)=degZ(vN+2)=⋯
degGD(vN)=degGD(vN+1)=degGD(vN+2)=⋯,
degGD(vN)=degGD(vN+1)=degGD(vN+2)=⋯,
degGP(vN)=degGP(vN+1)=degGP(vN+2)=⋯.
degGP(vN)=degGP(vN+1)=degGP(vN+2)=⋯.
u\leq_{\alpha}v\Rightarrow\lfloor u\rfloor_{D}\leq_{\alpha}\lfloor v\rfloor_{D}\text{ and }\lfloor u\rfloor_{P}\leq_{\alpha}\lfloor v\rfloor_{P},\text{ (resp. }wu\leq_{\alpha}wv,~{}uw\leq_{\alpha}vw,\ \text{ for all }w\in{\mathfrak{S}_{\Omega}}(Z))\
u\leq_{\alpha}v\Rightarrow\lfloor u\rfloor_{D}\leq_{\alpha}\lfloor v\rfloor_{D}\text{ and }\lfloor u\rfloor_{P}\leq_{\alpha}\lfloor v\rfloor_{P},\text{ (resp. }wu\leq_{\alpha}wv,~{}uw\leq_{\alpha}vw,\ \text{ for all }w\in{\mathfrak{S}_{\Omega}}(Z))\
f=i∑ciqi∣si with qi∣sˉi<p, where ci∈k,qi∈SΩ⋆(Z)(resp.MΩ⋆(Z))andsi∈G.
f=i∑ciqi∣si with qi∣sˉi<p, where ci∈k,qi∈SΩ⋆(Z)(resp.MΩ⋆(Z))andsi∈G.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Polynomial and algebraic computation · Algebraic structures and combinatorial models
Full text
Gröbner-Shirshov bases and linear bases for free multi-operated algebras over algebras with applications to differential Rota-Baxter algebras and integro-differential algebras
Zuan Liu, Zihao Qi, Yufei Qin and Guodong Zhou
Zuan Liu, Yufei Qin and Guodong Zhou, School of Mathematical Sciences, Shanghai Key Laboratory of PMMP,
East China Normal University,
Shanghai 200241,
China
Quite much recent studies has been attracted to the operated algebra since it unifies various notions such as the differential algebra and the Rota-Baxter algebra. An Ω-operated algebra is a an (associative) algebra equipped with a set Ω of linear operators which might satisfy certain operator identities such as the Leibniz rule. A free Ω-operated algebra B can be generated on an algebra A similar to a free algebra generated on a set. If A has a Gröbner-Shirshov basis G and if the linear operators Ω satisfy a set Φ of operator identities, it is natural to ask when the union G∪Φ is a Gröbner-Shirshov basis of B. A previous work answers this question affirmatively under a mild condition, and thereby obtains a canonical linear basis of B.
In this paper, we answer this question in the general case of multiple linear operators. As applications we get operated Gröbner-Shirshov bases for free differential Rota-Baxter algebras and free integro-differential algebras over algebras as well as their linear bases. One of the key technical difficulties is to introduce new monomial orders for the case of two operators, which might be of independent interest.
This paper extends the results of [17] to algebras endowed with several operators, with applications to differential Rota-Baxter algebras and integro-differential algebras.
0.1. Operated GS basis theory: from a single operator to multiple operators
Since its introduction by Shirshov [20] and Buchberger [4] in the sixties of last century, Gröbner-Shirshov (=GS) basis theory has become one of the main tools of computational algebra; see for instance [10, 1, 3]. In order to deal with algebras endowed with operators, Guo and his coauthors introduced a GS basis theory in a series of papers [11, 23, 15, 6] (see also [2])
with the goal to attack Rota’s program [19] to classify “interesting” operators on algebras.
Guo et al. considered operators satisfying some polynomial identities, hence called operated polynomial identities (aka. OPIs) [11, 23, 15, 6]. Via GS basis theory and the somewhat equivalent theory: rewriting systems, they could define when OPIs are GS. They are mainly interested into two classes of OPIs: differential type OPIs and Rota-Baxter type OPIs, which are carefully studied in [15, 23, 6].
For the state of art, we refer the reader to the survey paper [8] and for recent development, see [22, 12, 17, 21].
In these papers [11, 23, 15, 6], the operated GS theory and hence Rota’s classification program have been carried out only for algebras endowed with a single operator.
It would be very interesting to carry out further Rota’s program for the general case of multiple linear operators.
The paper [2] contains a first step of this program by developing the GS basis theory in this generalised setup. We will review and update the GS basis theory in the multi-operated setup in Section 2.
Another direction is to generalise from operated algebras over a base field to operated algebras over a base ring. While previous papers [17, 18] considered this aspect for single operator case, this paper is aimed to deal with this aspect for multiple linear operator case. In particular, some new monomial orders for the two operator case will be constructed which enable us to study operated GS bases for free operated algebras generated by algebras, while it seems that the monomial orders appeared in previous papers can be applied directly when the base ring is not a field any more.
0.2. Free operated algebras over algebras
Recently, there is a need to develop free operated algebras satisfying some OPIs over a fixed algebras and construct GS bases and linear bases for these free algebras as long as a GS basis is known for the given algebra. Ebrahimi-Fard and Guo [5] used rooted trees and forests to give explicit constructions of free noncommutative
Rota-Baxter algebras on modules and sets; Lei and Guo [16] constructed the linear basis of free Nijenhuis algebras over associative algebras;
Guo and Li [12] gave a linear basis of the free differential algebra over associative algebras by introducing the notion of differential GS bases.
In a previous paper [17], the authors considered a question which can be roughly stated as follows:
Question 0.1**.**
Given a (unital or nonunital) algebra A with a GS basis G and a set Φ of OPIs,
assume that these OPIs Φ are GS in the sense of [2, 15, 23, 6]. Let B
be the free operated algebra satisfying Φ over A. When will Φ∪G be a GS basis for B?
They answer this question in the affirmative under a mild condition in [17, Theorem 5.9]. When this condition is satisfied, Φ∪G is a GS basis for B and as a consequence, we also get a linear basis of B. This result has been applied to all Rota-Baxter type OPIs, a class of differential type OPIs, averaging OPIs and Reynolds OPI in [17].
It was also applied to
differential type OPIs by introducing
some new monomial orders [18].
In this paper, we consider a similar question for multi-operated algebras.
Let Ω be a nonempty set which will be the index set of operators. Algebras endowed with operators indexed by Ω will be called Ω-algebras. OPIs can be extended to the multi-operated setup and one can introduce the notion of Ω-GS for OPIs.
Question 0.2**.**
Let Φ be a set of OPIs of a set of operators indexed by Ω. Let A be a (unital) algebra together with a GS basis G. Assume that these OPIs Φ are GS in the sense of Section 2. Let B
be the free Ω-algebra over A such that the operators satisfy Φ. When will Φ∪G be an Ω-GS basis for B?
We extend the main result of [17] to multi-operated cases; see Theorem 2.12 for unital algebras and Theorem 2.13 for nonunital algebras.
0.3. Differential Rota-Baxter algebras and integro-differential algebras
The main motivation of this paper comes, in fact, from differential Rota-Baxter algebras and integro-differential algebras.
Differential Rota-Baxter algebras were introduced by Guo and Keigher [13] which reflect the relation between the differential operator and the integral
operator as in the First Fundamental Theorem of Calculus. Free differential Rota-Baxter algebras were constructed by using various tools including angularly decorated rooted forests and GS basis theory [13, 2].
Integro-differential algebras (of zero weight) were defined for the algebraic study of boundary problems
for linear systems of linear ordinary differential equations. Guo, Regensburger and Rosenkranz [14] introduced Integro-differential algebras with weight.
Free objects and their linear bases were constructed by using GS basis theory [14, 9, 7]
The main goal of this paper is to study free differential Rota-Baxter algebras and free integro-differential algebras over algebras from the viewpoint of operated GS basis theory.
In particular, when the base algebra is reduced to k, our results also give GS bases and linear bases for free differential Rota-Baxter algebras and free integro-differential algebras.
However, the original monomial orders used in [2, 14, 9, 7] do not satisfy the hypothesis in Theorems 2.12 and 2.13 for free multi-operated algebras over algebras, and we have to introduce a new monomial order ≤PD (resp. ≤uPD) to overcome the problem; see Section 1.3.
In contrast to the use different monomial orders while dealing with free differential Rota-Baxter algebras and free integro-differential algebras in [2] and [7] respectively, we will demonstrate that our monomial ordering ≤PD can be applied to both types of algebras simultaneously, as we shall see in Sections 3 and 4.
Moreover, since the case of the unital algebras was not discussed in [2], this aspect is addressed in Subsection 3.3 by using our monomial order ≤uPD.
0.4. Outline of the paper
This paper is organized as follows.
The first section contains remainder on free objects in multi-operated setting and on the construction of free Ω-semigroups and related structures,
and introduces some new monomial orders for the case of two operators, which will be the key technical tool of this paper.
In the second section, we recall the theory of GS bases for the multi-operated setting. After introducing OPIs, GS property for OPIs and Ω-GS bases for multi-operated algebras are defined; after giving some facts about free multi-operated Φ-algebras on algebras, answers to Question 0.2 are presented.
In the third section, multi-operated GS bases and linear bases for free differential Rota-Baxter algebras on algebras are studied and the fourth section contains our investigation for free integro-differential algebras on algebras.
Notation: Throughout this paper, k denotes a base field. All the vector spaces and algebras are over k.
1. New monomial orders on free multi-operated semigroups and monoids
In this section, we recall free objects in multi-operated setting and the construction of free Ω-semigroups and related structures, and
define two new monomial orders ≤PD and ≤uPD on free multi-operated semigroups and monoids.
The main results of this paper will highly depend on these new monomial orders.
For a set Z, denote by kZ (resp. S(Z), M(Z)) the free k-vector space (resp. free semigroup, free monoid) generated by Z. Denote the category of sets (resp. semigroups, monoids) by Set (resp. Sem, Mon). Denote the categories of k-algebras and unital k-algebras by Alg and uAlg respectively.
Throughout this section, let Ω be a nonempty set which will be the index set of operators.
1.1. Free objects in the multi-operated setup
Definition 1.1**.**
An operated set with an operator index set Ω or simply an Ω-set is a set S endowed with a family of maps
Pω:S→S indexed by ω∈Ω. The morphisms between Ω-sets can be defined in the obvious way. Denote the category of Ω-sets by Ω-Set.
Similarly, we can define Ω-semigroups and Ω-monoids. Their categories are denoted by Ω-Sem and Ω-Mon respectively.
Ω-vector spaces, nonunital or unital Ω-algebras can be defined in a similar way, except asking, moreover, that all the operators are k-linear maps. Denote the category of Ω-vector spaces, (resp. nonunital Ω-algebras, unital Ω-algebras) by Ω-Vect (resp. Ω-Alg, Ω-uAlg) with obvious morphisms.
As in [17], there exists the following diagram of functors:
[TABLE]
In this diagram, all functors from right to left, from below to above and from southwest to northeast are the obvious forgetful functors. The other functors are free object functors which are left adjoint to the forgetful functors.
Our notations for free object functors are analogous to those in [17]. For instance, FAlgΩ-Alg denotes the free object functor from
the category of algebras to that of nonunital Ω-algebras.
We could give similar constructions of these free object functors as in Sections 1-3 of [17]. However, as we don’t need the details, we will not repeat them. The curious readers could consult [17] and extend the constructions in [17] without essential difficulties.
1.2. Free multi-operated semigroups and monoids
Now we explain the construction of the free Ω-semigroup generated by a set Z.
For ω∈Ω, denote by ⌊Z⌋ω the set of all formal elements ⌊z⌋ω,z∈Z and put
⌊Z⌋Ω=⊔ω∈Ω⌊Z⌋ω. The inclusion into the first component Z↪Z⊔⌊Z⌋Ω induces an injective semigroup homomorphism
[TABLE]
For n≥2, assume that we have constructed SΩ,n−2(Z) and SΩ,n−1(Z)=S(Z⊔⌊SΩ,n−2(Z)⌋Ω) endowed with an injective homomorphism of semigroups
in−2,n−1:SΩ,n−2(Z)↪SΩ,n−1(Z).
We define the semigroup
[TABLE]
and
the natural injection
[TABLE]
induces an injective semigroup homomorphism
[TABLE]
Define SΩ(Z)=limSΩ,n(Z) and the maps sending u∈SΩ,n(Z) to ⌊u⌋ω∈SΩ,n+1(Z) induces a family of operators Pω,ω∈Ω on SΩ(Z).
The construction of the free Ω-monoid MΩ(M) over a set Z is similar, by just replacing S(Z) by M(Z) everywhere in the construction.
Remark 1.2**.**
We will use another construction of MΩ(Z). In fact, add some symbols ⌊1⌋Ω={⌊1⌋ω,ω∈Ω} to Z and form SΩ(Z⊔⌊1⌋Ω), then MΩ(Z) can be obtained from SΩ(Z⊔⌊1⌋Ω) by just adding the empty word 1.
It is easy to see that kSΩ(Z)(resp. kMΩ(Z)) is the free nonunital (resp. unital) Ω-algebra generated by Z.
1.3. Monomial orders
In this subsection, we introduce some new monomial orders on free Ω-semigroups and free Ω-monoids. We
only consider the case of two operators, say Ω={P,D} as the main examples in mind are differential Rota-Baxter algebras and integro-differential algebras following the convention from [7].
We first recall the definitions of well orders and monomial orders.
Definition 1.3**.**
Let Z be a nonempty set.
(a)
A preorder ≤ is a binary relation on Z that is reflexive and transitive, that is, for all x,y,z∈Z, we have
(i)
x≤x; and
(ii)
if x≤y,y≤z, then x≤z.
In the presence of a preoder ≤, we denote x=Zy if x≤y and x≥y; if x≤y but x=y, we write x<y or y>x.
(b)
A pre-linear order ≤ on Z is a preorder ≤ such that either x≤y or x≥y for all x,y∈Z.
(c)
A linear order or a total order ≤ on Z is a pre-linear order ≤ such that ≤ is symmetric, that is, x≤y and y≤x imply x=y.
(d)
A preorder ≤ on Z is said to satisfy the descending chain condition, if for each descending chain x1≥x2≥x3≥⋯, there exists N≥1 such that xN=ZxN+1=Z⋯.
A linear order satisfying the descending chain condition is called a well order.
Before giving the definition of monomial orders, we need to introduce the following notions generalising the case of one operator.
Definition 1.4**.**
Let Z be a set and ⋆ a symbol not in Z.
(a)
Define MΩ⋆(Z) to be the subset of MΩ(Z∪⋆) consisting of elements with ⋆ occurring only once.
(b)
For q∈MΩ⋆(Z) and u∈MΩ(Z), we define q∣u∈MΩ(Z) to be the element obtained by
replacing the symbol ⋆ in q by u. In this case, we say u is a subword of q∣u.
(c)
For q∈MΩ⋆(Z) and s=∑iciui∈kMΩ(Z) with ci∈k and ui∈MΩ(Z), we define
[TABLE]
(d)
Define SΩ⋆(Z) to be the subset of SΩ(Z∪⋆) consisting of elements with ⋆ occurring only once. It is easy to see SΩ⋆(Z) is a subset of MΩ⋆(Z), so we also have notations in (a)-(c) for SΩ⋆(Z) by restriction.
Definition 1.5**.**
Let Z be a set.
(a)
A monomial order on S(Z) is a well-order ≤ on S(Z) such that
[TABLE]
(a’)
a monomial order on M(Z) is a well-order ≤ on M(Z) such that
[TABLE]
(b)
a monomial order on SΩ(Z) is a well-order ≤ on SΩ(Z) such that
[TABLE]
(b’)
a monomial order on MΩ(Z) is a well-order ≤ on MΩ(Z) such that
[TABLE]
Let us recall some known preorders.
Definition 1.6**.**
For two elements u,v∈SΩ(Z),
(a)
define
[TABLE]
where the D-degree degD(u) of u is the number of occurrence of ⌊⌋D in u;
(b)
define
[TABLE]
where the P-degree degP(u) of u is the number of occurrence of ⌊⌋P in u;
(c)
define
[TABLE]
where the Z-degree degZ(u) is the number of elements of Z occurring in u counting the repetitions;
Definition 1.7**.**
Let Z be a set endowed with a well order ≤Z. Introduce the degree-lexicographical order ≤dlex on S(Z) by imposing, for any u=v∈S(Z), u<dlexv if
(a)
either degZ(u)<degZ(v), or
(b)
degZ(u)=degZ(v), and u=muin, v=mvin′ for some m,n,n′∈M(Z) and ui,vi∈Z with ui<Zvi.
It is obvious that the degree-lexicographic order ≤dlex on S(Z) is a well order .
We now define a preorder ≤Dlex on SΩ(Z), by the following recursion process:
(a)
For u,v∈SΩ,0(Z)=S(Z), define
[TABLE]
(b)
Assume that we have constructed a well order ≤Dlexn on SΩ,n(Z) for n≥0 extending all ≤Dlexi for any 0≤i≤n−1. The well order ≤Dlexn on SΩ,n(Z) induces a well order on ⌊SΩ,n(Z)⌋P (resp. ⌊SΩ,n(Z)⌋D), by imposing
⌊u⌋P≤⌊v⌋P (resp. ⌊u⌋D≤⌊v⌋D) whenever u≤Dlexnv∈SΩ,n(Z).
By setting u<v<w for all u∈Z, v∈⌊SΩ,n(Z)⌋D, and w∈⌊SΩ,n(Z)⌋P, we obtain a well order on Z⊔⌊SΩ,n(Z)⌋P⊔⌊SΩ,n(Z)⌋D.
Let ≤Dlexn+1 be the degree lexicographic order on SΩ,n+1(Z)=S(Z⊔⌊SΩ,n(Z)⌋P⊔⌊SΩ,n(Z)⌋D) induced by that on Z⊔⌊SΩ,n(Z)⌋P⊔⌊SΩ,n(Z)⌋D.
Obviously ≤Dlexn+1 extends ≤Dlexn. By a limit process, we get a preorder on SΩ(Z) which will be denoted by
≤Dlex. As is readily seen, ≤Dlex is a linear order.
Remark 1.8**.**
It is easy to see that the above construction of ≤Dlex can be extended to the case of more than two operators.
In fact, for a given well order
≤Ω in the index set Ω,
the defining process of ≤Dlex on SΩ(Z) is the same as above except one detail in step (b), where
we need to put u<v<w for all u∈Z, v∈⌊SΩ,n(Z)⌋ω1 and w∈⌊SΩ,n(Z)⌋ω2 with ω1≤Ωω2∈Ω.
Definition 1.9**.**
For any u∈SΩ(Z), let u1,…,un∈Z be all the elements occurring in u from left to right. If a right half bracket ⌋D locates in the gap between ui and ui+1, where 1≤i<n, the GD-degree of this right half bracket is defined to be n−i; if there is a right half bracket ⌋D appearing on the right of un, we define the GD-degree of this half bracket to be [math]. We define the GD-degree of u, denoted by degGD(u), to be the sum of the GD-degrees of all the half right brackets in u.
For example, the GD-degrees of the half right brackets in u=⌊x⌋D⌊y⌋D with x,y∈Z are respectively 1 and 0 from left to right, so degGD(u)=1 by definition.
For u,v∈SΩ(Z), define the GD-degree order ≤GD by
[TABLE]
Definition 1.10**.**
For any u∈SΩ(Z), let u1,…,un∈Z be all the elements occurring in u from left to right. If there are i elements in Z contained in a bracket ⌊⌋P , the GP-degree of this bracket is defined to be n−i. We denote by degGP(u) the sum of the GP-degree of all the brackets ⌊⌋P in u.
For example, the the GP-degrees of the brackets ⌊⌋P of u=⌊xy⌋P⌊z⌋P with x,y,z∈Z are respectively 1 and 2 from left to right, so degGP(u)=3 by definition.
For u,v∈SΩ(Z), define the GD-degree order ≤GD by
[TABLE]
It is easy to obtain the following lemma whose proof is thus omitted.
Lemma 1.11**.**
The orders ≤D, ≤P, ≤dZ, ≤GD and ≤GP are pre-linear orders satisfying the descending chain condition.
Combining all the orders above, we can now construct an order ≤PD of SΩ(Z):
[TABLE]
To prove that the ≤PD is a well-order, we need some preparation.
Definition 1.12**.**
(a)
Given some preorders ≤α1,…,≤αk on a set Z with k≥2, introduce another preorder
≤α1,…,αk by imposing recursively
[TABLE]
(b)
Let k≥2 and let ≤αi be a pre-linear order on Zi,1≤i≤k. Define the lexicographical product order ≤clex on the cartesian product Z1×Z2×⋯×Zk by defining
[TABLE]
where (x2,⋯,xk)≤clex(y2,⋯,yk) is defined by induction, with the convention that ≤clex is the trivial relation when k=1.
For k≥2, let ≤α1,…,≤αk−1 be pre-linear orders on Z, and ≤αk a linear order on Z. Then ≤α1,…,αk is a linear order on Z.
(b)
Let ≤αi be a well order on Zi, 1≤i≤k. Then the lexicographical product
order ≤clex is a well order on the cartesian product Z1×Z2×⋯×Zk.
Proposition 1.14**.**
The order ≤PD is a well order on SΩ(Z).
Proof.
Since ≤Dlex is a linear order, so is ≤PD by Lemma 1.11 and Lemma 1.13(a).
It suffices to verify that ≤PD satisfies the descending chain condition. Let
[TABLE]
be a descending chain. By Lemma 1.11, there exist N≥1 such that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
Thus all vi with i≥N belong to SΩ,k+p(Z). The restriction of the order ≤Dlex to SΩ,k+p(Z) equals
to the well order ≤Dlexk+p, which by definition satisfies the descending chain condition, so the chain v1≥PDv2≥PDv3≥PD⋯ stabilizes after finite steps.
∎
A well order ≤ is a monomial order on SΩ(Z) if and only if ≤ is bracket compatible, left compatible and right compatible.
Now we can prove the main result of this section which is the main technical point of this paper.
Theorem 1.17**.**
The well order ≤PD is a monomial order on SΩ(Z).
Proof.
Let u≤PDv.
It is obvious that preorders ≤D, ≤P and ≤dZ are bracket compatible, left compatible and right compatible. This solves the three cases u<Dv; u=Dv, u<dgpv; u=Dv, u=dgpv and u<dgxv.
If u=Dv, u=Pv,u=dZv and u<GDv,
obviously ⌊u⌋D<GD⌊v⌋D, ⌊u⌋P<GD⌊v⌋Puw<GDvw and wu<GDwv for w∈SΩ(Z). So ⌊u⌋D<PD⌊v⌋D, ⌊u⌋P<PD⌊v⌋P, uw<PDvw and wu<PDwv.
The case that u=Dv, u=Pv,u=dZv, u=GDv and u<GPv is similar to the above one.
It remains to consider the case that u=Dv, u=Pv,u=dZv, u=GDv, u=GPv and u<Dlexv.
Let n≥degD(u),degP(u). Since u,v∈SΩ,n(Z), thus u≤Dlexnv. By the fact that the restriction of ≤Dlexn+1 to ⌊SΩ,n(Z)⌋D is induced by ≤Dlexn, we have ⌊u⌋D≤Dlexn+1⌊v⌋D, ⌊u⌋D≤Dlex⌊v⌋D, and ⌊u⌋D≤PD⌊v⌋D. Similarly ⌊u⌋P≤PD⌊v⌋P.
Let w∈SΩ,m(Z). One can obtain uw≤Dlexrvw and wu≤Dlexrwv for r=max{m,n}, so uw≤PDvw and wu≤PDwv.
We are done.
∎
Now let’s move to the unital case.
Now we extend ≤PD from SΩ(Z) to MΩ(Z) by using
Remark 1.2.
Definition 1.18**.**
Let Z be a set with a well order. Let †P (resp. †D ) be a symbol which is understood to be ⌊1⌋P (resp. ⌊1⌋D) and write Z′=Z⊔{†P,†D}. Consider the free operated semigroup SΩ(Z′) over the set Z′. The well order on Z extends to a well order ≤ on Z′ by setting †P>z>†D, for any z∈Z. Besides, we impose degP(†P)=1 and degGP(†P)=0.
Then the monomial order ≤PD on SΩ(Z′) induces a well order ≤uPD on MΩ(Z)=SΩ(Z′)⊔{1} (in which ⌊1⌋P and ⌊1⌋D is identified with †P and †D respectively), by setting u>uPD1 for any u∈SΩ(Z′).
Theorem 1.19**.**
The well order ≤uPD is a monomial order on MΩ(Z).
Proof.
Obviously,
the well order ≤uPD is bracket compatible on MΩ(Z)\{1}.
Let x∈MΩ(Z)\{1}. By definition, x>uPD1. We have ⌊x⌋P>Dlex⌊1⌋P which implies ⌊x⌋P>uPD†P.
It is ready to see that ⌊x⌋D>uPDx>uPD†D.
Thus ≤uPD is bracket compatible.
Clearly, ≤uPD is left and right compatible.
∎
We record several important conclusions which will be useful later.
Proposition 1.20**.**
For any u,v∈MΩ(Z)\{1}, we have
(a)
⌊u⌋P⌊1⌋P>uPD⌊u⌊1⌋P⌋P≥uPD⌊⌊u⌋P⌋P,
(b)
⌊1⌋P⌊v⌋P>uPD⌊⌊v⌋P⌋P≥uPD⌊⌊1⌋Pv⌋P,
(c)
⌊1⌋P⌊1⌋P>uPD⌊⌊1⌋P⌋P,
(d)
⌊1⌋P⌊v⌋D>uPD⌊⌊1⌋Pv⌋D,
(e)
⌊u⌋D⌊1⌋P>uPD⌊u⌊1⌋P⌋D.
Proof.
Let u,v∈MΩ(Z)\{1}=SΩ(Z′).
(a)
It is easy to see ⌊⌊u⌋P⌋P have lowest degZ′ among ⌊u⌋P⌊1⌋P,⌊u⌊1⌋P⌋P,⌊⌊u⌋P⌋P, and
we also have degGP(⌊u⌋P⌊1⌋P)>degGP(⌊u⌊1⌋P⌋P).
(b)
It is similar to (a).
(c)
It follows from degZ′(⌊1⌋P⌊1⌋P)>degZ′(⌊⌊1⌋P⌋P).
(d)
It can be deduced from ⌊1⌋P⌊v⌋D>Dlex⌊⌊1⌋Pv⌋D by Definition 1.7.
(e)
It holds because degGD(⌊u⌋D⌊1⌋P)>degGD(⌊u⌊1⌋P⌋D).
∎
2. Operator polynomial identities and multi-operated GS bases
In this section, we extend the theory of operated GS bases due to [2, 15, 23, 6] from the case of single operator to multiple operators case. The presentation is essentially contained in [7].
2.1. Operator polynomial identities
In this subsection, we give some basic notions and facts related to operator polynomial identities.
Throughout this section, X denotes a set.
Definition 2.1**.**
We call an element ϕ(x1,…,xn)∈kSΩ(X) (resp. kMΩ(X)) with n≥1,x1,…,xn∈X an operated polynomial identity (aka OPI).
From now on, we always assume that OPIs are multilinear, that is, they are linear in each xi.
Definition 2.2**.**
Let ϕ(x1,…,xn) be an OPI. A (unital) Ω-algebra A=(A,{Pω}ω∈Ω) is said to satisfy the OPI ϕ(x1,…,xn) if
ϕ(r1,…,rn)=0, for all r1,…,rn∈A.
In this case, (A,{Pω}ω∈Ω) is called a (unital) ϕ-algebra.
Generally, for a family Φ of OPIs, we call a (unital) Ω-algebra (A,{Pω}ω∈Ω) a (unital) Φ-algebra if it is a (unital) ϕ-algebra for any ϕ∈Φ.
Denote the category of Φ-algebras (resp. unital Φ-algebras) by Φ-Alg (resp. Φ-uAlg).
Definition 2.3**.**
An Ω-ideal of an Ω-algebra is an ideal of the associative algebra closed under the action of the operators.
The Ω-ideal generated by a subset S⊆A is denoted by ⟨S⟩Ω-Alg (resp. ⟨S⟩Ω-uAlg).
Obviously the quotient of an Ω-algebra (resp. unital Ω-algebra) by an Ω-ideal is naturally an Ω-algebra (resp. Ω-unital algebra).
From now on, Φ denotes a family of OPIs in kSΩ(X) or kMΩ(X). For a set Z and a subset Y of MΩ(Z), introduce the subset SΦ(Y)⊆kMΩ(Z) to be
[TABLE]
2.2. Multi-operated GS bases for Φ-algebras
In this subsection, operated GS basis theory is extended to algebras with multiple operators following closely [2].
Definition 2.4**.**
Let Z be a set, ≤ a linear order on MΩ(Z) and f∈kMΩ(Z).
(a)
Let f∈/k. The leading monomial of f , denoted by fˉ, is the largest monomial appearing in f. The leading coefficient of f , denoted by cf, is the coefficient of fˉ in f. We call f monic with respect to ≤ if cf=1.
(a’)
Let f∈k (including the case f=0). We define the leading monomial of f to be 1 and the leading coefficient of f to be cf=f.
(b)
A subset S⊆kMΩ(Z) is called monicized with respect to ≤, if each nonzero element of S has leading coefficient 1.
Obviously, each subset S⊆MΩ(Z) can be made monicized if we divide each nonzero element by its leading coefficient.
We need another notation.
Let Z be a set. For u∈MΩ(Z) with u=1, as u can be uniquely written as a product u1⋯un with ui∈Z∪⌊MΩ(Z)⌋Ω for 1≤i≤n, call n the breadth of u, denoted by ∣u∣; for u=1, we define
∣u∣=0.
Definition 2.5**.**
Let ≤ be a monomial order on SΩ(Z) (resp. MΩ(Z)) and f,g∈kSΩ(Z) (resp. kMΩ(Z)) be monic.
(a)
If there are p,u,v∈SΩ(Z) (resp. MΩ(Z)) such that p=fˉu=vgˉ with max{∣fˉ∣,∣gˉ∣}<∣p∣<∣fˉ∣+∣gˉ∣, we call
[TABLE]
the intersection composition of f and g with respect to p.
(b)
If there are p∈SΩ(Z) (resp. MΩ(Z)) and q∈SΩ⋆(Z) (resp. MΩ⋆(Z)) such that p=fˉ=q∣gˉ, we call
[TABLE]
the inclusion composition of f and g with respect to p.
Definition 2.6**.**
Let Z be a set and ≤ a monomial order on SΩ(Z) (resp. MΩ(Z)). Let G⊆kSΩ(Z) (resp. kMΩ(Z)).
(a)
An element f∈kSΩ(Z) (resp. kMΩ(Z)) is called trivial modulo (G,p) for p∈SΩ(Z) (resp. MΩ(Z)) if
[TABLE]
If this is the case, we write
[TABLE]
In general, for any u,v∈SΩ(Z) (resp. MΩ(Z)), u≡vmod(G,p) means that u−v=∑ciqi∣si, with qi∣sˉi<p, where ci∈k,qi∈SΩ⋆(Z) (resp. MΩ⋆(Z)) and si∈G.
(b)
The subset G is called a GS basis in kSΩ(Z) (resp. kMΩ(Z)) with respect to ≤ if, for all pairs f,g∈G monicized with respect to ≤, every intersection composition of the form (f,g)pu,v is trivial modulo (G,p), and every inclusion composition of the form (f,g)pq is trivial modulo (G,p).
To distinguish from usual GS bases for associative algebras, from now on, we shall rename GS bases in multi-operated contexts by Ω-GS bases.
Theorem 2.7**.**
(Composition-Diamond Lemma) Let Z be a set, ≤ a monomial order on MΩ(Z) and G⊆kMΩ(Z). Then the following conditions are equivalent:
(a)
G* is an Ω-GS basis in kMΩ(Z).*
(b)
Denote
[TABLE]
As a k-space, kMΩ(Z)=kIrr(G)⊕⟨G⟩Ω-uAlg and Irr(G) is a k-basis of kMΩ(Z)/⟨G⟩Ω-uAlg.
Theorem 2.8**.**
(Composition-Diamond Lemma) Let Z be a set, ≤ a monomial order on SΩ(Z) and G⊆kSΩ(Z). Then the following conditions are equivalent:
(a)
G* is an Ω-GS basis in kSΩ(Z).*
(b)
Denote
[TABLE]
As a k-space, kSΩ(Z)=kIrr(G)⊕⟨G⟩Ω-Alg and Irr(G) is a k-basis of kSΩ(Z)/⟨G⟩Ω-Alg.
Let Φ⊆kSΩ(X) be a family of OPIs. Let Z be a set and ≤ a monomial
order on SΩ(Z). We call ΦΩ-GS on kSΩ(Z) with respect to ≤ if SΦ(SΩ(Z)) is an Ω-GS basis in kSΩ(Z) with respect to ≤.
(b)
Let Φ⊆kMΩ(X) be a family of OPIs. Let Z be a set and ≤ a monomial
order on MΩ(Z). We call ΦΩ-GS on kMΩ(Z) with respect to ≤ if SΦ(MΩ(Z)) is an Ω-GS basis in kMΩ(Z) with respect to ≤.
2.3. Multi-operated GS basis for free Φ-algebras over algebras
In this subsection, we consider multi-operated GS basis for free Φ-algebras over algebras and generalise the main result of [17] to multi-operated cases.
We will use the following results without proof as they are counterparts in multi-operated setup of [17, Propositions 4.8].
Proposition 2.10**.**
(a)
Let Φ⊂kSΩ(X) and A=kS(Z)/IA an algebra. Then
[TABLE]
is the free Φ-algebra generated by A.
(b)
Let Φ⊂kMΩ(X) and A=kM(Z)/IA a unital algebra. Then
Let A be a (unital) algebra together with a Gröbner-Shirshov basis G. Assume that a set Φ of operated polynomial identities is Ω-GS in the sense of Definition 2.9.
Considering the free (unital) Φ-algebra B over A, when will
the union “Φ∪G” be a Ω-GS basis for B?
It is surprising that the answer of the corresponding question given in
[17] can be generalised to multi-operated case without much modifications.
Theorem 2.12**.**
Let X be a set and Φ⊆kMΩ(X) a system of OPIs. Let A=kM(Z)/IA be a unital algebra with generating set Z.
Assume that Φ is Ω-GS on Z with respect to a monomial order ≤ in MΩ(Z) and that G is a GS basis of IA in kM(Z) with respect to the restriction of ≤ to M(Z).
Suppose that the leading monomial of any OPI ϕ(x1,…,xn)∈Φ has no subword in M(X)\X, and that ϕ(u1,…,un) vanishes or its leading monomial is ϕ(u1,…,un) for all u1,…,un∈MΩ(Z). Then SΦ(MΩ(Z))∪G is an Ω-GS basis of ⟨SΦ(MΩ(Z))∪IA⟩Ω-uAlg in kMΩ(Z) with respect to ≤.
Proof.
The proof of [17, Theorem 5.9] carries verbatim over multi-operated case, because it reveals that the key point is that the leading monomial of any OPI ϕ(x1,…,xn)∈Φ has no subword in M(X)\X.
For details, see the proof of [17, Theorem 5.9].
∎
There exists a nonunital version of the above result, which is also a multi-operated version of [18, Theorem 2.15].
Theorem 2.13**.**
Let X be a set and Φ⊆kSΩ(X) a system of OPIs. Let A=kS(Z)/IA be an algebra with generating set Z.
Assume that Φ is Ω-GS on Z with respect to a monomial order ≤ in SΩ(Z) and that G is a GS basis of IA in kS(Z) with respect to the restriction of ≤ to S(Z).
Suppose that the leading monomial of any OPI ϕ(x1,…,xn)∈Φ has no subword in S(X)\X, and that for all u1,…,un∈SΩ(Z), ϕ(u1,…,un) vanishes or its leading monomial is ϕ(u1,…,un). Then SΦ(SΩ(Z))∪G is an Ω-GS basis of ⟨SΦ(SΩ(Z))∪IA⟩Ω-Alg in kSΩ(Z) with respect to ≤.
3. Free differential Rota-Baxter algebras over algebras
In this section, we apply Theorems 2.12 and 2.13 to differential Rota-Baxter algebras.
From now on, let Ω={D,P}, fix a set X={x,y} with two elements such that variables in OPIs will take values in X.
When talking about algebras or reductions of OPIs, fix a set Z and we understand that variables in OPIs will be replaced by elements of
SΩ(Z) or MΩ(Z).
We first recall the definition of differential Rota-Baxter algebras. We use D() and P() instead of the linear operators ⌊⌋D and ⌊⌋P.
A (unital) differential k-algebra of weight λ (also called a (unital) λ-differential k-algebra) is a (unital) associative k-algebra R together with a linear operator D:R→R such that
[TABLE]
when R has a unity 1, it is asked that D(1)=0.
(b)
A Rota-Baxter k-algebra of weight λ is an associative k-algebra R together with a linear operator P:R→R such that
[TABLE]
(c)
A (unital) differential Rota-Baxter k-algebra of weight λ (also called a (unital) λ-differential Rota-Baxter k-algebra) is a (unital) differential k-algebra (R,D) of weight λ and a Rota-Baxter operator P of weight λ such that
[TABLE]
When we consider free differential Rota-Baxter algebras on algebras, it is disappointing to see that the traditional order (see [2]) would not meet the condition of Theorems 2.12 and 2.13. This is the intention of the new monomial orders ≤PD and ≤uPD introduced in Section 1.3.
3.1. Case of nonunital algebras with λ=0
Assume in this subsection that λ=0. Denote
(1)
ϕ1(x,y)=P(x)P(y)−P(xP(y))−P(P(x)y)−λP(xy),
(2)
ϕ2(x,y)=D(x)D(y)+λ−1D(x)y+λ−1xD(y)−λ−1D(xy),
(3)
ϕ3(x)=D(P(x))−x.
We first consider nonunital free differential Rota-Baxter algebras on algebras.
Proposition 3.2**.**
For any u,v∈SΩ(Z), the leading monomials of ϕ1(u,v), ϕ2(u,v) and ϕ3(u) under ≤PD are respectively
P(u)P(v),D(u)D(v) and D(P(u)).
Proof.
Let u1,⋯,un and v1,⋯,vm be all the elements of Z occurring in u and v from left to right.
For ϕ1(u,v)=P(u)P(v)−P(uP(v))−P(P(u)v)−λP(uv), we have degP(P(uv)) is smaller than those of the other three terms, while the degD,degZ and degGD of the other elements are the same. And one can see
[TABLE]
[TABLE]
so the leading monomial of ϕ1(u,v) is P(u)P(v).
The statements about ϕ2(u,v) and ϕ3(u) are obvious by comparing degD.
∎
Now let
[TABLE]
However, ΦDRB′ is not Ω-GS in kSΩ(Z) with respect to ≤PD.
Example 3.3**.**
For u,v∈SΩ(Z), let
[TABLE]
Then
[TABLE]
Let
[TABLE]
It is clear that the leading monomial of ϕ4(u,v) is P(u)D(v) with respect to ≤PD which cannot be reduced further.
Example 3.4**.**
For u,v∈SΩ(Z), let
[TABLE]
Then
[TABLE]
Let
[TABLE]
It is clear that the leading monomial of ϕ5(u,v) is D(u)P(v) with respect to ≤PD which cannot be reduced further.
Now denote ΦDRB to be the set of the following OPIs:
(1)
ϕ1(x,y)=P(x)P(y)−P(xP(y))−P(P(x)y)−λP(xy),
(2)
ϕ2(x,y)=D(x)D(y)+λ−1D(x)y+λ−1xD(y)−λ−1D(xy),
(3)
ϕ3(x)=D(P(x))−x,
(4)
ϕ4(x,y)=P(x)D(y)−D(P(x)y)+xy+λxD(y),
(5)
ϕ5(x,y)=D(x)P(y)−D(xP(y))+xy+λD(x)y.
It is obvious that
⟨SΦDRB′(Z)⟩Ω-Alg=⟨SΦDRB(Z)⟩Ω-Alg for each set Z.
Next we will show that ΦDRB is Ω-GS with respect to ≤PD. Before that, we need the following lemma to simplify our proof.
Lemma 3.5**.**
Let ϕ(x1,…,xn) and ψ(y1,…,ym) be two OPIs. Let Z be a set. Suppose that, for any u1,…,un,v1,…,vm∈SΩ(Z), the leading monomial of ϕ(u1,…,un) is ϕˉ(u1,…,un) and leading monomial of ψ(v1,…,vm) is ψˉ(v1,…,vm).
Now write f=ϕ(u1,…,un) and g=ψ(v1,…,vm) for fixed u1,…,un, v1,…,vm∈SΩ(Z).
If there exists i(1≤i≤n) and r∈SΩ⋆(Z) such that
ui=r∣gˉ, then the inclusion composition (f,g)pq=f−q∣g with p=fˉ and q=ϕˉ(u1,…,ui−1,r,ui+1,…,un), is trivial modulo (S{ϕ,ψ}(Z),w). We call this type of inclusion composition as complete inclusion composition.
Proof.
The assertion follows from
[TABLE]
∎
Remark 3.6**.**
Lemma 3.5 extends [6, Theorem 4.1(b)] to the case of multiple operators.
Now we can prove ΦDRB is Ω-GS.
Theorem 3.7**.**
ΦDRB* is Ω-GS in kSΩ(Z) with respect to ≤PD.*
Proof.
We write i∧j the composition of OPIs of ϕi and ϕj, which means ϕi lies on the left and ϕj lies on the right for intersection composition or ϕj is included in ϕi for inclusion composition. The ambiguities of all possible compositions in ΦDRB are listed as below: for arbitrary u,v,w∈SΩ(Z) and q∈SΩ⋆(Z),
Notice that all compositions above but the underlined ones can be dealt with by Lemma 3.5.
There remains to consider the underlined compositions. We only give the complete proof for the case 5∧1, the other cases being similar.
For the case 5∧1, write
f=ϕ5(u,v), g=ϕ1(v,w) and p=D(u)P(v)P(w) . So we have
[TABLE]
We are done.
∎
Theorem 3.8**.**
Let Z be a set, A=kS(Z)/IA a nonunital k-algebra. Then we have:
[TABLE]
Moreover, assume IA has a GS basis G with respect to the degree-lexicographical order ≤dlex. Then SΦDRB(Z)∪G is an operated GS basis of ⟨SΦDRB(Z)∪IA⟩Ω-Alg in kSΩ(Z) with respect to ≤PD.
Proof.
Since the leading monomial in ΦDRB has no subword in S(X)\X, the result follows immediately from Theorem 3.7 and Theorem 2.13.
∎
As a consequence, we obtain a linear basis.
Theorem 3.9**.**
Let Z be a set, A=kS(Z)/IA a nonunital k-algebra with a GS basis G with respect to ≤dlex. Then the set
Irr(SΦDRB(Z)∪G) which is by definition the complement of
[TABLE]
in SΩ(Z) is a linear basis of the free nonunital λ-differential Rota-Baxter algebra FAlgΦDRB-Alg(A) over A.
Since the monomial order used in [2] does not satisfy the conditions of Theorem 2.13, we have to make use of a new monomial order while treating free differential Rota-Baxter algebras over an algebra. In fact, since the leading monomials are different, even for free differential Rota-Baxter algebras over a field, our monomial order will provide new operated GS basis and linear basis.
3.2. Case of nonunital algebras with λ=0
Now we consider
nonunital free differential Rota-Baxter algebras on algebras with λ=0.
This case can be studied similarly to the case λ=0, so we omit the details in this subsection.
Denote ϕ1(x,y) with λ=0 by ϕ10(x,y) . Let
[TABLE]
We also write ϕ30(x)=ϕ3(x) for convenience.
Proposition 3.11**.**
For any u,v∈SΩ(Z), the leading monomials of ϕ10(u,v), ϕ20(u,v) and ϕ30(u) with respect to ≤PD are
P(u)P(v),D(u)v and D(P(u)) respectively.
Let
[TABLE]
By the following example, one can see that ΦDRB0′ is not Ω-GS in kSΩ(Z) with respect to ≤PD.
Example 3.12**.**
For u,v∈SΩ(Z), let
[TABLE]
Then
[TABLE]
Let
[TABLE]
It is clear that the leading monomial of ϕ40(u,v) with u,v∈SΩ(Z) is P(u)D(v) with respect to ≤PD which cannot be reduced further.
Now denote ΦDRB0 to be the set of the following OPIs:
(1)
ϕ10(x,y)=P(x)P(y)−P(xP(y))−P(P(x)y),
(2)
ϕ20(x,y)=D(x)y+xD(y)−D(xy),
(3)
ϕ30(x)=D(P(x))−x,
(4)
ϕ40(x,y)=P(x)D(y)−D(P(x)y)+xy.
It is obvious that
⟨SΦDRB0′(Z)⟩Ω-Alg=⟨SΦDRB0(Z)⟩Ω-Alg for arbitrary set Z.
Similar to the case λ=0, it can be
proved that ΦDRB0 is Ω-GS with respect to ≤PD.
Remark 3.13**.**
Note that ϕ40(x,y) is just ϕ4(x,y) with λ=0, and for u,v∈SΩ(Z)
[TABLE]
which is exactly ϕ5(u,v) with λ=0. So ϕ5(x,y) (λ=0) does not appear in ΦDRB0.
Theorem 3.14**.**
ΦDRB0* is Ω-GS in kSΩ(Z) with respect to ≤PD.*
Proof.
As in the proof of Theorem 3.7,
we write i∧j the composition of OPIs of ϕi and ϕj. There are two kinds of ambiguities of all possible compositions in ΦDRB0. Since ϕ10(x,y),
ϕ30(x), and
ϕ40(x,y) have the same leading monomials as in the case λ=0, the corresponding ambiguities i∧j with i,j∈{1,3,4} are the same in the proof of Theorem 3.7.
Since ϕ20(x,y) has a different leading monomial, the ambiguities of the case i∧j with i=2 or j=2 are the following: for arbitrary u,v,w∈SΩ(Z),q∈SΩ⋆(Z) and s∈SΩ(Z) or ∅,
1∧2
P(q∣D(u)v)P(w), P(u)P(q∣D(v)w);
2∧1
D(q∣P(u)P(v))w, D(u)q∣P(u)P(v);
2∧2
D(u)sD(v)w, D(q∣D(u)v)w, D(u)q∣D(v)w;
2∧3
D(P(u))v, D(q∣D(P(u)))v, D(u)q∣D(P(v));
2∧4
D(u)sP(v)D(w), D(q∣P(u)D(v))w, D(u)q∣P(v)D(w);
3∧2
D(P(q∣D(u)v));
4∧2
P(u)D(v)w, P(q∣D(u)v)D(w), P(u)D(q∣D(v)w).
Almost all the cases can be treated similarly as in the proof of Theorem 3.7, except a slight difference in the case 2∧2. In fact,
let
f=ϕ20(u,sD(v)), g=ϕ20(v,w) and p=D(u)sD(v)w. So we have
[TABLE]
We are done.
∎
Theorem 3.15**.**
Let Z be a set and A=kS(Z)/IA a nonunital k-algebra. Then we have:
[TABLE]
Moreover, assume IA has a GS basis G with respect to the degree-lexicographical order ≤dlex. Then SΦDRB0(Z)∪G is an operated GS basis of ⟨SΦDRB0(Z)∪IA⟩Ω-Alg in kSΩ(Z) with respect to ≤PD.
As a consequence, we obtain a linear basis.
Theorem 3.16**.**
Let Z be a set and A=kS(Z)/IA a nonunital k-algebra with a GS basis G with respect to ≤dlex. Then the set
Irr(SΦDRB0(Z)∪G) which is by definition the complement of
[TABLE]
in SΩ(Z) is a linear basis of the free nonunital [math]-differential Rota-Baxter algebra FAlgΦDRB0-Alg(A) over A.
3.3. Case of unital algebras
Now we consider unital differential Rota-Baxter algebras. Since the proofs are similar to those in the previous subsections, we omit most of them.
The study still divided into cases of λ=0 and λ=0.
When λ=0, since unital differential Rota-Baxter algebras have the condition D(1)=0, put ΦuDRB to be the union of ΦDRB with {D(1)}, but by abuse of notation, in ΦDRB, x,y take their values in MΩ(Z) instead of SΩ(Z).
Remark 3.17**.**
We have:
[TABLE]
So adding of the unity 1 will not produce new OPIs.
Moreover,
it is clear that except the above cases, the leading monomials of OPIs in ΦDRB are the same with respect to ≤PD and ≤uPD by Proposition 1.20.
With similar proofs as in Subsection 3.1, we can prove the following results.
Theorem 3.18**.**
ΦuDRB* is Ω-GS in kMΩ(Z) with respect to ≤uPD.*
Theorem 3.19**.**
Let Z be a set and A=kM(Z)/IA a unital k-algebra. Then we have:
[TABLE]
Moreover, assume IA has a GS basis G with respect to the degree-lexicographical order ≤dlex. Then SΦuDRB(Z)∪G is an operated GS basis of ⟨SΦuDRB(Z)∪IA⟩Ω-uAlg in kMΩ(Z) with respect to ≤uPD.
Theorem 3.20**.**
Let Z be a set and A=kM(Z)/IA a unital k-algebra with a GS basis G with respect to ≤dlex. Then the set
Irr(SΦuDRB(Z)∪G) which is by definition the complement of
[TABLE]
in MΩ(Z) is a linear basis of the free unital λ-differential Rota-Baxter algebra FuAlgΦuDRB-uAlg(A) over A.
When λ=0, denote ΦuDRB0:=ΦDRB0 (again by abuse of notation, ΦDRB0 is understood that u,v take their values in MΩ(X) instead of SΩ(X)).
Remark 3.21**.**
In ΦuDRB0, we have
[TABLE]
so it is not necessary to add D(1) into ΦuDRB0.
Note that ϕ40(u,1)≡−D(P(v))+v=−ϕ30(v), so adding the unity 1 will not induce any new OPI.
By using similar proofs in Subsection 3.2, one can show the following results.
Theorem 3.22**.**
ΦuDRB0* is Ω-GS in kMΩ(Z) with ≤uPD.*
Theorem 3.23**.**
Let Z be a set and A=kM(Z)/IA a unital k-algebra. Then we have:
[TABLE]
Moreover, assume IA has a GS basis G with respect to the degree-lexicographical order ≤dlex. Then SΦuDRB0(Z)∪G is an operated GS basis of ⟨SΦuDRB0(Z)∪IA⟩Ω-uAlg in kMΩ(Z) with respect to ≤uPD.
Theorem 3.24**.**
Let Z be a set and A=kM(Z)/IA a unital k-algebra with a GS basis G with respect to ≤dlex. Then the set
Irr(SΦuDRB0(Z)∪G) which is by definition the complement of
[TABLE]
in MΩ(Z) is a linear basis of the free unital [math]-differential Rota-Baxter algebra FuAlgΦuDRB0-uAlg(A) over A.
So far, we have completed the study of differential Rota-Baxter algebras.
4. Free integro-differential algebras over algebras
In this section, we carry the study of GS bases of free integro-differential algebras over algebras.
It reveals that integro-differential algebras can be investigated by using a method similar to differential Rota-Baxter algebras, but the details are more difficult.
We first recall the definition of integro-differential algebras.
Definition 4.1**.**
Let λ∈k.
An integro-differential k-algebra of weight λ (also called a λ-integro-differential k-algebra) is a differential k-algebra (R,d) of weight λ with a linear operator P:R→R which satisfies (c) in Definition 3.1:
[TABLE]
and such that
[TABLE]
Recall that
(1)
ϕ1(x,y)=P(x)P(y)−P(xP(y))−P(P(x)y)−λP(xy),
(2)
ϕ2(x,y)=D(x)D(y)+λ−1D(x)y+λ−1xD(y)−λ−1D(xy),
(3)
ϕ3(x)=D(P(x))−x,
(4)
ϕ4(x,y)=P(x)D(y)−D(P(x)y)+xy+λxD(y),
(5)
ϕ5(x,y)=D(x)P(y)−D(xP(y))+xy+λD(x)y,
and
denote
(6)
ϕ6(x,y)=P(D(x)P(y))−xP(y)+P(xy)+λP(D(x)y),
(7)
ϕ7(x,y)=P(P(x)D(y))−P(x)y+P(xy)+λP(xD(y)).
Notice that for u,v∈SΩ(Z),
since P(D(u)P(v)) (resp. P(P(u)D(v))) has the largest P-degree in ϕ6(u,v) (resp. ϕ7(u,v)), the leading monomial of ϕ6(u,v) (resp. ϕ7(u,v)) with respect to ≤PD is P(D(u)P(v)) (resp. P(P(u)D(v))).
4.1. Case of nonunital algebras with λ=0
Assume in this subsection that λ=0.
We first consider nonunital free integro-differential k-algebras over algebras.
According to the definition of integro-differential algebras, define
[TABLE]
By Example 3.3, Example 3.4, Example 4.2 and Example 4.3, ΦID′ is not Ω-GS in kSΩ(X) with respect to ≤PD.
Example 4.2**.**
For u,v∈SΩ(Z), let
[TABLE]
Then
[TABLE]
Let
[TABLE]
It is clear that the leading monomial of ϕ8(u,v) is P(D(P(u)v)) with respect to ≤PD which cannot be reduced further.
Example 4.3**.**
For u,v∈SΩ(Z), let
[TABLE]
Then
[TABLE]
Let
[TABLE]
It is clear that the leading monomial of ϕ9(u,v) is P(D(uP(v))) with respect to ≤PD which cannot be reduced further.
Remark 4.4**.**
Note that the OPI ϕ1(x,y) can be induced by ϕ3(x,y) and ϕ6(x,y). So an integro-differential algebra can be seen as a differential Rota-Baxter algebra.
Explicitly, for u,v∈SΩ(Z), let
[TABLE]
Then
[TABLE]
Now denote ΦID to be the set of the following OPIs:
(1)
ϕ1(x,y)=P(x)P(y)−P(xP(y))−P(P(x)y)−λP(xv),
(2)
ϕ2(x,y)=D(x)D(y)+λ−1D(x)y+λ−1xD(y)−λ−1D(xy),
(3)
ϕ3(x)=D(P(x))−x,
(4)
ϕ4(x,y)=P(x)D(y)−D(P(x)y)+xy+λxD(y),
(5)
ϕ5(x,y)=D(x)P(y)−D(xP(y))+xy+λD(x)y,
(8)
ϕ8(x,y)=P(D(P(x)y))−P(x)y,
(9)
ϕ9(x,y)=P(D(xP(y)))−xP(y).
Notice that ΦID=ΦDRB∪{ϕ8(x,y),ϕ9(x,y)}.
Proposition 4.5**.**
⟨SΦID′(Z)⟩Ω-Alg=⟨SΦID(Z)⟩Ω-Alg* for each set Z.*
Proof.
We firstly prove ⟨SΦID(Z)⟩Ω-Alg⊆⟨SΦID′(Z)⟩Ω-Alg, which follows from
[TABLE]
where u,v∈SΩ(Z).
Next we show ⟨SΦID′(Z)⟩Ω-Alg⊆⟨SΦID(Z)⟩Ω-Alg. Note that
[TABLE]
and
[TABLE]
So we have
[TABLE]
It proves ⟨SΦID′(Z)⟩Ω-Alg⊆⟨SΦID(Z)⟩Ω-Alg.
We are done.
∎
Now we can prove ΦID is Ω-GS.
Theorem 4.6**.**
ΦID* is Ω-GS in kSΩ(Z) with respect to ≤PD.*
Proof.
Since the ambiguities i∧j with i,j=1,2,3,4,5 in ΦID are the same as in Theorem 3.7, we only need to consider the ambiguities involving ϕ8 and ϕ9. The cases that cannot be dealt with directly by Lemma 3.5 are listed below: for arbitrary u,v,w∈SΩ(Z),q∈SΩ⋆(Z) and s∈SΩ(Z) or ∅,
All these compositions can be treated similarly as in the proof of Theorem 3.7. We only give the complete proof for the case 8∧1.
Take
f=ϕ8(u,P(v)s), g=ϕ1(u,v), p=P(D(P(u)P(v)s)) and q=P(D(⋆s)). Then we have
[TABLE]
We are done.
∎
Theorem 4.7**.**
Let Z be a set and A=kS(Z)/IA a nonunital k-algebra. Then we have:
[TABLE]
Moreover, assume IA has a GS basis G with respect to the degree-lexicographical order ≤dlex. Then SΦID(Z)∪G is an operated GS basis of ⟨SΦID(Z)∪IA⟩Ω-Alg in kSΩ(Z) with respect to ≤PD.
Proof.
Since the leading monomial in ΦID has no subword in S(X)\X, the result follows immediately from Theorem 4.6 and Theorem 2.13.
∎
As a consequence, we obtain a linear basis .
Theorem 4.8**.**
Let Z be a set and A=kS(Z)/IA a nonunital k-algebra with a GS basis G with respect to ≤dlex. Then a linear basis of the free nonunital λ-integro-differential algebra FAlgΦDRB-Alg(A) over A is given by the set
Irr(SΦID(Z)∪G), which is by definition the complement in SΩ(Z) of the subset consisting of q∣w where w runs through
Since the monomial order ≤PD is different from that used in [7], our operated GS basis and linear basis are different from theirs. The reason is that the monomial order in [7] does not satisfy the condition of Theorem 2.13, thus cannot enable us to discuss free integro-differential algebras over algebras.
Remark 4.10**.**
Define a new OPI ϕ10(x)=P(D(x)),
and let
[TABLE]
A ΦIID-algebra is just a nonunital λ-integro-differential algebra with the operators P and D being the inverse operator of each other, so we call such an operated algebra an invertible integro-differential algebra. One can show that
ΦIID∪{ϕ4(x,y),ϕ5(x,y)} is Ω-GS in kSΩ(Z) with respect to ≤PD.
4.2. Case of nonunital algebras with λ=0
Now we consider
nonunital free integro-differential algebras on algebras with λ=0.
This case can be studied similarly as the case λ=0, so we omit the details in this subsection.
As in Subsection 3.2, for a OPI ϕ, we denote ϕ0 for ϕ with λ=0 and also write ϕ0=ϕ when λ does not appear in ϕ for convenience.
Let
[TABLE]
Again, ΦID0′ is not Ω-GS in kSΩ(Z) with respect to ≤PD.
Remark 4.11**.**
By Example 4.2, we can get ϕ80(u,v) from ϕ40(u,v) and ϕ70(u,v).
One can not obtain ϕ90(u,v) from SΦID0′(Z) as in Example 4.3, since ϕ5 does not belong to ΦID0′.
However, we can still generate ϕ90(u,v) as follows: for u,v∈SΩ(Z), let
[TABLE]
Then
[TABLE]
Now denote ΦID0 to be the set of the following OPIs:
(1)
ϕ10(x,y)=P(x)P(y)−P(xP(y))−P(P(x)y),
(2)
ϕ20(x,y)=D(x)y+xD(y)−D(xy),
(3)
ϕ30(x)=D(P(x))−x,
(4)
ϕ40(x,y)=P(x)D(y)−D(P(x)y)+xy,
(8)
ϕ80(x,y)=P(D(P(x)y))−P(x)y,
(9)
ϕ90(x,y)=P(D(xP(y)))−xP(y).
As in the previous subsection, one can prove the following results.
Proposition 4.12**.**
⟨SΦID0′(Z)⟩Ω-Alg=⟨SΦID0(Z)⟩Ω-Alg* for any set Z.*
Theorem 4.13**.**
ΦID0* is Ω-GS in kSΩ(Z) with respect to ≤PD.*
Theorem 4.14**.**
Let Z be a set and A=kS(Z)/IA a nonunital k-algebra. Then we have:
[TABLE]
Moreover, assume IA has a GS basis G with respect to the degree-lexicographical order ≤dlex. Then SΦID0(Z)∪G is an operated GS basis of ⟨SΦID0(Z)∪IA⟩Ω-Alg in kSΩ(Z) with respect to ≤PD.
Theorem 4.15**.**
Let Z be a set and A=kS(Z)/IA a nonunital k-algebra with a GS basis G with respect to ≤dlex. Then the set
Irr(SΦID0(Z)∪G) which is by definition the complement of
[TABLE]
in SΩ(Z) is a linear basis of the free nonunital [math]-integro-differential algebra FAlgΦID0-Alg(A) over A.
4.3. Case of unital algebras
Now we consider unital integro-differential algebras. Since the proofs are similar to those in the previous subsections, we omit most of them.
The study still is divided into cases of λ=0 and λ=0.
When λ=0, since unital integro-differential algebras have the condition D(1)=0, we put ΦuID:=ΦID∪{D(1)}.
Theorem 4.16**.**
ΦuID* is Ω-GS in kMΩ(Z) with respect to ≤uPD.*
Theorem 4.17**.**
Let Z be a set and A=kM(Z)/IA a unital k-algebra. Then we have:
[TABLE]
Moreover, assume IA has a GS basis G with respect to the degree-lexicographical order ≤dlex. Then SΦuID(Z)∪G is an operated GS basis of ⟨SΦuID(Z)∪IA⟩Ω-uAlg in kMΩ(Z) with respect to ≤uPD.
Theorem 4.18**.**
Let Z be a set, A=kM(Z)/IA a unital k-algebra with a GS basis G with respect to ≤dlex. Then a linear basis of the free unital λ-integro-differential algebra FuAlgΦuID-uAlg(A) over A is given by the set
Irr(SΦuID(Z)∪G), which is by definition the complement in MΩ(Z) of the subset consisting of q∣w where w runs through
[TABLE]
for arbitrary s∈G,q∈MΩ⋆(Z),u,v∈MΩ(Z).
When λ=0, denote ΦuID0:=ΦID0.
Theorem 4.19**.**
ΦuID0* is Ω-GS in kMΩ(Z) with respect to ≤uPD.*
Theorem 4.20**.**
Let Z be a set and A=kM(Z)/IA a unital k-algebra. Then we have:
[TABLE]
Moreover, assume IA has a GS basis G with respect to the degree-lexicographical order ≤dlex. Then SΦuID0(Z)∪G is an operated GS basis of ⟨SΦuID0(Z)∪IA⟩Ω-uAlg in kMΩ(Z) with respect to ≤uPD.
Theorem 4.21**.**
Let Z be a set and A=kM(Z)/IA a unital k-algebra with a GS basis G with respect to ≤dlex. Then the set
Irr(SΦuID0(Z)∪G) which is by definition the complement of
[TABLE]
in MΩ(Z) is a linear basis of the free unital [math]-integro-differential algebra FuAlgΦuID0-uAlg(A) over A.
4.4. Differential Rota-Baxter algebras vs integro-differential algebras
Since integro-differential algebras have one more defining relation than differential Rota-Baxter algebras,
by Proposition 2.10, the free integro-differential algebra over an algebra A is a quotient of the free differential Rota-Baxter algebra over A in general. However, by using the descriptions of ΦDRB and ΦID and Theorems 3.7 and 4.6, we could also show that the former one is a differential Rota-Baxter algebra subalgebra of the later one.
Theorem 4.22**.**
The free nonunital λ-integro-differential algebra FAlgΦID-Alg(A) over an algebra A is differential Rota-Baxter subalgebra of the free nonunital λ-differential Rota-Baxter algebra FAlgΦDRB-Alg(A) over A.
Proof.
We have the observation mentioned before
[TABLE]
That is to say, the operated Gröbner-Shirshov basis of the free nonunital λ-differential Rota-Baxter algebra FAlgΦDRB-Alg(A) over an algebra A is a subset of that of the free nonunital λ-integro-differential algebra FAlgΦID-Alg(A) over A. So by Diamond Lemma, FAlgΦID-Alg(A) is a subspace of FAlgΦDRB-Alg(A). It is obvious that FAlgΦID-Alg(A) is also differential Rota-Baxter subalgebra of FAlgΦDRB-Alg(A).
∎
Remark 4.23**.**
Gao and Guo [7] also studied GS bases of the free integro-differential algebras and free differential Rota-Baxter algebra both generated by sets, and they deduced that the free integro-differential algebra generated by a set is a subalgebra of the free differential Rota-Baxter algebra generated by the same set.
Theorem 4.22 proves an analogous fact for these free algebras generated by algebras.
However, our method is completely different from theirs.
Remark 4.24**.**
By using the descriptions of ΦDRB0 and ΦID0 (resp. ΦuDRB and ΦuID, ΦuDRB0 and ΦuID0) and Theorems 3.14 and 4.13 (resp. Theorems 3.18 and 4.16, Theorems 3.22 and 4.19), we always have the same result
in both unital and nonunital cases with any λ (zero or nonzero).
Acknowledgements: The authors were supported by NSFC (No. 11771085, 12071137) and by STCSM (22DZ2229014).
Bibliography23
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] L. A. Bokut and Y. Chen, Gröbner-Shirshov bases and their calculations , Bull. Math. Sci. 4 (2014), 325-395.
2[2] L. A. Bokut, Y. Chen and J. Qiu, Gröbner-Shirshov bases for associative algebras with multiple operators and free Rota-Baxter algebras , J. Pure Appl. Algebra 214 (2010) 89-110.
3[3] L. A. Bokut, Y. Chen, K. Kalorkoti, P. Kolesnikov and V. Lopatkin, Gröbner-Shirshov Bases: Normal Forms, Combinatorial and Decision Problems in Algebra , World Scientific 2020.
4[4] B. Buchberger, An algorithm for finding a basis for the residue class ring of a zero-dimensional polynomial ideal , Ph.D. thesis, University of Innsbruck (1965) (in German).
5[5] K. Ebrahimi-Fard and L. Guo, Free Rota-Baxter algebras and rooted trees, J. Algebra Appl. 7 (2008), no. 2, 167-194.
6[6] X. Gao and L. Guo, Rota’s Classification Problem, rewriting systems and Gröbner-Shirshov bases , J. Algebra 470 (2017), 219-253.
7[7] X. Gao, L. Guo and M. Rosenkranz, Free integro-differential algebras and Gröbner-Shirshov bases. J. Algebra 442 (2015), 354-396.
8[8] X. Gao, L. Guo and H. Zhang, Rota’s program on algebraic operators, rewriting systems and Gröbner-Shirshov bases , Adv. Math. (China) 51 (2022), no. 1, 1-31.