If an abelian subgroup has index , the centralizer of any contains , so the class size of divides . The prime-power conjugacy-class obstruction to simplicity rules this out. If , the group is a p-group and has nontrivial center of a group, also ruling out nonabelian simplicity.
Adjoint-Higgs breaking of SU(3) to SU(2) and U(1) Created 2026-10-05 Updated 2026-10-06
For an adjoint vacuum expectation value proportional to , the centralizer is . Four gauge bosons remain massless and four acquire a common mass. This differs from Fundamental-Higgs breaking of SU(3) to SU(2).
Except in degree six, the -cycles are characterized among order-three elements by the largest centralizer. Their cyclic subgroups correspond to three-element supports. Two different such subgroups commute exactly for disjoint supports; with one common point their generator products have order five, and with two common points those products have order two or three. Thus an automorphism induces an automorphism of . The maximal cliques of a Johnson graph reconstruct a permutation of the points. After undoing that permutation, an automorphism fixes every cyclic -subgroup. Product orders force its choices of generator inversion to be consistent on the connected graph, and inversion of every -cycle would reverse a noncommuting product. Hence it fixes all -cycles, which generate .
Center of a group Created 2026-09-24 Updated 2026-10-14
The center of a group consists of the elements that commute with every element of that group:
where is the centralizer of . These are operations whose position in any product can be changed freely. The center is an abelian group and a characteristic subgroup, hence a normal subgroup. A group is an abelian group precisely when .
For the symmetric group , the conjugacy classes are
An element belongs to the center precisely when its conjugacy class has one element, so . Yet commutator subgroup of the symmetric group on three letters gives , with three elements. Thus belonging to the commutator subgroup does not mean commuting with everything. The alternating group is an abelian group as a subgroup, but its nonidentity elements do not commute with the transpositions in the surrounding .
For the dihedral group of group order eight in abelianization of the square symmetry group, the center is . A rotation commutes with precisely when , which requires even. No reflection commutes with , since whereas . Consequently
The half-turn can be performed before or after any square symmetry with the same result. Its appearance both here and in the commutator subgroup is a feature of this example, rather than a general equality. See Conrad, Dihedral groups I, theorem 3.4 and example 3.5.
The center and the commutator subgroup answer different useful questions: which operations already commute with everything, and which operations must disappear for the entire group to commute. In an abelian group these answers are and . Another way to use the center is through conjugation: the group homomorphism has group kernel , so the first isomorphism theorem gives , the inner automorphism group. The quotient group by the center thus records the distinct conjugation operations; it need not be an abelian quotient.
A nontrivial finite p-group always has a nontrivial center. In the class equation, each noncentral conjugacy class has size divisible by , so . The identity element ensures is nonempty, hence it has at least elements. See McKernan, MIT 18.703, lemmas 23.6–23.7 and definition-lemma 23.10.
Centralizer 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.
Centralizer and normalizer Created 2026-09-24 Updated 2026-10-14
Both constructions are stabilizer subgroups for the conjugation action. The centralizer fixes an individual element ; the normalizer preserves a subgroup as a whole, while possibly moving its elements. The centralizer of a subset fixes every member of individually, so
For a cyclic subgroup , commuting with the group generator is equivalent to commuting with all its powers, giving .
In the symmetric group , let and . Then
Every transposition sends to under conjugation. In particular, for ,
Thus belongs to the normalizer of but not to the centralizer of . Preserving the collection of powers allows the two possible directions of its group generator to be exchanged.
Figure 1.
The centralizer fixes , while the normalizer preserves and may exchange with its inverse element
. Details.
This distinction lets one ask separately which operations leave a chosen operation unchanged and which operations preserve the subgroup it generates. The normalizer also supplies a group homomorphism to the automorphism group of , by ; its group kernel is . In this example the group homomorphism has two possible outputs, fixing or replacing it by . The quotient group is therefore a cyclic group of group order two. Milne develops the normalizer as a stabilizer subgroup in Group Theory (v4.01) by James S. Milne.
Identify a regular orbit with the group using a chosen base point. A permutation commuting with all left translations satisfies . Thus the centralizer consists of right translations. Defining makes and gives an isomorphism to , rather than an unmentioned reversal of multiplication.
Centralizer of a subset 2026-10-14
The centralizer of a subset of a group consists of the elements commuting with every member of . It is the intersection of the element centralizers, hence a subgroup. Directly, identity commutes with every element, products of two elements that each commute with every member of still have that property, and the same is true of inverses. For this is the centre of a group. For an empty subset the commutation condition is vacuous and the centralizer is all of .
Class equation Created 2026-10-03 Updated 2026-10-14
For a finite group , choose one representative from each conjugacy class with more than one element. The class equation is
where is the center of a group and is the centralizer of . Each central element contributes its own one-element conjugacy class. Every remaining conjugacy class contributes its size, given by the orbit-stabilizer theorem. The sum counts each element exactly once. See McKernan, Group actions and automorphisms, lemma 23.6.
For conjugacy classes of the symmetric group on three letters, take and . Their centralizers have sizes two and three, and the center of a group has size one, giving
For an abelian group, every centralizer is the whole group, every conjugacy class has size one, and the sum over noncentral representatives is empty.
The power of this counting identity is that the sizes of conjugacy classes constrain group structure. For a nontrivial finite p-group with group order , every noncentral conjugacy class has size a positive power of , by Lagrange's theorem. The class equation therefore gives . Since the identity element lies in the center of a group, the center of a group must have at least elements. This obtains an element commuting with the entire group without constructing one. See McKernan, lemma 23.7.
Historically, these ideas belong to the nineteenth-century development of permutation groups and normal subgroups. Milne's historical opening records Galois's introduction of normal subgroups in 1832 and Jordan's systematic treatment of permutation groups in 1870. This is context for the conjugation action and the class equation, rather than a claim that either author first stated the modern formula.[ref]