English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

The symmetric group Sn consists of the n! permutations of n distinct objects under the binary operation of combining permutations. Each permutation is either even or odd. Prove that in every subgroup of Sn, each element is even or exactly half the elements are even.

2007-12-01 14:31:38 · 2 answers · asked by Hynton C 3 in Science & Mathematics Mathematics

2 answers

Suppose there's at least one odd permutation p.

Look at the mapping from S-->S that sends any s -->ps

Odd permutations are mapped to even ones and vice versa.

So there's a 1-1 correspondence between odd and even permutations. So the number of each is the same.

Q.E.D.

2007-12-01 18:36:41 · answer #1 · answered by Curt Monash 7 · 4 0

you're taking the attitude of the dihedral and study it to the subgroups.The S5 must be inverted to supply you the reflect photograph of the isomorphic subgroups of 8,10 and 12.Then take the damaging log of each and every attitude to evaluation with the different subgroups.this might enable you to make certain to relationship of the S5 team that are non isomorphic to the propose deviation of each and every subset in terms of diverse non symetric dihedrals. See, incredibly undemanding.

2016-12-10 09:36:28 · answer #2 · answered by carmean 4 · 0 0

fedest.com, questions and answers