I have been staring at this question for a while. I'm sure there is a little trick I am missing…anyway, it is the following:

$ f = x^3 + x + 3 $

a) Show $f$ is irreducible over $\mathbb{Q}[x]$: Did this fine, using the following theorem: "If $f$ is primitive (i.e. the GCD of the coefficients is 1), then $f$ is irreducible in $\mathbb{Z}[x] \iff f$ is irreducible in $\mathbb{Q}[x]$, then showed by contradiction that $f$ was irreducible in $\mathbb{Z}[x]$.

b) Show that $f$ has exactly one real root: Pretty straightforward with Intermediate Value Theorem and showing that $~f' > 0. $

c) Let $\theta$ be the real root of $f$. Let $\phi, \phi'$ be the two other

roots. Compute:

[$\mathbb{Q}(\theta)$ : $\mathbb{Q}$], [$\mathbb{Q}(\theta, \phi)$ : $\mathbb{Q}$], [$\mathbb{Q}(\theta, \phi, \phi')$ : $\mathbb{Q}$].

Managed to compute the first one as 3, as $f$ is the minimal polynomial for $\theta$ and is of degree 3.

As for the second one, using the tower law, I can get

$\displaystyle [\mathbb{Q}(\theta, \phi) : \mathbb{Q}] = [\mathbb{Q}(\theta) : \mathbb{Q}][\mathbb{Q}(\theta, \phi) : \mathbb{Q}(\theta)] = 3[\mathbb{Q}(\theta, \phi) : \mathbb{Q}(\theta)]. $

My question is, how do I compute $[\mathbb{Q}(\theta, \phi) : \mathbb{Q}(\theta)]$? If I know this, i'm sure I can extend the method to get the final part. Would I need to find the minimal polynomial of $\phi$ over $\mathbb{Q}(\theta)$? If so, how do I show the polynomial is in $\mathbb{Q}(\theta)$ and not just $\mathbb{Q}$ ?

## Best Answer

Over $\mathbb Q(\theta)$, you can divide out the factor $x-\theta$ from $f$ to obtain a quadratic polynomial with $\phi,\phi'$ as roots. But is it minimal? Could possibly $\mathbb Q(\theta,\phi)=\mathbb Q(\theta)$? (Use that $\theta\in\mathbb R$)