[Math] In transitive (non-trivial) group action, there must be at least one group element without fixed point

abstract-algebraalternative-proofgroup-actionsgroup-theory

Let a finite group $G$ act transitively on a finite set $S$ with $|S| \geq 2$.
The problem is to show that not every $g \in G$ can have a fixed point in this action. I proved this on my own, but I'm looking for alternate proofs.

My proof:

$G$ acts transitively so we can write $S = G.s$.

Assume that every $g \in G$ has a fixed point $h_g.s$. Then
$g \in \operatorname{Stab}(h_g.s) = h_g \operatorname{Stab}(s) h_g^{-1}$.
It turns out that $G$ is equal to the union of conjugates of
$\operatorname{Stab}(s)$, but that can't happen unless $|S| = 1$.

Best Answer

Let $t$ denote the number of orbits of $G$ acting on $S$. By the Cauchy-Frobenius Lemma (the lemma that is not Burnside's), $t = \frac{1}{|G|} \sum_{g \in G} |fix(g)|$, where $|fix(g)|$ is the number of points in $S$ that are fixed by $g$. In other words, the number of orbits is equal to the average value of the number of fixed points of permutations in $G$.

When the group action is transitive, $t=1$. The identity permutation $1_G$ fixes more than 1 point (assuming $|S| \ge 2$). Because the identity permutation contributes a value larger than 1, in order for the average value to be equal to 1, some permutation must contribute a value less than 1, ie, some permutation in $G$ has 0 fixed points.

Related Question