decompose an ideal into zero-dimensional ideals
The ZeroDimensionalDecomposition command computes a sequence of zero-dimensional ideals, some of which may lie in extended polynomial rings. That is, to make the resulting ideals zero-dimensional, ring variables can be moved into the coefficient field. If the ideals in the resulting sequence are contracted back to the original ring and intersected, you get the original ideal. In general, this decomposition is not unique.
This command allows you to run algorithms for zero-dimensional ideals on ideals of positive Hilbert dimension. Be aware that some algorithms do not interact well with the extension and contraction process. In particular, you cannot use this process to directly test whether an ideal is radical because the decomposition of a radical ideal may contain non-radical components that vanish under contraction and intersection. Valid applications include solving, testing whether an ideal is prime or primary, and computing prime or primary decompositions or radical of an ideal.
J ≔ x⁢y−y
zdd ≔ ZeroDimensionalDecomposition⁡J
K ≔ −2⁢y3+3⁢x3⁢z,−y2⁢z2
zdd ≔ ZeroDimensionalDecomposition⁡K
L ≔ x−y,x3−y⁢z⁢w
L2 ≔ x2−y,x3−y⁢z⁢w
Becker, T., and Weispfenning, V. Groebner Bases. New York: Springer-Verlag, 1993.
Download Help Document
What kind of issue would you like to report? (Optional)