2

Currently working through a book that uses a bit of Galois Theory in some chapter. If a theorem is stated I do prefer to at least have read proofs/proved results at some point in the past before proceeding (even though I'm sure the author isn't lying to me about the theorem being true). Unfortunately I have note gone over Galois Theory in the past and its quite a distraction to do so now for one theorem.

The theorem in the book states this:

Let $ \omega_n = e^{ 2\pi i/n }$, the primitive $n$-th root of unity. Put $F := \mathbb{Q} (\omega_n )$, the smallest field subfield of $\mathbb{C}$ containing $ \omega_n $. Let $ \Gamma $ be the automorphisms of $F$ that fix $\mathbb{Q}$. Let $\alpha \in F $. If $ \sigma ( \alpha ) = \alpha $ for all $ \sigma \in \Gamma $ then $ \alpha \in \mathbb{Q} $.

I want to prove this using only facts I know, which include the following (thanks to contributors in this thread Looking for shorter proof that order of Galois group of cyclotomic field is finite );

Facts I Know, Which Can Be Used Without Proving:

  • $ \mathbb{Q} ( \omega_{n} ) $ has finite dimension as a vector space over $ \mathbb{Q} $,

  • $ \omega_{n} $ is algebraic over $ \mathbb{Q} $,

  • the definition of a minimal polynomial in $ \mathbb{Q} [x] $ for an element $ a \in \mathbb{Q} ( \omega_{n} ) $

  • Let $\sigma$ be an automorphism of $\mathbb{Q}(\omega_n)$ fixing $\mathbb{Q}$. For any polynomial $p(X)$ over $\mathbb{Q}$ and $\alpha \in \mathbb{Q}(\omega_n)$ we have $\sigma(p(\alpha)) = p(\sigma(\alpha))$.

  • Any element $\alpha \in \mathbb{Q}(\omega_n)$ can be written in the form $\alpha = \frac{p(\omega_n)}{q(\omega_n)}$ for some polynomials $p, q$ over $\mathbb{Q}$ such that $q(\omega_n) \neq 0$.

  • Let $\sigma, \tau$ be automorphisms of $\mathbb{Q}(\omega_n)$ that fix $\mathbb{Q}$. Then $\sigma(\omega_n) = \tau(\omega_n) \iff \sigma = \tau$.

  • Let $p$ be any polynomial over $\mathbb{Q}$ such that $p(\omega_n) = 0$ (not necessarily the minimal polynomial). Then for any automorphism $\sigma$ of $\mathbb{Q}(\omega_n)$ fixing $\mathbb{Q}$, we have $p(\sigma(\omega_n)) = 0$.

Thing of Which I Have NOT Read Proofs, So Can't Be Used Unless Proved (Happy for Them To Be Proved, Then Used Though):

  • $ \mathbb{Q} ( \omega_{n} ) $ has dimension $ \phi (n) $, where $ \phi (n) $ is the number of positive integers less than $ n $ that are coprime to $ n $,

  • The set $ \{ \omega_{n} , \omega_{n}^{2} , \dots , \omega_{n}^{n-1} \} $ spans $ \mathbb{Q} ( \omega_{n} ) $ as a $\mathbb{Q}$-vector space

  • The Fundamental Theorem of Galois Theory

  • The minimal polynomial of some $ \beta \in F $ has no repeated roots

  • If $ m $ is the minimal polynomial of some $ \beta \in F $ then $\Gamma $ acts transitively on the roots of $m$

My attempt so far:

Let $\alpha \in F $. Suppose $ \sigma ( \alpha ) = \alpha $ for all $ \sigma \in \Gamma $.

It is simple to verify that there exists an automorphism $ \gamma \in \Gamma $ that sends elements of $F$ to their complex conjugates. If $\alpha = a + bi$ with $a,b \in \mathbb{R}$ and $ b \neq 0$, then $\gamma ( \alpha ) \neq \alpha $. So we can assume $ \alpha \in \mathbb{R}$.

I'm not sure how to proceed from here.

