Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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 G2=G0,ri (iI)ri1ari=ϕi(a) (aAi) embeds G0, and C=x,ri:iI is free on these generators. Let G3 be the HNN extension of G2 with letter t centralizing the actual subgroup C. Let D=C,q1tqG3. The HNN extension of G3 with letter k centralizing the actual subgroup D is exactly B. All these base maps are injective. Moreover Aix=Bix={1}. These are associated subgroups, without a claim about full centralizers or a free basis for D.

Facts & Assumptions

Given: The groups, free bases and maps from the preceding lemma.

[F1]

Ai,Bi are free on the displayed bases, ϕi is their basis isomorphism, ρ is injective on Tη, and finite multiple-letter Britton and stable-letter comparison hold. (Boone base groups and associated free bases)

[F2]

Single-letter HNN normal forms exist and are unique after choosing transversals. (Normal forms in an HNN extension are unique relative to chosen transversals)

[F3]

A reduced HNN word with a stable letter is nonidentity. (Britton's lemma)

[F4]

The semigroup construction introduces the distinguished terminal symbol q and places it in the subsequent state alphabet Qˉ=Q{q}. (Boone machine semigroup and augmented configurations)

[F5]

The Boone presentation defines B and lists its rule-letter, t-centralizer, and k-centralizer relations, including commutation with q1tq. (Boone group presentation and special word)

[A1]

Assume AC to choose the coset representatives used in HNN normal forms. (The Axiom of Choice)

Proof

1.1

Since every ϕi is an isomorphism of actual subgroups of G0, the successive construction in [F1] forms G2 with embedded bases. Its relations need only be imposed on the free bases, because conjugation and ϕi preserve products and inverses. The tape relation ri1(sx)ri=sx1 is equivalent to sxri=risx1 and then ris=sxrix. Thus the finite presentation of G2 is exactly the tape/state/rule portion of B.

F1F5A1algebra
1.2

The automorphism used in [F1] fixes H and carries qa(i)T1 onto Ai. A reduced free-product word with a state syllable cannot belong to H, so AiH=T1. Similarly BiH=T1. If an element of Tη equals xm, applying ρ gives identity, and the injectivity on Tη gives that element equal to 1. The infinite order of x then gives m=0. Hence Aix=Bix={1}.

F1
2.1

Let a nonempty freely reduced word on x,ri be given, consolidating consecutive x letters into powers. A possible rule pinch has the form riϵxmriϵ. If m0, step 1.2 excludes subgroup membership. If m=0, 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 x. This proves freeness of C on x,ri, including the case of zero rule letters.

F1step 1.2
3.1

The identity map of the actual subgroup CG2 is an isomorphism, so adjoining t with that edge map is an HNN extension. Choose representatives by [A1]; [F2]–[F3] embed G2 in G3. Commutation with each x,ri is equivalent to commutation with every product and inverse, hence with all of C.

F2F3A1step 2.1
4.1

By [F4], q is a specified generator in the embedded state group, so q1tqG3 is defined. Let D be the subgroup generated by the finite list x,ri,q1tq. Its identity map is an isomorphism regardless of relations among that list. Adjoining k with this edge map therefore embeds G3 by [F2]–[F3], again using [A1]. Requiring commutation with the displayed generators is equivalent to commutation with D. By [F5], these are exactly the remaining defining relations of B; both presentations are the same free-group quotient. This proves the tower and every asserted embedding.

F2F3F4F5A1step 1.1step 3.1

Source locator

Rotman, printed pp.438–440, Lemma 12.11. Simpson, Definition 1, p.1, independently uses the convention ri1ari=ϕi(a); 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