PolynomialIdeals[Saturate] - saturate an ideal
|
Calling Sequence
|
|
Saturate(J, f, s)
|
|
Parameters
|
|
J
|
-
|
polynomial ideal
|
f
|
-
|
polynomial, or list or set of polynomials
|
s
|
-
|
(optional) name
|
|
|
|
|
Description
|
|
•
|
The Saturate command computes the saturation of an ideal J with respect to a polynomial f, denoted J:. Saturation removes all the solutions of f from J, and is equivalent to a repeated application of Quotient. This functionality is also available through the Simplify command.
|
•
|
If the second argument is a list or set of polynomials, then the Saturate command removes the solutions of each polynomial, or equivalently their product.
|
•
|
If the optional third argument s is given, it is assigned a positive integer exponent with the property that J:f^infinity = J:f^s. This value is not guaranteed to be minimal.
|
|
|
Examples
|
|
>
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
>
|
|
| (5) |
>
|
|
| (6) |
>
|
|
| (7) |
>
|
|
| (8) |
>
|
|
| (9) |
>
|
|
| (10) |
|
|
References
|
|
|
Becker, T., and Weispfenning, V. Groebner Bases. New York: Springer-Verlag, 1993.
|
|
|
Download Help Document
Was this information helpful?