saturate(I, J)
saturate I
If $I$ is either an ideal or a submodule of a module $M$, the saturation $I : J^\infty$ is defined to be the set of elements $f$ in the ring or $M$ such that $f J^N$ is contained in $I$, for some $N$ large enough.
For example, one way to homogenize an ideal is to homogenize the generators and then saturate with respect to the homogenizing variable.
|
|
|
|
We can use this command to remove graded submodules of finite length.
|
|
|
If $I$ and $J$ are both monomial ideals, then a faster algorithm is used. Otherwise, when needed, Gröbner bases will be computed, and if the computation succeeds the result is cached inside the first argument. Partial computations are not yet cached, but this may change in a future version.
The object saturate is a method function with options.
The source of this document is in Saturation/saturate-doc.m2:139:0.