Macaulay2 » Documentation
Packages » Macaulay2Doc » ideals » Ideal » MonomialIdeal » monomialSubideal
next | previous | forward | backward | up | index | toc

# monomialSubideal -- find the largest monomial ideal in an ideal

- Usage:
    `monomialSubideal I`
- Inputs:
  - I, an ideal
- Outputs:
  - a monomial ideal, the largest monomial ideal contained in I

## Description

    i1 : QQ[a,b,c,d];

    i2 : I = ideal(b*c, c^2 - b*d, -a*c+b^2)

                      2         2
    o2 = ideal (b*c, c  - b*d, b  - a*c)

    o2 : Ideal of QQ[a..d]

    i3 : monomialSubideal I

                         3          2   3          2
    o3 = monomialIdeal (b , b*c, a*c , c , a*b*d, b d, a*c*d)

    o3 : MonomialIdeal of QQ[a..d]

Implemented by Greg Smith.

## Ways to use monomialSubideal:

- `monomialSubideal(Ideal)`

## For the programmer

The object monomialSubideal is a method function.

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/Macaulay2Doc/functions/monomialIdeal-doc.m2:296:0.