Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-28
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.

Normal forms in an HNN extension are unique relative to chosen transversals

Statement

Fix an HNN extension in associated-subgroup notation and choose transversal data (S,S+) as in The transversal data used for HNN normal forms. Then every element of the HNN extension is represented by a unique transversal normal form

a0tε1a1tεnan.

In particular, the identity has the unique normal form with n=0 and a0=eA.

Facts & Assumptions

Given: The HNN extension and chosen transversals in the statement.

[L1]

The chosen transversals give unique decompositions a=cs with cC, sS and a=dr with dC+, rS+, and they define the admissible normal words. (The transversal data used for HNN normal forms)

[L2]

Replacing a pin tct1 by ϕ(c) or a pin t1dt by ϕ1(d) preserves the represented element. (Elementary HNN reductions preserve the represented element)

[L3]

The relative presentation of the HNN extension is the quotient of AF({t}) by the relators tct1ϕ(c)1 for cC. (The edge-group presentation is equivalent to the associated-subgroup presentation, An HNN extension with its stable letter, The free product of an arbitrary family of groups)

Proof

technique · direct
1.1

Starting at the right end of an HNN word, use [L1] to rewrite every coefficient following a t as cs with cC and every coefficient following a t1 as dr with dC+. Move the subgroup factor to the left by tc=ϕ(c)t or t1d=ϕ1(d)t1. If this creates adjacent inverse stable letters, apply [L2], combine the adjacent base coefficients, and repeat. Each cancellation removes two stable letters; between cancellations the next coset decomposition is unique. The process therefore terminates and yields a transversal normal form.

L1L2givenalgebra
1.2

Let N be the set of transversal normal forms. For aA, let λa multiply the initial coefficient by a. Define λt by prepending t, making the forced decomposition a0=cs from [L1], and using tcs=ϕ(c)ts; define λt1 dually from a0=dr and t1dr=ϕ1(d)t1r. If the new stable letter is inverse to the first old one and s=e or r=e, cancel that pair and apply the same front rule again. This recursion terminates because each repetition removes two stable letters.

L1L2construct
1.3

Uniqueness of the decompositions in [L1] gives λaλb=λab and shows directly, in the cancellation and noncancellation cases, that λt and λt1 are inverse permutations of N. For cC, the front rules reduce the literal pin in tct1w before touching w, so λtλcλt1=λϕ(c). Thus the factor actions of A and F({t}) satisfy every relator in [L3] and descend to an action of the HNN extension on N.

L1L2L3step 1.2algebra
2.1

Apply the action from step 1.3 to the length-zero normal word eA. Reading a written normal form from right to left reconstructs it exactly: each terminal coefficient is already in the required transversal, and the nonidentity condition at a sign change prevents cancellation. Hence a normal form sends eA to that same written normal form. If two normal forms represented one group element, their actions on eA would agree, so the two written forms would be identical. The identity acts trivially, and therefore its unique normal form is eA.

L1step 1.3algebra

Depends on

Used by

Dependency tree · two levels

15 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