Question #179442

Prove that for every subgroup H of Sn, either all of the permutations in H are even, or exactly half are even.



1
Expert's answer
2021-04-14T00:48:19-0400

Let aa be the number of odd permutations of H and bb denotes the number of even permutations. Then let {g1,g2,,ga}\{g_{1},g_{2},\cdots, g_{a}\} denotes the odd permutations. Then we consider .S={g1g1,g2g1,g3g1g1ga}.S=\{g_{1}g_{1},g_{2}g_{1},g_{3}g_{1}\cdots g_{1}g_{a}\} . By closure property SH.S\subseteq H. Also g1gi=g1gjgi=gj.g_{1}g_{i}=g_{1}g_{j}\Rightarrow g_{i}=g_{j}. Hence, S=a.|S|=a. x,yx,y odd permutations implies xyxy even. Hence SS consists of even permutations. Hence ab[SH]a\leq b [\because S\subseteq H] . Now even permutations of a subgroup always forms a group since, inverse of a even permutation is even and x,y evenxy even.x,y \ even \Rightarrow xy \ even. Also identityidentity is even permutation. Hence the even permutations are a subgroup of H. Hence by Lagrange, ba+bb|a+b . This shows, ba.b|a. So either a=0,a=0, or a=b[ba].a=b [\because b\geq a]. Hence b=H [case:a=0] or b=H2 [a=b].b=|H| \ [case: a=0]\ or \ b=\frac{|H|}{2} \ [a=b].


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS