put an ideal into a canonical form
polynomial ideal, or sequence of ideals
(optional) set of variables
(optional) monomial ordering
(optional) set of substitutions
(optional) set of inequations
The Simplify command attempts to simplify an ideal using a Groebner basis. It always detects whether the ideal is equivalent to the entire polynomial ring.
The Simplify command can be applied directly to sequences of ideals, but must be mapped onto lists and sets.
A monomial order, T, can be specified as an optional argument, forcing ideals into a canonical form.
The set of ring variables can also be overridden using an optional argument. If the new variables are a subset of the original ones, this computes the extension of the ideal in the new polynomial ring. The Contract command inverts this process when it is possible to do so. Groebner bases that are stored by the system are not preserved under this operation.
Simplify can optionally perform syntactic substitutions prior to the computation of a Groebner basis. This is equivalent to using the eval command on the ideal generators. Stored Groebner bases are not preserved under this operation.
Simplify can also simplify under the assumption that certain expressions are not equal. This functionality is equivalent to that of the Saturate command, and can be of great assistance on large problems.
J ≔ x4−x2+y6,x−y5,y2−x
K ≔ x2+y26,2⁢y−z⁢x2,z2⁢x⁢y
S ≔ x2−x+1,x−y,y2−y+1,y−x
Force a canonical form.
R ≔ z2+1−2⁢y−2⁢m+y2+2⁢y⁢m−3⁢m2,x2+y2−m2,1−2⁢x−2⁢m+x2+2⁢x⁢m+t2,2−2⁢z+z2+t2+2⁢t⁢m−2⁢t−2⁢m,5−6⁢m−4⁢z+m2+4⁢m⁢z+z2+4⁢t2−4⁢t−4⁢t⁢y−4⁢t⁢m+2⁢y+y2+2⁢y⁢m
R is a difficult system to solve.
R1 ≔ Simplify⁡R,m≠0:
R1 is much easier to solve.
Download Help Document