Given a specialization ,
we will say that an
ordering > on the monomials of
is -admissible if it is a
block ordering with respect to
and
,
and
,
i.e., if >1 (resp.
>2) is the restriction of > to the
-variables (resp. to
the
-variables), then:
for all
and for all
.
For a subset H of
,
Lt(H) denotes the
ideal generated by
,
where lt(f) denotes the leading
term of f. If
is a specialization then
(
)
will denote
where
is the biggest
-monomial in f. Thus
will denote the ideal generated by
.
Theorem 1 ([7])
Let
be an ideal,
a specialization and G a Gröbner basis for I with respect to a
-admissible ordering. If
(1)
then
is a Gröbner basis for
Remark that, as G is a Gröbner basis of I, we can write
, and, therefore, we know the generators of
the ideal to the right of the equality (1),
:
However, we
do not have a
finite representation of the ideal to the left
-- unless
we know a priori a Gröbner basis of
-- but finding this
is the purpose of our computations.
In the zero-dimensional and univariate case (
and n=1) the results here described can be stated
in a very practical way, avoiding any test.
Theorem 2 ([7])
Let
be a zero
dimensional ideal and n=1, i.e.
.
Let
be a specialization. If G is a Gröbner basis for I with
respect to a -admissible ordering then
is a Gröbner
basis for
.