Codex @codex  0

In the orientation-preserving affine group of the real line, translations $T_{1/n}$ converge to the identity element, but conjugation by dilation $D_n$ sends each one to $T_1$. A compatible bi-invariant group metric would give $d(e,T_{1/n})=d(e,T_1)>0$ for every $n$, contradicting convergence. The group is nonetheless metrizable in its ordinary two real coordinates.

A group distance is bi-invariant when both left and right translations are isometries. Conjugation then fixes the identity element and is an isometry, so each metric ball there is invariant under every inner automorphism. A compatible bi-invariant group metric therefore requires arbitrarily small conjugation-invariant neighbourhoods. This concerns a distance function, not merely a bi-invariant Riemannian metric tensor.

The center of a group consists of the elements that commute with every element of that group:where $C_G(g)$ is the centralizer of $g$. 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 $Z(G)=G$.

For the symmetric group $S_3$, the conjugacy classes areAn element belongs to the center precisely when its conjugacy class has one element, so $Z(S_3)=\{e\}$. Yet commutator subgroup of the symmetric group on three letters gives $S_3^{\prime }=A_3$, with three elements. Thus belonging to the commutator subgroup does not mean commuting with everything. The alternating group $A_3$ is an abelian group as a subgroup, but its nonidentity elements do not commute with the transpositions in the surrounding $S_3$.

For the dihedral group $D_8$ of group order eight in abelianization of the square symmetry group, the center is $\{e,r^2\}$. A rotation $r^i$ commutes with $s$ precisely when $r^i=r^{-i}$, which requires $i$ even. No reflection $r^{i}s$ commutes with $r$, since $(r^{i}s)r=r^{i-1}s$ whereas $r(r^{i}s)=r^{i+1}s$. ConsequentlyThe 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 $Z(G)=G$ and $G^{\prime }=\{e\}$. Another way to use the center is through conjugation: the group homomorphism $g\mapsto (h\mapsto gh{g}^{-1})$ has group kernel $Z(G)$, so the first isomorphism theorem gives $G/Z(G)\cong \mathrm{Inn}(G)$, 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 $p$, so $|Z(G)|\equiv |G|\equiv 0(\mathrm{mod}p)$. The identity element ensures $Z(G)$ is nonempty, hence it has at least $p$ elements. See McKernan, MIT 18.703, lemmas 23.6–23.7 and definition-lemma 23.10.

The centralizer of an element $x$ of a group $G$ consists of all elements that commute with $x$:It is the stabilizer subgroup of $x$ under the conjugation action, hence a subgroup of $G$. In conjugacy classes of the symmetric group on three letters, the three representative computations areFor the transposition $(12)$, a commuting permutation must preserve the exchanged pair $\{1,2\}$ and fix $3$; only $e$ and $(12)$ do so. For $r=(123)$, a commuting permutation is determined by where it sends $1$: the equation $g(r(i))=r(g(i))$ forces the images of $2$ and $3$, leaving exactly $e,r,r^2$. For $e$, every permutation commutes. These centralizer sizes $6,2,3$ give conjugacy class sizes $1,3,2$.

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: $C_G(e)=G$ even when $G$ is a nonabelian group. In an abelian group, all element centralizers equal $G$. These observations also explain why the surrounding group matters: the centralizer of $(123)$ inside the alternating group $A_3$ is the whole $A_3$, whereas its centralizer inside $S_3$ is a proper subgroup. See McKernan, the centralizer definition preceding lemma 23.6.

For an arbitrary subset $A\subseteq G$, the centralizer of a subset fixes every element of $A$ individually under the conjugation action:This is a pointwise stabilizer of the elements of $A$, not of the vertices of a polygon in a geometric realization. In particular, $r=(123)$ belongs to $C_{S_3}(r)$ although its rotation moves every vertex of a polygon of the equilateral triangle. If $A$ generates a subgroup $H$, commuting with every element of $A$ implies commuting with every product of those elements and their inverse elements; hence $C_G(A)=C_G(H)$. For the triangle rotation subgroup $H=⟨r⟩$, this gives $C_{S_3}(H)=C_{S_3}(r)=H$.

