Fix right coset transversals for , containing . In the convention , every element has a unique normal form , with and whenever . A permutation action on the set of these formal sequences proves uniqueness and embeds the base group. Transporting subgroup coefficients across stable letters converts general words to these normal forms.
A reduced sequence is a word with no pinch in an HNN extension. If , Britton's lemma makes it nontrivial and prevents it from representing a base-group element. Reduced sequences need not be unique; uniqueness requires the fixed coset representatives in the normal form theorem for an HNN extension.
A cyclically reduced sequence has no pinch in an HNN extension either internally or across its cyclic junction. If its stable-letter length is positive, every positive power remains reduced, so Britton's lemma gives infinite order. Repeated cyclic conjugation and pinch removal shows that any finite-order element of an HNN extension is conjugate into its base group.
In , a pinch is a subword with , or with . It can be replaced by a base-group element, removing two stable letters. Britton's lemma asserts that every identity word with stable letters must have a pinch after base-group multiplication is performed.
Articles by others on the same topic
There are currently no matching articles.