Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. 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

I am seeking methods to see if a polynomial $f \in O(\mathbb{C^2},0)$ is irreducible. The subject is really new to my and I am studying for myself, for which I don't see about this subject.

would thank them a lot they could provide me some bibliography where to read about this topic

share|cite|improve this question
What sort of "methods", theoretical, algorithms? For what intended applications? You need to say more to get a good answer. – Bill Dubuque Sep 14 '10 at 0:49
uy! really any method is welcome, Believe me, I would read. I'm reading a book about desingularizacion of vector fields, this book gives a result about how to calculate the multiplicity of intersection of two divisors, the theorem says roughly the following: Let Editing wait.... – Keinohrhasen Sep 14 '10 at 0:57
Theorem: The intersection of an irreducible local divisor $D_f$ with another effective local divisor $D_g$ is isolated if and only if the germ $g\left( \tau \right) $ is not identically zero, and multiplicity $D_{f}\overset{0}{.}D_{g}$ of this intersection is equal to ther order $ord_{0}\left( g\left( \tau \right) \right) $ I need examples, therefore, need to read a little about the criteria for irreducible polynomials in two complex variables – Keinohrhasen Sep 14 '10 at 1:06

Here's one idea: if $f(x, y)$ is reducible, then the projective closure of $f(x, y) = 0$ has at least two components, which intersect by Bezout's theorem. These intersections are singularities and therefore can be found by setting all partial derivatives to zero. If no singularities exist then $f$ is irreducible.

share|cite|improve this answer
thank you very much, I'm chewing the idea – Keinohrhasen Sep 14 '10 at 3:39

Your Answer


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