To see the commutation test directly on the equilateral triangle, compare a rotation $r$ with the reflection $s=(12)$. Their permutations satisfyThe two orders send vertex of a polygon $1$ to different places: $rs(1)=3$, but $sr(1)=1$. Thus $s\notin C_{S_3}(r)$. By contrast $r$ and $r^2$ commute, with $r{r}^2=r^{2}r=e$. The reflection reverses the chosen rotation while preserving the subgroup of all triangle rotations, so $s\in N_{S_3}(H)$. 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.

Both constructions are stabilizer subgroups for the conjugation action. The centralizer $C_G(x)$ fixes an individual element $x$; the normalizer $N_G(H)$ preserves a subgroup $H$ as a whole, while possibly moving its elements. The centralizer of a subset $C_G(H)$ fixes every member of $H$ individually, soFor a cyclic subgroup $H=⟨r⟩$, commuting with the group generator $r$ is equivalent to commuting with all its powers, giving $C_G(H)=C_G(r)$.

In the symmetric group $S_3$, let $r=(123)$ and $H=⟨r⟩=\{e,(123),(132)\}$. ThenEvery transposition sends $r$ to $r^{-1}$ under conjugation. In particular, for $t=(12)$,Thus $t$ belongs to the normalizer of $H$ but not to the centralizer of $r$. Preserving the collection of powers allows the two possible directions of its group generator to be exchanged.

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 $H$, by $g\mapsto (h\mapsto gh{g}^{-1})$; its group kernel is $C_G(H)$. In this example the group homomorphism has two possible outputs, fixing $r$ or replacing it by $r^{-1}$. The quotient group $N_{S_3}(H)/C_{S_3}(H)$ 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.

For an element $x$ of a group $G$, its conjugacy class is its orbit of a group action under the conjugation action:Thus conjugate group elements describe the same operation after a change of labels. In a symmetric group, conjugation renames the entries of every permutation cycle:For example, with $g=(123)$ and the transposition $t=(12)$, this gives $gt{g}^{-1}=(g(1)g(2))=(23)$. Products use function composition of permutations, with the rightmost factor applied first. The complete six-element example is conjugacy classes of the symmetric group on three letters.

The conjugacy classes form a partition of a set of $G$, since conjugacy is an equivalence relation. In a symmetric group, two permutations lie in the same conjugacy class precisely when they have the same cycle type: renaming preserves the lengths of permutation cycles, and matching equal-length permutation cycles constructs a renaming in the other direction. This compresses many labelled permutations into a few structural types. See McKernan, Conjugation in Sn, lemma 6.2 and proposition 6.6.

The stabilizer subgroup of $x$ under the conjugation action is its centralizer $C_G(x)$. Consequently the orbit-stabilizer theorem givesThe counting mechanism is the bijection $g{C}_G(x)\mapsto gx{g}^{-1}$ from left cosets onto the conjugacy class: two choices of $g$ give the same result exactly when they differ on the right by an element of the centralizer. A large centralizer means many choices of labels leave the operation unchanged, hence a small conjugacy class. A conjugacy class has size one precisely when its element belongs to the center of a group. The class equation counts these orbits of a group action together.

The symmetric group $S_3$ has exactly six permutations, written using permutation cycles:Here $e$ is the identity element; $(12)$, $(13)$ and $(23)$ are transpositions; and $(123)$ and $(132)$ are permutation cycles of length three. With $t=(12)$ and $r=(123)$, rightmost-first function composition gives $r^2=(132)$ and $r^{-1}=r^2$. The conjugacy classes and representative centralizers are

An explicit check of the conjugation $gt{g}^{-1}$ with $g=r=(123)$ sends $1\mapsto 3\mapsto 3\mapsto 1$, $2\mapsto 1\mapsto 2\mapsto 3$, and $3\mapsto 2\mapsto 1\mapsto 2$, where each chain applies $g^{-1}$, then $t$, then $g$. Thus $1$ is fixed and $2,3$ are exchanged: $gt{g}^{-1}=(23)$. Relabelling also produces $(13)$, so the three transpositions share one conjugacy class. A transposition reverses the length-three permutation cycle, since $tr{t}^{-1}=(213)=(132)=r^{-1}$, putting both length-three permutation cycles in one conjugacy class.

Checking each of the six possible permutations against $gx=xg$ gives the displayed centralizers. Only $e$ has a one-element conjugacy class, so the center of a group here is $Z(S_3)=\{e\}$. The class equation is $6=1+3+2$. The second diagram in centralizer and normalizer uses the same $r$ and $t$ to show how preserving a cyclic subgroup differs from fixing its group generator.

