# ideals

## An overview

In Macaulay2, once a ring (see rings) is defined, ideals are constructed in the usual way by giving a set of generators.

For those operations where we consider an ideal as a module, such as computing Hilbert functions and polynomials, syzygies, free resolutions, see modules.

For additional common operations and a comprehensive list of all routines in Macaulay2 which return or use ideals, see Ideal.

The following link differs from the previous one in case only: ideal.