The Operators subpackage provides access to Add, Multiply, and Quotient as binary operators.  An exponentiation operator, which uses binary powering on Multiply, is also provided.  These operators are intended for interactive use with small examples.

Note: The `in` and `subset` operators are bound to the IdealMembership and IdealContainment routines when the PolynomialIdeals package is loaded. They are not part of the Operators subpackage.

The arithmetic operators accept ordinary expressions as well as ideals.  Wherever an expression f is encountered, the operators construct <f> in an appropriate polynomial ring.

Unlike their respective commands in PolynomialIdeals, the arithmetic operators simplify their results to a canonical form using reduced Groebner bases. The Simplify command is also rebound so that it simplifies ideals to this same canonical form.  The parent PolynomialIdeals package command behavior of Simplify can still be accessed through the long form PolynomialIdeals[Simplify].

Operator overloading and the simplification of ideals to a canonical form is often very expensive and may be impractical for problems of even a moderate size.  In this case, don't use these operators.  Use the Add, Multiply, and Quotient commands in the parent PolynomialIdeals package, and apply the Simplify command selectively.

These operators are part of the Operators subpackage, and can be used in their binary form only after executing with(PolynomialIdeals[Operators]), or inside a use statement.