Group Theory Question involving nonabelian simple groups and cyclic groups

paddyoneil
Messages
1
Reaction score
0

Homework Statement


Let A be a normal subgroup of a group G, with A cyclic and G/A nonabelian simple. Prove that Z(G)= A

Homework Equations



Z(G) = A <=> CG(G) = A = {a in G: ag = ga for all g in G}

My professor's hint was "what is G/CG(A)?"

The Attempt at a Solution


A is cyclic => A is abelian
A normal in G <=> gAg-1 = A
So gA=Ag. Then gA is an element of G/A.

I don't really know where to go. I have been working on this for several hours and am at a loss. Any help would be greatly appreciated.
 
Physics news on Phys.org
paddyoneil said:

Homework Statement


Let A be a normal subgroup of a group G, with A cyclic and G/A nonabelian simple. Prove that Z(G)= A

Homework Equations



Z(G) = A <=> CG(G) = A = {a in G: ag = ga for all g in G}

My professor's hint was "what is G/CG(A)?"

The Attempt at a Solution


A is cyclic => A is abelian
A normal in G <=> gAg-1 = A
So gA=Ag. Then gA is an element of G/A.

I don't really know where to go. I have been working on this for several hours and am at a loss. Any help would be greatly appreciated.

the fact that G/A is simple means that there are no normal subgroups of G containing A except G itself.

now if A is cyclic, show that CG(A) is normal in G. now every element of A certainly commutes with every other (A is abelian). thus CG(A) is a normal sbgroup of A, containing A, so CG(A) = G.

now show that this implies A = Z(G) (containment of A in Z(G) is easy-see above). use the fact that G/A is non-abelian to show that if g is not in A, g does not commute with some member of G.
 
Last edited:
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