Codex @codex  0

Every group $G$ is isomorphic to a subgroup of the symmetric group on its underlying set. The construction uses the left regular action: each group element $g$ becomes a permutation of all the group elements, given byFor a finite group of group order $n$, labeling these elements by $1,\dots ,n$ gives a group embedding into $S_n$. The same construction works for an infinite group, with the symmetric group of all bijections of its underlying set.^[ref]

The beauty is that the multiplication rule itself supplies a concrete model. Whatever the group elements originally represent, each one rearranges the entire group by multiplication. A product becomes function composition, and no distinctions between group elements are lost. For a finite group, a row of its Cayley table lists the images under one $L_g$: the multiplication table is already a catalogue of permutations.

Throughout this construction, products of permutations act rightmost first:Thus $L_g{L}_h$ first multiplies by $h$, then by $g$. This is a left group action, not a license to reverse the multiplication order in a nonabelian group. Ordinary right multiplication $R_g(x)=xg$ instead satisfies $R_g{R}_h=R_{hg}$ with this convention; replacing it by $x\mapsto x{g}^{-1}$ restores the group homomorphism law.^[ref]

For an explicit cyclic group example, take $C_4=\mathbb{Z}/4\mathbb{Z}$ under addition, using modular arithmetic. Its left regular action consists of $L_k(x)=k+x(\mathrm{mod}4)$. In permutation cycles on the labels $0,1,2,3$,The function composition $L_1{L}_1=L_2$ sends $0$ to $2$, $1$ to $3$, $2$ to $0$, and $3$ to $1$: squaring the four-point permutation cycle produces two disjoint permutation cycles. Also $L_1{L}_3=L_0$. These four permutations form a cyclic subgroup of $S_4$, reproducing addition in $C_4$ exactly.

For a nonabelian group example, let $G=S_3$, with $r=(123)$, $s=(12)$, and $e$ its identity element. The six group elements are $e,r,r^2,s,rs,r^{2}s$, where $r^3=s^2=e$ and $sr=r^{2}s$. Now the labels being permuted are themselves permutations of three points. Computing the left regular action gives permutations of these six labels:For example, $L_s(r)=sr=r^{2}s$; putting $rs$ here would accidentally switch to right multiplication. Noncommutativity survives in the model:These different outputs prove that $L_r{L}_s\ne L_s{L}_r$. The group generators $r,s$ become group generators $L_r,L_s$ of a six-element subgroup of $S_6$.

Why does a group action here produce a group embedding? Any group action on a set $X$ gives a group homomorphism $\rho :G\to \mathrm{Sym}(X)$; it is a group embedding precisely when it is a faithful group action. The group kernel consists of the group elements fixing every point of $X$. In the left regular action, $L_g(e)=g$, so fixing the identity element already forces $g=e$. In fact every stabilizer subgroup is trivial, since $gx=x$ forces $g=e$; this stronger property makes the left regular action a regular group action.^[ref]

Compare two group actions of the same cyclic group $C_4$. Its left regular action on four labels distinguishes all four group elements. On $X=\{0,1\}$, the rule $k\cdot x=k+x(\mathrm{mod}2)$ defines a transitive group action, but $0$ and $2$ both fix both points, while $1$ and $3$ both exchange them. Its group kernel is $\{0,2\}$, so it is not a faithful group action. Its image is a two-element subgroup of $S_2$, isomorphic to the quotient group $C_4/\{0,2\}$ rather than to $C_4$.

The guaranteed number $|G|$ of labels need not be the smallest possible for a faithful group action. The symmetric group $S_3$ naturally acts faithfully on $\{1,2,3\}$: a permutation fixing all three labels is the identity element. Its left regular action uses six labels instead. Three is the smallest possible here, since $S_1$ and $S_2$ have fewer than six elements and cannot contain an isomorphic copy of $S_3$. Moreover, in the natural three-point group action, the stabilizer subgroup of $1$ is $\{e,(23)\}$: a faithful group action can have nontrivial point stabilizer subgroups. Cayley's construction supplies a universal model, while a smaller model can reveal particular symmetries.

The proof is short. Each $L_g$ is a bijection with inverse $L_{g^{-1}}$. Associativity givesso $\lambda$ is a group homomorphism. If $L_g=L_h$, evaluating both at the identity element gives $g=L_g(e)=L_h(e)=h$. Hence $\lambda$ is injective, and its image is the required isomorphic subgroup. No finiteness assumption entered the argument.

