be the system of equations we want to solve in
.
Let
,
be vectors in the right
-module
.
Hence we can abbreviate the system of inhomogeneous equations by
(4)
In order to describe the generating set of solutions we have to find one solution of
the inhomogeneous system 4
and if possible a finite set of generators for the solutions of the homogeneous system
(5)
We can proceed as described in the previous section.
Of course now the prefix Gröbner bases are bases of submodules in the right
-module
, i.e., their
elements are vectors
in
.
Let
be a finite reduced prefix Gröbner basis of the right submodule
generated by
in
, and
,
the corresponding vectors of course now in
respectively
.
There are two linear mappings given by matrices
,
such that
and
.
Equation 4 is solvable if and only if
which
is again decidable using prefix reduction with respect to .
Let
be a generating set for the solutions of the
homogeneous system
(6)
and let be the identity matrix.
Further let
be the columns of the matrix
.
Since
these are solutions of the homogeneous system 5 as well.
We can even show that the set
generates all solutions of 5:
Let
be an arbitrary solution of system 5,
i.e.
.
Then
is a solution of system 6 as
.
Hence there are
such that
.
Further we find
and hence is a right linear combination of elements in
.
Now the important part is to find a generating set for the solutions of the homogeneous
system 6.
Let
be a finite reduced prefix Gröbner basis of the
right submodule generated by
.
Notice that for vectors the head term is defined to be the polynomial in the
first non-zero component.
We define
where for and ,
.
See Section 5 for details how to realize a reduction relation for the module case.
Hence we get
and
.
As before we have to distinguish two cases.
For every
with
such that
is a prefix (as a word) of
,
i.e.
for some
, by Lemma 8
we know
for some
.
We determine vectors as follows:
where the polynomials
are due to the reduction sequence
.
Then
, where
Lemma 3
The finitely many vectors
,
,
form a right generating set for all solutions of system 6.
Proof :
1.1
Let
be an arbitrary (non-trivial) solution of 6.
We proceed by showing for all
as follows:
Let
be the maximal term when concatenating the head terms of the multiples in the sum
and the number of multiples
with
and
.
A solution is called smaller than if either or and
.
We will prove our claim by induction on and 4.
Since we assume to be a non-trivial solution, we know .
Then following the lines of the proof of Lemma 2 we can distinguish two cases:
If there is
such that
,
then
,
,
and
for some
,
.
Then
with
, is again a solution of 6.
It remains to show that it is a smaller one.
To see this we have to examine the multiples
for all
where
and
:
For we get
and as
and the resulting monomials
add up to zero we get
5.
For we get
and either
if
or else
Hence either or is decreased.
Let us now assume there are
such that
and
,
with
.
Without loss of generality we can assume that
for some
.
Then by Lemma 8 we know that
for some
.
For the corresponding s-polynomial
we have a vector
and we can define
where
with
.
It remains to show that this solution indeed is smaller.
To do this we examine the multiples
for all
where
and
.
For we get
and by Lemma 8
.
Hence
implying either
if
or else
.