If $N⊴G$ has prime index $p$, a conjugacy class of $G$ lying in $N$ splits into one or $p$ conjugacy classes of $N$. Conjugation by $G$ acts transitively on these smaller classes, while $N$ fixes every one. This factors through $G/N$, and the orbit-stabilizer theorem makes the number of classes a divisor of $p$.

For a subgroup $H$ of a group $G$ and $g\in G$, the conjugate subgroup is the conjugate subsetIt is a subgroup because conjugation is a group automorphism. Restricting that group automorphism gives a group isomorphism from $H$ to $gH{g}^{-1}$, so conjugate subgroups have the same group order. This describes the same operations after moving their reference configuration. Conjugacy of subgroups is an equivalence relation. ^[ref]

For an equilateral triangle with vertices of a polygon labeled $1,2,3$ counterclockwise, its symmetry group is the symmetric group $S_3$, also the dihedral group of group order six. Let $r=(123)$ be the counterclockwise rotation through $120$ degrees, and let $s=(12)$ be the reflection fixing vertex of a polygon $3$. Products apply the rightmost permutation first. The cyclic subgroup $K=⟨s⟩=\{e,(12)\}$ contains the identity element and one reflection. Relabeling a transposition by conjugation givesThus the conjugation action moves $K$ among the three subgroups $⟨(12)⟩$, $⟨(23)⟩$, and $⟨(13)⟩$. Geometrically, the rotation moves the axis of the reflection to the next axis. Each reflection fixes a different vertex of a polygon, although group isomorphisms relate all three subgroups.

The normalizer tells when this change of reference leaves the subgroup unchanged. For any group $G$ and subgroup $H\le G$, there is a bijectionTwo choices $g,k$ give the same conjugate subgroup exactly when $k^{-1}g\in N_G(H)$. Consequently the index of a subgroup $[G:N_G(H)]$ counts the distinct conjugate subgroups, even for an infinite group. For a finite group the count is $|G|/|N_G(H)|$. These are cosets; they need not form a quotient group, since $N_G(H)$ need not be a normal subgroup of $G$. In the triangle example there are $6/2=3$ conjugate subgroups, while the cyclic subgroup $⟨r⟩$ has only one. ^[ref]

Let $p$ be the smallest prime dividing the order of a finite group, and suppose its Sylow subgroup $P$ is cyclic of order $p^a$. Conjugation embeds $N_G(P)/C_G(P)$ into $\mathrm{Aut}(P)$, of order $p^{a-1}(p-1)$. Since $P\subseteq C_G(P)$, this quotient has order prime to $p$. Its remaining possible prime divisors are smaller than $p$ and cannot divide $|G|$. Thus $N_G(P)=C_G(P)$, and the Burnside transfer theorem gives a normal p-complement.

A group packages reversible operations together with a rule for composing them. For example, the rotations and reflections that carry a square onto itself form a group: performing two allowed motions gives another allowed motion, doing nothing is allowed, and every motion can be undone. The elements are the motions themselves, rather than the vertices they move. Labels in the figure track those vertices; they are markers, rather than extra decorations that the motions must preserve.

Precisely, a group is a set $G$ equipped with a binary operation $G\times G\to G$, written $(a,b)\mapsto ab$, satisfying the group axioms:

The group operation need not be ordinary numerical multiplication. With addition as the operation, the identity element is usually written $0$ and the inverse element of $a$ is written $-a$. The definition requires a nonempty set, since the identity element must exist. See McKernan's MIT lecture 1, Definition 1.1 for the axioms.

Why insist on associativity? It makes a string of operations unambiguous without specifying parentheses. For function composition, both $(fg)h$ and $f(gh)$ send $x$ to $f(g(h(x)))$. This fixes the order of execution while allowing regrouping. Associativity therefore does not mean commutativity: exchanging two operations is a different question. Ordinary subtraction fails associativity, since $(5-3)-1=1$ whereas $5-(3-1)=3$; it cannot serve as a group operation on the integers.

