Past exam of the mathematics course of the University of Cambridge / 2008 / ia / Paper 3 / 8E (Groups)

Let a finite group $G$ act on a set $X$. For $x\in X$, define its stabilizer subgroup $G_x=\{g:g\cdot x=x\}$ and its group orbit $Gx=\{g\cdot x:g\in G\}$. The mapis well-defined, because multiplying $g$ on the right by an element fixing $x$ does not change its image. It is onto by the definition of the orbit. If $g\cdot x=h\cdot x$, then $h^{-1}g\in G_x$, so $g{G}_x=h{G}_x$; hence it is one-to-one. Every coset has $|G_x|$ elements and the cosets partition $G$. This proves the orbit-stabilizer theorem:For a group element $x$, its cyclic subgroup $H=⟨x⟩$ has $\mathrm{ord}(x)$ elements. Apply the theorem to the action of $G$ on its left cosets $G/H$, whose stabilizer at $H$ is $H$. It follows thatThis is the needed case of Lagrange's theorem, obtained directly from the action.

To prove Cauchy's theorem for finite groups, let $p$ be a prime divisor of $|G|$ and considerThe first $p-1$ entries are arbitrary and determine the last, so $|\mathcal{X}|=|G{|}^{p-1}$ is divisible by $p$. Cyclically rotate the entries. This preserves the product constraint even if $G$ is nonabelian, sinceThus a cyclic group of order $p$ acts on $\mathcal{X}$. By the orbit-stabilizer theorem, its orbits have size one or $p$. Its fixed tuples are exactly $(g,\dots ,g)$ with $g^p=e$. If $m$ is their number, counting the remaining size-$p$ orbits gives $m\equiv |\mathcal{X}|\equiv 0(\mathrm{mod}p)$. The identity provides one fixed tuple, so $m\ge p$ and a nonidentity $g$ with $g^p=e$ exists. The order of this $g$ divides $p$: division of $p$ by its order and minimality of that order prove this directly. Since $p$ is prime and $g\ne e$, the order is exactly $p$. This is the cyclic-tuple proof of Cauchy theorem.

Now suppose every nonidentity element has order two. Then every element equals its inverse, and for any $a,b\in G$,Thus group of exponent two is abelian applies. Starting from the identity subgroup, choose an element outside the subgroup already generated. Because the group is abelian and that element squares to the identity, adjoining it doubles the subgroup: it is the disjoint union of the old subgroup and its translate by the new element. Repeating until the finite group is exhausted shows $|G|=2^r$. Conversely the direct product of groups $C_2^r$ has order $2^r$ and every nonidentity element has order two. ThereforeThe case $r=0$ is the trivial group and satisfies the condition vacuously. These finite examples are elementary abelian groups of exponent two.

An infinite example is the group of all binary sequences, with coordinatewise addition modulo two:Every sequence added to itself is zero, so every nonzero sequence has order exactly two. The sequences having a single $1$ in coordinate $j$ are all distinct, proving that the group is infinite.