John Doe
  • 392
  • Hint: Let $f$ be the minimal polynomial of $\alpha$, then $\sigma(\alpha)$ is also a root of $f$. – cansomeonehelpmeout Jun 20 '25 at 14:08
  • @cansomeonehelpmeout that hint is in the list of things I know. Trouble is I've not previously proved that the roots of a minimal polynomial are mapped to each other (mentioned in the list of things I don't know). So even though $\sigma ( \alpha) $ is a root of the minimal polynomial of $ \alpha $, I cannot be sure there exists some $ \sigma \in \Gamma $ such that $ \sigma (\alpha ) \neq \alpha $. – John Doe Jun 20 '25 at 14:12
  • Aren’t you assuming that $\sigma(\alpha)=\alpha$ for all $\sigma\in\Gamma$? – cansomeonehelpmeout Jun 20 '25 at 14:15
  • @cansomeonehelpmeout Sorry, yes I am assuming $ \sigma ( \alpha ) = \alpha $. Maybe that previous comment wasn't so clear. I was thinking, if $ \alpha \in \mathbb{R} \setminus \mathbb{Q} $ then I would have to show that $\sigma ( \alpha ) \neq \alpha $ and end up with a contradiction. One way to do that would be to show $ \sigma ( \alpha ) $ is sent to another root of the minimal polynomial. But showing that $ \Gamma $ acts transitively on roots of minimal polynomial is something I have not verified previously (as well as the minimal polynomial having multiple roots). – John Doe Jun 20 '25 at 14:23
  • 2
    Well, the truth is, it's easier to establish what you don't know yet than to make a complicated argument only based on what you know. Especially the items (2)(4)(5) in the forbidden list are all standard and easy to show. – Just a user Jun 20 '25 at 14:32
  • It's of course possible (but tedious) to write down a proof of this special case without assuming knowledge of field theory. But why? If you repeatedly need Galois theory, you should either accept it as a black box for now, or learn the basic facts. Mathematicians have developed a beautiful theory to deal with finite field extensions; refusing to use it seems counterproductive. – anankElpis Jun 20 '25 at 14:38
  • @Justauser Ahh maybe I wasn't clear in the post, the things I don't know aren't forbidden to be used. Just that I haven't managed to prove them, so if they are to be used then I want to be able to understand how they are proved (using things I know). – John Doe Jun 20 '25 at 14:38
  • @anankElpis Its just a sticking point if I'm working through a book and haven't verified facts used at some point in the past. Unfortunately this particular book did not give much mention about Galois Theory facts until I got to the point where they appeared. The Galois Theory results are used in a small part of the book, but I just feel much more comfortable if my brain has accepted a result as true before using it. In short I like to have complete knowledge of the maths I'm using. Reading through 40 pages of Galois Theory for a 2 line lemma is a big distraction, so looking for a shortcut. – John Doe Jun 20 '25 at 14:43
  • I need to link to this canonical thread. Not sure whether this is a duplicate or not? We also have this and several other old threads linked to those two. – Jyrki Lahtonen Jun 23 '25 at 13:17

4 Answers4

3

What is the book you are reading and do you really need to have your question answered for all $n$ or only some special case like prime $n$ or prime power $n$?

Your fifth bullet point can be simplified: each element of $\mathbf Q(\omega_n)$ is $f(\omega_n)$ for some polynomial $f(x)$ in $\mathbf Q[x]$. This is because your $1/q(\omega_n)$ can be rewritten as a polynomial in $\omega_n$. That is because it is a standard result in field theory that when $K$ is a field and $\alpha$ is algebraic over $K$, the field $K(\alpha)$ is the same as the ring $K[\alpha]$ of polynomials in $\alpha$ with coefficients in $K$. This then makes the second fact you have not yet proved easy to show.

You do not need the fundamental theorem of Galois theory to prove what you want, as what you want to prove is needed to prove the fundamental theorem of Galois theory. That $\Gamma$ acts transitively on the roots of the minimal polynomial of each $\beta$ in $F$ is very closely related to the fact that you are trying to show. I think you being unrealistic in hoping for a shortcut that bypasses proving any of the results you say you have not yet proved.

