First prove the torsion in an HNN extension statement directly from Britton's lemma. Let have finite order in an HNN extension of . Among its conjugates, choose a reduced normal-form word with the smallest possible number of stable letters. If , that conjugate lies in the embedded base , so its finite order and the base's torsion-free group property force it to be the identity.
Suppose instead that . There are no internal pinches in an HNN extension because the word is reduced. There is also no pinch at the join of its end with its beginning. Indeed, write it as and conjugate off to obtain . If the joined subword were a pinch, its two signs would be opposite; conjugating by and using the pinch relation would reduce the stable-letter count by two, contradicting minimality. Thus every positive power is reduced with exactly stable letters in the th power. Britton's lemma makes every such power nonidentity, contradicting finite order. We have proved
The base embeds by the same lemma, so finite order has not been lost or artificially introduced by a quotient.
For the countable torsion-free embedding with two conjugacy classes, start with . Given a countable torsion-free , list all ordered pairs of its nonidentity elements. Both elements have infinite order, so the assignment is an isomorphism between their infinite cyclic subgroups. Successively adjoin one stable letter for each pair with relation . Each HNN extension embeds the previous group and is torsion-free by the result just proved. Let be the union after all pairs from have been treated. It remains countable because only countably many generators were added, and torsion-free because any element and any purported finite-order equation occur in a finite stage.
Repeat this whole process: new stable letters and their products must also be included in later pair lists. In the final increasing union
the original embeds and torsion-freeness and countability persist. Any two nonidentity elements lie together in some and are conjugate in . Thus every countable torsion-free group embeds in a countable torsion-free group in which all nonidentity elements are conjugate. If the initial group is nontrivial there are exactly two conjugacy classes; for the trivial group the stated condition is vacuous, or one can begin with instead. The listing is set-theoretic; no algorithm for recognizing nonidentity elements is assumed.
Use a deterministic single-tape Turing machine with finite tape alphabet containing a blank symbol , and finite control states. Its instruction of a Turing machine has the form
It reads , writes , changes state, and moves the head left, right, or stays. An instantaneous description of a Turing machine records the state, scanned position, and tape contents; cells outside the finite recorded window are blank. The initial description places the head at the first input symbol, or at a blank for an empty input. A tape infinite in both directions is used here; extending the recorded window does not change its infinite blank surroundings.
Introduce a dedicated halting state and replace every undefined transition by a stay instruction to , retaining the scanned symbol. Give no instructions. This effective normalization changes only the final bookkeeping step, not whether the original machine halts. Keep its initial state and tape alphabet unchanged. State letters, tape letters, and the new symbols are mutually disjoint.
Represent a finite description by the word
The head scans the first letter of if there is one; if is empty it scans an implicit blank just beyond the recorded right end. The letters of are in left-to-right order, and the remaining right-hand letters follow the scanned cell. The markers bound a window, not walls of the physical tape. Thus the input is represented exactly by , including empty.
Define the semigroup simulation of a Turing machine by taking generators , all state letters, , and , with the following finite list of defining equalities. For each ordinary instruction, use its row below; in a left-move row add the first relation for every :
These are the cases where a scanned cell is explicitly present. For the instructions reading , add boundary cases when the right-hand word is empty:
A left move at the recorded left end supplies a new scanned blank ; a right move at the right end can keep the next blank implicit. Each equality can be checked by reading the new scanned cell and written symbol. For instance leaves the head scanning , with the just-written to its right. Every transition is one of these local substitutions, including either finite-window boundary case.
Finally add only the terminal cleanup equalities
There are finitely many generators and relations, and every side is a nonempty word. Thus these equations define a finite semigroup presentation , not merely a rewriting program. In particular, its equalities may be used in either direction.
If halts on , the simulated forward computation takes to some . The cleanup relations remove and , then . This proves the forward implication.
For the converse, equality in a semigroup presentation is witnessed by a finite sequence of replacements in contexts, in either direction. Before the first cleanup relation is used, every word reached from is still a valid description: it has exactly two outer markers, exactly one state letter, tape symbols between them, and nothing outside. The transition equalities and their inverses preserve this form. A forward transition sends its interpreted configuration to its unique successor . Since the machine is deterministic, eventually halts if and only if eventually halts. Consequently eventual halting is invariant even when such an equality is traversed backward; no reversibility hypothesis on the machine is needed.
Any first cleanup replacement must already encounter . The inverse erasure rules also require , and the inverse acceptance rule requires , which cannot appear before an acceptance replacement. Therefore a derivation reaching the one-letter word first reaches a description in state using only simulation equalities. Halting invariance along this initial part of the derivation implies that the original input configuration halts. Thus
The converse proof is what prevents arbitrary inverse uses of the defining relations from becoming spurious halting certificates.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact