How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Boone base groups and associated free bases
Statement
Assume AC. Put and . Then is infinite cyclic and embeds in . For each rule , put , . The subgroups are free on the indicated bases. The correspondence , is an isomorphism . The map , is an involutive automorphism of .
The retraction sending , is injective on each , for . The automorphism of fixing and all other states and sending identifies with ; the corresponding automorphism identifies with .
We also use the following finite multiple-letter version of Britton's lemma: for finitely many isomorphisms between subgroups of one base, the successive HNN construction embeds that base; a word with stable letters equal to a base element contains a pinch for an original edge subgroup. Two reduced words representing the same element have the same ordered sequence of signed stable letters.
Facts & Assumptions
Given: The finite alphabets and rule contexts of the Boone presentation.
These are the specified tape relations and rule words. (Boone group presentation and special word)
Reduced words give free groups and their universal property; nonempty reduced words are nonidentity. (Reduced words form the free group on an alphabet)
Reduced syllable expressions in a free product are unique. (Normal form theorem for free products)
A reduced single-letter HNN word containing a stable letter cannot be the identity. (Britton's lemma)
The base embeds in a single-letter HNN extension. (The base group embeds in its HNN extension)
Assume the Axiom of Choice. (The Axiom of Choice)
Proof
For finitely many edge maps between subgroups of a base , adjoin their letters successively. The edge subgroups remain embedded after each addition by [F5], so the next map is still an isomorphism of actual subgroups. AC chooses representatives of their nonempty cosets for the single-letter normal forms underlying [F4]. This is the choice use throughout the construction.
Prove the multiple-letter pinch assertion by induction on the number of letters. With no letters there is nothing to assert; with one letter apply [F4] to the word times the inverse of its asserted base value. For the next letter, regard all older-letter blocks as coefficients. If the new letter occurs, single-letter Britton supplies a new-letter pinch whose intervening older-letter block represents an element of an original edge subgroup in . If that block contains older letters, the induction hypothesis supplies an older-letter pinch in the original spelling. Otherwise the new-letter pinch is already a pinch over . If the new letter never occurs, use the induction hypothesis directly. This proves the assertion for every finite family, without changing any edge subgroup.
For completeness, compare two multiple-letter reduced words with . In a pinch can occur only across the seam, since neither side has an internal pinch. It must pair the last signed letter of with the inverse of the last signed letter of , with the same label. Reducing this pinch replaces the seam coefficient by a base element, leaving shortened prefixes of the original reduced words. Repeat. If one prefix had stable letters after the other ran out, it would be a reduced word equal to a base element, contradicting step 2.1. Hence all paired letters agree in reverse order and both prefixes run out together. This proves the sequence assertion, including length zero.
Start with the free group on . By [F2], for every nonzero integer . The map is an isomorphism : it preserves addition of exponents, is injective and has precisely that image. Successively adjoin each with . Steps 1.1–2.1 apply (the local stable letter is ), giving and preserving the infinite order of . Form using [F3]; states have no relations with .
Sending and respects every relator of , giving . For either or , a nonempty reduced word in the abstract letters maps under and then to the same nonempty reduced tape word. By [F2] it is nonidentity. Thus is free on that displayed basis, and restricts injectively to .
In , the subgroup is a free product: any alternating product of its nonidentity state powers and tape elements is a nonempty reduced syllable word by [F3]. The assignment fixing and all other states and sending to defines an automorphism of . Its inverse sends that state to and fixes the same other generators; substitution verifies both composites on every generator. This automorphism carries the preceding free product to , proving its asserted free basis. Empty or give the same substitution with an identity factor.
Replace the state by , the contexts by , and by in the explicit automorphism construction of step 5.1. Its inverse is . Thus is free on the stated basis. The unique homomorphisms given by the forward and reverse basis correspondences compose to the identity on every basis element, hence on both groups. They are inverse isomorphisms, proving the assertion about .
Inverting the equation gives , exactly its image under . Thus defines an endomorphism of . Its square fixes and every , so it is an involutive automorphism. It interchanges and . All claims now follow.
Source locator
Rotman, printed pp.438–440, Lemma 12.11 and Corollary 12.12. The free state factor here corrects the state/ commutation printed in part (ii-prime). The multiple-letter pinch and comparison arguments above derive precisely the extra interface needed from the local single-letter results.
Depends on
Used by
Dependency tree · two levels
19 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.