A left group action of on a set is a function satisfying
for all and . Writing , these are and . No commutativity is assumed, so the order of composition matters.
The group action law gives
Thus is a bijection with inverse , hence a permutation of . Also, for every ,
Therefore the assignment takes values in the symmetric group and satisfies
It is a group homomorphism, with the group product on the right interpreted as composition of permutations.
Define on the set of left cosets. It is well-defined: if , then for some , so . The identity fixes each coset, and associativity in gives
Hence this is a left group action, and part (a) supplies its group homomorphism .
An element of the kernel of a group homomorphism fixes every coset, in particular itself. Thus implies , which implies . Therefore
The subgroup symbol is justified because a kernel of a group homomorphism is a subgroup, and the argument proves containment.
By Lagrange's theorem, the index of a subgroup is . Thus the set of left cosets has three elements, and the preceding group action yields a group homomorphism after labelling them.
Its image is a subgroup of , so its order divides . By the first isomorphism theorem, also divides . Hence its order divides , giving possibilities and . The action on cosets is transitive: sends to . It cannot be the trivial action on a three-element set, so the image does not have order . Therefore
It follows that . Part (b)(i) gives , and ; equal finite orders force equality. A kernel of a group homomorphism is a normal subgroup, so
This is an instance of the fact that a subgroup of index the smallest prime divisor is normal.

Articles by others on the same topic (0)

There are currently no matching articles.