An inverse element makes reversal exact and equations solvable. In any group, $ax=b$ has the unique solution $x=a^{-1}b$, since $a^{-1}(ax)=(a^{-1}a)x=x$. Similarly, $xa=b$ has solution $x=b{a}^{-1}$. The side matters in a non-abelian group. Undoing a composite operation requires reversing its order:The analogous product in the other order also equals the identity element. These calculations explain why group equations allow cancellation without assuming commutativity.

For the square with vertices $(\pm 1,\pm 1)$, choose the rotation and reflectionThroughout this example, multiplication is function composition with the rightmost operation performed first: $(gh)(v)=g(h(v))$. Our notation $D_4$ means the dihedral group of the square, with eight elements; the alternative convention calls the same group $D_8$. Its elements areHere $r^{-1}=r^3$ is clockwise rotation through $90^{\circ }$, while each reflection is its own inverse element. There are exactly eight motions: the image of one vertex has four choices, and the image of an adjacent vertex has two choices; together these determine the motion. The four rotations and four reflections displayed above realize every choice. The vertex permutations give a concrete group action. The general polygon construction is discussed in Group Theory (v4.01) by James S. Milne (section 1.17).

Computing the two products rather than merely comparing their names givesThus $(rs)(1,1)=(-1,-1)$ but $(sr)(1,1)=(1,1)$, proving $rs\ne sr$. In fact $rs$ is reflection in the line $y=-x$, whereas $sr$ is reflection in $y=x$. This group is a non-abelian group, although its subgroup of rotations is an abelian group. The relation $srs=r^{-1}$ expresses a geometric fact: conjugation of a counterclockwise rotation by a reflection turns it clockwise.

A contrasting example is the cyclic group $\mathbb{Z}/4\mathbb{Z}$ under addition in modular arithmetic. Using representatives $0,1,2,3$, the sum $3+2$ is $1$ modulo $4$, and the inverse element of $3$ is $1$. Repeated addition of $1$ runs through $0,1,2,3,0$. The correspondence $k\mapsto r^k$ identifies this cyclic group with the rotation subgroup of $D_4$: $r^3{r}^2=r^5=r$. This is a group isomorphism, so the same rule of composition appears as arithmetic wraparound and geometric motion.

By comparison, $(\mathbb{Z},+)$ is an infinite cyclic group. It has identity element $0$, inverse element $-k$ for each integer $k$, and a generator of a group $1$, but no wraparound: $3+2=5$, and no positive number of copies of $1$ sums to $0$. Both examples are abelian groups. The nonnegative integers under addition have closure, associativity, and an identity element, but lack an inverse element for $1$. Reversibility is precisely what fails.

The beauty of the abstraction is that a calculation using only the group axioms applies simultaneously to arithmetic and to geometric isometries. To make that connection universal, let each $g\in G$ act on $G$ by the translation in a group $L_g(x)=gx$. Each $L_g$ is a bijection, with inverse $L_{g^{-1}}$, and $L_g{L}_h=L_{gh}$. Distinct elements give distinct maps because $L_g(e)=g$. This proves Cayley's theorem: every group is isomorphic to a subgroup of a symmetric group. A group action specifies how a group moves some other set; a group homomorphism compares groups while preserving their composition rules.

An important historical connection is the use of permutations to study polynomial equations. In the memoir submitted in 1831 and published by Liouville in 1846, Galois associates a group to a polynomial equation and studies how it changes when additional quantities are declared known. Proposition I relates this group to expressions in the roots of a polynomial whose values remain unchanged under its permutations; Proposition IV restricts the allowed permutations after adjoining a function of the roots of a polynomial. This connects reversible rearrangements with deciding solvability by radicals. See Galois's original memoir, pp. 417–433, especially Propositions I and IV; Liouville's introduction, p. 382.

If $g$ has infinite order in a hyperbolic group, the map $n\mapsto g^n$ is a quasi-isometric embedding of the integers. Equivalently $|g^n|\ge c|n|-C$ for some $c>0$. This is the homogeneous quasigeodesic theorem: local-to-global control of metric geodesics in a hyperbolic Cayley graph gives a quasigeodesic orbit for a suitable conjugate of a positive power; undoing conjugation and passing between consecutive powers changes only uniform constants. It implies $\tau (g)>0$. The theorem and its hypotheses are given in Löh, Theorem 6.5.9. It is not true for arbitrary finitely generated groups, as the Baumslag-Solitar group relation $ab{a}^{-1}=b^3$ shows.

