Is x^6-2x^3-1 Irreducible Over Q?

  • Thread starter Thread starter T-O7
  • Start date Start date
T-O7
Messages
55
Reaction score
0
Hi,
I need to figure out whether or not the polynomial
x^6-2x^3-1
is irreducible (over Q).
I don't think Eisenstein works in this case, and performing modulo 2 on this i get x^6-1
which is reducible over F2.
Any ideas? Incidently, if i let y=x^3, then i get
y^2-2y -1
which is irreducible over Q...but I'm not sure if that means anything about the original polynomial.
 
Physics news on Phys.org
Sure enough, Eisenstein doesn't work as there is no prime p such that p\mid -1. However if you reduce modulo 3, you get (i hope)
x^6-[2]x^3-[1] = x^6+[-2]x^3+[-1] = x^6+x^3+[2] and this polynomial in Z_2[x] seems to be irreducible (at a first try I couldn't factor it in 2 polynomials of smaller degree, but you can try yourself). So if that polynomial is irreducible in Z_2[x] then x^6-2x^3-1 is irreducible in Q[x].
 
Hmm..okay. I was hoping I wouldn't have to resort to brute force hehe
OK, so I have shown that the polynomial x^6+x^3+2 has no linear or quadratic factors over F3, but how did you show it can't factor into cubic terms? I don't really know the irreducible cubic polynomials over F3, and it seems like there might be quite a few of them?
 
T-O7 said:
I don't really know the irreducible cubic polynomials over F3, and it seems like there might be quite a few of them?

It won't be horrid, there are only 18 candidates for monic irreducibles of degree 3 (constant term must be non-zero), 10 of them will have roots. Trial division by the remaining 8 will be tedious though. Actually you can cut this down quite alot, if you check that none of the monic irreducibles with constant term 2 divide your polynomial, then you know none with constant term 1 do (do you see why?).

Sorry, I don't have anything quicker to offer.
 
Yes, great, thanks for the tip. After a little tedious work, it turns out that it is irreducible over F3, so my original polynomial was irreducible over Q. Yay, thanks a lot :biggrin:
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top