Proving o(An) = o(a) for Finite Abelian Groups | G, N, a | Group Theory Homework

  • Thread starter Thread starter Justabeginner
  • Start date Start date
  • Tags Tags
    Finite Groups
Justabeginner
Messages
309
Reaction score
1

Homework Statement


Let G be a finite group with N , normal subgroup of G, and a, an element in G.
Prove that if (a) intersect N = (e), then o(An) = o(a).


Homework Equations





The Attempt at a Solution


(aN)^(o(a)) = a^(o(a)) * N = eN = N, but is the least power such that (aN)^m = N. Assume m must divide o(a).

(aN)^((o(a)) = (aN)^ (mq +r) where 0 <= r < m,
However, ((aN)^m)-q * a(N)^(o(a)) = (a(N)^r)= N = (a(N)^r).
r < m so r= 0 and mq= o(a).
I am not sure how to continue however, am I even going in the right direction?

Thanks!
 
Physics news on Phys.org
Justabeginner said:

Homework Statement


Let G be a finite group with N , normal subgroup of G, and a, an element in G.
Prove that if (a) intersect N = (e), then o(An) = o(a).


Homework Equations





The Attempt at a Solution


(aN)^(o(a)) = a^(o(a)) * N = eN = N, but is the least power such that (aN)^m = N. Assume m must divide o(a).

(aN)^((o(a)) = (aN)^ (mq +r) where 0 <= r < m,
However, ((aN)^m)-q * a(N)^(o(a)) = (a(N)^r)= N = (a(N)^r).
r < m so r= 0 and mq= o(a).
I am not sure how to continue however, am I even going in the right direction?

Thanks!

Presumably ##(a)## is meant to indicate the cyclic subgroup of ##G## generated by the element ##a##, ##aN## is the left coset ##aN=\{an:n\in N\}## considered as an element of the quotient group ##G/N##, ##o(a)## is order of ##a## as an element of ##G## and ##o(aN)## the order of the element ##aN## in the quotient group ##G/N##.

You've correctly identified that ##aN^{o(a)}=a^{o(a)}N=eN=N## and concluded (I think) that ##o(aN)|o(a)##, or at the very least that ##o(aN)\leq o(a)## (which is all that's really needed).

What remains to be shown is that ##o(a)\leq o(aN)##. This is where you probably want to use the necessary fact that ##(a)\cap N=(e)##.

Hint:
For all ##k##, ##a^k\in aN^k##
 
That made sense and I think I got it. Thank you very much!
 
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...
Back
Top