Let $\alpha \in \mathbb{C}$ be algebraic over $\mathbb{Q}$ and $F\subseteq \mathbb{C}$ be a subfield.
Prove that $[F(\alpha):F]\leqslant [\mathbb{Q}(\alpha):\mathbb{Q}]$.
This looks like a problem in which I'm supposed to use the tower law, but I keep getting stuck.
I know $\mathbb{Q}\subseteq\mathbb{Q}(\alpha)\subseteq\mathbb{C}$ and $F\subseteq F(\alpha)=\mathbb{Q}(F\cup \left \{ \alpha \right \})\subseteq\mathbb{C}$ but the fact that $[\mathbb{C}:\mathbb{Q}]=\infty$ was proving quite problematic.
I then thought about using the fact that $[\mathbb{Q}(\alpha):\mathbb{Q}]=deg(f)$ and $[F(\alpha):F]=deg(g)$ where $f$ is the minimum polynomial of $\alpha$ over $\mathbb{Q}$ and $g$ is the minimum polynomial of $\alpha$ over $F$. But, we've only just been introduced to the minimum polynomial and I'm having trouble using it. I know $f$ is irreducible and such that $\mathbb{Q}(\alpha)\cong \mathbb{Q}[x]/ \left \langle f \right \rangle$ and $g$ is irreducible and such that $F(\alpha)\cong F[x]/ \left \langle g \right \rangle$ but I can't see where to go from here. Can anyone help?
Thanks in advance!
Hints:
We do know that $\;\Bbb Q\subset \Bbb F\subset\Bbb C\;$ , and suppose $\;f(x)\in\Bbb Q[x]\;$ is the minimal polynomial of $\;\alpha\;$ over the rationals, and $\;g(x)\in\Bbb F[x]\;$ is the min. pol. of $\;\alpha\;$ over $\;\Bbb F\;$ , thus
$$\Bbb Q[x]\subset\Bbb F[x]\implies f(x),g(x)\in\Bbb F[x]\implies g(x)\mid f(x)\;\;\text{within}\;\;\Bbb F[x]\;\text{(why?)}$$
and from here that
$$...=\deg g\le\deg f=...$$