This paper extends Buchberger's theory and algorithms for Gr"obner bases to multivariate Ore extensions over rings that are modules over principal ideal domains, utilizing M"oller Lifting Theorem.
Contribution
It introduces a Buchberger theory and algorithms specifically designed for multivariate Ore extensions, expanding the applicability of Gr"obner basis methods.
Findings
01
Developed Buchberger theory for multivariate Ore extensions.
02
Implemented algorithms based on M"oller Lifting Theorem.
03
Enhanced computational methods for non-commutative polynomial rings.
Abstract
We present Buchberger Theory and Algorithm of Gr\"obner bases for multivariate Ore extensions of rings presented as modules over a principal ideal domain. The algorithms are based on M\"oller Lifting Theorem.
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
TopicsPolynomial and algebraic computation · Commutative Algebra and Its Applications · Algebraic Geometry and Number Theory
Full text
Buchberger-Zacharias Theory of Multivariate Ore Extensions
We present Buchberger Theory and Algorithm of Gröbner bases for multivariate Ore extensions of rings presented as modules over a principal ideal domain. The algorithms are based on Möller Lifting Theorem.
In her 1978 Bachelor’s thesis [53] Zacharias discussed how to extend Buchberger Theory [7, 8, 10] from the case of polynomial rings over a field to that of polynomials over a Noetherian ring with suitable effectiveness conditions.
In the meantime a similar task was performed in a series of papers — Kandri-Rody–Kapur [20] merged the rewriting rules behind Euclidean Algorithm with Buchberger’s rewriting, proposing a Buchberger Theory for polynomial rings over Euclidean domains; Pan [39] studied Buchberger Theory for polynomial rings over domains introducing the notions of strong/weak Gröbner bases — which culminated with [34].
Such unsorpassed paper, reformulating and improving Zacharias’ intuition, gave efficient solutions to compute
both weak and strong Gröbner bases for polynomial rings over each Zacharias ring, with particolar attention to the PIR case. Its main contribution is the reformulation of Buchberger test/completion (“a basis F is Gröbner if and only if each
S-polynomial between two elements of F, reduces to 0”) in the more flexible lifting theorem (“a basis F is Gröbner if and only if
each element in a minimal basis of the syzygies among the
leading monomials lifts, via Buchberger reduction,
to a syzygy among the elements of F”).
The only further contribution to this ultimate paper is the survey [6] of Möller’s results which reformulated them in terms of Szekeres Theory [50].
The suggestion of extending Buchberger Theory to non-commuative
rings which satisfy Poincaré-Birkhoff-Witt Theorem was put forward by Bergman [5],
effectively applied by Apel–Lassner [3, 4] to Lie algebras and further extended to solvable polynomial rings [21, 22], skew polynomial rings [15, 16, 17] and to other
algebras [1, 11, 25, 26]
which satisfy Poincaré-Birkhoff-Witt Theorem and thus, under the standard intepretation of Buchberger Theory in terms of filration/graduations [2, 29, 32, 49, 28],
have the classical polynomial ring as associated graded rings.
In particular Weispfenning [52] adapted his results to a generalization of the Ore extension [38] proposed by Tamari [51] and its construction was generalized by his student Pesch [40, 41] thus introducing the notion of iterative Ore extension with commuting variables
[TABLE]
the concept has been called Ore algebra in [12] and is renamed here as
multivariate Ore extension (for a different and promising approach to Ore algebras see [23]).
Bergman’s approach and most of all extensions are formulated for rings which are vector spaces over a field; in our knowledge the only instances in which the coefficient ring R is presented as a D-module over a domain D (or at least as a Z-module) are Pritchard’s [42, 43] extension of Möller Lifting Theory to non-commutative free algebras and Reinert’s [44, 45] deep study of Buchberger Theory on Function Rings.
Following the recent survey on Buchberger-Zacharias Theory
for monoid rings R[S] over a unitary effective ring R and an effective monoid S [31], we propose here a Möller–Pritchard lifting theorem presentation of Buchberger-Zacharias Theory
and related Gröbner basis computation algorithms for multivariate Ore extensions. The twist w.r.t. [31] is that there R[S] coincides with its associated graded ring; here R and its associated graded ring
[TABLE]
coincide as sets and as left R-modules between themselves and with the commutative polynomial ring R[Y1,⋯,Yn], but as rings have different multiplications.
We begin by recalling Ore’s original theory [38] of non-commutative polynomials R[Y], relaxing the original assumption that R is a field to the case in which R is a domain (Section 1.1) and Pesch’s constructions of multivariate Ore extensions (Section 1.2) and graded multivariate Ore extensions (Section 1.3), focusing on the arithmetics of the main Example 14
[TABLE]
Next we introduce Buchberger Theory in multivariate Ore extensions recalling the notion of term-orderings (Section 2.1), definition and main properties of left, right, bilateral and restricted Gröbner bases (Section 2.2) and Buchberger Algorithm for computing canonical forms in the case in which R is a field (Section 2.3).
We adapt to our setting Szekeres Theory [50] (Section 3), Zacharias canonical representation with related algorithm (Section 4) and Möller Lifting Theorem (Section 5).
The next Sections are the algorithmic core of the paper:
we reformulate for multivariate Ore extensions over a Zacharias ring
–
Möller’s algorithm for computing the required Gebauer–Möller set (id est the minimal basis of the module of the syzygies among the
leading monomials) for Buchberger test/completion of left weak bases (Section 6.1);
–
his reformulation of it which requires only l.c.m. computation in R for the case in which R is a PIR (Section 6.2);
–
still in the case in which R is a PIR, Möller’s completion of a left weak basis to a left strong one (Section 6.3);
–
Gebauer–Möller criteria [18] for producing a Gebauer–Möller set (Section 6.4);
–
Kandri-Rody–Weispfenning completion [21] of a left weak bases for producing a bilateral one (Section 7.1);
as a technical tool required by Weispfenning’s restricted completion, how to produce right Gebauer–Möller sets (Section 7.3).
Finally we reverse to a theoretical survey summarizing the structural theorem for the case in which R is a Zacharias ring over a PID (Section 8), specializing to our setting Spear’s Theorem [48, 28] (Section 9) and extending to it Lazard’s Structural Theorem [24] (Section 10).
In an appendix we discuss, as far as it is possible, how to extend this theory and algorithms to the case in which R is a PIR (Section A).
1 Recalls on Ore Theory
1.1 Ore Extensions
Let R be a not necessarily commutative domain; Ore [38] investigated
under which conditions
the R-module
R:=R[Y]
of all the formal polynomialsis made a ring under the assumption
that the multiplication of polynomials shall be associative and both-sided distributive and the limitation imposed by the postulate that
the degree of a product shall be equal to the sum of the degree of the factors.
It is clear that, due to the distributive property, it suffices to define the product of two monomials bYr⋅aYs or even more specifically, to define the product
Y⋅r,r∈R;
this necessarily requires the existence of maps α,δ:R→R such that
[TABLE]
Ore calls α(r) the conjugate and
δ(r) the derivative of r.
Under the required postulate clearly we have
for each r∈R, α(r)=0⟹r=0,
so that α is injective.
It is moreover sufficient to consider, for each r,r′∈R, the relations
[TABLE]
[TABLE]
and, if R is a skew field, and r=0,
[TABLE]
to deduce that
α is a ring endomorphism;
2. 3.
the following conditions are equivalent:
(a)
for each d∈R∖{0} exists c∈R∖{0}:Y⋅c=dY+δ(c),α(c)=d;
2. (b)
α is a ring automorphism;
3. 4.
δ is an α-derivation of Rid est an additive map satisfying
[TABLE]
4. 5.
if R is a skew field, then each r∈R∖{0} satisfies
[TABLE]
5. 6.
Im(α)⊂R is a subring, which is an isomorphism copy of R;
6. 7.
R1:={r∈R:r=α(r)}⊂R is a ring, the invariant ring of R;
7. 8.
R0:={r∈R:δ(r)=0}⊂R is a ring, the constant ring of R;
8. 9.
{r∈R:Y⋅r=rY}=R0∩R1.
9. 10.
If R is a skew field, such are also Im(α), R1 and R0.
10. 11.
Denoting Z:={z∈R:zr=rz\mboxforeachr∈R} the center of R, we have
[TABLE]
Moreover, if we consider two polynomials
f(Y),g(Y)∈R∖{0},
[TABLE]
we have
[TABLE]
since α is an endomorphism, b=0⟹α(b)=0⟹αm(b)=0 and
since R is a domain it holds
αm(b)=0=a⟹aαm(b)=0⟹f⋅g=0.
As a consequence
R is a domain.
Definition 1**.**
R with the ring structure described above is called an Ore extension and is denoted R[Y;α,δ].
Remark 2* (Ore).*
In an Ore extension R[Y;α,δ], denoting
S=⟨α,δ⟩ the free semigroup over the alphabet {α,δ} and, for each d∈N and i∈N,0≤i≤d, Sd,i the set of the (id) words in S of length d in which occur i instances of α and d−i instances of δ in an arbitrary order, we have
[TABLE]
for each d∈N;
for instance
[TABLE]
In particular, for f(Y)=∑i=0naiYn−i and g(Y)=∑i=0mbiYm−i in R we have
[TABLE]
Remark 3* (Ore).*
Under the assumption that (cf. 3.) α is an automorphism, each polynomial
∑i=1naiYi∈R can be uniquely represented as
∑i=1nYiaˉi for proper values aˉi∈R.
In fact we have
ax=xα−1(a)−δ(α−1(a))
from which we can deduce inductively proper expressions
[TABLE]
\sqcap$$\sqcup
1.2 Multivariate Ore Extensions
Definition 4**.**
An iterative Ore extension is a ring (whose multiplication we denote ⋆) defined as
[TABLE]
where, for each i>1, αi is an endomorphism and δi
an αi-derivation of the iterative Ore extension
[TABLE]
A multivariate Ore extension
(or: Ore algebra [12]; or: iterative Ore extension with commuting variables [40, 41]) is an iterative Ore extension which satisfies
–
αjδi=δiαj, for each i,j, i=j,
–
αiαj=αjαi,
δiδj=δjδi for j>i,
–
αj(Yi)=Yi,δj(Yi)=0 for j>i.
\sqcap$$\sqcup
Lemma 5** (Pesch).**
In an iterative Ore extension, for each i<j
it holds
[TABLE]
Proof.
For each i<j, we have
Yj⋆Yi=αj(Yi)Yj+δj(Yi).\sqcap$$\sqcup
Lemma 6** (Pesch).**
An iterative Ore extension is a multivariate Ore extension iff Yj⋆Yi=YiYj
for each i<j.
Thus the R-module structure of a multivariate Ore extension
can be identified with that of the polynomial ring R[Y1,…,Yn]
over its natural R-basis
[TABLE]
We can therefore denote αYi:=αi,δYi:=δi for each i and, iteratively,
[TABLE]
Remark that a multivariate Ore extension is not an algebra; in fact,
if we define, for τ=Y1d1⋯Yndn
and t=Y1e1⋯Ynen such that τ∣t
[TABLE]
we have
[TABLE]
We can define, for each t∈T, a map
[TABLE]
so that
t⋆r=αt(r)t+θt(r) for each t∈T and each r∈R.
Such maps αt and θt satisfy properties analogous of those of Ore’s
conjugate and derivative:
Lemma 7**.**
With the present notation, for each t∈T, we have
for each r∈R, αt(r)=0⟹r=0,
2. 2.
αt* is a ring endomorphism;*
3. 3.
the following conditions are equivalent:
(a)
for each d∈R∖{0} exists c∈R∖{0}:Y⋆c=dY+θt(c),αt(c)=d;
2. (b)
αt* is a ring automorphism;*
4. 4.
θt* is an αt-derivation of R;*
5. 5.
if R is a skew field, then each r∈R∖{0} satisfies
[TABLE]
6. 6.
Im(αt)⊂R* is a subring, which is an isomorphism copy of R.*
We further have
*if each αi is an automorphism, also each αt, t∈T, is such.
** *\sqcap$$\sqcup
1.3 Associated graded Ore Extension
Definition 8**.**
A multivariate Ore extension
[TABLE]
where each δi is zero, will be called a
graded Ore extension (or:
Ore extension with zero derivations [40, 41])
and will be denoted
[TABLE]
\sqcap$$\sqcup
Lemma 9**.**
In a multivariate graded Ore extension,
–
*since it is an Ore algebra, the *αs commute,
–
and t\star r=\alpha_{t}(r)t\Bigl{[}=:{\bf M}(t\star r)\Bigr{]}\mbox{\ for each }t\in{{\cal T}}\mbox{\ and }r\in R.
Remark 10*.*
Note that, since multivariate Ore extensions coincide, as left R-modules, with the classical polynomial rings R[Y1,…,Yn] and so
have the same R-basis, namely T, they can share with the polynomial rings their
standard T-valuation [50, 29, 2, 32] [30, §24.4,24.6].
This justifies the definition below.
Definition 11**.**
Given an Ore extension
R:=R[Y1;α1,δ1][Y2;α2,δ2]⋯[Yn;αn,δn]
the corresponding graded Ore extension
G(R):=R[Y1;α1][Y2;α2]⋯[Yn;αn]
is called its associated graded Ore extension.
\sqcap$$\sqcup
Example 12*.*
The first non obvious example of Ore extension was proposed in 1948 by D.Tamari [51] in connection with the notion of “order of irregularity” introduced by Ore in [37]; it consists of the
graded Ore extension.
[TABLE]
2. 2.
Such construction was generalized by Weispfenning [52] which introduced the rings
[TABLE]
3. 3.
and extended by Pesch [40] to his iterated Ore extensions with power substitution
[TABLE]
where αi:R→R:x↦xei,ei∈N.
4. 4.
An Ore extension where α is invertible is discussed in [27]:
[TABLE]
where
[TABLE]
whose inverse is
[TABLE]
\sqcap$$\sqcup
Note that, while as R-modules R and G(R) coincide both with the polynomial ring
P=R[Y1,…,Yn], the three rings have, in general, different arithmetics; we will denote ⋆ the multiplication of R and ∗ those of G(R).
thus S:=R[Y;α,δ] is an Ore extension of which R is the
associated graded Ore extension. \sqcap$$\sqcup
Example 14*.*
Since in Buchberger-Zacharias Theory, from an algorithmic point of view, the interest points are associated graded rings and thus the rôle of derivates is irrelevant, we illustrate the results for the Ore extensions with the zero-derivatives
[TABLE]
with αi(x):=cixei,ci∈Z∖{0},ei∈N∖{0}.
If we denote γ the map
[TABLE]
where the last equality holds for e=1,
we have Yia∗xb=cibγ(a,ei)xeiabYia.
Note that
[TABLE]
Since
αj(αi(x))=ciαj(xei)=cicjeixeiej
and
αi(αj(x))=cjαi(xej)=cjciejxeiej,
then R is a graded Ore extension if and only if
[TABLE]
id est
[TABLE]
We thus have (2n) relations among the n coefficients ci. In particular we need to partition the indices as
[TABLE]
If I:=O⊔E=∅ then each such equations are the trivial equality 1=1 and thus all ci are free. The situation is completely different when I:=O⊔E=∅;
in fact,
–
for i∈S necessarily ci=±1;
–
if a prime p divides at least a cj,j∈I, then it divides each ci,i∈I.
As regards the sign of ci we can say that
–
if E=∅ then
–
ci is positive for each i∈S∪O,
–
the sign of ci,i∈E, is undetermined but all the ci,i∈E, have the same sign.
–
if E=∅ then the sign of ci,i∈S∪O is undetermined.
For instance
–
for e1=e4=1,e2=5,e3=3 we have S={1,4},O={2,3},E=∅ and
[TABLE]
whence c1=±1,c4=±1,c2=±c32;
–
for e1=e4=1,e2=2,e3=3 we have S={1,4},O={3},E={2}, and
[TABLE]
whence c1=c4=1,c3=c22>0;
–
for e1=1,e2=2,e3=3, S={1}E={2}, O={3}. Suppose c2=6, so both the primes 2 and 3 divide c2. From c1=c20, c12=c30, c22=c3 we get c1=1 and c3=36. We notice that 2∣c3 and 3∣c3, but neither 2 nor 3 divide c1;
–
for e1=e4=1,e2=4,e3=8 we have S={1,4},E={2,3},O=∅ and
[TABLE]
whence c1=c4=1,c2=χ3,c3=χ7,c2c3>0.
As regards the values ∣ci∣,1≤i≤n,
setting
[TABLE]
we have
[TABLE]
In fact, since if a prime p divides at least a cj,j∈I, then it divides each ci,i∈I,
we can express each ∣ci∣,i∈I, as
∣ci∣=p1ai,1⋯phai,h
where p1,⋯,ph are the prime factors
of the
squarefree associate
χ=p1⋯ph of χ.
We have
[TABLE]
whence ai=aj⟺ei=ej and ai>aj⟺ej<ei.
Thus the cis with minimal ei minimalize also all ai,l,1≤l≤h.
We moreover have aj,l=(ei−1)ai,i(ej−1),1≤l≤h.
To avoid cumbersome and useless case-to-case studies,
let us simply assume ci>0 for each i;
under this restricted assumption, a series of inductive arguments allow to deduce
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Substituing cj=χej−1 and ci=χei−1 we get
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Note that associativity is verified by
[TABLE]
and
[TABLE]
\sqcap$$\sqcup
2 Buchberger Theory
2.1 Term ordering
For each m∈N, the free R-module Rm –
the canonical basis of which will be denoted {e1,…,em} –
is an (R,R)-bimodule with basis the set of the terms
[TABLE]
If we impose on T(m) a total ordering <, then
each f∈Rm has a unique representation as
an ordered linear combination of terms t∈T(m) with coefficients in R:
[TABLE]
The support of f is the set supp(f):={t∣c(f,t)=0}.
W.r.t. < we denote T(f):=t1
the maximal term of f, lc(f):=c(f,t1) its leading cofficient and M(f):=c(f,t1)t1
its maximal monomial.
If we denote, following [44, 45],
M(Rm):={ctei∣c∈R∖{0},t∈T,1≤i≤m},
for each f∈Rm∖{0} the unique finite representation above
can be reformulated
[TABLE]
as a sum of elements of the monomial setM(Rm).
While a multivariate Ore extension does not satisfiy commutativity between terms and coefficients,
[TABLE]
it however satisfies
[TABLE]
moreover, while R is not a monoid ring under the multiplication ⋆, so that in particular we cannot claim τ⋆ω∈T for τ,ω∈T, however
τ⋆ω satisfies
[TABLE]
where we have denoted
∘ the (commutative) multiplication of T;
similarly, for n∈M(Rm)
and ml,mr∈M(R)={ct:c∈R∖{0},t∈T} we have
M(ml⋆m⋆mr)=ml∗m∗mr.
In conclusion
w.r.t. each term ordering ≺ on T and each
≺-compatible
term ordering < on T(m), id est any well-ordering on T(m) which satisfies
[TABLE]
it holds, for each l,r∈R\mboxandf∈R(m),
[TABLE]
and
[TABLE]
As a consequence we trivially have
Corollary 15**.**
If ≺ is a term ordering on T
and < is a ≺-compatible
term ordering on T(m),
then, for each l,r∈R and f∈R(m),
M(l⋆f)=M(M(l)⋆M(f))=M(l)∗M(f);
2. 2.
M(f⋆r)=M(M(f)⋆M(r))=M(f)∗M(r);
3. 3.
M(l⋆f⋆r)=M(M(l)⋆M(f)⋆M(r))=M(l)∗M(f)∗M(r).
4. 4.
T(l⋆f)=T(l)∘T(f);
5. 5.
T(f⋆r)=T(f)∘T(r);
6. 6.
T(l⋆f⋆r)=T(l)∘T(f)∘T(r).
2.2 Gröbner Bases
In function of a term ordering < on T(m) which is
compatible with a term ordering on T which, with a slight abuse of notation, we still denote <,
we denote, for any set F⊂Rm,
IL(F),IR(F),I2(F) the left (resp. right, bilateral) module generated by F,
and
From now on, in order to avoid cumbersome notation and boring repetitions,
we will drop the subscripts when it will be clear of which kind of module (left, right, bilateral, restricted) we
are discussing.
As a consequence, the four statements of (7) will be summarized as
[TABLE]
Similarly, we formulate a (left,right,bilateral,restricted) definition simply for the bilateral case leaving to the reader the task to remove the irrelevant factors.
For instance condition (ii) below is stated for the bilateral case; it would be reformulated:
left case
for each f∈I(F) there are g∈F, a∈R∖{0},λ∈T such that
M(f)=aλ∗M(g)=M(aλ⋆g),
right case
for each f∈I(F) there are g∈F, b∈R∖{0},ρ∈T such that
M(f)=M(g)∗bρ=M(g⋆bρ),
restricted case
for each f∈I(F) there are g∈F, a∈R∖{0},ρ∈T such that
M(f)=aM(g)∗ρ=M(ag⋆ρ),
\sqcap$$\sqcup
Thus, if R is a skew field, the following conditions are equivalent and can be naturally chosen as definition of Gröbner bases:
M(I(F))=M{I(F)}=M{I(M{F})}=I(M{F})∩M(Rm),
2. 2.
for each f∈I(F) there is g∈F such that M(g)∣M(f).
But in general between these statements there is just the implication (2)⟹(1).
Thus [39], there are two alternative natural definitions for the concept of Gröbner bases:
–
a stronger one which satisfies
the following equivalent conditions:
(i).
for each f∈I(F) there is g∈F such that
M(g)∣M(f),
2. (ii).
for each f∈I(F) there are g∈F, a,b∈R∖{0},λ,ρ∈T such that
M(f)=aλ∗M(g)∗bρ=M(aλ⋆g⋆bρ),
3. (iii).
M(I(F))=M{I(F)}=M(F);
–
and a weaker one which satisfies
the following equivalent conditions:
(iv).
for each f∈I(F) there are gi∈F, ai,bi∈R∖{0},λi,ρi∈T for which, denoting
τi:=T(gi),
one has
–
T(f)=λi∘T(gi)∘ρi for each i, and
lc(f)=∑iaiαλi(lc(gi))αλiτi(bi)
if moreover R is a skew field
M(F)=M{I(M{F})}
so that conditions (i-v) above are all equivalent and are also equivalent to
(vi).
T(f)=λ∘T(g)∘ρ for some
g∈F, λ,ρ∈T.
Example 17*.*
Let us now specialize the ring of Example 14
to the case
[TABLE]
and remark that
[TABLE]
As a consequence, for each (b0,b1,b2,b3),(j0,j1,j2,j3)∈N4
[TABLE]
if and only if
[TABLE]
and b5b0(2a13a24a3−1)∣j.
Note that if we set y:=5x then for each (b1,b2,b3),(j1,j2,j3)∈N3 and
b(y),j(y)∈Z[y]⊂R
[TABLE]
if and only if, not only (8)
but also b(y2a13a24a3)∣j(y).
Definition 18**.**
Let I⊂Rm be a (left, right, bilateral, restricted) module and
G⊂I.
–
G will be called
–
a (left, right, bilateral, restricted) weak Gröbner basis (Gröbner basis for short) of I if
[TABLE]
id est if G satisfies conditions (iv-v) w.r.t. the module I=I(G);
in particular M{G}
generates the (left, right, bilateral, restricted) module
M(I)⊂Rm;
–
a
(left, right, bilateral, restricted) strong Gröbner
basis of I if
for each
f∈I there is g∈G such that M(g)∣M(f),id est if G satisfies conditions (i-iii) w.r.t. the module I=I(G).
–
We say that f∈Rm∖{0} has
–
a left Gröbner representation
in terms of G if it can be written as
f=∑i=1uli⋆gi,
with li∈R,gi∈G and
T(li)∘T(gi)≤T(f)\mboxforeachi;
–
a left (weak) Gröbner representation
in terms of G if it can be written as
f=∑i=1μaiλi⋆gi,
with ai∈R∖{0},λi∈T,gi∈G and
T(λi⋆gi)≤T(f)\mboxforeachi;
–
a left (strong) Gröbner representation in terms
of G if it can be written as
f=∑i=1μaiλi⋆gi,
with ai∈R∖{0},λi∈T,gi∈G and
[TABLE]
–
a right Gröbner representation
in terms of G if it can be written as
f=∑i=1ugi⋆ri,
with ri∈R,gi∈G and
T(gi)∘T(ri)≤T(f)\mboxforeachi;
–
a right (weak) Gröbner representation
in terms of G if it can be written as
f=∑i=1μgi⋆biρi,
with bi∈R∖{0},ρi∈T,gi∈G and
T(gi⋆ρi)≤T(f) for each i;
–
a right (strong) Gröbner representation in terms
of G if it can be written as
f=∑i=1μgi⋆biρi,
with bi∈R∖{0},ρi∈T,gi∈G and
[TABLE]
–
a bilateral (weak) Gröbner representation
in terms of G if it can be written as
f=∑i=1μaiλi⋆gi⋆biρi,
with ai,bi∈R∖{0},λi,ρi∈T,gi∈G and
T(λi⋆gi⋆ρi)≤T(f) for each i;
–
a bilateral (strong) Gröbner representation in terms
of G if it can be written as
f=∑i=1μaiλi⋆gi⋆biρi,
with ai,bi∈R∖{0},λi,ρi∈T,gi∈G and
T(f)=λ1∘T(g1)∘ρ1>λi∘T(gi)∘ρi\mboxforeachi.
–
a restricted (weak) Gröbner representation
in terms of G if it can be written as
f=∑i=1μaigi⋆ρi,
with ai∈R∖{0},ρi∈T,gi∈G and
T(gi⋆ρi)≤T(f) for each i;
–
a restricted (strong) Gröbner representation in terms
of G if it can be written as
f=∑i=1μaigi⋆ρi,
with ai∈R∖{0},ρi∈T,gi∈G and
T(f)=T(g1)∘ρ1>T(gi)∘ρi\mboxforeachi.
–
For f∈Rm∖{0},F⊂Rm, an element
h:=NF(f,F)∈Rm is called a
–
(left, right, bilateral, restricted) (weak) normal form
of f w.r.t. F, if
f−h∈I(F) has a weak Gröbner representation in
terms of F, and
h=0⟹M(h)∈/M{I(M{F})};
–
(left, right, bilateral, restricted) strong normal form
of f w.r.t. F, if
f−h∈I(F) has a strong Gröbner representation in
terms of F, and
h=0⟹M(f)∈/M(F).\sqcap$$\sqcup
Proposition 19**.**
(cf. [44, 45])
For any set F⊂Rm∖{0}, among the
following
conditions:
f∈I(F)⟺* it has a (left, right, bilateral, restricted) strong Gröbner representation
f=∑i=1μaiλi⋆gi⋆biρi
in terms of F which further satisfies*
[TABLE]
2. 2.
f∈I(F)⟺* it has a (left, right, bilateral, restricted) strong Gröbner representation in terms of F;*
3. 3.
F* is a (left, right, bilateral, restricted) strong Gröbner basis of I(F);*
4. 4.
f∈I(F)⟺* it has a (left, right, bilateral, restricted) weak Gröbner representation in terms of F;*
5. 5.
F* is a (left, right, bilateral, restricted) Gröbner basis of I(F);*
6. 6.
f∈I(F)⟺* it has a (left, right) Gröbner representation in terms of F;*
7. 7.
for each f∈Rm∖{0} and any (left, right, bilateral, restricted) strong normal form h of f w.r.t. F we have
f∈I(F)⟺h=0;
8. 8.
for each f∈Rm∖{0} and any (left, right, bilateral, restricted) weak normal form h of f w.r.t. F we have
f∈I(F)⟺h=0;
there are the implications
[TABLE]
If
R is a skew field we have also the implication (4)⟹(2) and as a consequence also (5)⟹(3).
Proof.
The implications (1)⟹(2)⟹(4)⟺(6), (3)⟹(5), (2)⟹(3) and (4)⟹(5)
are trivial.
Ad (3)⟹(1):
for each f∈I2(F) by assumption there are
elements
g∈F,m=aλ,n=bρ∈M(R) such that
M(f)=M(m⋆g⋆n).
Thus T(f)=T(m⋆g⋆n)=λ∘T(g)∘ρ and,
denoting
f1:=f−m⋆g⋆n,
we have
T(f1)<T(f) so the claim follows
by induction, since < is a well ordering.
Ad (5)⟹(4): similarly, for each f∈I2(F) by assumption there
are elements
gi∈F,T(gi):=τieli,
mi=aiλi,ni=biρi∈M(R) such that
–
T(f)=T(λi⋆gi⋆ρi)=λi∘τi∘ρieli for each i,
–
lc(f)=∑iaiαλi(lc(gi))αλiτi(bi).
It is then sufficient to denote
f1:=f−∑imi⋆gi⋆ni
in order to deduce the claim
by induction, since
T(f1)<T(f) and < is a well ordering.
Ad (4)⟹(2): let f∈I2(F)∖{0}; (4) implies the existence of g∈F,λ,ρ∈T, such that
T(f)=λ∘T(g)∘ρ.
Then setting
f_{1}:=f-\mathop{\rm lc}\nolimits(f)\Bigl{(}\alpha_{\lambda}\left(\mathop{\rm lc}\nolimits(g)\right)\Bigr{)}^{-1}\lambda\star g\star\rho
we deduce the claim
by induction, since
T(f1)<T(f) and < is a well ordering.
Ad (3)⟹(7) and (5)⟹(8): either
–
h=0 and f=f−h∈I(F) or
–
h=0, M(h)∈/M(I(F)), h∈/I(F) and f∈/I(F).
Ad (7)⟹(2) and (8)⟹(4): for each f∈I(F), its normal form is h=0 and
f=f−h has a strong (resp.: weak) Gröbner representation in
terms of F.
\sqcap$$\sqcup
Proposition 20**.**
(Compare [30, Proposition 22.2.10])
If F is a (weak, strong) Gröbner basis of I:=I(F), then the following holds:
Let g∈Rm be a (weak, strong) normal form of f w.r.t. F. If g=0, then
[TABLE]
2. 2.
Let f,f′∈Rm∖I be such that f−f′∈I. Let g
be a (weak, strong) normal form of f w.r.t. F and g′ be a (weak, strong) normal form of f′ w.r.t. F.
Then
–
T(g)=T(g′)=:τ* and*
–
lc(g)−lc(g′)∈Iτ:={lc(f):f∈I,T(f)=τ}∪{0}⊂R*. *
Proof.
Let h∈Rm be such that h−f∈I; then h−g∈I and
M(h−g)∈M{I}.
If T(g)>T(h) then M(h−g)=M(g)∈M{I}, giving
a contradiction.
2. 2.
The assumption implies that f−g′∈I so that, by the previous result,
T(g)≤T(g′).
Symmetrically, f′−g∈I and T(g′)≤T(g).
Therefore T(g)=T(g′)=τ; morevoer, either
–
T(g−g′)<τ and M(g)=M(g′) so that lc(g)=lc(g′) or
–
T(g−g′)=τ and
{\bf M}(g-g^{\prime})={\bf M}(g)-{\bf M}(g^{\prime})=\Bigl{(}\mathop{\rm lc}\nolimits(g)-\mathop{\rm lc}\nolimits(g^{\prime})\Bigr{)}\tau; thus, since g−g′∈I,
lc(g)−lc(g′)∈Iτ.
\sqcap$$\sqcup
2.3 Canonical forms (skew field case)
If R:=K is a skew field,
for any set F⊂Rm
we denote N(F) the (left, right, bilateral, restricted) order module
N(F):=T(m)∖T(F)
and
K[N(F)] the (left, right, bilateral, restricted) K-module K[N(F)]:=SpanK(N(F)).
Definition 21**.**
For any (left, right, bilateral, restricted) module I⊂Rm,
the order module N(I):=T(m)∖T{I} is called
the escalier of I.
We easily obtain the notion, the properties and
the computational algorithm (Figure 1) of (left, right, bilateral, restricted)
canonical forms:
Lemma 22**.**
(cf. [30, Lemma 22.2.12])*
Let I⊂Rm be a (left, right, bilateral, restricted) module.
If R=K is a skew field
and denoting
A the (left, right,bilateral, restricted) module A:=Rm/I
it holds*
Rm≅I⊕K[N(I)];**
2. 2.
A≅K[N(I)];**
3. 3.
for each f∈Rm, there is a unique
[TABLE]
such that f−g∈I.
Moreover:
(a)
Can(f1,I)=Can(f2,I)⟺f1−f2∈I;**
2. (b)
Can(f,I)=0⟺f∈I.**
4. 4.
For each f∈Rm,f−Can(f,I) has a (left, right, bilateral, restricted) strong
Gröbner representation in terms of any Gröbner basis.
Definition 23**.**
(cf. [30, Definition 22.2.13])
For each f∈Rm the unique element
[TABLE]
such that f−g∈I will be called the
(left, right, bilateral, restricted) canonical
form of f w.r.t. I.
\sqcap$$\sqcup
Corollary 24**.**
(cf. [30, Corollary 22.3.14])* If R=K is a skew field,
there is a unique set G⊂I such that*
–
T{G}* is an irredundant basis of T(I);*
–
for each g∈G,lc(g)=1;
–
for each g∈G,g=T(g)−Can(T(g),I).
G* is called the (left, right, bilateral, restricted) reduced
Gröbner basis of I.
\sqcap$$\sqcup*
Note that the algorithm described for right canonical forms is assuming that each αi is an automorphism; alternatively we can assume that R is given as a right R-module in which case the theory can be developped symmetrically.
3 Szekeres Theory
Let
I⊂Rm be a (left-bilateral)
module; if
we denote
for each
τ∈T(m), Iτ the additive group
[TABLE]
I:={Iτ:τ∈T(m)} and,
for each ideal a⊂R ,
Ta and La the sets
[TABLE]
we have
for each τ∈T(m), Iτ⊂R is a left ideal;
2. 2.
for each ideals a,b⊂R,
a⊂b⟹Ta⊃Tb;
3. 3.
Ta=b⊇a⨆Lb,
La=Ta∖b⫌a⋃Tb;
4. 4.
for terms τ,ω∈T(m), τ∣ω⟹Iτ⊂Iω;
5. 5.
for each ideal a⊂R, Ta⊂T(m) is a right semigroup module.
\sqcap$$\sqcup
If R is a skew field, the situation is quite trivial: for any ideal I we have
[TABLE]
Szekeres notation is related with a pre-Buchberger construction of “canonical” ideals for the case of polynomial rings R[Y1,…,Yn] over a PID R.
In connection recall that [13, 14]
a not necessarily commutative ring R is called a
(left, right, bilateral) Bézout ring if every finitely generated (left, right, bilateral) ideal is principal
and is called a Bézout domain if it is both a Bézout ring and is a domain,
and remark that, if R is a noetherian (left, bilateral) Bézout ring, then for each
τ∈T(m),
there is a value cτ∈R satisfying Iτ=I(cτ).
Definition 25**.**
With the present notation, we call Szekeres ideal each ideal Iτ⊂R and Szekeres level
each set La⊂T(m), Szekeres semigroup
each semigroup Ta⊂T(m).
Finally, if R is a noetherian left Bézout ring we call
Szekeres generator each
value cτ∈R satisfying Iτ=IL(cτ).
Note that if R is a
noetherian Bézout ring, we have,
[TABLE]
Proposition 26** (Szekeres).**
[50]** Let R be a
noetherian left Bézout ring and I⊂Rm be a (left,bilateral) module.
Denote
[TABLE]
*and fix, for each τ∈T, any element fτ∈I such that111Of course for the extreme case Iτ=(0) so that cτ=0, we have fτ:=0.
M(fτ)=cττ.
Then the basis
Sw:={fτ s.t. τ∈T}
is a left/bilateral weak Gröbner basis of I.*
Proof.
For each f∈I, denoting τ:=T(f) we have lc(f)∈IL(cτ) and lc(f)=dcτ for suitable d∈R∖{0}.
Thus if τ∈T we have M(f)=dM(fτ); if, instead, τ∈T
there are suitable
di,∈R∖{0},ωi∈T⊂T(m),λi,ρi∈T
for which
λi∘ωi∘ρi=τ and cτ=∑idiαλi(cωi)
so that
[TABLE]
\sqcap$$\sqcup
Remark 27*.*
Remark that in the case in which
each endomorphism ατ,τ∈T(m), is an automorphism, we can consider also right modules I to which we can associate
[TABLE]
which are right ideals themselves; in fact if we represent
f∈Rm as (see
Remark 3) f=∑i=1nYiaˉi
and we denote τI the right ideal
[TABLE]
then Iτ is the right ideal ατ(τI).
However, in this setting, Szekeres Theory can be built more easily by considering the ideals
τI obtained through the right representation of
Remark 3
and adapting to them the results reported above.
Remark that if an endomorphism ατ is not invertible, in general Iτ is not an ideal but just an additive group.
Finally note that for restricted modules, one apply verbatim, the classical Szekeres theory and subistitute in the results above each instance of
αλ(cω),τ=λ∘ω∘ρ with cω,τ=ω∘ρ\sqcap$$\sqcup
Example 28*.*
In the Ore extension
[TABLE]
we can consider, as a left module, the two-sided ideal
I2(x)=IL{xYi:i∈N}; we thus have
[TABLE]
so that, setting a:=I(x)⊂R, it holds
I={a},Ta=La={Yi:i∈N},
and Sw={xYi:i∈N} is both a weak and a strong
Gröbner basis of IL(x).
For the right ideal
IR(xY) the sets Iτ are not ideals;
we have, e.g.
[TABLE]
4 Zacharias canonical representation
Following Zacharias approach to Buchberger Theory [53], if each module I⊂Rm has a groebnerian property, necessarily the same property must be satisfied at least by the modules
I⊂Rm⊂Rm and thus such property in Rm can be used to device a procedure granting the same property in Rm. The most elementary application of Zacharias approach is the generalization of the property of canonical forms from the case in which R=K is a skew field to the general case: all we need is an effective notion of canonical forms for modules in R:
Definition 29** (Zacharias).**
[53]
A ring R is said to have
canonical representatives if
there is an algorithm which, given an element c∈Rm and a (left,bilateral, right) module
J⊂Rm,
computes a unique element Rep(c,J) such that
–
c−Rep(c,J)∈J,
–
Rep(c,J)=0⟺c∈J.
The set
[TABLE]
is called the canonical Zacharias representation of the module Rm/J.
\sqcap$$\sqcup
Remark that, for each c,d∈Rm and each module J⊂Rm, we have
[TABLE]
Using Szekeres notation for a (left, right, bilateral) module I⊂Rm we obtain
–
the partition
T(m)=L(I)⊔R(I)⊔N(I)
of T(m)
where
–
N(I):=L(0)={ω∈T(m):Iω=(0)},
–
L(I):=LR={ω∈T(m):Iω=R},
–
R(I):={ω∈T(m):Iω∈/{(0),R}};
–
the canonical Zacharias representation
[TABLE]
of the module Rm/I.
If R has canonical representatives and there is an algorithm (cf. Definition 42 (c), (e)) which, given an element c∈Rm and a
(left, right, bilateral) module J⊂Rm computes the unique canonical representative
Rep(c,J), an easy adaptation of Figure 1 allows to extend, from the field coefficients
case to the Zacharias ring [53, 31] coefficients case, the notion of canonical forms, the algorithm (Figure 2) for computing them and
their characterizing properties:
Lemma 30**.**
If R has canonical representatives,
also R has canonical representatives.
With the present notation and denoting
A the (left, right, bilateral) module A:=Rm/I
it holds:
Rm≅I⊕Rep(I);**
2. 2.
A≅Rep(I);**
3. 3.
for each f∈Rm, there is a unique
(left, right, bilateral) canonical
form of f
[TABLE]
such that
–
f−g∈I,
–
γ(f,τ,I,<)=Rep(γ(f,τ,I,<),Iτ)∈Rep(Iτ),
for each τ∈T(m).
Moreover:
(a)
Can(f1,I)=Can(f2,I)⟺f1−f2∈I;**
2. (b)
Can(f,I)=0⟺f∈I;**
4. 4.
*for each f∈Rm,f−Can(f,I) has a
(left, right, bilateral) (weak, strong) Gröbner representation in terms of any
(weak, strong) Gröbner basis.
** *\sqcap$$\sqcup
5 Möller’s Lifting Theorem
5.1 Left case
The validity of Eqs. (5) and (6) allows
to intoduce the groebnerian terminology and, as in the standard theory of commutative polynomial rings over a field [30, § 21.1-2] or a Zacharias ring [53],
the ability of imposing a T(m)-valuation on modules over R
and its associated graded Ore extension S:=G(R) (see Remark 10).
The only twist w.r.t. the classical theory is that there the ring was coinciding with its associated graded ring; here they coincide as sets and as left R-modules, but as rings have two different multiplications.
Consequently, denoting by ⋆ the one of R and by ∗ the one of S,
given a finite basis
[TABLE]
with respect to the module M:=IL(F)⊂Rm we need to consider
the morphisms
[TABLE]
where the symbols {e1,…,eu} denote the common canonical basis of
Su and Ru which, as R-modules, coincide.
We can then consider
–
the T(m)-valuation v:Ru→T(m)
defined,
for each σ:=∑i=1uhiei∈Ru∖{0},
by
[TABLE]
under which we further have Su=G(Ru);
–
the corresponding leading formLL(σ):=∑h∈HM(hh)eh∈Su – which is T(m)-homogeneous of T(m)-degree v(σ)=δϵ
– where
[TABLE]
Definition 31**.**
With the notation above and denoting
for each set S⊂Ru,
LL{S}:={LL(g):g∈S}⊂Su,
–
for a left R-module N⊂Ru,
a set B⊂N is called a left standard basis
if IL(LL{B})=IL(LL{N});
–
for each h∈N a representation
[TABLE]
is called a
left standard representation in R in terms
of B iff
[TABLE]
–
if u∈ker(sL) is T(m)-homogeneous
and U∈ker(SL) is such that u=LL(U), we say that
ulifts to U, or U is a lifting of u, or simply uhas
a lifting;
–
a left Gebauer–Möller set for F is any
T(m)-homogeneous basis of
ker(sL);
–
for each T(m)-homogeneous element σ∈Ru,
we say that SL(σ) has a
left quasi-Gröbner representation
in terms of F if it can be written as
SL(σ)=∑i=1uli⋆gi
with
v(σ)>T(li⋆gi)=T(li)∘T(gi)\mboxforeachi.
Remark 32*.*
Note that
each Gröbner representation of SL(σ) in terms of F gives also a
quasi-Gröbner representation since T(li)∘T(gi)≤T(SL(σ))<v(σ);
on the other side, a quasi-Gröbner representation grants only
T(li)∘T(gi)<v(σ)
but not necessarily
T(li)∘T(gi)≤T(SL(σ)), since in principle we could have
T(SL(σ))<T(li)∘T(gi)<v(σ)
so that we don’t necessarily obtain a Gröbner representation of the S-polynomial
SL(σ).
This relaxation was introduced by
Gebauer-Möller in their reformulation of Buchberger Theory for polynomial rings over a field [18];
in that setting, it allowed to better remove useless S-pairs and thus granted a more efficient reformulation of the algorithm; in the more general setting we are considering now, viz polynomials over rings, it becomes essential also for a smooth reformulation of the theory.
\sqcap$$\sqcup
Observe that if σ:=∑j=1uhjej∈ker(SL)
then denoting
[TABLE]
its leading formLL(σ):=∑j=1udjλjej∈Su is
T(m)-homogeneous of T(m)-degree v(σ):=δϵ∈T(m),
satisfies
With the present notation and denoting
GM(F) any left Gebauer–Möller set for F, the following
conditions are equivalent:
F* is a left Gröbner basis of M;*
2. 2.
f∈M⟺f* has a left Gröbner representation in terms of F;*
3. 3.
for each
σ∈GM(F), the S-polynomial* SL(σ) has a quasi-Gröbner representation*
[TABLE]
4. 4.
each σ∈GM(F) has a lifting lift(σ);
5. 5.
each T(m)-homogeneous element
u∈ker(sL) has a lifting lift(u).
Proof.
(1)⟹(2)
Let f∈M; by assumption
[TABLE]
where (a1λ1,…,auλu) is T(m)-homogeneous of T(m)-degree T(f).
Therefore g:=f−∑i=1uaiλi⋆gi∈M and
T(g)<T(f).
Thus, we can assume by induction the existence of a
Gröbner representation
g:=∑i=1uli⋆gi of g; whence
f:=∑i=1u(aiλi+li)⋆gi
is the required Gröbner representation of f.
(2)⟹(3)
SL(σ)∈M and T(SL(σ))<v(σ).
(3)⟹(4)
Let SL(σ)=∑i=1uli⋆gi be a
quasi-Gröbner representation in terms of F; then
T(li⋆gi)<v(σ) so that
lift(σ):=σ−∑i=1uliei is the required lifing of σ.
(4)⟹(5)
Let
u:=∑i=1uaiλiei,ai=0⟹λi∘τieli=v(u),
be a T(m)-homogeneous element in ker(sL) of T(m)-degree v(u).
Then there are cσ∈R,λσ∈T
for which
[TABLE]
For each σ∈GM(F) denote
[TABLE]
and remark that
T(liσ)∘τieli≤v(σˉ)<v(σ),
SL(lift(σ))=0 and
SL(σˉ)=SL(σ).
It is sufficient to define
[TABLE]
to obtain
lift(u)=u−uˉ,LL(lift(u))=u,SL(uˉ)=SL(u),SL(lift(u))=0.
(5)⟹(1)
Let g∈M, so that there are
li∈R,
such that
σ1:=∑i=1uliei∈Ru
satisfies
g=SL(σ1)=∑i=1uli⋆gi.
Denoting H:={i:T(li)∘τieli=v(σ1)}, then
either
–
T(g)=v(σ1),
so that
M(g)=∑i∈HM(li)∗M(gi)∈M{IL(M{F})} and we are through, or
–
T(g)<v(σ1),
0=∑i∈HM(li)∗M(gi)=sL(LL(σ1)) and
the T(m)-homogeneous element
LL(σ1)∈ker(sL)
has a lifting U:=LL(σ1)−∑i=1uli′ei
with
[TABLE]
so that
g=SL(σ2) and v(σ2)<v(σ1)
for
[TABLE]
and the claim follows by the well-orderedness of <.
With the same notation the equivalent conditions (1-5) imply that
{lift(σ):σ∈GM(F)}* is a left standard basis of ker(SL).*
Proof.
(4)⟹(6)
Let
σ1:=∑i=1uliei∈ker(SL)⊂Ru.
Denoting
H:={i:T(li)∘τieli=v(σ1)}, we have
[TABLE]
and there is a T(m)-homogeneous representation
[TABLE]
Then
[TABLE]
satisfies both σ2∈ker(SL) and
v(σ2)<v(σ1);
thus the claim follows by induction.
\sqcap$$\sqcup
Example 35*.*
Let us consider the ring of Example 17 and three elements f1,f2,f3∈R with
[TABLE]
Under the natural T-pseudovaluation on R3,
an element
[TABLE]
is homogeneous of T-degree Y1a+2Y2b+2Y3c+2 iff
[TABLE]
Let us now specialize ourselves to the case a=b=c=0 and consider the Z-module of the homogeneous syzygies of T-degree Y12Y22Y32; (9)
is a syzygy in ker(sL) iff
so that
(y+1)∣β and setting β=(y+1)δ we have
α=−δ(y2+y+1)−γ(y2+1) whence
[TABLE]
Remark 36*.*
We can consider also the
homogeneous syzygy of T-degree Y12Y22Y32
[TABLE]
Moreover, since
[TABLE]
setting
[TABLE]
we have
[TABLE]
note that
[TABLE]
\sqcap$$\sqcup
Example 35* (cont.).*
Setting now τ:=Y1aY2bY3c and z:=y2a3b4c, for the syzygy (9) we have
[TABLE]
whence
[TABLE]
and
[TABLE]
Thus, {σ1,σ2} is a minimal basis of ker(sL).
5.2 Bilateral case
Considering R as a left R-module, the adaptation of Möller lifting theorem to the bilateral case requires a few elementary adaptations; given a finite set
[TABLE]
and the bilateral module M:=I2(F),
denote
[TABLE]
the commutative subring R^⊂R of R consisting of the elements belonging to the center of R and remark that
the subring of R generated by 1R is a subring of R^ and that
R^ is also a subring of the center of the associated graded Ore extension S of R.
Considering both the R-bimodule
R⊗R^Rop and the S-bimodule
S⊗R^Sop, which, as sets, coincide,
we impose on the bilateral R-module (R⊗R^Rop)u, whose canonical basis is denoted
{e1,…,eu} and whose generic element has the shape
[TABLE]
the T(m)-graded structure given by
the valuation
v:(R⊗R^Rop)u→T
as
[TABLE]
for each
[TABLE]
so that
[TABLE]
and its corresponding
T(m)-homogeneous leading form
is
[TABLE]
where
H:={j:λj∘τj∘ρjeιℓj=v(σ)=δϵ}; we also denote, for each set S⊂(R⊗R^Rop)u,
[TABLE]
We can therefore consider the morphisms
[TABLE]
Definition 36**.**
With the notation above
–
for a bilateral R-module N,
a set F⊂N is called a bilateral standard basis
if
[TABLE]
–
for each h∈N a representation
[TABLE]
is called a
standard representation in R in terms
of F iff
[TABLE]
–
if u∈ker(s2) is T(m)-homogeneous
and U∈ker(S2) is such that u=L2(U), we say that
ulifts to U, or U is a lifting of u, or simply uhas
a lifting;
–
a bilateral Gebauer–Möller set for F is any
T(m)-homogeneous basis of
ker(s2);
–
for each T(m)-homogeneous element
σ∈(R⊗R^Rop)u,
we say that S2(σ) has a bilateral
quasi-Gröbner representation
in terms of G if it can be written as
[TABLE]
with
λi∘T(gℓi)∘ρi<v(σ) for each i.
\sqcap$$\sqcup
Theorem 37** (Möller–Pritchard).**
With the present notation and denoting
GM(F) any bilateral Gebauer–Möller set for F, the following
conditions are equivalent:
F* is a bilateral Gröbner basis of M;*
2. 2.
f∈M⟺f* has a bilateral Gröbner representation in terms of F;*
3. 3.
for each σ∈GM(F),
the bilateral S-polynomial S2(σ) has a bilateral quasi-Gröbner representation
S2(σ)=∑l=1μalλl⋆gℓl⋆blρl, in terms of F;
4. 4.
each σ∈GM(F) has a lifting lift(σ);
5. 5.
each T(m)-homogeneous element
u∈ker(s2) has a lifting lift(u).
Proof.
(1)⟹(2)
Let f∈M; by assumption
[TABLE]
where
∑i=1μaiλieℓibiρi∈(S⊗R^Sop)u is T(m)-homogeneous of T(m)-degree T(f).
Therefore g:=f−∑i=1μaiλi⋆gℓi⋆biρi∈M and
T(g)<T(f).
Thus, the claim follows by induction since < is a well-ordering.
(2)⟹(3)
S2(σ)∈M and T(S2(σ))<v(σ).
(3)⟹(4)
Let
[TABLE]
be a bilateral
quasi-Gröbner representation in terms of F; then
[TABLE]
is the required lifting of σ.
(4)⟹(5)
Let
u:=∑iaiλieℓibiρi∈(S⊗R^Sop)u,λi∘τℓi∘ρieιℓi=v(u),
be a T(m)-homogeneous element in ker(s2) of T(m)-degree v(u).
Then there are λσ,ρσ∈T,aσ,bσ∈R∖{0},
for which
[TABLE]
For each σ∈GM(F) denote
[TABLE]
and remark that
λiσ∘τℓiσ∘ρiσeιℓiσ≤v(σˉ)<v(σ) and
S2(σˉ)=S2(σ).
It is sufficient to define
[TABLE]
to obtain
[TABLE]
(5)⟹(1)
Let
g∈M, so that there are
λi,ρi∈T,ai,bi∈R∖{0},1≤ℓi≤u,
such that
σ1:=∑i=1μaiλieℓibiρi∈(R⊗R^Rop)u
satisfies
[TABLE]
Denoting H:={i:λi∘T(gℓi)∘ρi=λi∘τℓi∘ρieιℓi=v(σ1)}, then
either
–
v(σ1)=T(g) so that, for each i∈H,
M(aiλi⋆M(gℓi)⋆biρi)=aiλi∗M(gℓi)∗biρi
and
[TABLE]
and we are through, or
–
T(g)<v(σ1), in which case
0=∑i∈Haiλi∗M(gℓi)∗biρi=s2(L2(σ1))
and
the T(m)-homogeneous element
L2(σ1)∈ker(s2)
has a lifting
[TABLE]
with
[TABLE]
so that
g=S2(σ2) and v(σ2)<v(σ1) holds
for
[TABLE]
and the claim follows by the well-orderedness of <.
\sqcap$$\sqcup
Theorem 38** (Janet—Schreyer).**
With the same notation the equivalent conditions (1-5) imply that
{lift(σ):σ∈GM(F)}* is a bilateral standard basis of ker(S2).*
Proof.
(4)⟹(6)
Let
σ1:=∑i=1μaiλieℓibiρi∈ker(S2)⊂(R⊗R^Rop)u.
Denoting
H:={i:λi∘τℓi∘ρieιℓi=v(σ1)}, we have
[TABLE]
and there is a T(m)-homogeneous representation
[TABLE]
with λσ,ρσ∈T,aσ,bσ∈R∖{0}.
Then
[TABLE]
satisfies both σ2∈ker(S2) and
v(σ2)<v(σ1);
thus the claim follows by induction.
\sqcap$$\sqcup
5.3 Restricted case
In order to deal with restricted modules, we need simply to adapt and simplify the bilateral case.
Thus, we consider both the left R-modules
R⊗Rop and R⊗Sop, which, as sets, coincide,
we impose on the bilateral R-module (R⊗Rop)u, whose canonical basis is denoted
{e1,…,eu} and whose generic element has the shape
[TABLE]
the T(m)-graded structure given by
the valuation
v:(R⊗Rop)u→T
as
[TABLE]
for each
[TABLE]
so that
[TABLE]
and its corresponding
T(m)-homogeneous leading form
is
[TABLE]
where
H:={j:τj∘ρjeιℓj=v(σ)=δϵ}; we also denote, for each set S⊂(R⊗Rop)u,
[TABLE]
We can therefore consider the morphisms
[TABLE]
Definition 39**.**
With the notation above
–
for a restricted module N,
a set F⊂N is called a restricted standard basis
if
[TABLE]
–
for each h∈N a representation
[TABLE]
is called a
standard representation in R in terms
of F iff
[TABLE]
–
if u∈ker(sW) is T(m)-homogeneous
and U∈ker(SW) is such that u=LW(U), we say that
ulifts to U, or U is a lifting of u, or simply uhas
a lifting;
–
a restricted Gebauer–Möller set for F is any
T(m)-homogeneous basis of
ker(sW);
–
for each T(m)-homogeneous element
σ∈(R⊗R^Rop)u,
we say that SW(σ) has a restricted
quasi-Gröbner representation
in terms of G if it can be written as
[TABLE]
with
T(gℓi)∘ρi<v(σ) for each i.
\sqcap$$\sqcup
Theorem 40** (Möller–Pritchard).**
With the present notation and denoting
GM(F) any restricted Gebauer–Möller set for F, the following
conditions are equivalent:
F* is a restricted Gröbner basis of IW(F);*
2. 2.
f∈IW(F)⟺f* has a restricted Gröbner representation in terms of F;*
3. 3.
for each σ∈GM(F),
the restricted S-polynomial SW(σ) has a restricted quasi-Gröbner representation
SW(σ)=∑l=1μalgℓl⋆ρl,
in terms of F;
4. 4.
each σ∈GM(F) has a lifting lift(σ);
5. 5.
each T(m)-homogeneous element
u∈ker(sW) has a lifting lift(u).
Theorem 41** (Janet—Schreyer).**
With the same notation the equivalent conditions (1-5) imply that
{lift(σ):σ∈GM(F)}* is a restricted standard basis of ker(SW).*
6 Gröbner basis Computation for Multivariate Ore Extensions of Zacharias Domains
We recall the definition of Zacharias ring [53], [30, §26.1], [31].
Definition 42**.**
A ring R with identity is called
a (left) Zacharias ring
if it satisfies the following properties:
(a).
R is a noetherian ring;
2. (b).
there is an algorithm which, for each
c∈Rm,C:={c1,…ct}⊂Rm∖{0},
allows to decide whether
c∈IL(C) in which case it produces elements
di∈R:c=∑i=1tdici;
3. (c).
there is an algorithm which, given
{c1,…ct}⊂Rm∖{0}, computes a finite set of
generators for
the left syzygy R-module {(d1,⋯,dt)∈Rt:∑i=1tdici=0}.
Note that
[34] for a ring R with identity which satisfies (a) and (b), (c) is equivalent to
(d).
there is an algorithm which, given
{c1,…cs}⊂Rm∖{0}, computes a finite basis of the
ideal
[TABLE]
If R has canonical representatives,
we improve the computational assumptions
of Zacharias rings, requiring also the following property:
(e).
there is an algorithm which, given an element c∈Rm and a
left
module J⊂Rm, computes the unique canonical representative
Rep(c,J).
\sqcap$$\sqcup
If R is a left Zacharias domain, the three algorithms proposed by Möller [34] for computing Gröbner bases in the polynomial ring over R can be easily adapted to
multivariate Ore extensions of Zacharias domains, provided that
each αi, and therefore each ατ, is an automorphism.
6.1 First algorithm
Still considering a finite basis
[TABLE]
of the module M:=IL(F)
and denoting
–
H(F):={{i1,i2,…,ir}⊆{1,…,u}:li1=⋯=lir};
–
for each H:={i1,i2,…,ir}∈H(F),
–
εH:=eli1=⋯=eli1,
–
τH:=lcm(τi:i∈H),
–
for each I⊂H,
–
τH,I:=τIτH,
–
αH,I:R→R the morphism
ατH,I;
–
T(H):=τHεH,
and, if R is a PID,
–
cH:=lcm(αH,i(ci):i∈H),
–
μ(H):=cHτH and
–
M(H)=cHT(H)=cHτHεH=μ(H)εH;
–
T:={T(H):H∈H(F)};
–
for any m=δϵ∈T,
–
for each i,1\leq i\leq u,t_{i}({\sf m}):=\begin{cases}\frac{\delta}{\tau_{i}}&\mbox{ if {\bf T}(g_{i})\mid{\sf m},}\cr 1&\mbox{ otherwise;}\cr\end{cases}
–
v(m)=(v(m)1,…,v(m)u)∈Ru the vector such
that
[TABLE]
–
C(m)⊂Ru a finite basis of the syzygy module
[TABLE]
–
S(m):={(d1t1(m),…,dutu(m)):(d1,…,du)∈C(m)};
–
S(F):=⋃m∈TS(m);
–
S′(F)⊂S(F) any subset satisfying
–
for each σ∈S(F)∖S′(F)
exist σj∈S′(F),dj∈R,τj∈T,
such that
σ=∑jdjτj∗σj;
with
ai∈R,λi∈T,v(σ):=τϵ, and
ai=0⟹λiτi=τ,ϵ=eli,
and assume that it is a left syzygy in ker(sL).
Denoting I:={i≤u:ai=0} and setting
m:=δϵ:=lcm{T(gi):i∈H}∣v(σ),
there is υ∈T:υδ=τ.
With the present notation we also have
δ=ti(m)τi;
thus υti(m)τi=υδ=λiτi
and
λi=υti(m).
We also have
[TABLE]
so that
[TABLE]
so that
(αυ−1(a1),…,αυ−1(au))∈SyzL(v(m)1,…,v(m)u).
Therefore, if we enumerate as
[TABLE]
a basis of C(m)
and we denote sj:=∑i=1udjiti(m)ei,1≤j≤v, the elements of S(m),
we have
(αυ−1(a1),…,αυ−1(au))=∑j=1vbj(dj1,…,dju) for suitable bj∈R
and
[TABLE]
\sqcap$$\sqcup
Corollary 44**.**
The following holds:
S′(F)* is a Gebauer–Möller set for F.*
2. 2.
F* is a left Gröbner basis of the module it generates iff
each h∈R(F) has a left Gröbner representation in terms of F.
** *\sqcap$$\sqcup
Example 45*.*
If we consider the ring of Example 17 as a left Z[x]-module endowed
with the Γ-pseudovaluation,
Γ={Y1a1Y2a2Y3a3:(a1,a2,a1)∈N3},
we obtain a similar solution as the one described in Example 35 .
Expressing each M(fi) as M(fi)=lc(fi)T(fi), according Zacharias approach we need to compute a syzygy bases in Z[x] among
αY1(lc(f1))=(y2−1), αY2(lc(f2))=(y3−1) and
αY3(lc(f3))=(y4−1); the natural solutions
(−(y2+y+1),(y+1),0), (−(y2−1),0,1)
produce σ1 and σ2.
Example 46*.*
Let us now specialize the ring of Example 14
to the case
[TABLE]
and let us consider four elements f1,f2,f3,f4∈R with
[TABLE]
We have
[TABLE]
and
[TABLE]
Denoting
[TABLE]
we have S(Y12Y22Y32)={b(2,4)}
and, since
[TABLE]
we can take
S(Y12Y32Y32)={b(1,3),Y2∗b(2,4),b(3,4)};
thus
[TABLE]
is the required Gebauer–Möller set.
\sqcap$$\sqcup
6.2 Second algorithm
Möller proposes an (essentially) equivalent alternative computation:
for any s,1≤s≤u, let us consider the
syzygy module
[TABLE]
and let us compute S(F)=Su by inductively
extending Ss−1 to Ss, the inductive seed being
S1=∅.
A direct application of the property (d) of a Zacharias ring allows to compute a Gebauer-Möller set via
Definition 47**.**
A subset H⊂{1,…,s}∩H(F),s≤u, is
said to be
maximal for a term δϵ∈T(m) if
H={i,1≤i≤s:τi∣δ,eli=ϵ},
basic if s∈H and H is maximal for T(H).
For a basic subset H⊂{1,…,s}∩H(F), denote H×:=H∖{s}.
For any
[TABLE]
a syzygy associated to H and ds is any
T(m)-homogeneous syzygy
[TABLE]
where di∈R are suitable elements for which
dsαH,s(cs)=−∑i∈H×diαH,i(ci).\sqcap$$\sqcup
{d1H,…,drHH}* a basis of the ideal IL({αH,i(ci) s.t. i∈H×}):IL(αH,s(cs)) for each basic subset H∈H,*
–
DjH∈Rs* a syzygy associated to H and djH, for each basic subset H∈H and each j,1≤j≤rH*
the set
{A1,…,Aμ}∪{DjH:H∈H,1≤j≤rH}
is a T(m)-homogeneous basis of Ss.
Proof.
Let
S:=(d1λ1,…,dsλs)∈Ss,ds=0,
be a
T(m)-homogeneous element of T(m)-degree δϵ
and let
[TABLE]
since by T(m)-homogeneity,
τi∣δ and eιi=ϵ for each i∈K, we have T(K)∣δϵ;
we also have
di=0\mboxforeachi∈/K\mboxandλiτi=δ,eιi=ϵ\mboxforeachi∈K.
For the set H:={i,1≤i≤s:τi∣τK,eιi=εK}
clearly we have
τH∣τK and K⊆H so that
τH∣τK∣δ; we also have εH=εK=ϵ.
Moreover ds=0 implies s∈K⊆H so that H is basic.
Since (d1λ1,…,dsλs)∈Ss, setting υ:=τHδ,
we have
[TABLE]
so that ∑i∈Hdiαλi(ci)=0,
∑i∈Hαυ−1(di)αH,i(ci)=0, whence
[TABLE]
Therefore αυ−1(ds)=∑j=1rHujdjH
and S−∑j=1rHαυ(uj)υ∗DjH∈Ss−1.\sqcap$$\sqcup
Example 49*.*
If we consider the ring of Example 17 as a left Z[x]-module endowed
with the Γ-pseudovaluation,
Γ={Y1a1Y2a2Y3a3:(a1,a2,a1)∈N3},
we obtain a similar solution as the one described in Example 35 .
Expressing each M(fi) as M(fi)=lc(fi)T(fi), according Zacharias approach we need to compute a syzygy bases in Z[x] among
αY1(lc(f1))=(y2−1), αY2(lc(f2))=(y3−1) and
αY3(lc(f3))=(y4−1); the natural solutions
(−(y2+y+1),(y2+1),0), (−(y2−1),0,1)
produce σ1 and σ3.
Example 50*.*
In Examples 46, the basic elements are the following:
[TABLE]
\sqcap$$\sqcup
Corollary 51**.**
Assuming that the Zacharias domain R is a principal ideal domain and denoting222Remember that α{i,j},j=ατ for τ=τjlcm(τi,τj)., for each i,j,1≤i<j≤u, eιi=eιj,
[TABLE]
we have that {b(i,j):1≤i<j≤u,eιi=eιj} is a Gebauer–Möller set for
F,
so that
F is a Gröbner basis of M, iff
each B(i,j), 1≤i<j≤u,eιi=eιj, has a weak Gröbner
representation in terms of F.
\sqcap$$\sqcup
Proof.
Since, for any basic subset
H⊂{1,…,s}∩H(F)
we have
[TABLE]
and b(i,s) is the syzygy associated to {i,s} and
α{i,s},s(cs)lcm(α{i,s},i(ci),α{i,s},s(cs)).
\sqcap$$\sqcup
Example 52*.*
In Examples 46, we obtain the following redundant Gebauer–Möller set (see Examples 65)
[TABLE]
\sqcap$$\sqcup
Corollary 53**.**
Assuming that the Zacharias domain R is a principal ideal domain and
that each αi is an automorphism
denoting, for each i,j,1≤i<j≤u, eιi=eιj,
[TABLE]
we have that {b(i,j):1≤i<j≤u,eιi=eιj} is a Gebauer–Möller set for
F,
so that
F is a right Gröbner basis of M, iff
each B(i,j), 1≤i<j≤u,eli=elj, has a right weak Gröbner
representation in terms of F.
\sqcap$$\sqcup
6.3 Third algorithm: from weak to strong Gröbner basis
As regards strong Gröbner bases, we have
Definition 54**.**
A set C⊂Rm is called a
completion of F, if, for each subset
H⊂H(F) which is maximal for T(H), it contains an element
fH∈I(F)
which satisfies
T(fH)=T(H)=τHεH,
2. 2.
lc(fH)=cH=gcd(αH,i(lc(gi)):i∈H),
3. 3.
fH has a Gröbner representation in terms of F.
Algorithm 55* (Möller).*
A completion of F can be inductively computed by
mimicking the construction of Theorem 48
as follows: the result being trivial if #F=1, we can assume to have
already obtained a completion C(F×) of F×={g1,…,gs−1},s≤u; for each maximal subset H⊂{1,…,s}, if s∈/H we
can take as fH the corresponding element in C(F×).
If instead s∈H, then H× is maximal in F× for
T(H×) and τH×∣τH; thus there is a corresponding element
fH× in C(F×);
let us compute the values s,t,d∈R such that
[TABLE]
and define
fH:=sτH×τH⋆fH×+tτsτH⋆gs
which satisfies M(fH)=dT(H)=dτHϵH so that
it is sufficient to substitute fH× with its Gröbner
representation, to obtain the required Gröbner representation of fH.
\sqcap$$\sqcup
Proposition 56** (Möller).**
With the present notation
and under the assumption that R is a principal ideal domain,
the following conditions are equivalent:
F* is a Gröbner basis of M;*
2. 2.
a completion of F is a strong Gröbner basis of M.
Proof.
(1)⟹(2)
Let f∈M and let
f=∑i=1uhi⋆gi be a Gröbner representation;
denoting H:={j:T(hj⋆gj)=T(f)=:τϵ} we have
τH∣τ,ϵH=ϵ.
Thus, setting
υj:=τjτ,ωj:=τjτH for each j and
λ:=τHτ we have
[TABLE]
so that
αλ(lc(fH))=αλ(cH)∣lc(f)
and lc(f)=dαλ(lc(fH)) with d∈R. In conclusion we have
M(f)=dλ∗M(fH).
(2)⟹(1)
Let f∈M and let
f=K⊂H(F)∑cKτKfK be a strong Gröbner
representation of it in terms of
a completion of F; it is sufficient to substitute
each fK with a Gröbner
representation of it in terms of F to obtain the required representation.
\sqcap$$\sqcup
Example 57*.*
In the ring of Examples 17 and 35, we finally have (see Remark 36)
Let us still assume that the Zacharias domain R is a principal ideal domain
and we will use freely notations as
M(i),M(i,j),M(i,j,k),1≤i,j,k≤u, instead of
M({i}),M({i,j}),M({i,j,k}); we can then easily apply to the present setting the reformulation and improvement by Gebauer–Möller [18] of
Buchberger Criteria [9].
However we must be aware that in this context, there is no chance of reformulating
Buchberger’s First Criterion.
Remark 59*.*
In fact we should at least require that
[TABLE]
id est not only lcm(τi,τj)=τi∘τj=τj∘τi which is trivially true but also
[TABLE]
This essentially requires ci∣ατj(ci) and cj∣ατi(cj) whence ατj=Id; this suggests that Buchberger’s First Criterion hardly can be applied except for the case of the commutative ring P=R[Y1,…,Yn],R a PIR, where it is stated as
If F⊂P and I(F) is an ideal of P, it holds
[TABLE]
Note that the proof which considers the trival sysygies gigj−gjgi=0 holds only to the classical polynomial ring case.
\sqcap$$\sqcup
Definition 60**.**
A useful S-pair set
for F is any
subset
[TABLE]
such that
{b(i,j):{i,j}∈GM} is a Gebauer–Möller set for F.
Corollary 61**.**
With the present notation, under the assumption that
R is a principal ideal domain, F is a Gröbner basis of the left module M iff, denoting
GM a useful S-pair set for F,
each S-polynomial B(i,j),{i,j}∈GM has
a Gröbner representation in terms of F.
\sqcap$$\sqcup
Proof.
By definition
{b(i,j):{i,j}∈GM} is a Gebauer–Möller set for F so that,
by Theorem 33,
F is a Gröbner basis of M iff
each S-polynomial B(i,j),{i,j}∈GM has
a Gröbner representation in terms of F.
\sqcap$$\sqcup
An S-element
b(i,j),1≤i<j≤u,eli=elj, and the related S-pair {i,j} are
called redundant
if either
(a).
exists k>j, elk=eli=elj such that
[TABLE]
2. (b).
or exists k<j,elk=eli=elj:μ(j,k)∣μ(i,j)=μ(k,j).
\sqcap$$\sqcup
Lemma 63** (Möller).**
The following holds
for each i,j,k:1≤i,j,k≤u,eli=elj=elk, it holds
[TABLE]
2. 2.
{{\mathfrak{R}}}:=\bigl{\{}b(i,j),1\leq i<j\leq u,{\bf e}_{l_{i}}={\bf e}_{l_{j}}\mbox{\ and not redundant}\bigr{\}}*
is a useful S-element set.*
3. 3.
Let G:={g1,…,gs},s≤u, and let
[TABLE]
be a useful S-pair set for G∗={g1,…,gs−1}.
Let M:={μ(j,s):1≤j<s,elj=els} and let
M′⊂M be the set of the elements μ:=μ(j,s)∈M such
that there exists μ(j′,s)∈M:μ(j′,s)∣μ(j,s)=μ(j′,s).
For each μ:=M(j,s)∈M∖M′
let iμ,1≤iμ<s, be such that
μ=M(iμ,s).
Then
(cf. [30, Lemma 25.1.8]) In order to prove the claim by induction, it is sufficient to show
that, for each redundant {i,j},1≤i<j≤u,eli=elj=:ϵ,
there are
In order to show this, we only need to consider the representation
[TABLE]
and to prove that
[TABLE]
this happens (according to the two cases of the definition)
because
(a)
τ(i,k)∣τ(i,j,k)=τ(i,j)=τ(i,k) implies
{i,k}≺{i,j} and the same argument proves {j,k}≺{i,j};
2. (b)
the same argument as that above proves {j,k}≺{i,j}, while
{i,k}≺{i,j} because τ(i,k)≤τ(i,j) and k<j.
3. 3.
(cf. [30, Lemma 25.1.9])
Let i<s,eli=els=:ϵ,μ:=μ(i,s). Then:
–
if there exists μ′∈M such that μ(iμ′,s)=μ′∣μ(i,s)=μ′, then since iμ′<s, {i,s} is redundant;
–
if i=iμ then {im,s}∈GM;
–
if i=iμ then
b(i,s)=μ(i,iμ)μ(i,iμ,s)b(i,iμ)−b(iμ,s).
\sqcap$$\sqcup
Corollary 64**.**
With the present notation, under the assumption that
R is a principal ideal domain,
F is a Gröbner basis of M iff
each S-polynomial B(i,j),{i,j}∈R has
a Gröbner representation in terms of F.
\sqcap$$\sqcup
Thus the redundant elements are b(2,3) via 1 or 4, b(1,2) via 4 and b(1,4) via 3.
But, as it is well-known, it is more efficient (if else for storing considerations) the algorithm sketched in Lemma 63.3 which
for s=2
stores (1,2),
for s=3
stores (1,3),
for s=4
removes
(1,2) and stores (2,4) and (3,4).
Thus the Gebauer Möller set is still
[TABLE]
while
[TABLE]
\sqcap$$\sqcup
7 Weispfenning Completions for Bilateral Gröbner basis for Multivariate Ore Extensions of Zacharias Domains
7.1 Kandri-Rody–Weispfenning completion
The most efficient technique for producing bilateral Gröbner bases G:=I2(F) in a noetherian Ore extension is
Kandri-Rody–Weispfenning completion [21]. Iteratively:
–
Repeat
–
Compute a left-Gröbner basis G of the ideal IL(F);
–
for each g∈G,1≤i≤n, compute the normal form NF(g⋆Yi,IL(F)) of
g⋆Yi w.r.t. G;
–
set H:={NF(g⋆Yi,IL(G)),g∈G,1≤i≤n}, F:=G∪H
until H=∅.
The rationale of the algorithm is
Lemma 66** (Kandri-Rody–Weispfenning).**
For G⊂R the following conditions are equivalent:
IL(G)=I2(G);
2. 2.
for each τ∈T and each g∈G, g⋆τ∈IL(G);
3. 3.
for each i,1≤i≤n, and each g∈G, g⋆Yi∈IL(G).
Proof.
(1)⟹(2)⟺(3)
is trivial.
(2)⟹(1)
B2(G):={λ⋆g⋆ρ:λ,ρ∈T,g∈G}
is an R-linear basis of I2(G) and satisfies
[TABLE]
\sqcap$$\sqcup
7.2 Weispfenning: Restricted Representation and Completion
We can wlog assume that R is effectively given as a quotient R=R/I of a
free monoid ring R:=Z⟨v⟩ (over Z and the monoid ⟨v⟩ of all words over the alphabet v) modulo a bilateral ideal I.
We must restrict ourselves to the case in which < is a sequential term-ordering, id est for each τ∈T, the set {ω∈T:ω<τ} is finite.
Let M be the bilateral module M:=I2(F)
and IW(F) the restricted module
[TABLE]
If every f⋆αυ(v),f∈F,v∈v,υ∈T,υ<Ω, has a restricted representation in terms of F w.r.t. a sequential term-ordering <, then
every f⋆r,f∈F,r∈R, has a restricted representation in terms of F w.r.t. <.
Proof.
We can wlog assume r=∏i=1νvi,vi∈v and prove the claim by induction on ν∈N.
Thus we have a restricted representation in terms of F
[TABLE]
whence we obtain
[TABLE]
and since ρj<T(f)≤Ω each element
gij⋆αρj(vν) can be substituted with its restricted representation whose existence is granted by assumption.
\sqcap$$\sqcup
Lemma 68**.**
[52]** Under the same assumption, if, for each
gj∈F, both Yi⋆gj,1≤i≤n and each
gj⋆αυ(v),v∈v,υ∈T,υ<Ω, have a restricted representation in terms of F w.r.t. <, then IW(F)=M.
Proof.
It is sufficient to show that, for each f∈IW(F), both each
Yi⋆f∈IW(F),1≤i≤n and each f⋆r∈IW(F),r∈R.
By assumption f=∑jdjgij⋆ρj,dj∈R∖{0},ρj∈T,1≤ij≤u, so that
[TABLE]
by assumption each Yi⋆gij has a restricted representation in terms of F;
for the Lemma above, also each gij⋆αρj(r) has a restricted representation in terms of F.
\sqcap$$\sqcup
Let M be the bilateral module M:=I2(F)
and IW(F) the restricted module
[TABLE]
F* is the bilateral Gröbner basis of M iff*
denoting
GM(F) any restricted Gebauer–Möller set for F, each σ∈GM(F) has a restricted quasi-Gröbner representation
in terms of F;
2. 2.
for each
gj∈F, both Yi⋆gj,1≤i≤n and each
gj⋆αυ(v),v∈v,υ∈T,υ<Ω, have a restricted representation in terms of F w.r.t. <.
7.3 Gebauer-Möller sets for Restricted Gröbner bases
It is clear from Corollary 69 that the computation of a Gröbner bases can be obtained via Weispfenning’s completion, provided that we are able to produce restricted Gebauer-Möller sets; to do so, we need only to properly reformulate the results of Section 7.2.
We begin by remarking that for each monomial cτ∈M(R) the function
g↦cg⋆τ distributes, thus we can define a multiplication
⋄:R×R→R by setting
[TABLE]
which of course is commutative and thus, granting the trivial syzygy
[TABLE]
allows to recover Buchberger First Criterium.
As a consequence, we can define the notion of restricted Gröbner representation:
–
we say that f∈Rm∖{0} has a restricted Gröbner representation
in terms of G if it can be written as
f=∑i=1uli⋄gi,
with li∈R,gi∈G and
T(li)∘T(gi)≤T(f)\mboxforeachi.
Let us denote, for each i,j,1≤i<j≤u, eli=elj,
[TABLE]
and let us explicitly assume that
–
for each
gj∈F, both Yi⋆gj,1≤i≤n and each
gj⋆αυ(v),v∈v,υ∈T,υ<T(gj), have a restricted representation in terms of F w.r.t. <.
Lemma 70** (Buchberger’s First Criterion).**
If m=1, id est F⊂R and IW(F) is an ideal of R,
then
[TABLE]
Proof.
We will prove that BW(i,j) has a restricted Gröbner representation in terms of F; thus the result will follow by the equivalence
Proposition 19, (4)⟺(8).
Remark that
[TABLE]
satisfy
T(pi)<T(gi),T(pj)<T(gj).
Then it holds:
[TABLE]
and
[TABLE]
There are then two possibilities: either
–
M(pj)⋄M(gi)=M(pi)⋄M(gj) in which case
[TABLE]
and
[TABLE]
is a restricted Gröbner representation;
–
or M(pj)⋄M(gi)=M(pi)⋄M(gj),
T(BW(i,j))<T(pj)∘T(gi)=T(pi)∘T(gj), in which case
BW(i,j)=pj⋄gi−pi⋄gj would not be a Gröbner representation.
But the latter case is impossible: in fact, from
[TABLE]
we deduce
lcm(T(gi),T(gj))=T(gj)∘T(gi)
and T(i,j)=T(i)∘T(j)
contradicting the assumption
M(i,j)=M(i)⋄M(j).\sqcap$$\sqcup
Definition 71**.**
Denote
[TABLE]
A useful S-pair set for F is any
subset
[TABLE]
such that
{b(i,j):{i,j}∈GM∪Cu} is a Gebauer–Möller set for F.
Corollary 72**.**
With the present notation, under the assumption that
R is a principal ideal domain,
F is a Gröbner basis of M iff, denoting
GM a useful S-pair set for F,
each S-polynomial BW(i,j),{i,j}∈GM
has
a Gröbner representation in terms of F.
\sqcap$$\sqcup
Proof.
By definition
{bW(i,j):{i,j}∈GM∪Cu} is a Gebauer–Möller set for F so that,
by Theorem 33,
F is a Gröbner basis of M iff
each S-polynomial BW(i,j),{i,j}∈GM∪Cu has
a Gröbner representation in terms of F.
The claim is a direct consequence of Buchberger’s First Criterion which states that for each {i,j}∈Cu, BW(i,j) has a weak Gröbner
representation in terms of F.
\sqcap$$\sqcup
Definition 73**.**
An S-element
b(i,j),1≤i<j≤u,eli=elj, and the related S-pair {i,j} are
called redundant
if either
(a).
exists k>j, elk=eli=elj such that
[TABLE]
2. (b).
or exists k<j,elk=eli=elj:M(j,k)∣M(i,j)=M(j,k).
\sqcap$$\sqcup
Lemma 74** (Möller).**
The following holds
for each i,j,k:1≤i,j,k≤u,eli=elj=elk, it holds
[TABLE]
2. 2.
{{\mathfrak{R}}}:=\bigl{\{}b(i,j),1\leq i<j\leq u,{\bf e}_{l_{i}}={\bf e}_{l_{j}}\mbox{\ and not redundant}\bigr{\}}*
is a useful S-element set.*
3. 3.
Let G:={g1,…,gs},s≤u, and let
[TABLE]
be a useful S-pair set for G∗={g1,…,gs−1}.
Let M:={M(j,s):1≤j<s,elj=els} and let
M′⊂M be the set of the elements μ:=M(j,s)∈M such
that either
–
there exists M(j′,s)∈M:M(j′,s)∣M(j,s)=M(j′,s) or
–
(in case M is an ideal) there exists iμ,1≤iμ<s:
[TABLE]
For each μ:=M(j,s)∈M∖M′
let iμ,1≤iμ<s, be such that
μ=M(iμ,s).
Then
(cf. [30, Lemma 25.1.8]) In order to prove the claim by induction, it is sufficient to show
that, for each redundant {i,j},1≤i<j≤u,eli=elj=:ϵ,
there are
In order to show this, we only need to consider the representation
[TABLE]
and to prove that
[TABLE]
this happens (according to the two cases of the definition)
because
(a)
τ(i,k)∣τ(i,j,k)=τ(i,j)=τ(i,k) implies
{i,k}≺{i,j} and the same argument proves {j,k}≺{i,j};
2. (b)
the same argument as that above proves {j,k}≺{i,j}, while
{i,k}≺{i,j} because τ(i,k)≤τ(i,j) and k<j.
3. 3.
(cf. [30, Lemma 25.1.9])
Let i<s,eli=els=:ϵ,μ:=M(i,s). Then:
–
if there exists μ′∈M such that M(iμ′,s)=μ′∣M(i,s)=μ′, then since iμ′<s, {i,s} is redundant;
–
if i=iμ and M(iμ)⋄M(s)=M(iμ,s), then
(M is an ideal)
bW(iμ,s)∈Cs so that BW(iμ,s) has a restricted Gröbner
representation in terms of G by Buchberger’s First Criterion;
–
if i=iμ and M(iμ)⋄M(s)=M(im,s) then {im,s}∈GM;
–
if i=iμ then
b(i,s)=⋄M(i,iμ,s)M(i,iμ)b(i,iμ)−b(iμ,s).
\sqcap$$\sqcup
Corollary 75**.**
With the present notation, under the assumption that
R is a principal ideal domain,
F is a restricted Gröbner basis of M iff
each S-polynomial BW(i,j),{i,j}∈R, has
a restricted Gröbner representation in terms of F;
2. 2.
for each
gj∈F, both Yi⋆gj,1≤i≤n and each
gj⋆αυ(v),v∈v,υ∈T,υ<T(gj), have a restricted representation in terms of F w.r.t. <.
\sqcap$$\sqcup*
8 Structural Theorem for Multivariate Ore Extensions of Zacharias PIDs
Theorem 76** (Structural Theorem).**
Let R be a left Zacharias principal ideal domain, R:=R[Y1,…,Yn] a multivariate Ore extension of R,
< a term-ordering, M⊂Rm a left module generated
by a basis
F:={g1,…,gu}⊂M, M(gi)=ciτieli,
C(F) a completion of F,
R:={B(i,j),1≤i<j≤u,eli=elj\mboxandnotredundant}.
Then the following conditions are equivalent:
(1).
F* is a left Gröbner basis of M;*
2. (1s).
C(F)* is a left strong Gröbner basis of M;*
3. (2).
B(F):={λg:λ∈T,g∈F}* is a Gauss generating
set [30, Definition 21.2.1];*
4. (3).
f∈M⟺* it has a left Gröbner representation in terms of F;*
5. (4).
f∈M⟺* it has a left strong Gröbner representation in terms of C(F);*
6. (5).
for each f∈Rm∖{0} and any normal form
h of f w.r.t. F, we have
[TABLE]
7. (5s).
for each f∈Rm∖{0} and any strong normal form
h of f w.r.t. C(F), we have
[TABLE]
8. (6).
for each f∈Rm∖{0},f−Can(f,M) has a strong
Gröbner representation in terms of C(F);
9. (7).
each B(i,j)∈R has a weak Gröbner
representation in terms of F;
10. (8).
for each element σ of a Gebauer–Möller set for F,
the S-polynomial SL(σ) has a left quasi-Gröbner representation in terms of F.
of a free assocative algebra,
a general approach is to directly apply Spear’s Theorem [48] [30, Proposition 24.7.3] [28], which, while not a tool for computation, can be helpful in order to understand
the structure of A.
For the present setting, denoting
–
fij:=YjYi−αj(Yi)Yj−δj(Yi),1≤i<j≤n,
–
C:={fij:1≤i<j≤n};
–
I:=I2(C)
and for each m∈N,
–
{e1,…,em} the canonical basis of Rm,
–
C(m):={fijι:=fijeι:1≤i<j≤n,1≤ι≤m},
we have the presentation
[TABLE]
and, for each free R-module Rm,m∈N,
the projection Π extends to the canonical projections, still denoted Π,
if F⊂R[Y1,…,Yn]m, so that in particular Π(f)=f for each f∈F,
is the Gröbner basis of M, then F⊔C(m) is a Gröbner basis of M′.
3. 3.
Assume each m′∈M′ has a Gröbner representation in terms of F⊂M′.
Set
[TABLE]
where
Can(g,Im)∈R[Y1,…,Yn]m denotes the canonical form of g∈Qm w.r.t.
C(m) so that in particular g=Π(g) for each g∈Fˉ.
Then each
m∈M
has a Gröbner representation in terms of Fˉ.
4. 4.
if F⊂R[Y1,…,Yn]m, so that in particular Π(f)=f for each f∈F,
is such that each
m∈M
has a Gröbner representation in terms of F, then
each m′∈M′
has a Gröbner representation in terms of F⊔C(m).
Corollary 79**.**
[28, Corollary 14]** With the present notation and considering
–
the bilateral R-module (R⊗R^Rop)u with canonical basis
{e1,…,eu}
–
the bilateral Q-module (Q⊗R^Qop)∣F∣+m∣G∣ with canonical basis
[TABLE]
–
the projections S2:(R⊗R^Rop)∣F∣→Rm:S2(ei)=gi,1≤i≤u, and
–
S^2:(Q⊗R^Qop)∣F∣+m∣C∣→Qm:**
[TABLE]
–
the map
[TABLE]
(where each
λ,ρ∈R⟨Y1,...,Yn⟩,a,b∈R∖{0})
[TABLE]
if Σ⊂(Q⊗R^Qop)∣F∣+m∣C∣
is a bilateral standard basis of ker(S^2), then
Πˉ(Σ) is a bilateral standard basis of ker(S2).
10 Lazard Structural Theorem for Ore Extensions over a Principal Ideal Domain
Let D be a commutative principal ideal domain, R:=D[Y;α,δ] be an Ore extension and
I⊂R be a bilateral ideal.
Let F:={f0,f1,…,fk} be a reduced minimal strong bilateral Gröbner basis of I ordered so that
[TABLE]
and let us denote, for each
i,
ci:=lc(fi),
ri∈D∖{0} and pi∈R the content333Defined here as the greatest common divisor of the coefficients of fi in the principal ideal domain D . and the primitive of fi so that fi=ripi;
denoting P:=p0 the primitive part of f0
and Gk+1:=rk∈D∖{0} the content of fk we have
Theorem 80**.**
With the present notation, for each i,0≤i<k, there is Hi+1∈R,d(i):=deg(Hi) and Gi∈D∖{0} such that
–
f0=G1⋯Gk+1P,**
–
fj=Gj+1⋯Gk+1HjP,1≤j≤k,**
and
0<d(1)<d(2)<⋯<d(k);
2. 2.
Gi∈D,1≤i≤k+1, is such that ci−1=Gici
3. 3.
P=p0* (the primitive part of f0∈R);*
4. 4.
Hi∈R* is a monic polynomial of degree d(i), for each i;*
5. 5.
Hi+1∈(G1⋯Gi,G2⋯GiH1,…,Gj+1⋯GiHj,…,Hi−1Gi,Hi)* for all i.***
6. 6.
ri=Gi+1⋯Gk.
Proof.
Let P and Gk+1 be, resp.,
the greatest common right divisor of {p0,…,pk} in R
and the greatest common divisor of {r0,…,rk} in D;
since a set {g0,…,gk} is a minimal strong Gröbner basis if and only if the
same is true for {rg0g,…,rgkg}, r∈D,g∈R, we can left divide by Gk+1 and right
divide by P and assume wlog
that P=Gk+1=1 and that both the greatest common right divisor of {p0,…,pk}
and the greatest common divisor of {r0,…,rk} are 1.
Setting d(i):=deg(fi) and
ν(i):=d(i+1)−d(i) for each i, by assumption we have
d(i)≤d(i+1).
If d(i)=d(i+1), let us define
[TABLE]
where c,bi,bi+1∈D are such that
bici+bi+1ci+1=c, c being the greatest common divisor of ci and ci+1,
so that cYd(i+1)=M(h)∈M(I);
this implies the existence of j such that M(fj)∣M(h)∣M(fi+1)
contradicting minimality; thus d(i)<d(i+1) and this, in turn, implies (1) since
d(i)=d(i)−deg(P).
Both fiYν(i) and fi+1 are
in the ideal and have degree d(i+1).
Therefore, for
c,bi,bi+1∈D such that
bici+bi+1ci+1=c, c being the greatest common divisor of ci and ci+1,
h:=bifiYd(i+1)−d(i)+bi+1fi+1∈I,
so that
cYd(i+1)=M(h)∈M(I)
and M(fj)∣M(h) for some j. If
ci+1=c, necessarily deg(fj)<deg(fi+1) whence j<i+1 and
M(fj)∣M(h)∣M(fi+1) getting a contradiction.
As a conclusion ci=Gi+1ci+1, for some Gi+1∈D and (2).
Since Gi+1fi+1−fiYν(i) is a polynomial of degree less than
d(i+1) which reduces to zero by the Gröbner basis, it follows that
[TABLE]
thus, inductively we obtain
[TABLE]
Also
[TABLE]
Therefore, the assumptions that the greatest common right divisor of {p0,…,pk}
and the greatest common
divisor of {r0,…,rk} are 1
imply that
p0=ck=1 proving (3); thus in particular f0=c0 so that c0∣f0 and this is sufficient to deduce, by the inductive argument, that each ci left-divides
fi and therefore coincides with ri.
Inductively we obtain
[TABLE]
thus proving (6);
defining Hi the polynomial s.t. ciHiP=fi for all i we have lc(Hi)=1 (proving (4)), d(i)+deg(P)=deg(fi) and
Gi+1fi+1∈(f0,…,fi) which proves (5) dividing out Gi+1⋯Gk.
\sqcap$$\sqcup
Appendix A The PIR case
While an understandable timor restrained us to violate Ore’s tabu requiring degree preservation of product, it is well-known that Zacharias–Möller results are naturally stated for polynomials over PIRs and the restriction to PIDs is unnatural; we therefore sketch here the few modifications to the theory which are required in order to adapt it to Ore extensions R over a PIR R.
The first delicate adaptation is required by formula (4); the natural solution is due to Gateva [15, 16, 17] which considered valuation over the semigroup with zero T∪{o} instead of T setting
[TABLE]
Her theory however apply only to domains.
Thus in order to extend Corollary 15 we need to reformulate it as
Corollary 15**.**
If ≺ is a term ordering on T
and < is a ≺-compatible
term ordering on T(m),
then, for each l,r∈R and f∈R(m),
T(l⋆f)≤T(l)∘T(f)* equality holding provided that lc(l)lc(f)=0;*
5. 5.
T(f⋆r)≤T(f)∘T(r)* equality holding provided that lc(f)lc(r)=0;*
6. 6.
T(l⋆f⋆r)≤T(l)∘T(f)∘T(r)* equality holding provided that lc(l)lc(f)lc(r)=0.*
If, moreover, R is a domain, then
T(l⋆f)=T(l)∘T(f);
2. 8.
T(f⋆r)=T(f)∘T(r);
3. 9.
T(l⋆f⋆r)=T(l)∘T(f)∘T(r).
As regards Gröbner basis computation we remark that the first and the third algorithms (Section 6.1 and 6.3 ) apply verbatim also in the PIR case; in the algorithm in fact we have {i}∈H(F) for each i,1≤i≤u and thus each m:=T(gi)∈H is treated by the algorithm which (if the basis is minimal) produces also the annihilitator syzygy
[TABLE]
where we denote, for each i≤u, ai∈R the annihilator of I(ci).
In the second algorithm (Section 6.2) the inductive seed becomes
[TABLE]
and, for each s,1<s≤u,
{s} is basic for T(gs) provided the basis is minimal.
Therefore
Corollary 49**.**
Assuming that the Zacharias ring R is principal and denoting, for each i,j,1≤i<j≤u, eli=elj,
[TABLE]
we have that
[TABLE]
is a Gebauer–Möller set for
F,
so that
F is a Gröbner basis of M, iff
each B(i,j), 1≤i<j≤u,eli=elj,
and each A(i),i≤u,
has a weak Gröbner
representation in terms of F.
\sqcap$$\sqcup
Corollary 51**.**
Assuming that the Zacharias ring R is principal and
that each αi is an automorphism
denoting, for each i,j,1≤i<j≤u, eli=elj,
[TABLE]
we have that
[TABLE]
is a Gebauer–Möller set for F,
so that
F is a right Gröbner basis of M, iff
each B(i,j), 1≤i<j≤u,eli=elj, and each A(i),i≤u, has a right weak Gröbner
representation in terms of F.
\sqcap$$\sqcup
Corollary 58**.**
With the present notation, under the assumption that
R is a principal ideal ring,
F is a Gröbner basis of I iff, denoting
GM a useful S-pair set for F,
each S-polynomial B(i,j),{i,j}∈GM, and each A(i),1≤i≤u,
has
a Gröbner representation in terms of F.
\sqcap$$\sqcup
Corollary 61**.**
With the present notation, under the assumption that
R is a principal ideal domain,
F is a Gröbner basis of M iff
each S-polynomial B(i,j),{i,j}∈R, and each A(i),1≤i≤u,
has
a Gröbner representation in terms of F.
\sqcap$$\sqcup
Corollary 62**.**
With the present notation, under the assumption that
R is a principal ideal ring,
F is a Gröbner basis of M iff
each S-polynomial BW(i,j),{i,j}∈R, and each A(i),1≤i≤u,
has
a restricted Gröbner representation in terms of F;
3. 3.
for each
gj∈F, both Yi⋆gj,1≤i≤n and each
gj⋆αυ(v),v∈v,υ∈T,υ<T(gj), have a restricted representation in terms of F w.r.t. <.
\sqcap$$\sqcup*
Finally we remark that a
Lazard Structural Theorem for Ore Extensions over a Principal Ideal Domain can be easily obtained by adapting the result given by Norton–Sălăgean [35, 36], [30, § 33.3] for polynomial rings.
Bibliography53
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Apel J., Gröbnerbasen in Nichetkommutativen Algebren und ihre Anwendung , Dissertation, Leipzig (1988)
2[2] Apel J., Computational ideal theory in finitely generated extension rings , Theor. Comp. Sci. 224 (2000), 1–33
3[3] Apel J., Lassner, W., An Algorithm for calculations in enveloping fields of Lie algebras , In: Proc. Int. Conf. on Comp. Algebra and its Appl. n Theoretical Physics JINR D 11-85-792 , Dubna (1985) 231–241
4[4] Apel J., Lassner, W., Computation and Simplification in Lie fields , L. N. Comp. Sci. 378 (1987), 468–478, Springer
5[5] Bergman G.H., The Diamond Lemma for Ring Theory , Adv. Math. 29 (1978), 178–218
6[6] E. Byerne, Gröbner bases over commutative rings and Applications to coding theory in M. Sala et al. (Ed.) Gröbner bases, Coding, Cryptography , Springer Risc XVI, (2009). 239–262
7[7] Buchberger B., Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal , Ph. D. Thesis, Innsbruck (1965)
8[8] Buchberger B., Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleischunssystem , Aeq. Math. 4 (1970), 374–383