Proving Non-Cyclic and Non-Abelian Properties of Dihedral and Symmetric Groups?

MikeDietrich
Messages
31
Reaction score
0

Homework Statement


Prove that S_n and D_n for n>=3 are non-cyclic and non-abelian.


Homework Equations


I get that I need to show that two elements from each group do not commute and that there is not a single generator to produce the groups... I am just unsure of how to do this.



The Attempt at a Solution


I can prove the non-abelian part for both by "multiplying" two of the elements and showing they do not commute (easy enough). However, how do I generalize the property to all n>=3? I have no idea where to start with the cyclic part. I have a hard time visualizing how rotations and reflections could be cyclic.

Any guidance appreciated. I generally find someone says one little thing that makes everything click into place. Thanks!
 
Physics news on Phys.org
Well, it suffices to show that the groups are not abelian. This implies that the groups are not cyclic (since any cyclic group is abelian).

Let's start of with Sn. You need to find two elements in Sn which do not commute. Can you find me such elements in S3??
 
Sure. r = rotation, s = refection
Let's say r_1=3, r_2=1, r_3 = 2 and s_1 = 2, s_2 = 1 and s_3 = 3 then (r)(s) = (1,3,2) and (s)(r) = (3,2,1). Obviously, they do not commute. How do I generalize that to include all n>=3?
 
Well, I think this example generalizes to all n... It will never be true that rs=sr.
 
Yeah... you're right. I was over-thinking this one. THANKS!
 
Is is enough to show Dn is non-abelian as it is a subgroup of Sn. This follows directly from a definition (note s-1 = s)

[URL]http://upload.wikimedia.org/math/0/5/6/056d32f591f128306e785abf0b1437c7.png[/URL]
 
Last edited by a moderator:
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