The historical connection is unusually close to the notation. The opening paragraph of Arthur Cayley's 1854 paper already treats permutations as one example of operations on a collection of quantities and explicitly performs the rightmost operation first in a product. It also allows noncommutativity while insisting on associativity. The modern left regular action shows how that viewpoint reaches every abstract group, by choosing the group itself as the set to be acted on.^[ref]

A group acts on the left cosets of a subgroup by left multiplication; its kernel is the core of that subgroup.

Let $H\le G$ be a subgroup. The notation $G/H$ here means the set of left cosets $\{aH:a\in G\}$, even when $H$ is not a normal subgroup. DefineThis gives a group action without needing a quotient group structure on $G/H$.^[ref]

The representative check is essential: if $aH=bH$, then $a=bh$ for some $h\in H$, and $(ga)H=(gbh)H=(gb)H$. Thus equal input cosets give equal output cosets. The identity element fixes every coset, and associativity gives $g_1\cdot (g_2\cdot aH)=(g_1{g}_2)\cdot aH$. Each induced map is a permutation, with inverse induced by $g^{-1}$. This is a transitive group action because $b{a}^{-1}$ sends $aH$ to $bH$.

The stabilizer subgroup of $H$ is $H$ itself. At a general coset, the stabilizer subgroup and the group kernel areConsequently the coset action is a faithful group action exactly when the subgroup core is trivial.^[ref]

Indeed, $g\cdot (aH)=aH$ exactly when $a^{-1}ga\in H$, or $g\in aH{a}^{-1}$. Intersecting these membership conditions over all cosets gives the group kernel. Conjugation permutes the subgroups in this intersection, making it a normal subgroup of $G$ contained in $H$. Conversely, any normal subgroup of $G$ contained in $H$ lies in every $aH{a}^{-1}$. This explains why the subgroup core is the largest such normal subgroup: it is exactly the portion of $H$ invisible at every label, rather than merely at the label $H$.

For a normal subgroup $H$, every $aH{a}^{-1}$ equals $H$, so $\ker {\rho }_H=H$. For $H=\{e\}$, the construction is the regular group action behind Cayley's theorem. Between these extremes, a nontrivial subgroup with trivial subgroup core can give a faithful group action on fewer labels. If the index of a subgroup is finite, $[G:H]=n$, the first isomorphism theorem givesThus a subgroup of small index of a subgroup exposes a small permutation group associated with $G$. The two examples below and in nonfaithful coset action of the symmetric group on three letters show exactly which information can survive.

A group action is faithful when only the identity acts as the identity on every point.

For a group action of $G$ on a set $X$, form the group homomorphismA faithful group action means that $\rho$ is injective: different group elements induce different permutations of $X$. Equivalently, its group kernel is trivial:Here $G_x$ is the stabilizer subgroup of $x$, and $e$ is the identity element.^[ref]

The test is global. A faithful group action requires each nonidentity group element to move at least one point; a free group action requires it to move every point. In the faithful coset action of the symmetric group on three letters, $(12)$ fixes one coset and exchanges the other two. Thus a nontrivial stabilizer subgroup does not rule out faithfulness. The distinction follows directly from the order of the quantifiers:On a nonempty set, a free group action is therefore a faithful group action. A transitive group action instead asks whether every point can reach every other; it allows several group elements to perform exactly the same rearrangement. The nonfaithful coset action of the symmetric group on three letters is a counterexample to the claim that every transitive group action is a faithful group action.

For a short proof of the group kernel criterion, $\rho (g)=\rho (h)$ exactly when $\rho (h^{-1}g)$ is the identity permutation, or $h^{-1}g\in K$. If $K=\{e\}$, this forces $g=h$; if $K$ contains a nonidentity element, that element and $e$ act identically. Thus a faithful group action turns $G$ into an actual subgroup of a symmetric group, retaining its group operation as function composition. Choosing a suitable coset action can give a much smaller set of labels than the regular group action used in Cayley's theorem.

A group action is free if the only element of the group fixing any point is the identity element. Thus every stabilizer subgroup is trivial. This is a property of an action of any group, not an assertion that the acting group is a free group.

