Abstract Algebra: Extension Fields & Complex nth Roots

  • Thread starter Thread starter Doom of Doom
  • Start date Start date
  • Tags Tags
    Extension Fields
Doom of Doom
Messages
85
Reaction score
0
Two problems from my abstract algebra class...


1)
Let K be the algebraic closure of a fi eld F and suppose E is a field such that  F F \subseteq E \subseteq K. Then is K the algebraic closure of E?

2)
Let n be a natural number with n\geq2, and suppose that \omega is a complex nth root on unity. Is there a formula for \left[\mathbb{Q}(\omega) : \mathbb{Q}\right] ?


__________________


To 1), I must be missing something really silly, because it seems to me like it is obviously the case that K is also the algebraic closure of E, and that the proof should be easy. But I simply can't think of anything.


To 2) I would say no, but I am not exactly sure that I understand the question. For example, if n=8, then e^{i2\pi/8} is a complex 8th root of unity such that \left[\mathbb{Q}(e^{i2\pi/8}) : \mathbb{Q}\right]=4. However, i is also an 8th root of unity, but \left[\mathbb{Q}(i) : \mathbb{Q}\right]=2. Thus, for a given n, there is not necessarily a formula. Does this sound right?
 
Physics news on Phys.org
1) Well for K to be the algebraic closure of E you must show:
a) K/E is algebraic.
b) If g(x) \in E[x], then g(x) splits completely in K. (HINT: Remember that K is an algebraic closure of itself so h(x) \in K[x] imply that h(x) splits completely in K).

2) Well \omega is a specific nth root of unity so it's acceptable for your formula to behave differently when given e^{i2\pi/8} and when given e^{i\pi/8}. You should probably look for a formula of the form:
\left[\mathbb{Q}\left(e^{ik\pi/n}\right) \, : \, \mathbb{Q} \right] = f(n,k)
so the formula can depend on both n and k, not just n.
 
Ok, for 2), I've got the formula

<br /> \left[\mathbb{Q}\left(e^{ik\pi/n}\right) \, : \, \mathbb{Q} \right] = \phi\left(\frac{n}{\gcd(n,k)}\right)<br />,

where phi is Euler's totient funciton.

Is that right?

Now I just have to prove it...
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top