Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 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.

Ascending HNN extensions admit the one-sided normal form

Statement

Let

Aϕ=A,ttat1=ϕ(a) for every aA

be an ascending HNN extension. Then every element of Aϕ has a unique expression

tmatn

with m,n0, aA, and

aϕ(A)whenever m,n>0.

Facts & Assumptions

Given: The ascending HNN extension in the statement.

[L1]

In an ascending HNN extension, the negative associated subgroup is all of A and the positive associated subgroup is ϕ(A). (Ascending HNN extensions of injective endomorphisms)

[L2]

An HNN extension has a unique transversal normal form once transversals are fixed. (Normal forms in an HNN extension are unique relative to chosen transversals)

Proof

technique · direct
1.1

Choose a right-coset transversal S for ϕ(A)\A containing e, and apply [L2] with the transversal for the negative associated subgroup equal to {e}. Every coefficient following a letter t is then e, so a sign pattern +, cannot occur: it would create a pin. Thus every transversal normal form has all negative stable letters before all positive stable letters.

L1L2givenalgebra
2.1

Such a normal form has the shape a0t1s1t1smtn, where siS and the positive-letter coefficients are identities. Repeatedly use bt1=t1ϕ(b) to move a0 and then the intervening coefficients to the right. This gives one expression tmatn. If m,n>0, normality gives sme; the resulting middle coefficient has the form ϕ(b)sm, so it lies outside ϕ(A).

L1L2step 1.1algebra
3.1

Conversely, start with tmatn and recursively decompose the coefficient immediately following the last t1 into its unique form ds with dϕ(A) and sS, moving d left by t1d=ϕ1(d)t1. This recovers a unique transversal normal form. When m,n>0, the condition aϕ(A) makes the last representative nonidentity, so no cancellation occurs at the sign change. This reverse construction and the construction of step 2.1 are inverse, and uniqueness in [L2] therefore gives uniqueness of m,n,a.

L1L2step 2.1algebra

Depends on

Used by

Dependency tree · two levels

9 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