Macaulay2 » Documentation
Packages » MinimalPrimes » isPrime(Ideal)
next | previous | forward | backward | up | index | toc

isPrime(Ideal) -- whether an ideal is prime

Description

This function determines whether an ideal in a polynomial ring is prime.

i1 : R = QQ[a..d];
i2 : I = monomialCurveIdeal(R, {1, 5, 8})

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

o2 : Ideal of R
i3 : isPrime I

o3 = true

See also

Ways to use this method:


The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/MinimalPrimes/doc.m2:310:0.