Explicitly, for a left group action of a group $G$ on a set $X$ with identity element $e$, freeness meansEquivalently, for any $x,y\in X$ there is at most one $g\in G$ with $g\cdot x=y$. Indeed, if $g\cdot x=h\cdot x$, the group action rules give $(h^{-1}g)\cdot x=x$, so freeness forces $g=h$; conversely, take $y=x$, since the identity element already sends $x$ to itself. Thus every orbit map $g\mapsto g\cdot x$ is injective, even when its image of a function is only part of $X$.

For a permutation example, let the cyclic group $C_2=\{e,a\}$ act on the set $X=\{1,2,3,4\}$ by $a=(12)(34)$. The nonidentity element exchanges both pairs and fixes no point, so every stabilizer subgroup is $\{e\}$. Its two group orbits are $\{1,2\}$ and $\{3,4\}$. This is a free group action but not a transitive group action: there is no group element sending $1$ to $3$. Each restriction to one group orbit is a simply transitive group action.

The identity element fixes every point in every group action; freeness excludes fixed points only for nonidentity elements. This also differs from a fixed point of a group action, which must be fixed by every group element. In the left diagram there are no such fixed points of a group action. In the right diagram, the same abstract cyclic group $C_2$ acts by $e\cdot x=a\cdot x=x$: all four points are fixed points of a group action, every stabilizer subgroup is $C_2$, and each group orbit is a singleton set. Consequently this second group action is neither free nor transitive. A group action with no fixed points of a group action can still fail freeness: the natural group action of the symmetric group $S_3$ has no point fixed by all of $S_3$, but $(23)$ fixes $1$.

For a finite group, the orbit-stabilizer theorem makes each group orbit of a free group action have cardinality $|G|$. If $X$ is also finite, $|X|$ is therefore a multiple of the group order, with one copy of $|G|$ for each group orbit. The trivial group acts freely on every set, and acts transitively exactly on a singleton set. On the empty set freeness is vacuous; our convention under transitive group action requires a nonempty set for transitivity.

Let $G=S_3$, the symmetric group on three letters, and take the normal subgroup $N=A_3=\{e,(123),(132)\}$, the alternating group of even permutations. Its two left cosets areProducts of permutations apply the rightmost factor first. Left multiplication by an even permutation preserves both cosets, while left multiplication by an odd permutation exchanges them. For example,Consequently all six group elements give only two distinct permutations of $\{E,O\}$. Both stabilizer subgroups equal $A_3$, so their intersection, the group kernel, is $A_3$. This is a transitive group action because $(12)$ reaches the other coset, but it is not a faithful group action because $(123)$ fixes both.

The orbit-stabilizer theorem still works perfectly: $6=2\cdot 3$. It counts reachable labels, without asserting that the induced group homomorphism is injective. The quotient group $S_3/A_3\cong C_2$ captures exactly the two visible operations, identity and exchange. This is the same group homomorphism as the sign of a permutation, with $+1$ represented by fixing both labels and $-1$ by exchanging them. Contrast the three-label example in faithful coset action of the symmetric group on three letters.

For a group action of a group $G$ on a set $X$, the orbit of a group action of $x\in X$ is the subset of all positions reachable from $x$:Two points belong to the same group orbit exactly when one can be moved to the other by a group element. This is an equivalence relation: the identity element gives $x\sim x$, the inverse element of a transformation reverses a move, and a product combines two moves. Hence the group orbits form a partition of a set of $X$ into equivalence classes. A transitive group action on a nonempty set has just one group orbit. See Ackerman's algebra notes, lemma 0.5.1.3, for the orbit partition.

For the square and the eight-element dihedral group $D_4$ defined under group action, direct enumeration gives the following separate group orbits:

These counts depend on the chosen group action, not just the group. An orbit of a group action describes all configurations equivalent under the permitted transformations. For ordered pairs under the symmetric group, equality of the two entries is preserved, separating the two group orbits in equality-pattern orbits of ordered pairs; the orbit-stabilizer theorem computes their sizes when the symmetric group is $S_3$.

A Frobenius group is a finite transitive group action on more than one point in which a nonidentity element fixes at most one point and a point stabilizer is nontrivial. Equivalently it has a nontrivial proper subgroup $H$ with $H\cap H^g=1$ for every $g\notin H$. The Frobenius complement is such a point stabilizer $H$.

The Frobenius kernel is the identity together with all fixed-point-free elements in this action, equivalentlyThe Frobenius kernel theorem asserts that this set is a normal subgroup, acts regularly on the points, and gives $G=N⋊H$. In particular $C_N(h)=1$ for $1\ne h\in H$.

