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

how can one show (hopefully in an elementary manner) that there exist irreducible polynomials of arbitrary degree and number of variables over arbitrary field?

thank you

P.S. induction?

EDIT: ehm, sorry, I meant for $n\geq2$, i.e. in at least two variables.

share|cite|improve this question
If the field is algebraically closed then only polynomials of degree $1$ are irreducible. – Asaf Karagila Mar 2 '11 at 18:04
Almost a duplicate:… – Qiaochu Yuan Mar 2 '11 at 20:02
up vote 6 down vote accepted

This is false. Any irreducible polynomial in one variable over an algebraically closed field (such as $\mathbb{C}$) has degree 1.

For $n \ge 2$, the answer is yes: just take the irreducible polynomial $y-x^d$.

share|cite|improve this answer
Proof: If $x_1\!-\!x_2^d\!=\!f(\bf x)g(\bf x)\!=\!(\sum_{\bf a}\alpha_{\bf a}\bf x^{\bf a})(\sum_{\bf b}\beta_{\bf b}\bf x^{\bf b})\!=\!\sum_{\bf a,\bf b}\alpha_{\bf a}\beta_{\bf b}\bf x^{\bf a+\bf b}$, then $fg$ would include a monomial with $x_1x_2$, a contradiction. $\blacksquare$ – Leon Nov 6 '11 at 9:30

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.