MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Varieties decompose uniquely into finitely many irreducibles, and each variety is generated by only finitely polynomials. These two finiteness properties make varieties seemingly "manageable" objects, and leads me to the question:

Can a computer, given a variety (finite set of polynomials) produce a list of its irreducible components (finite set of finite sets of polynomials) in finite time?

share|cite|improve this question
up vote 2 down vote accepted

This is just about primary decomposition! There are several CAS which can do that, for example Singular.

share|cite|improve this answer
Thanks, do you know if Mathematica has such a function? – Randomblue Oct 25 '09 at 12:23
I don't know Mathematica because I hate this Sin[] notation and so on :) Maple can do primary decompositions in polynomial rings (theoretically, I never used this). I think Sage just uses the interface to Singular. – user717 Oct 25 '09 at 12:41
Magma can do it too. – Qiaochu Yuan Oct 25 '09 at 13:36
As can Macaulay2. – Graham Leuschke Oct 25 '09 at 15:10

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.