Alphabeta Math
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.

✓ 6 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Hnn Extensions and Brittons Lemma - Examples

1 · Prerequisites

2 · Summary

These examples keep the normal-form language concrete. They show how direct products and Baumslag-Solitar groups fit the HNN template, carry out one explicit double pin reduction, and isolate the difference between “contains a stable letter” and “is Britton-reduced”.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The direct product A x Z as an HNN extension

Example

If both associated subgroups equal the whole base group A and the associated isomorphism is the identity, then the HNN extension is naturally isomorphic to A×Z.

Facts & Assumptions

Given: A group A.

[L1]

An HNN extension is obtained by adjoining a stable letter that conjugates one chosen subgroup onto another. (An HNN extension with its stable letter)

[L2]

A homomorphism out of an HNN extension is determined by a homomorphism on the base group and the image of the stable letter, provided the conjugacy relation is respected. (The universal property of an HNN extension)

Verification

technique · direct
1.1L1given

Take both associated subgroups to be A and the associated isomorphism to be the identity. Then the defining relation in [L1] becomes tat−1=a for every a∈A, so the stable letter commutes with the image of A.

2.1L2step 1.1algebra∎

The map from the HNN extension to A×Z sending A to A×{0} and t to (e,1) satisfies the relation from step 1.1, so [L2] gives a homomorphism. The reverse map sends (a,n) to atn, and the commuting relation makes it a homomorphism inverse to the first one. Hence the HNN extension is A×Z.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Baumslag-Solitar groups as HNN extensions

Example

For nonzero integers m,n, the Baumslag-Solitar group

BS(m,n)=⟨a,t∣tamt−1=an⟩

is an HNN extension of Z, and it is ascending exactly in the cases ∣m∣=1 or ∣n∣=1.

Facts & Assumptions

Given: Nonzero integers m,n.

[L1]

A general HNN extension adjoins a stable letter conjugating one embedded subgroup onto another. (An HNN extension with its stable letter)

[L2]

An ascending HNN extension is the case in which one associated subgroup is the whole base group. (Ascending HNN extensions of injective endomorphisms)

[L3]

Ascending HNN extensions admit one-sided normal forms. (Ascending HNN extensions admit the one-sided normal form)

Verification

technique · direct
1.1L1given

In the base group A=⟨a⟩≅Z, the subgroups ⟨am⟩ and ⟨an⟩ are isomorphic and the displayed presentation is exactly of the HNN form from [L1].

2.1L2L3step 1.1algebra∎

If ∣m∣=1, then ⟨am⟩=A and [L2] makes BS(m,n) an ascending HNN extension; similarly if ∣n∣=1 after reversing the stable letter. In those cases [L3] gives the one-sided normal form. When both ∣m∣ and ∣n∣ exceed 1, both associated subgroups are proper, so the extension is not ascending.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

An ascending HNN extension from doubling the integers

Example

The injective endomorphism ϕ:Z→Z given by ϕ(n)=2n produces the ascending HNN extension

⟨a,t∣tat−1=a2⟩,

and every element has a unique one-sided normal form t−maktn with m,n≥0 and k odd whenever m,n>0.

Facts & Assumptions

Given: The doubling endomorphism of Z.

[L1]

An injective endomorphism of a group defines an ascending HNN extension. (Ascending HNN extensions of injective endomorphisms)

[L2]

In an ascending HNN extension, every element has a unique form t−mbtn, with b outside the image subgroup whenever m,n>0. (Ascending HNN extensions admit the one-sided normal form)

Verification

technique · direct
1.1L1given

The map ϕ(n)=2n is injective, so [L1] gives the presentation ⟨a,t∣tat−1=a2⟩. Its positive associated subgroup is 2Z≤Z.

2.1L2step 1.1algebra∎

Under the multiplicative notation ak↔k, the image subgroup ϕ(Z)=2Z consists exactly of the even exponents. Thus ak∉ϕ(Z) exactly when k is odd. The condition in [L2] therefore specializes to the stated unique forms t−maktn, with k odd whenever m,n>0.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Britton reduction of a word with two pins

Example

In associated-subgroup notation, the word

w=tct−1t−1dt(c∈C−, d∈C+)

contains two pins and Britton-reduces to the base-group element ϕ(c)ϕ−1(d).

Facts & Assumptions

Given: An HNN extension in associated-subgroup notation.

[L1]

The displayed subwords tct−1 and t−1dt are pins. (HNN words, pins, and Britton-reduced words)

[L2]

Replacing either kind of pin by the corresponding subgroup element preserves the represented element. (Elementary HNN reductions preserve the represented element)

[L3]

Britton's lemma detects nontriviality only after all pins have been removed. (Britton's lemma)

Verification

technique · direct
1.1L1L2given

By [L1], the first three letters of w form a pin, so [L2] replaces them by ϕ(c) and gives the shorter word ϕ(c)t−1dt.

2.1L2L3step 1.1algebra∎

The remaining stable-letter subword is the second kind of pin, so another application of [L2] gives ϕ(c)ϕ−1(d)∈A. This is the Britton-reduced representative to which [L3] applies.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-28Open item page →

An HNN extension realises two chosen isomorphic subgroups as conjugate

Example

If α,β:C→A are injective, then in the HNN extension

G=⟨A,t | t α(c) t−1=β(c) for c∈C⟩,

the subgroups α(C) and β(C) become conjugate by the stable letter:

t α(C) t−1=β(C).

Facts & Assumptions

Given: The HNN extension in the statement.

[L1]

The defining relations of an HNN extension identify t α(c) t−1 with β(c) for every c∈C. (An HNN extension with its stable letter)

[L2]

The stable letter is the universal element that enforces the required conjugacy relation. (The universal property of an HNN extension)

Verification

technique · direct
1.1L1given

For every c∈C, [L1] gives t α(c) t−1=β(c). Hence t α(C) t−1⊆β(C).

2.1L1L2step 1.1algebra∎

Applying the same relation to t−1 shows α(c)=t−1β(c)t for every c∈C, so β(C)⊆t α(C) t−1. Thus the two subgroups are conjugate exactly as [L2] predicts.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

A stable-letter word need not be Britton-reduced

Statement refuted

Every HNN word containing a stable letter is Britton-reduced.

Facts & Assumptions

Given: An HNN extension in associated-subgroup notation.

[L1]

A pin tct−1 with c∈C− is not Britton-reduced. (HNN words, pins, and Britton-reduced words)

[L2]

Such a pin reduces to the base-group element ϕ(c). (Elementary HNN reductions preserve the represented element)

Counterexample

technique · direct
1.1L1given

Choose any c∈C−. The word tct−1 contains a stable letter, and [L1] says it is a pin, so it is not Britton-reduced.

2.1L2step 1.1algebra∎

By [L2], the same word reduces to ϕ(c)∈A. Thus it is a concrete counterexample to the statement refuted.

Sources