Using the fact that G is abelian in this abstract algebra problem

jdinatale
Messages
153
Reaction score
0
I'll post the problem and my attempt at solution all in one picture:

jdjd.jpg




In the red step, I'm using commutative multiplication. Am I allowed to do this? I'm not sure, because the subset of G might not be a subgroup, so I don't know if its necessarily abelian like G is. Or does the fact that G is abelian override this somehow?
 
Physics news on Phys.org
Any subgroup of an abelian group is abelian.
 
deluks917 said:
Any subgroup of an abelian group is abelian.

i'm trying to PROVE it's a subgroup. That's the question itself.
 
That looks good. I don't see the confusion. In an abelian group, it always holds that

(ab)^n=a^nb^n

You don't need any subgroups to prove this.
 
Sorry any subset of an abelian group is abelian.
 
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