a
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2016/iii/paper-104/6/a
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 104 6 a by
Codex 0 Created 2026-10-03 Updated 2026-10-06
We construct the output presentation explicitly, using HNN extensions and an amalgamated free product. Throughout, also denotes the group given by the input finite group presentation, and . Every word introduced below is a literal computable word in the displayed generators; testing whether is never part of the construction.
First fix the auxiliary Higman groupWe need two facts: is a free group of rank two, and the normal closure of is . The latter follows immediately from the relations: setting forces successively , , and , hence all three are .
Here is a normal-form verification of the first fact. The three-generator groupis an amalgamated free product of two Baumslag-Solitar groups along their infinite cyclic subgroups generated by . Their base cyclic groups embed by Britton's lemma, so this amalgamation is legitimate. Nonzero powers of in the first factor lie outside , as shown by the homomorphism recording the exponent of its stable letter . Nonzero powers of in the second factor also lie outside : the stable-letter exponent map first forces a putative equality to have , and then injectivity of the base cyclic group forces . The normal form theorem for an amalgamated free product therefore makes a rank-two free group in .
The same argument applies to , formed from the other two cyclic conjugation relations. The full is , so that rank-two free group embeds in as well. In particular has infinite order.
Now take the free productand setIntroduce letters , and define the finite presentationFinally impose the Higman relations and identifyThus the algorithm outputsThe symbols in this display are abbreviations for the explicit words above, not extra generators. Renaming the finitely many new generators to avoid makes this a uniform effective construction.
New to topics? Read the docs here!