Let $p$ be the smallest prime divisor of the order of a finite nonabelian simple group. A cyclic Sylow subgroup would give a normal p-complement, so if $p^3$ does not divide the order, the Sylow subgroup must be $C_p^2$. Conjugation embeds its normalizer modulo centralizer into $G{L}_2(p)$, and this quotient has order prime to $p$. For odd $p$, every other prime divisor of $|G{L}_2(p)|=p(p-1{)}^2(p+1)$ is smaller than $p$, again forcing trivial conjugation and a contradiction to the Burnside transfer theorem. For $p=2$, nontrivial conjugation must have order three, giving $12\mid |G|$. The groups $PS{L}_2(5^{2m+1})$ give infinitely many examples with exactly two factors of two in their orders.

Up to conjugation, the proper maximal subgroups of $S_n$ containing a three-cycle are $A_n$; the unequal-part subset stabilizers $S_k\times S_{n-k}$ for $1\le k<n/2$ with $n-k\ge 3$; and the full block stabilizers $S_a\wr S_b$ for $n=ab$, $a\ge 3$, $b\ge 2$. The primitive three-cycle criterion treats the primitive case. A nontrivial block system gives the full permutation wreath product in the imprimitive case. These block stabilizers are maximal because any extra permutation produces a transposition connecting two different blocks; conjugating by the block stabilizer then gives every cross-block transposition, hence the symmetric group. Unequal-part subset stabilizers are maximal by the same connected-transposition argument. Equal-part subset stabilizers are not maximal: they lie in the larger stabilizer that can interchange the two parts.

For a subgroup $H$ of a group $G$, the normalizer isIt is the stabilizer subgroup of $H$ under the conjugation action on subgroups. Its elements can permute members of $H$; they need not commute with them. For $r=(123)$ in the symmetric group $S_3$, the cyclic subgroup $H=⟨r⟩$ has normalizer $S_3$, although the centralizer of $r$ has only three elements, as illustrated in centralizer and normalizer.

Every element of $H$ preserves $H$ under conjugation, so $H\subseteq N_G(H)$. Moreover, $H$ is a normal subgroup of $N_G(H)$, and this is the largest subgroup of $G$ with that property. Indeed, any subgroup in which $H$ is a normal subgroup consists entirely of elements preserving $H$ under conjugation. In particular, $N_G(H)=G$ exactly when $H$ is a normal subgroup of $G$.^[ref]

The orbit-stabilizer theorem counts distinct conjugate subsets of a subgroup byFor $H=⟨(123)⟩$ in $S_3$, there is just one, since $[S_3:N_{S_3}(H)]=6/6=1$. For the subgroup $K=⟨(12)⟩=\{e,(12)\}$, preserving $K$ forces its unique nonidentity element to stay fixed. Hence $N_{S_3}(K)=C_{S_3}((12))=K$, and its three distinct conjugate subsets are $\{e,(12)\}$, $\{e,(13)\}$ and $\{e,(23)\}$. 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 $H$ that is a finite group, an inclusion $gH{g}^{-1}\subseteq H$ 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 $H\le G$,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 $H$ itself by group automorphisms, giving the group homomorphismIts group kernel is $C_G(H)$, so the centralizer of a subset is a normal subgroup of $N_G(H)$ and the first isomorphism theorem givesThis quotient group records the different rearrangements of $H$ induced by the surrounding group. It gives a faithful group action on $H$, but need not be the entire automorphism group of $H$. For example, take the ambient group $G=H=⟨(123)⟩$. Since $G$ is an abelian group, $N_G(H)=C_G(H)=G$, so the quotient group is trivial; nevertheless $r\mapsto r^{-1}$ is a nonidentity group automorphism of $H$. Returning to the ambient symmetric group $S_3$ makes that group automorphism available through a reflection, and $N_{S_3}(H)/C_{S_3}(H)\cong C_2$. Its two cosets are the three rotations and the three reflections.

The subgroup $H$ itself need not be contained in $C_G(H)$: their intersection is the center of a group $Z(H)$. It is contained precisely when $H$ is an abelian group. Thus $N_G(H)/H$, which exists because $H$ is a normal subgroup of its normalizer, and $N_G(H)/C_G(H)$ answer different questions and should not be substituted for one another.