0
$\begingroup$

In a few algebra books it is proved, that for every $n,m \in \mathbb N$ there are polynomials $f(x)$ of degree $n$ which are irreducible mod $m$. They are divisors of $x^{m^n}-x \ \text{(mod }m)$.

Is this still true, if I allow only polynomials with real roots?

Or do you have some counterexamples?

  • 0
    Good idea. It would be great, if you have a source or a proof for it.2012-04-22

1 Answers 1

2

@Gerry: Oh, very true. I didn't think of that.

The proof is easy, I think. Let $f$ be irreducible mod $m$ of degree $n$. Without loss of generality, let $f$ be monic. If $n$ is odd, $f$ has a real root. If $n$ is even, $M := \text{min}_{x \in \mathbb{R}} f(x) > -\infty$. If M < 0, $f$ has a root. If $M>0$, define $g(x) := f(x) - m\lceil\frac{M}{m}\rceil$. Then $f \equiv g$ modulo $m$ and $g$ has a root $\zeta \in \mathbb{R}$ (by means of the intermediate value theorem).


Edit: You can also find a polynomial that splits over $\mathbb{R}$.

Let $\widetilde{g}$ be a polynomial such that $g(x) = \widetilde{g}(x) \cdot ( x - \zeta )$. We can repeat the same procedure with $\widetilde{g}$, but $\text{deg}(\widetilde{g}) = \text{deg}(g)-1$. By induction we are done.

(The statement we proved by induction on $n$ is as follows: Let $f$ be a polynomial of degree $n$ irreducible modulo $m$. Then there exists a polynomial $g \equiv f$ modulo $m$ such that $g$ splits over $\mathbb{R}$.)

  • 0
    Ah, you want $f$ to split into linear factors over $\mathbb{R}$? Well, that changes it a bit. :) Will think about it, may edit my answer later.2012-04-22