Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 133 4 d Solution Created 2026-10-03 Updated 2026-10-05
Assume first that the finite relator set is nonempty and putFor every nonidentity finite-order element choose a shortest conjugacy representative. The preceding parts give a word representing its conjugacy class of length at most . The identity class has the empty representative.
There are only finitely many such words because the generating alphabet is finite. If it has formal letters and , a sufficient upper bound for the number of words isDistinct classes cannot require more representatives than there are words; different words may of course represent the same class. ConsequentlyThis is the torsion conjugacy bound for a Dehn presentation. It does not claim that there are only finitely many finite-order elements.
If is empty, the maximum in the PDF is undefined. Handle this case separately: the group is a free group on the finite alphabet, and a nonempty cyclically reduced word has no freely trivial positive power. Thus there is no nonidentity torsion and only the identity conjugacy class. If the alphabet is empty, the group is trivial and the same conclusion holds.