KCd
  • 55,662
  • The book is Representation Theory of Finite Groups by Benjamin Steinberg. Most of the background needed for the book was covered in an introductory chapter and I filled in any gaps in knowledge at that point. Galois Theory was not mentioned though. It seems the result is require for all $n \in \mathbb{N}$. – John Doe Jun 22 '25 at 11:50
  • By looking at that book I see that you are trying to learn a proof of Burnside's $p^aq^b$ theorem. If you mention in your post that you are reading a proof of that theorem, then it would add some extra context. In Steinberg's book the result you are asking about is Theorem 6.3.7 and he describes it as a consequence of the fundamental theorem of Galois theory (FTGT). While true, logically speaking that theorem is proved as a preliminary result needed to prove FTGT, e.g., in https://kconrad.math.uconn.edu/blurbs/galoistheory/galoiscorr.pdf you want Theorem 3.13(1) and FTGT is Theorem 5.6. – KCd Jun 22 '25 at 20:09
  • I checked four undergraduate algebra books with a chapter on Galois theory: Beach & Blair's Abstract Algebra 4th edition, Gallian's Contemporary Abstract Algebra 9th edition, Lang's Undergraduate Algebra 2nd edition, and Rotman's Galois Theory 2nd edition. Gallian states FTGT but doesn't prove it, and doesn't state your theorem separately. The other books prove FTGT and all of them prove your desired theorem before they state and prove FTGT. – KCd Jun 22 '25 at 20:12
0

I think the easiest way to do this without explicitly using Galois theory is to show that $1, \omega, \omega^2, ... , \omega^{\varphi(n)-1}$ is a basis for $F$ over $\mathbb Q$, where $\omega = e^{2\pi i /n}$ is the standard primitive $n$th root of unity. From here, if

$$x = \sum\limits_{j=0}^{\varphi(n)-1} c_j \omega^j \tag{$c_j \in \mathbb Q$}$$

is fixed by every element of $\Gamma$, it's not difficult to see that $c_1 = c_2 = \cdots = c_{\varphi(n)-1} = 0$, so $x = c_0 \in \mathbb Q$.

How to see this is a basis? The minimal polynomial $\mu(X)$ of $\omega$ divides

$$X^n-1 = (X-1)(X - \omega)(X- \omega^2) \cdots (X - \omega^{n-1})$$

and in fact

$$\mu(X) = \prod\limits_{ \textrm{GCD}(k,n)=1} (X - \omega^k)$$

This is because the roots of $\mu(X)$ are precisely the primitive $n$th roots of unity (there are some gaps to fill in here, where you will have to make some ad hoc "Galois theory"-like arguments). From here, you may deduc that $F$ has degree $\varphi(n)$ over $\mathbb Q$, and that the aforementioned list is actually a basis.

As others have mentioned, you can't get something for nothing here, and will need to either invoke standard field theory results or fill in the gaps yourself in an ad hoc way.

D_S
  • 35,843
  • 3
    Proving $\mu(X)$ is irreducible over $\mathbf Q$ for all $n$ is not easy because these polynomials need not be irreducible over other fields. I also think your "not difficult to see" step is more involved than you suggest, since a field automorphism replaces $\omega$ with some $\omega^k$ where $(k,n) = 1$ and the list ${\omega^{kj}}{0 \leq j \leq \varphi(n)-1}$ is not necessarily a permutation of the list ${\omega^j}{0 \leq j \leq \varphi(n)-1}$. For example, taking $n = 3$, so $\varphi(n)=2$, complex conjugation changes ${1,\omega}$ to ${1,\omega^2} = {1,-1-\omega}$. – KCd Jun 20 '25 at 19:58
  • Have got as far as showing ${ 1, \omega, \omega^2, ... , \omega^{\varphi(n)-1} }$ and can see from some examples that $\omega, \omega^2, ... , \omega^{\varphi(n)-1} $ are not necessarily primitive roots of unity (consider the case when $n = 6$).

    So as @KCd mentioned, the elements $\omega, \omega^2, ... , \omega^{\varphi(n)-1} $ are not necessarily permuted amongst each other.

    But from here I'm not sure how to show if $x = \sum\limits_{j=0}^{\varphi(n)-1} c_j \omega^j$ for $c_j \in \mathbb{Q}$ is fixed by all automorphisms, then $c_1 = c_2 = \cdots = c_{\varphi(n)-1} = 0$.

    – John Doe Jun 22 '25 at 11:46
  • Your example "when $n = 6$" is not an example where $\omega, \ldots, \omega^{\varphi(n)-1}$ are not all primitive roots of unity since $\varphi(6) - 1 = 1$. But $n = 8$ is an example: $\varphi(8)-1 = 3$ and the list $\omega, \omega^2, \omega^3$ has two primitive $8$th roots of unity and one root of unity of order $4$. – KCd Jun 22 '25 at 19:36
  • As you say, my answer does not really make the problem that much easier. Really it's better to just prove what you want using Galois theory. – D_S Jun 22 '25 at 21:44
