MHB Prove: Q(ζp)=Q(ζip) | Cyclotomic Polynomials

  • Thread starter Thread starter mathjam0990
  • Start date Start date
  • Tags Tags
    Polynomials
mathjam0990
Messages
28
Reaction score
0
Let ζp be e2πi/p. For an integer i, such that p does not divide i, prove Q(ζp) = Q(ζip ).

I think this has something to do with both exponents of ζp (1 and i) being coprime to p, but I am not sure at all how to show the equality. If anyone could please help with an explanation, that would be great. Thank you.
 
Physics news on Phys.org
mathjam0990 said:
Let ζp be e2πi/p. For an integer i, such that p does not divide i, prove Q(ζp) = Q(ζip ).

I think this has something to do with both exponents of ζp (1 and i) being coprime to p, but I am not sure at all how to show the equality. If anyone could please help with an explanation, that would be great. Thank you.
Some caution is needed here, because $i$ is doing double duty, as an exponent and as the square root of $-1$. Just don't be tempted to write $\zeta_p^i$ as $(e^{2\pi i/p})^i.$

It should be clear that $\mathbb{Q}(\zeta_p^i) \subseteq \mathbb{Q}(\zeta_p)$ (because $\zeta_p^i \in \mathbb{Q}(\zeta_p)$). To prove the reverse inclusion you need to show that $\zeta_p \in \mathbb{Q}(\zeta_p^i)$. This will follow if you can show that $\zeta_p$ is a power of $\zeta_p^i$. That is where $i$ and $p$ being coprime will come in.
 
Opalg said:
To prove the reverse inclusion you need to show that $\zeta_p \in \mathbb{Q}(\zeta_p^i)$. This will follow if you can show that $\zeta_p$ is a power of $\zeta_p^i$. That is where $i$ and $p$ being coprime will come in.

Thank you for your response. I apologize, I should have mentioned that I knew the proof would be to show each is contained in the other. But I have no clue how to show $\zeta_p \in \mathbb{Q}(\zeta_p^i)$. Could you please explain how I would do that and I can respond via "reply with quote" if I happen to get lost? Thank you.
 
The $p$-th roots of unity form a cyclic group of order $p$, under complex multiplication. The elements are, from your definition of $\zeta_p$:

$\{(\zeta_p)^k: k = 0,1,2,\dots,p-1\}$ (so $\zeta_p$ is a generator). The link between "$p$-th roots of unity" and an abstract cyclic group of order $p$ (or to be more specific: $\Bbb Z/p\Bbb Z$) is provided by the complex exponential (which lies beneath DeMoivre's formula, as well).

A (semi-) elementary result of group theory is that for a cyclic group $\langle a\rangle$, of order $n$, the order of $a^k$ is:

$\dfrac{n}{\gcd(k,n)}$

In particular, for $n = p$, if $\gcd(k,p) = 1$, then $a^k$ has order $p$ (I am using $k$ instead of your $i$ for the very reasons Opalg outlined in his first post).
 
A possibly more simple-minded approach is to say that we want to find $r$ such that $(\zeta_p^k)^r = \zeta_p$. But $\zeta_p^k$ is a $p$th root of unity, so $(\zeta_p^p)^s = 1$ (for any integer $s$).

Therefore it would be good to find integers $r,s$ such that $kr = ps+1$, because then $(\zeta_p^k)^r = (\zeta_p^p)^s(\zeta_p)^1 = \zeta_p$. That ought to point you towards ideas connected with Euclid's algorithm.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top