I am attempting to solve part (c) of the following problem from Artin's algebra textbook. I have already solved a, b, and d.
Determine the irreducible polynomial for $α=\sqrt3+\sqrt5$ over the following fields.
(a) $\mathbb{Q}$ (b) $\mathbb{Q(\sqrt5)}$ (c) $\mathbb{Q(\sqrt10)}$ (d) $\mathbb{Q(\sqrt15)}$
Attempt
I'm pretty sure that that irreducible polynomial for $α$ over $\mathbb{Q(\sqrt10)}$ is $f(x)=x^4-16x^2+4$, but of course, I have to prove it.
I see that $α^3-α-1=0$, so it suffices to show that $[\mathbb{Q}(\sqrt10,α):\mathbb{Q(\sqrt10)}]=4$. I see that $[\mathbb{Q}(\sqrt10,α):\mathbb{Q(\sqrt10)}][\mathbb{Q}(\sqrt10):\mathbb{Q}]=[\mathbb{Q}(\sqrt10,α),\mathbb{Q}(α)][\mathbb{Q}(α):\mathbb{Q}]$.
To show that $[\mathbb{Q}(\sqrt10,α):\mathbb{Q(\sqrt10)}]=4$, it is enough to show that $[\mathbb{Q}(\sqrt10,α),\mathbb{Q}(α)]=2$.
Now, I see that $[\mathbb{Q}(\sqrt10,α),\mathbb{Q}(α)]$ must be either $2$ or $1$. Suppose it is $1$. Then $\sqrt10\in \mathbb{Q(\alpha)}$, and from this we obtain $\sqrt10\in \mathbb{Q}(\sqrt3,\sqrt5)$, and hence $\sqrt2\in \mathbb{Q}(\sqrt3,\sqrt5)$.
Now, it seems to me that this is a contradition, although I do not see how to rigorously prove it. If I can prove the following Lemma, I should be done.
I want to prove the Lemma: $\sqrt2\notin \mathbb{Q}(\sqrt3,\sqrt5)$
Attempt to prove Lemma
Suppose $\sqrt2\in \mathbb{Q}(\sqrt3,\sqrt5)$. I see that, for some $a,b,c,d\in \mathbb{Q}$, we have $\sqrt2=a+b\sqrt5+c\sqrt3+d\sqrt3 \sqrt5$. I predict that a contradiction can be obtained by playing around with this equation, but I do not know. Help would be appreciated.
Square both sides of the equation in Michael's comment to get
$2a^2 = 3b^2+5c^2+15d^2+e^2+2be\sqrt{3}+2ce\sqrt{5}+2de\sqrt{15}+6bd\sqrt{5}+10cd\sqrt{3}+2bc\sqrt{15}$
We write this as $m = n\sqrt{3}+l\sqrt{5}+k\sqrt{15}$ for some integers $m,n,l,k$. So,
$m-n\sqrt{3} = \sqrt{5}(l+k\sqrt{3}) \implies m^2-2mn\sqrt{3}+3n^2 = 5(l^2+2lk\sqrt{3}+3k^2)$.
Since $\sqrt{3}$ is not rational, this means that $2mn+10lk = 0$ and thus $m^2+3n^2 = 5l^2+15k^2$. Looking at this last equation mod $5$ means that $m \equiv n \equiv 0 \pmod{5}$ (by checking the different possibilities). Writing $m=5m', n=5n'$ and then dividing by $5$ gives that $5m'^2+15n'^2 = l^2+3k^2$. But now $l,k$ must be multiples of $5$ by the same reasoning as before. We get the classical infinite descent contradiction.