0

Firstly, it is immediate that $\mathbb{Q}(\omega_n) =\mathbb{Q}[\omega_n]$ (see KCd's comment, here you can use the extended euclidean algorithm to solve for $r(x)$ such that $m_{\omega_n}q + r = 1$, this is a consequence of irreducibility of minimal polynomials. Here we know such a minimal polynomial exists since $\omega_n^n - 1 = 0$ so we can choose the polynomial of least degree as below). It then follows that any element can be written in the form $\sum_0^{n-1} a_i\omega_n^i$, this proves the second fact, from this we can choose a basis $\{1,\omega_n^{k_1},...,\omega_n^{k_r}\}$ for $F/\mathbb{Q}$. Alternatively you can show $\mathbb{Q}[\omega_n]$ is a field by noticing $\omega_n^{n-1} = \omega_n^{-1}$ and take inverses by partial fraction decomposition.

Now we can represent any element $\alpha \in F$ as a matrix, with the $j$-th column being the image of the $j$-th basis element under multiplication by $\alpha$. By the [Cayley-Hamilton Theorem] we have that $\alpha$ satisfies its characteristic polynomial. Thus for any element the set of polynomials which it satisfies is non-empty and we can pick an element of minimal degree. This minimal degree polynomial must be seperable (i.e. distinct roots) since otherwise $(f,f') \neq 1$, and since $\deg f' = \deg f - 1$ this contradicts minimality since $\alpha$ must then satisfy one of $(f,f')$ or $\frac{f}{(f,f')}$ of strictly smaller degree. Now if $m_\alpha$ is the minimal polynomial of $\alpha$, and $\beta$ is any other root of $m_\alpha$ we have the isomorphism $\alpha \mapsto \beta$ via $\mathbb{Q}[\alpha] \cong \mathbb{Q}[x]/m_\alpha \cong \mathbb{Q}[\beta]$ (universal property of polynomial rings + first isomorphism theorem). This can be extended to an isomorphism $F \to F$ via the [Isomorphism Extension Theorem] (or if you insist on checking the details yourself note that you can easily do the extension "one element at a time" using the above isomorphism for simple extensions).

Finally note that $\deg m_\alpha = 1$ if and only if $\alpha \in \mathbb{Q}$, so for any $\alpha \not \in \mathbb{Q}$ we can choose some $\beta \neq \alpha$ satisfying $m_\alpha$ and thus we have an automorphism $F \overset{\sigma}{\to} F$ with $\sigma: \alpha \mapsto \beta$.

Note on why $\mathbf{\beta \in F}$: We have that since $\mathbb{Q}[x]$ is a PID, $m_{\omega_n} \vert x^n - 1$. Since our $F$ contains all roots of the latter polynomial, the same is true for the former. From the fourth fact you know, it follows that field isomorphisms must permute the roots of $m_{\omega_n}$, thus $F = Q(\omega_n) \subset \sigma(\mathbb{Q}(\omega_n))$ for any field isomorphism (in particular the one sending $\alpha \mapsto \beta$). Now since $\omega_n$ generates $F/\mathbb{Q}$, the same must be true of $\sigma(\omega_n)$ for $\sigma(F)/\mathbb{Q}$, i.e. $\sigma(\mathbb{Q}(\omega_n)) \subset \mathbb{Q}(\sigma(\omega_n)) \subset F$. Thus $\beta \in F$.

tigs
  • 100
  • In your last paragraph, it is not obvious without knowing Galois theory, or more precisely without knowing the result the OP is seeking, that for each $\alpha \in F - \mathbf Q$ that there is a root $\beta$ of $m_\alpha$ besides $\alpha$ that is in $F$. – KCd Jun 20 '25 at 21:14
  • @KCd I prove this in my answer since if $\alpha$ is not rational then it’s minimal polynomial has degree greater than one, and I show that minimal polynomials are separable (I.e. distinct roots). Is your complaint that I assume the fundamental theorem of algebra? – tigs Jun 20 '25 at 21:21
  • The issue is: why are any roots of $m_\alpha$ besides $\alpha$ actually in $F$? It is obvious to someone who knows Galois theory since $F/\mathbf Q$ is Galois (splitting field of $x^n - 1$), but for someone who does not know Galois theory it is not clear why. In $\mathbf Q(\sqrt[3]{2})$, which is not a Galois extension, $x^3-2$ has just one root rather than all three roots. – KCd Jun 20 '25 at 21:26
  • You are correct, I forgot this is not immediately obvious. I’ll update my answer to include this fact later today. – tigs Jun 20 '25 at 21:34
  • In your update, “$\beta\in\mathbf Q$” should be “$\beta\in F$”. I’m not persuaded by the reasoning in that paragraph: you can’t deduce that an unknown root $\beta$ of $m_\alpha$ in some field must lie in $F$. Indeed, let $a$ be a square root of $2$ in $\mathbf R$ and $b$ be a square root of $2$ in the $7$-adic numbers. There is an isomorphism $\mathbf Q(a)\to\mathbf Q(b)$ mapping $a$ to $b$, but that doesn’t show the $7$-adic number $b$ is one of the real numbers $\pm a$. You need to prove $m_\alpha$ has a 2nd root in $F$, not that all abstract roots of $m_\alpha$ are in $F$, which is not so. – KCd Jun 21 '25 at 05:19
  • @KCd here we are presupposing $\beta \in \mathbb{C}$, this argument works so long as we are consistent in what algebraic closure we are working in, in this case $\overline{\mathbb{Q}} \subset \mathbb{C}$, since in this case we are mapping to roots of $m_{\omega_n}$ in $\mathbb{C}$. I am pretty sure my reasoning is similar to the proofs in Lang’s algebra which is where I first learned about Fields and Galois theory. – tigs Jun 21 '25 at 05:45
  • 1
    The isomorphism extension theorem does not directly imply what you say it does. It only says that there is an extension to $F \to F'$, where $F'$ is some algebraic extension of $F$. This does not help you to prove what you want. – Lukas Heger Jun 21 '25 at 07:47
  • Your argument in that paragraph cannot work because you need to use the fact $F/\Bbb Q$ is a splitting field in some way. – Lukas Heger Jun 21 '25 at 07:49
  • 1
    As an example of what @LukasHeger is saying, set $F = \mathbf Q(\sqrt[4]{2})$, $\alpha = \sqrt{2}$, and $\beta = -\sqrt{2}$ that are both in $F$. The isomorphism $\mathbf Q(\alpha)\to\mathbf Q(\beta)$ mapping $\alpha$ to $\beta$ does not extend to an isomorphism $F\to F$, but it does extend to an isomorphism $F\to\mathbf Q(i\sqrt[4]{2})$ mapping $\sqrt[4]{2}$ to $i\sqrt[4]{2}$. – KCd Jun 21 '25 at 15:30
0

Proved this in the end by piecing together bits of information from answers, comments and links provided in this post. Let me know of any places where there are mistakes. These are the steps of the proof I put together:

As in the original post, continue using the notation $F:= \mathbb{Q} (\omega_n)$ and $\Gamma$ for the set of automorphisms of $F$.

Assume $n \geq 3$ because the main theorem that we want to prove is trivial for $n=1$ and $n=2$. Then $\omega _{n} \notin \mathbb{Q}$.

The following two results are some that I have read a proof of in the past. Probably should have put it in the "results I know" section of the original post, but did not know they would be used.

(1) State result on constructing field using irreducible polynomial of $K[x]$ where $K$ is a field

Let $K$ be a field. Let $p(x) \in K[x]$ be a polynomial of degree $d$ that is irreducible over $K$. Let $\langle p(x) \rangle$ be the ideal generated by $p(x)$. Then $K[x] / \langle p(x) \rangle$ is a field. Furthermore, if $\alpha = x + \langle p(x) \rangle $ then every element of $K[x] / \langle p(x) \rangle$ can be expressed uniquely in the form $ k_{d-1} \alpha ^{d-1} + \dots + k_{1} \alpha ^{1} + k_{0} $, where $k_{i} \in K$ for each $i \in \{ 0,1, \dots ,d-1 \}$.

(2) State result on isomorphism between an algebraic field extension of $K$ and a quotient of $K [x]$

Suppose $K$ is a subfield of $\mathbb{C}$. Let $p(x) \in K [x]$ be an irreducible polynomial. Let $\rho \in \mathbb{C}$ be a root of $p$. Then there exists a field isomorphism $\psi : K ( \rho ) \rightarrow K [x] / \langle p(x) \rangle $ with $ \psi ( \rho ) = x + \langle p(x) \rangle $.

(Could generalise this to fields other than $\mathbb{C}$ but this result is enough for what we need.)

(3) Show $\{ 1, \omega_{n} , \dots , \omega ^{d-1} \}$ is basis for $\mathbb{Q} (\omega _{n} )$, where $d$ degree of minimal polynomial of $\omega _{n}$ over $\mathbb{Q}$

Let $m(x) \in \mathbb{Q}$ be minimal polynomial of $\omega _{n}$ over $\mathbb{Q}$. By (2), there exists an isomorphism $ \psi_{1} : \mathbb{Q} ( \omega _{n} ) \rightarrow \mathbb{Q} [x] / \langle m(x) \rangle $ with $ \psi_{1} ( \omega _{n} ) = x + \langle m(x) \rangle $.

Using (1) and the isomorphism $ \psi_{1}^{-1} $, we can see that $\{ 1, \omega_{n} , \dots , \omega ^{d-1} \}$ is basis for $\mathbb{Q} (\omega _{n} )$, where $d$ degree of minimal polynomial of $\omega _{n}$ over $\mathbb{Q}$.

(4) Find all of the roots of $m(x)$ and show degree of $m(x)$ is $ \phi (n) $

Using proof from this post,

prove cyclotomic polynomial is a minimal polynomial

we know that the minimal polynomial is \[ m(x) = \prod _{\substack{ k \in \{ 1, \dots , n\}, \\ gcd(k,n) = 1 } } (x- \omega _{n}^{k} ) . \] We can see this has $ \phi (n) $ distinct roots, where $ \phi(n) $ is the number of positive numbers less than $n$ that are coprime to $n$. Can also see $m(x)$ has no repeated roots. So $ \phi (n) $ is the degree of $m(x)$. Another fact we can see is each root generates the group $ \langle \omega _{n} \rangle $.

(5) Prove $\Gamma$ acts transitively on roots of $m(x)$

Let $ \psi _{1} $ be the isomorphism defined in (3). Let $ \omega_{n} ^{\prime} $ be a root of the minimal polynomial $m(x)$. Then by (2), there exists an isomorphism $ \psi_{2} : \mathbb{Q} ( \omega _{n}^{\prime} ) \rightarrow \mathbb{Q} [x] / \langle m(x) \rangle $ with $ \psi_{2} ( \omega _{n}^{\prime} ) = x + \langle m(x) \rangle $.

Now $ \mathbb{Q} ( \omega _{n} ) = \mathbb{Q} ( \omega _{n}^{\prime} ) $ because we saw in (4) that $ \langle \omega _{n} \rangle = \langle \omega _{n}^{\prime } \rangle $. It follows that $ \psi_{1} \circ \psi_{2} \in \Gamma $ with $ \psi _{1} ( \psi _{2} ( \omega _{n} ) ) = \omega _{n} ^{\prime }$. Clearly this means that $ \Gamma $ acts transitively on the roots of $m(x)$.

(6) Show the set of elements fixed by all automorphisms is a subfield of $\mathbb{Q} (\omega_n)$ containing $\mathbb{Q}$

Let $A = \{ \alpha \in F: \sigma (\alpha ) = \alpha \text{ for all } \sigma \in \Gamma \}$. Let $ \alpha, \beta \in A $. Then, \[ 1 = \sigma (\alpha \alpha^{-1} ) = \sigma (\alpha ) \sigma (\alpha^{-1} ) = \alpha \sigma (\alpha^{-1} ). \] Hence $ \sigma (\alpha^{-1} ) = \alpha^{-1} $. Similarly $\sigma (- \alpha ) = - \alpha$. So $ \sigma (\beta \alpha^{-1} ) = \beta \alpha^{-1} $ and $ \sigma (\beta - \alpha ) = \beta - \alpha $.

This shows $A$ is a subfield of $F$. Clearly $\mathbb{Q} \subseteq A$ by the definition of $\Gamma$.

(7) Find minimal polynomial of $ \omega _n $ over $A$

Let $m^{*} (x) \in A[x]$ be the minimal polynomial of $ \omega _n $ over $A$. Since $\mathbb{Q} \subseteq A$ and $ \omega _n$ is a root of the minimal polynomial $m(x) \in \mathbb{Q}$, it follows $m^{*} (x)$ divides $m(x) $.

Let $ \omega_{n} ^{\prime} $ be a root of $m(x) $ then $\sigma ( \omega _n ) = \omega_{n} ^{\prime} $ for some $ \sigma \in \Gamma$.

By the definition of $A$, the coefficients of $m^{*} (x) $ are fixed by $\sigma$, so $0 = \sigma (0) = \sigma (m^{*} (\omega _n) ) = m^{*} ( \sigma (\omega _n) ) = m^{*} ( \sigma ( \omega_{n} ^{\prime} ) $. Hence $\omega_{n} ^{\prime} $ is a root of $m^{*}$. So $ m(x) $ divides $ m^{*} (x) $. Hence $ m(x) = m^{*} (x) $.

(8) Prove the main result

Notice $ A( \omega _{n} ) = \mathbb{Q} ( \omega _{n} ) $ because $A \subseteq \mathbb{Q} ( \omega _{n} ) $ and $ \mathbb{Q} \subseteq A$. Using (1) and (2), every element of $ \mathbb{Q} ( \omega _{n} ) $ can be expressed uniquely as in the form $ a_{d-1} \omega _{n} ^{d-1} + \dots + a_{1} \omega _{n} ^{1} + a_{0} $, where $d $ is the degree of $m(x)$ and $a_{i} \in A$ for each $i \in \{ 0,1, \dots ,d-1 \}$.

Suppose $A \neq \mathbb{Q}$. By definition, $ \mathbb{Q} \subseteq A$, so there exists $ a \in A \setminus \mathbb{Q}$. Then $a = a \cdot 1$ when expressing $a$ as an element of $\mathbb{Q} ( \omega _{n} ) $ as an $A$-vector space.

But when expressed as an element of $\mathbb{Q} ( \omega _{n} ) $ as an $\mathbb{Q}$-vector space, $a = q_{d-1} \omega _{n} ^{d-1} + \dots + q_{1} \omega _{n} ^{1} + q_{0} $ where $q_{j} \in \mathbb{Q}$ for each $j \in \{0,1, \dots , d-1 \}$ and most importantly $q_{k} \neq 0$ for some $k \neq 0$.

But $ q_{d-1} \omega _{n} ^{d-1} + \dots + q_{1} \omega _{n} ^{1} + q_{0} $ is also a linear combination of basis elements with coefficients in $A$. So we have two distinct linear expressions for $a$ when looking at $\mathbb{Q} ( \omega _{n} ) $ as an $A$-vector space.

This is a contradiction. Thus $A = \mathbb{Q}$.

John Doe
  • 392