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 base groups and associated free bases

Statement

Assume AC. Put H=x,Sˉs1xs=x2 (sSˉ) and G0=HF(Qˉ). Then x is infinite cyclic and embeds in H. For each rule i, put ai=Fi#qa(i)Gi, bi=Hi#qb(i)Ki. The subgroups Ai=ai,sx (sSˉ),Bi=bi,sx1 (sSˉ) are free on the indicated bases. The correspondence aibi, sxsx1 is an isomorphism ϕi:AiBi. The map θ(x)=x1, θ(s)=s is an involutive automorphism of H.

The retraction ρ:HF(Sˉ) sending x1, ss is injective on each Tη=sxη:sSˉ, for η=±1. The automorphism of G0 fixing H and all other states and sending qa(i)ai identifies qa(i)T1 with Ai; the corresponding automorphism identifies qb(i)T1 with Bi.

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.

[F1]

These are the specified tape relations and rule words. (Boone group presentation and special word)

[F2]

Reduced words give free groups and their universal property; nonempty reduced words are nonidentity. (Reduced words form the free group on an alphabet)

[F3]

Reduced syllable expressions in a free product are unique. (Normal form theorem for free products)

[F4]

A reduced single-letter HNN word containing a stable letter cannot be the identity. (Britton's lemma)

[F5]

The base embeds in a single-letter HNN extension. (The base group embeds in its HNN extension)

[A1]

Assume the Axiom of Choice. (The Axiom of Choice)

Proof

1.1

For finitely many edge maps between subgroups of a base E, 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.

F4F5A1construct
2.1

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 E. 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 E. If the new letter never occurs, use the induction hypothesis directly. This proves the assertion for every finite family, without changing any edge subgroup.

F4step 1.1
3.1

For completeness, compare two multiple-letter reduced words U,V with U=V. In UV1 a pinch can occur only across the seam, since neither side has an internal pinch. It must pair the last signed letter of U with the inverse of the last signed letter of V, 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.

step 2.1algebra
3.2

Start with the free group on x. By [F2], xn1 for every nonzero integer n. The map xnx2n is an isomorphism xx2: it preserves addition of exponents, is injective and has precisely that image. Successively adjoin each s with s1xs=x2. Steps 1.1–2.1 apply (the local stable letter is s1), giving H and preserving the infinite order of x. Form G0=HF(Qˉ) using [F3]; states have no relations with H.

F1F2F3step 1.1step 2.1
4.1

Sending x1 and ss respects every relator of H, giving ρ:HF(Sˉ). For either η=1 or η=1, a nonempty reduced word in the abstract letters zs maps under zssxη and then ρ to the same nonempty reduced tape word. By [F2] it is nonidentity. Thus Tη=sxη:sSˉ is free on that displayed basis, and ρ restricts injectively to Tη.

F2step 3.2
5.1

In G0, the subgroup qa(i)T1 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 H and all other states and sending qa(i) to Fi#qa(i)Gi defines an automorphism of G0. Its inverse sends that state to (Fi#)1qa(i)Gi1 and fixes the same other generators; substitution verifies both composites on every generator. This automorphism carries the preceding free product to Ai, proving its asserted free basis. Empty Fi or Gi give the same substitution with an identity factor.

F2F3step 4.1construct
6.1

Replace the state by qb(i), the contexts by Hi#,Ki, and T1 by T1 in the explicit automorphism construction of step 5.1. Its inverse is qb(i)(Hi#)1qb(i)Ki1. Thus Bi 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 ϕi.

F2F3step 4.1step 5.1
7.1

Inverting the equation s1xs=x2 gives s1x1s=x2, exactly its image under θ. Thus θ defines an endomorphism of H. Its square fixes x and every s, so it is an involutive automorphism. It interchanges T1 and T1. All claims now follow.

F1step 3.2step 6.1algebra

Source locator

Rotman, printed pp.438–440, Lemma 12.11 and Corollary 12.12. The free state factor here corrects the state/x 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.

Sources