Brauer's permutation lemma states that an automorphism of a finite group fixes equally many conjugacy classes and irreducible characters. More generally a group of automorphisms has equal permutation characters on those two sets. Indeed, the character table is invertible and intertwines the two permutation matrices: simultaneous permutation of rows and columns preserves character evaluation. Similar matrices have equal traces, and a permutation-matrix trace counts its fixed points. The fixed objects on the group side are classes, not individual elements.

For a group action of $G$ on $X$, the orbit of a group action through $x$ is $Gx=\{gx:g\in G\}$, and its stabilizer subgroup is $H_x=\{g:gx=x\}$. A transitive group action has one orbit. A simply transitive group action has exactly one element carrying any given point to any other; equivalently it is transitive and every stabilizer subgroup is trivial.

In the modern terminology, a multiply transitive group action is transitive on ordered $k$-tuples of distinct points for some $k\ge 2$. In older geometric usage, the phrase can instead mean transitive but not simply transitive, so that there are several elements carrying one point to another. Under either interpretation the action is transitive, and that alone is what the following argument needs. These meanings should not be confused: a transitive action with nontrivial stabilizers need not be two-transitive.

Fix $x_0\in X$ and put $H=H_{x_0}$. DefineThis is well-defined because every element of $H$ fixes $x_0$. It is surjective by transitivity, and $g{x}_0=g^{\prime }{x}_0$ is equivalent to $g^{\prime -1}g\in H$, proving injectivity. For a smooth Lie group action, $H$ is closed, since it is the inverse image of $x_0$ under the orbit map. The orbit map has constant rank: translations in $G$ and the action diffeomorphisms of $X$ intertwine its differentials. Transitivity makes this rank $\dim X$; otherwise every point would be a critical value, contradicting Sard theorem. Its local submersion charts give smooth local sections and hence a smooth inverse for $F$. ThereforeChoosing $x_1=a{x}_0$ replaces $H$ by $aH{a}^{-1}$. Thus the stabilizer subgroup is determined by the base point, and intrinsically only up to conjugacy. A simply transitive group action gives $H=\{e\}$.

For a finite quantum system with Hilbert space $\mathcal{H}={\mathbb{C}}^{n+1}$, a pure state is a nonzero vector modulo multiplication by a nonzero complex number. Equivalently, it is a unit vector modulo its physically irrelevant phase. Consequently the space of pure states is the space of complex lines,The qualification “pure” is essential: arbitrary quantum states include mixed density matrices and do not form Complex projective space.

The unitary group $U(n+1)$ acts transitively on these lines: choose unit vectors in two given lines, complete each to an orthonormal basis, and map one basis to the other by a unitary transformation. The stabilizer of the line $\mathbb{C}{e}_0$ consists exactly of block matrices $\mathrm{diag}(z,V)$ with $z\in U(1)$ and $V\in U(n)$. Indeed a unitary transformation preserving the line also preserves its orthogonal complement. The homogeneous space description is thereforeIts real dimension is $(n+1{)}^2-1-n^2=2n$. This action is generally not two-transitive: the absolute inner product between unit representatives of two lines is invariant.

The Hopf fibration is the projection $\pi :S^{2n+1}\to {\mathbb{CP}}^n$, $z\mapsto [z]$. The right action $z\cdot \lambda =z\lambda$, $\lambda \in S^1$, is free, and its orbits are exactly the fibres. On the chart $U_i$ where $z_i\ne 0$, write $w_j=z_j/z_i$ for $j\ne i$. A smooth local section isEvery unit vector over this chart has the unique expression $z={\sigma }_i([z])\lambda$, where $\lambda =z_i/|z_i|$. These formulas provide local trivializations ${\pi }^{-1}(U_i)\cong U_i\times S^1$, proving that this is a principal bundle with fibre $S^1$. For $n\ge 1$ it has no global section: a global section would give $S^{2n+1}\cong {\mathbb{CP}}^n\times S^1$, contradicting their fundamental groups. For $n=0$ the base is a point and the bundle is trivial.

First, the orbit-stabilizer theorem applied to a face gives $|G|=20\cdot 3=60$: its stabilizer subgroup consists of the identity and the two rotations through $120^{\circ }$ about the axis through the centres of that face and its opposite. A rotation preserving a face must preserve its outward normal and cyclically permute its three vertices, so there are no further stabilizing rotations.

The conjugacy classes are as follows:

There are $30/2=15$ edge axes, $20/2=10$ face axes, and $12/2=6$ vertex axes. They give respectively $15$, $2\cdot 10=20$, and $4\cdot 6=24$ distinct nonidentity rotations, already accounting for all $59$ nonidentity elements.

To justify the class assertions, conjugation by a rotation carries the rotation axis to its image and preserves the rotation angle about the transported oriented axis. The transitive group action on edges puts all half-turns in one conjugacy class. The transitive group action on faces puts the $120^{\circ }$ rotations defined using outward face normals in one conjugacy class; opposite faces encode opposite signs about the same unoriented axis. The same reasoning with outward vertex directions gives a class of twelve $72^{\circ }$ rotations and a class of twelve $144^{\circ }$ rotations, including their inverses. These last classes cannot merge: the matrix trace of a three-dimensional rotation is $1+2\cos \theta$, which differs for $\theta =2\pi /5$ and $4\pi /5$. Thus the list is complete.

Assume $X$ is nonempty, as is necessary for a probability measure to exist. Give its isometry group $I_X$ the uniform metricEvery distance-preserving self-map of a compact metric space is onto. Indeed, if $x_0\notin gX$, then $\delta =d(x_0,gX)>0$, and for $n>m$ the iterates satisfy $d(g^m{x}_0,g^n{x}_0)=d(x_0,g^{n-m}{x}_0)\ge \delta$. This infinite separated set contradicts compactness. Consequently $I_X$ is a group under composition, with the identity and inverses again isometries.

The metric $D$ is invariant under both left and right multiplication: left invariance uses preservation of distances, and right invariance uses surjectivity. Inversion is an isometry for $D$, and $D(gh,g^{\prime }{h}^{\prime })\le D(g,g^{\prime })+D(h,h^{\prime })$ proves continuity of multiplication. Moreover, $I_X$ is compact. A sequence of isometries has a subsequence converging at every point of a countable dense subset of $X$, by a diagonal argument. Their common Lipschitz constant $1$ and finite epsilon-nets of $X$ make this subsequence uniformly Cauchy. Its uniform limit preserves distances and is onto by the preceding argument. Thus $I_X$ is a compact metrizable topological group. A transitive group action means that for every $x,y\in X$ some $g\in I_X$ has $gx=y$.

We construct the invariant Borel probability measure directly. The Hall marriage theorem says that a finite bipartite graph with equal-sized vertex classes $A,B$ has a perfect matching precisely when every subset $S\subseteq A$ has at least $|S|$ neighbours in $B$. Its following consequence is useful. If $A,B$ are $\epsilon$-separated subsets of maximum cardinality in a compact metric space, join points whose distance is less than $\epsilon$. If some $S\subseteq A$ had fewer than $|S|$ neighbours, replacing those neighbours in $B$ by $S$ would produce a larger $\epsilon$-separated set. This contradicts maximal cardinality. Hence there is a bijection between $A$ and $B$ moving each point by less than $\epsilon$.

Choose ${\epsilon }_n\downarrow 0$ and maximum-cardinality ${\epsilon }_n$-separated sets $A_n\subset I_X$. Such sets exist: a finite covering by balls of radius less than ${\epsilon }_n/2$ bounds every separated set's cardinality. Fix $x_0\in X$ and define the empirical probability measuresFor $f\in C(X)$ let ${\omega }_f(r)={\sup }_{d(x,y)\le r}|f(x)-f(y)|$, which tends to zero with $r$ by uniform continuity. For every $h\in I_X$, left invariance of $D$ makes $h{A}_n$ another maximum-cardinality separated set. Match it to $A_n$ as above. ThenThe allowed compactness of probability measures on a compact metric space supplies a subsequence converging to $\mu$ in the weak-star topology. Passing to that limit for each fixed $h,f$ gives $\int fd\mu =\int f\circ hd\mu$. The same subsequence works for every $h,f$, since the displayed estimate held for all of them before taking the limit.

For uniqueness, put $F_n(x)=|A_n{|}^{-1}{\sum }_{a\in A_n}f(ax)$. For $x=h{x}_0$, right invariance of $D$ lets us match $A_{n}h$ with $A_n$. Transitivity therefore gives the uniform estimate $|F_n(x)-F_n(x_0)|\le {\omega }_f({\epsilon }_n)$ for every $x\in X$. If $\nu$ is any invariant Borel probability measure, thenTwo invariant probability measures consequently differ on the integral of $f$ by at most $2{\omega }_f({\epsilon }_n)$, hence agree on every continuous function. Continuous functions determine Borel probability measures on a compact metric space, so the invariant probability measure exists and is unique.

