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 hnn tower and auxiliary subgroups
Statement
Assume AC. The multiple HNN extension embeds , and is free on these generators. Let be the HNN extension of with letter centralizing the actual subgroup . Let . The HNN extension of with letter centralizing the actual subgroup is exactly . All these base maps are injective. Moreover . These are associated subgroups, without a claim about full centralizers or a free basis for .
Facts & Assumptions
Given: The groups, free bases and maps from the preceding lemma.
are free on the displayed bases, is their basis isomorphism, is injective on , and finite multiple-letter Britton and stable-letter comparison hold. (Boone base groups and associated free bases)
Single-letter HNN normal forms exist and are unique after choosing transversals. (Normal forms in an HNN extension are unique relative to chosen transversals)
A reduced HNN word with a stable letter is nonidentity. (Britton's lemma)
The semigroup construction introduces the distinguished terminal symbol and places it in the subsequent state alphabet . (Boone machine semigroup and augmented configurations)
The Boone presentation defines and lists its rule-letter, -centralizer, and -centralizer relations, including commutation with . (Boone group presentation and special word)
Assume AC to choose the coset representatives used in HNN normal forms. (The Axiom of Choice)
Proof
Since every is an isomorphism of actual subgroups of , the successive construction in [F1] forms with embedded bases. Its relations need only be imposed on the free bases, because conjugation and preserve products and inverses. The tape relation is equivalent to and then . Thus the finite presentation of is exactly the tape/state/rule portion of .
The automorphism used in [F1] fixes and carries onto . A reduced free-product word with a state syllable cannot belong to , so . Similarly . If an element of equals , applying gives identity, and the injectivity on gives that element equal to . The infinite order of then gives . Hence .
Let a nonempty freely reduced word on be given, consolidating consecutive letters into powers. A possible rule pinch has the form . If , step 1.2 excludes subgroup membership. If , the displayed pair would cancel freely, contrary to the chosen spelling. Thus a word with rule letters is nonidentity by multiple-letter Britton in [F1]; without rule letters it is a nonzero power of the embedded . This proves freeness of on , including the case of zero rule letters.
The identity map of the actual subgroup is an isomorphism, so adjoining with that edge map is an HNN extension. Choose representatives by [A1]; [F2]–[F3] embed in . Commutation with each is equivalent to commutation with every product and inverse, hence with all of .
By [F4], is a specified generator in the embedded state group, so is defined. Let be the subgroup generated by the finite list . Its identity map is an isomorphism regardless of relations among that list. Adjoining with this edge map therefore embeds by [F2]–[F3], again using [A1]. Requiring commutation with the displayed generators is equivalent to commutation with . By [F5], these are exactly the remaining defining relations of ; both presentations are the same free-group quotient. This proves the tower and every asserted embedding.
Source locator
Rotman, printed pp.438–440, Lemma 12.11. Simpson, Definition 1, p.1, independently uses the convention ; the local normal-form convention uses its inverse stable letter.
Depends on
Used by
Dependency tree · two levels
21 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.
Sources
- Joseph J. Rotman, An Introduction to the Theory of Groups, Chapter 12, pp.438–440, Lemma 12.11 (standard reference, not scraped)
- Stephen G. Simpson, A Slick Proof, Definition 1, p.1 (independent HNN convention cross-check) (standard reference, not scraped)