The symmetric group has exactly six permutations, written using permutation cycles:Here is the identity element; , and are transpositions; and and are permutation cycles of length three. With and , rightmost-first function composition gives and . The conjugacy classes and representative centralizers are
All six permutations of the symmetric group , their conjugacy classes, and representative centralizers
. Details. An explicit check of the conjugation with sends , , and , where each chain applies , then , then . Thus is fixed and are exchanged: . Relabelling also produces , so the three transpositions share one conjugacy class. A transposition reverses the length-three permutation cycle, since , putting both length-three permutation cycles in one conjugacy class.
Checking each of the six possible permutations against gives the displayed centralizers. Only has a one-element conjugacy class, so the center of a group here is . The class equation is . The second diagram in centralizer and normalizer uses the same and to show how preserving a cyclic subgroup differs from fixing its group generator.
Normalizer Created 2026-09-24 Updated 2026-10-14
For a subgroup of a group , the normalizer isIt is the stabilizer subgroup of under the conjugation action on subgroups. Its elements can permute members of ; they need not commute with them. For in the symmetric group , the cyclic subgroup has normalizer , although the centralizer of has only three elements, as illustrated in centralizer and normalizer.
Every element of preserves under conjugation, so . Moreover, is a normal subgroup of , and this is the largest subgroup of with that property. Indeed, any subgroup in which is a normal subgroup consists entirely of elements preserving under conjugation. In particular, exactly when is a normal subgroup of .[ref]
The orbit-stabilizer theorem counts distinct conjugate subsets of a subgroup byFor in , there is just one, since . For the subgroup , preserving forces its unique nonidentity element to stay fixed. Hence , and its three distinct conjugate subsets are , and . This is the subgroup counterpart of counting a conjugacy class with a centralizer: the object being stabilized determines which denominator belongs in the count.[ref]
The equality in the definition is essential. For a subgroup that is a finite group, an inclusion already gives equality by equal cardinalities. For an infinite subgroup, that inference can fail: conjugation might carry it onto a proper subgroup. The normal subgroup criterion is therefore, with the explicit hypothesis ,No finiteness or commutativity assumption is needed. A normal subgroup is preserved as a set; its elements need not lie in the center of a group.
There is a second useful count, distinct from counting conjugate subgroups. The normalizer acts on itself by group automorphisms, giving the group homomorphismIts group kernel is , so the centralizer of a subset is a normal subgroup of and the first isomorphism theorem givesThis quotient group records the different rearrangements of induced by the surrounding group. It gives a faithful group action on , but need not be the entire automorphism group of . For example, take the ambient group . Since is an abelian group, , so the quotient group is trivial; nevertheless is a nonidentity group automorphism of . Returning to the ambient symmetric group makes that group automorphism available through a reflection, and . Its two cosets are the three rotations and the three reflections.
The subgroup itself need not be contained in : their intersection is the center of a group . It is contained precisely when is an abelian group. Thus , which exists because is a normal subgroup of its normalizer, and answer different questions and should not be substituted for one another.
