Let T=[(a_1, a_2,...,a_t) C {1,2,...n}] and H_T={beta is a member of S_n|beta(a_i)=a_i, for all a_i which is a member of T}. H_t is called the stabilizer of T in S_n, stab(T). Prove that H_T < S_n. What is the order of H_T
Let T=[(a_1, a_2,...,a_t) C {1,2,...n}] and H_T={beta is a member of S_n|beta(a_i)=a_i, for all a_i which is a member of T}. H_t is called the stabilizer of T in S_n, stab(T). Prove that H_T < S_n. What is the order of H_T
do you understand what H_T does?it suffices to show that H_T is a subgroup of S_n. or do you know that and are wondering how to do it?
you must show that H_T is nonempty. (consider the identity function)
then show that it is closed under the composition of functions
then show that each element has an inverse
which of these do you have problems with?
H_T leaves the elements in T fixed and permutes the other elements. how many ways can we permute the remaining elements?What is the order of H_T
note that the identity function is in so that it is not empty
to show closure, we need to show that if then (without loss of generality)
so assume . then and
thus
so that since
For inverses, note that if then works as the inverse of , and it is also in , since if we assume , then
so that
thus,