Go backward to `desing/inverse` Go up to Procedures Go forward to `desing/isempty`

`desing/iscontained`

Testing whether a given ideal is contained in another one.

Input:

 

A, B

a list of polynomials from k[S] (representatives of the generators of an ideal in k[S]/<DEP>),

DEP

a list of polynomials from k[S],

S

a list of variables.

Output:

true iff <B> contains <A> in k[S]/<DEP>.