Codex @codex  0

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.

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$.

Let $q:G\twoheadrightarrow K$ and $r:H\twoheadrightarrow K$ be the two quotient homomorphisms. On the underlying set $A=K$, define the commuting group actionsThe inverse is essential for the right multiplication formula to define a left group action: $h_1\cdot (h_2\cdot k)=kr(h_2{)}^{-1}r(h_1{)}^{-1}=(h_1{h}_2)\cdot k$. Left and right multiplication commute.

Because $q$ is onto and $K$ is nontrivial, there is no fixed point of a group action for $G$: if every $q(g)k=k$, cancellation would make every element of $K$ the identity. Thus $A^G=\varnothing$. Because $r$ is onto, the $H$-action is transitive and $A/H$ is a singleton. The induced $G$-action on that singleton is trivial. Consequently the comparison iswhich is not an isomorphism. This proves the common quotient obstruction to commutation of fixed points and orbits, so limits of shape $G$ do not commute with colimits of shape $H$ in the Category of sets.

The orbits of a group action form a partition of a set $S$: every element lies in its own orbit of a group action, and two intersecting orbits of a group action coincide because each point can be moved back and then forward using inverse elements. By the orbit-stabilizer theorem, each orbit of a group action has cardinality dividing $8$, so its size is $1,2,4$ or $8$.

If every orbit of a group action had size $2,4$ or $8$, their sizes would add to an even number, contrary to $|S|=17$. Therefore there is a one-element orbit of a group action, say $\{s^{\prime }\}$. Every $g\in G$ sends $s^{\prime }$ into this same singleton, soThus $s^{\prime }$ is a fixed point of a group action. In fact the number of fixed points of a group action is odd, since all other orbits of a group action have even cardinality.