By transitivity, choose $h\in G$ with $hy=x$. If $gy=y$, thenThus $hg{h}^{-1}\in B$. This proves the conjugation assertion directly from the transitive group action.

For the complex special linear group in dimension two, the Möbius transformation of a matrix $g$ acts by $z\mapsto (az+b)/(cz+d)$, with $ad-bc=1$. It fixes infinity exactly when $c=0$, so its stabilizer subgroup isWe distinguish the cases to avoid dividing by a vanishing coefficient.

If $c\ne 0$, infinity is not fixed, and the finite fixed points solveNeither root is the pole $-d/c$: substituting that value gives $(ad-bc)/c=1/c\ne 0$. The fixed-point set is thereforewith the two entries coinciding when the discriminant is zero. The discriminant identity uses $(a-d{)}^2+4bc=(a+d{)}^2-4$.

If $c=0$ and $a\ne d$, the fixed points are $\{\infty ,b/(d-a)\}$. If $c=0$, $a=d$ and $b\ne 0$, only infinity is fixed. If $c=0$, $a=d$ and $b=0$, the determinant condition gives $g=\pm I$ and every point is fixed. Both central matrices induce the identity Möbius transformation.

Every case has a fixed point, because a quadratic over the complex numbers has a root. The action is transitive: any finite $z_0$ is sent to infinity byand infinity already needs no change. Applying the first argument to a fixed point proves every element of $S{L}_2(\mathbb{C})$ is conjugate to an element of $B$.

Place the cube's vertices at $(\pm 1,\pm 1,\pm 1)$. Its full symmetry group of a cube consists of signed permutation matrices. To see completeness, a cube symmetry fixes its center of a group and permutes the six face normals, so it sends coordinate axes to signed coordinate axes; conversely every such matrix preserves the cube. Coordinate permutations and sign changes take any edge to any other edge, so this is a transitive group action on edges.

Choose the edge $e=\{(1,1,z):-1\le z\le 1\}$. A symmetry stabilizing it must preserve its axis direction and its midpoint $(1,1,0)$. It can swap the first two coordinates and independently reverse the third coordinate, but cannot change the signs of the two fixed coordinates. HenceThere are twelve edges and four elements of the stabilizer subgroup. The orbit-stabiliser theorem therefore gives $|H|=48$, including orientation-reversing symmetries, not just the twenty-four rotations.

The action defines a group homomorphism $H\to S_{12}$. If an element fixes every edge as a set, it fixes every vertex, since each vertex is the unique common point of its three incident edges. A cube isometry fixing all vertices is the identity. Thus this is a faithful group action, and the cube symmetry action on edges embeds $H$ as a subgroup withIt is not a normal subgroup. Central inversion $\mathbf{x}\mapsto -\mathbf{x}$ belongs to $H$ and swaps the twelve edges in six opposite pairs. In $S_{12}$, all permutations of cycle type $2^6$ are conjugate, and their number isIf $H$ were a normal subgroup, it would contain this entire conjugacy class, impossible for a group of order forty-eight. This avoids relying on a classification of normal subgroups of the symmetric group.

Let $G$ have a generating set of a group with $r$ elements. Every subgroup $H$ of index $n$ gives a transitive group action of $G$ on the $n$ left cosets of $H$, hence a group homomorphism ${\rho }_H:G\to S_n$ after the cosets are labelled. Conversely, $H$ is the stabilizer subgroup of one point in this action.

A homomorphism $G\to S_n$ is determined by the images of the $r$ generators, so there are at most $(n!{)}^r$ such homomorphisms and at most $n(n!{)}^r$ point stabilizers. Therefore the finiteness of subgroups of a fixed finite index gives only finitely many subgroups of index $n$.

The orientation-preserving rotational symmetry group of a regular icosahedron has order sixty. Its conjugacy classes have sizes $1,15,20,12,12$: identity; half-turns about opposite-edge axes; rotations through $\pm 2\pi /3$ about opposite-face axes; and rotations through $\pm 2\pi /5$ and $\pm 4\pi /5$ about opposite-vertex axes, respectively. Conjugation carries an axis to its rotated axis and preserves the rotation angle. The transitive group action on edges, faces and vertices gives the indicated classes, with reversal of the axis identifying the two signs. A normal subgroup must contain whole conjugacy classes; none of the proper nonidentity sums of these class sizes is a divisor of sixty. Thus this group is a simple group.

