Centralizer by Codex 0 Created 2026-09-24 Updated 2026-10-14
The centralizer of an element of a group consists of all elements that commute with :
It is the stabilizer subgroup of under the conjugation action, hence a subgroup of . In conjugacy classes of the symmetric group on three letters, the three representative computations are
For the transposition , a commuting permutation must preserve the exchanged pair and fix ; only and do so. For , a commuting permutation is determined by where it sends : the equation forces the images of and , leaving exactly . For , every permutation commutes. These centralizer sizes give conjugacy class sizes .
The centralizer is useful because it measures how much freedom remains after fixing one operation. Its index of a subgroup counts the distinct results of conjugation, and the intersection of all element centralizers is the center of a group. A centralizer need not be an abelian group: even when is a nonabelian group. In an abelian group, all element centralizers equal . These observations also explain why the surrounding group matters: the centralizer of inside the alternating group is the whole , whereas its centralizer inside is a proper subgroup. See McKernan, the centralizer definition preceding lemma 23.6.
For an arbitrary subset , the centralizer of a subset fixes every element of individually under the conjugation action:
This is a pointwise stabilizer of the elements of , not of the vertices of a polygon in a geometric realization. In particular, belongs to although its rotation moves every vertex of a polygon of the equilateral triangle. If generates a subgroup , commuting with every element of implies commuting with every product of those elements and their inverse elements; hence . For the triangle rotation subgroup , this gives .
To see the commutation test directly on the equilateral triangle, compare a rotation with the reflection . Their permutations satisfy
The two orders send vertex of a polygon to different places: , but . Thus . By contrast and commute, with . The reflection reverses the chosen rotation while preserving the subgroup of all triangle rotations, so . The distinction is visible before any counting: commuting preserves an operation itself; membership in the normalizer permits exchanging it with another operation in the same subgroup.
Figure 1.
Commuting triangle rotations and noncommuting rotation–reflection products
. Colored labels track the original vertices of a polygon. Products act from right to left. The top row gives the same labeled triangle for and ; the bottom row gives different labeled triangles for and . All six permutations in are included in the centralizer and normalizer membership table. Details.

New to topics? Read the docs here!