AI ALIGNMENT FORUM
AF

Wikitags
Main
Intuitive version
2

Cauchy's theorem on subgroup existence

Edited by Patrick Stevens last updated 30th Jun 2016
Requires: Cyclic group, Prime number, Orbit-stabiliser theorem, Group action

Cauchy's theorem states that if G is a finite group and p is a prime dividing |G| the order of G, then G has a subgroup of order p. Such a subgroup is necessarily cyclic (proof).

Proof

The proof involves basically a single magic idea: from thin air, we pluck the definition of the following set.

Let X={(x1,x2,…,xp):x1x2…xp=e} the collection of p-tuples of elements of the group such that the group operation applied to the tuple yields the identity. Observe that X is not empty, because it contains the tuple (e,e,…,e).

Now, the cyclic group Cp of order p acts on X as follows: (h,(x1,…,xp))↦(x2,x3,…,xp,x1) where h is the generator of Cp. So a general element hi acts on X by sending (x1,…,xp) to (xi+1,xi+2,…,xp,x1,…,xi).

This is indeed a group action (exercise).

Show solution

  • It certainly outputs elements of X, because if x1x2…xp=e, then xi+1xi+2…xpx1…xi=(x1…xi)−1(x1…xp)(x1…xi)=(x1…xi)−1e(x1…xi)=e
  • The identity acts trivially on the set: since rotating a tuple round by 0 places is the same as not permuting it at all.
  • (hihj)(x1,x2,…,xp)=hi(hj(x1,x2,…,xp)) because the left-hand side has performed hi+j which rotates by i+j places, while the right-hand side has rotated by first j and then i places and hence i+j in total.

Now, fix ¯x=(x1,…,xp)∈X.

By the Orbit-Stabiliser theorem, the orbit OrbCp(¯x) of ¯x divides |Cp|=p, so (since p is prime) it is either 1 or p for every ¯x∈X.

Now, what is the size of the set X?

Show solution

It is |G|p−1.

Indeed, a single p-tuple in X is specified precisely by its first p elements; then the final element is constrained to be xp=(x1…xp−1)−1.

Also, the orbits of Cp acting on X partition X (proof). Since p divides |G|, we must have p dividing |G|p−1=|X|. Therefore since |OrbCp((e,e,…,e))|=1, there must be at least p−1 other orbits of size 1, because each orbit has size p or 1: if we had fewer than p−1 other orbits of size 1, then there would be at least 1 but strictly fewer than p orbits of size 1, and all the remaining orbits would have to be of size p, contradicting that p∣|X|.

Hence there is indeed another orbit of size 1; say it is the singleton {¯x} where ¯x=(x1,…,xp).

Now Cp acts by cycling ¯x round, and we know that doing so does not change ¯x, so it must be the case that all the xi are equal; hence (x,x,…,x)∈X and so xp=e by definition of X.

Parents:
Group
Children:
Cauchy's theorem on subgroup existence: intuitive version
Discussion0
Discussion0