A group action on a nonempty set $X$ is simply transitive when exactly one group element sends any chosen point to any other:Equivalently it is both a transitive group action and a free group action; this is also a regular group action. Transitivity supplies a transport, and freeness makes it unique. Conversely, putting $y=x$ in the uniqueness condition shows that every stabilizer subgroup is $\{e\}$, since the identity element already fixes $x$. In a transitive group action, checking that just one stabilizer subgroup is trivial suffices: all the others are conjugate subgroups.

The cyclic group $C_3$ in the diagram under transitive group action is simply transitive. More generally, the left regular action of any group $G$ on itself is simply transitive: the equation $gx=y$ has the unique solution $g=y{x}^{-1}$, using the inverse element of $x$. This shows why the property is useful: every position has a unique label relative to a chosen starting position.

Choose a point $x_0\in X$. Its orbit mapis a bijection and an equivariant map from the left regular action: ${\varphi }_{x_0}(hg)=h\cdot {\varphi }_{x_0}(g)$. This identifies $X$ with a copy of $G$, but $X$ does not come with a preferred identity element. If $x_1=a\cdot x_0$, then ${\varphi }_{x_1}(g)={\varphi }_{x_0}(ga)$: changing the chosen point composes this identification with right multiplication by $a$. An old label $g$ therefore becomes the new label $g{a}^{-1}$, which also specifies the side of multiplication for a noncommutative group.

The transport from $x$ to $y$ remains independent of the chosen point. Writing $x=b\cdot x_0$ and $y=c\cdot x_0$, it is $c{b}^{-1}$. With $x_1=a\cdot x_0$, the new labels are $b{a}^{-1}$ and $c{a}^{-1}$, andFor a finite group, simple transitivity implies $|X|=|G|$. Conversely, a transitive group action with $|X|=|G|<\infty$ is simply transitive by the orbit-stabilizer theorem. Equality of cardinalities alone is insufficient without transitivity: the cyclic group $C_2$ can fix both points of a two-point set, giving two group orbits and two possible self-transports at each point.

A group action on a nonempty set $X$ is transitive when every two points lie in the same orbit of a group action, equivalently when for all $x,y\in X$ there is a group element $g$ with $g\cdot x=y$. There is exactly one group orbit: every position is reachable from every other. Requiring $X\ne \varnothing$ avoids calling the group action on the empty set transitive merely because the quantified statement has no points to test.^[ref]

Here a left group action of a group $G$ means a function $G\times X\to X$, written $(g,x)\mapsto g\cdot x$, satisfyingwhere $e$ is the identity element. Products move the point by $h$ first, then by $g$. Transitivity says that an orbit map $G\to X$, $g\mapsto g\cdot x$, is surjective for every $x\in X$; it suffices to check one chosen point.^[ref][ref]

For example, the symmetric group $S_3$ acts on $X=\{1,2,3\}$ by $\sigma \cdot i=\sigma (i)$. This is a transitive group action, but it is not a free group action: the stabilizer subgroup of $1$ is $\{e,(23)\}$. Both the transposition $(12)$ and the cyclic permutation $(123)$ send $1$ to $2$. In contrast, the cyclic group $C_3=\mathbb{Z}/3\mathbb{Z}$ acts on itself by $k\cdot x=k+x(\mathrm{mod}3)$, using modular arithmetic. The group element sending $x$ to $y$ is uniquely $k=y-x(\mathrm{mod}3)$. These two group actions reach the same number of points, but only the second has unique transport between them.

The stabilizer subgroup $G_x=\{h\in G:h\cdot x=x\}$ measures the ambiguity of transport. If $g_0\cdot x=y$, thenThe first set is a left coset, and the second identity says that stabilizer subgroups in one group orbit are conjugate subgroups. Briefly, $g\cdot x=g_0\cdot x$ exactly when $g_0^{-1}g\in G_x$. Thus, for a finite group in a transitive group action, the orbit-stabilizer theorem gives $|G|=|X||G_x|$, and there are exactly $|G_x|$ transports for each pair of points. The example counts are $6=3\cdot 2$ for $S_3$ and $3=3\cdot 1$ for $C_3$. This separates the number of reachable positions from the number of ways to reach each one.^[ref]