0

I'm having some trouble figuring out a solution to this. I understand that $f$ is separable, iff all its roots are distinct, however I'm completely clueless about how to investigate that criterion...so I tried focussing on irreducibility first. That turned out to be quite confusing too.

First, I tried finding the primitive roots of unity, which turned out to be $\pm 1$, so I suspected $f$ might always be irreducible, because 1 is always in $\mathbb{F}_p$, for any prime. But then I plugged them into $f$ over some of the possible fields and that didn't seem to check out.

Next, I figured $\alpha$ is a zero of $f$ over $\mathbb{F}_p$, if $\alpha^4 \equiv p-1 \text{ mod } p \iff \alpha \equiv \sqrt[4]{p-1} \text{ mod } p$. I know $p-1$ must be even, since $p$ is prime and therefore odd, so I can substitute $2k$, $k$ being a suitable element of $\mathbb{Z}$. So I get $\alpha \equiv \sqrt[4]{2k} \text{ mod } p$. $\sqrt[4]{2k}$ is whole (natural, even), precisely if $2k = m^4, m \in \mathbb{F}_p$, so $m = \alpha$ would then be a zero...

I know I'd have to investigate the case that $f$ might be representable as the product of two polynomials of degree less than 4 next, but I'll need to consider that after I crossed this hurdle.

Any ideas?

Dietrich Burde
  • 140,055
Raiden
  • 17
  • 1
    This polynomial is always reducible, because it has a root in every field $\mathbb{F_p}$. As for separability, use formal derivatives. – Mark Apr 27 '24 at 16:28
  • 2
    Did $x^4-1$ get edited to $x^4+1$? ... – paul garrett Apr 27 '24 at 16:49
  • yep that was a typo. idk why Dietrich Burde rolled it back tho.... – Raiden Apr 27 '24 at 18:38
  • Which polynomial is it: $x^4-1$ or $x^4+1$? Anyway both always factor, and both are duplicates. The first one is obvious, and the second isn't difficult either. As you see, the way it factors depends on the residue class of $p$ mod $8$. – Jyrki Lahtonen Apr 28 '24 at 04:15
  • (cont'd) Mostly, because that residue class determines which of $-1$, $2$, $-2$ have a modular square root. At least one of them always has. – Jyrki Lahtonen Apr 28 '24 at 04:21
  • Anyway, with $p=5$, $\pm2$ are the primitive fourth roots of unity ($2^2=4=-1$). Modulo $7$ there are none, but $2=3^2$, so modulo $7$ we have $$x^4+1=x^4+2x^2+1-2x^2=(x^2+1)^2-(3x)^2=(x^2+3x+1)(x^2-3x+1)$$ whereas $x^2+1$ is irreducible modulo $7$ (and still a factor of $x^4-1$). – Jyrki Lahtonen Apr 28 '24 at 04:34

0 Answers0