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 areFor 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 satisfyThe 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.
Mathieu group 2026-10-14
Möbius pointwise stabilizer of two points Created 2026-10-14 Updated 2026-10-31
For two distinct points of the Riemann sphere, conjugate by a Möbius transformation sending them to zero and infinity. A transformation fixing those two points has the form , . Composition multiplies the parameter, so the pointwise stabilizer is isomorphic to the complex multiplicative group. For zero and one, conjugation by gives .
Past exam of the mathematics course of the University of Cambridge 2004 ia Paper 3 2D Solution Created 2026-09-24 Updated 2026-10-14
The Möbius group consists of maps with , acting on the Riemann sphere . Proportional matrices represent the same map. Thus it is , equivalently after normalizing the determinant. A zero denominator gives the image , while maps to when and stays at infinity when .
Fixing both zero and infinity forces , leaving with . Composition multiplies the parameters, giving a bijective group homomorphism from the multiplicative group of nonzero complex numbers to this pointwise stabilizer.
For the other pair, take , which sends zero to zero and one to infinity. Conjugate the scaling subgroup by this Möbius transformation:Every map fixing zero and one arises this way. Composition again multiplies , proving both subgroups are isomorphic to . This is the Möbius pointwise stabilizer of two points; conjugation changes the selected fixed points without changing its group structure.
Stabilizer subgroup Created 2026-09-24 Updated 2026-10-14
For a group action of a group on a set , the stabilizer subgroup of consists of the transformations that leave fixed:It is a subgroup: the identity element fixes , products of transformations fixing fix , and the inverse element of a transformation fixing also fixes . A stabilizer subgroup is a subset of , whereas the orbit of a group action is a subset of . See Ackerman's algebra notes, definition 0.4.1.2.
For the square group actions defined under group action, direct calculation givesThe reflection fixes and individually. The reflection preserves the unoriented side of a polygon by exchanging its two vertices of a polygon. The half-turn rotation exchanges the two ends of the unoriented diagonal of a polygon while preserving that diagonal of a polygon. Thus fixing a side of a polygon or diagonal of a polygon as an object does not mean fixing every point on it; the latter condition uses a pointwise stabilizer. The four stabilizer subgroups have group orders , matching group orbit sizes through the orbit-stabilizer theorem.
A stabilizer subgroup records the transformations still available after imposing a constraint. Fixing a vertex of a polygon of the square leaves two choices; fixing its centroid leaves all eight. In a faithful group action, a stabilizer subgroup can still contain a nonidentity transformation, as shows: a faithful group action requires that only the identity element fix every point of simultaneously, not that every individual stabilizer subgroup be trivial. The two-point cyclic group example under group action has both stabilizer subgroups equal to the group kernel of its associated group homomorphism.
