2
$\begingroup$

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.

  • 1
    Almost a duplicate: http://math.stackexchange.com/questions/24425/irreducible-homogeneous-polynomials-of-arbitrary-degree/24426#244262011-03-02

1 Answers 1

6

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$.

  • 0
    *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$2011-11-06