Form the HNN extension which centralizes :
This is the extension associated to the identity isomorphism ; relations on the displayed finite generating set imply for all . Since is finitely presented and are finite, this is a finite group presentation.
For any ,
The forward implication follows from Britton's lemma: if , the word is reduced with two stable letters and cannot be the identity. The reverse implication is the defining centralization relation. Consequently the computable word
satisfies
An algorithm for the word problem for a group would therefore decide the nonrecursive set , a contradiction. Hence .

Articles by others on the same topic (0)

There are currently no matching articles.