Either all the permutations in H are even or

  • Thread starter Thread starter rsa58
  • Start date Start date
  • Tags Tags
    even Permutations
Click For Summary
SUMMARY

For every subgroup H of the symmetric group S(n) where n≥2, it is established that either all permutations in H are even or exactly half are even. This conclusion is derived from the properties of permutations, specifically the behavior of odd and even permutations under multiplication. The subgroup A(n), which is a normal subgroup of index 2 in S(n), plays a crucial role in this analysis. The closure of H and the interaction between odd and even permutations confirm this dichotomy.

PREREQUISITES
  • Understanding of symmetric groups, specifically S(n) and A(n).
  • Knowledge of even and odd permutations.
  • Familiarity with group theory concepts such as subgroups and normal subgroups.
  • Basic understanding of permutation multiplication properties.
NEXT STEPS
  • Study the properties of symmetric groups S(n) and their subgroups.
  • Explore the concept of normal subgroups, particularly in relation to A(n).
  • Learn about the classification of permutations as even or odd.
  • Investigate the implications of group closure in the context of permutation groups.
USEFUL FOR

This discussion is beneficial for students of abstract algebra, particularly those studying group theory, as well as mathematicians interested in the properties of symmetric groups and permutation classifications.

rsa58
Messages
83
Reaction score
0

Homework Statement


Show that for every subgroup H of S(n) [the symmetric group on n letters] for n>=2 either all the permutations in H are even or exactly half of them are even.


Homework Equations





The Attempt at a Solution



I didn't really know how to do this but i thought maybe since H is closed it has something to do with the fact that an odd permutation times an odd permutation produces an even permutation and an odd permutation times an even permutation produces an odd permutation.
 
Physics news on Phys.org
Consider H[itex]\cap[/itex]A(n) and HA(n). Use the fact that A(n) is an index 2 normal subgroup of S(n).
 
Even simpler, if H contains an odd permutation 'o', then H*o=H. But multiplying by o turns even permutations into odd, and vice versa.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
3
Views
2K
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
6K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K