Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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 form theorem for free products with amalgamation

Statement

Every element of GKHG\ast_KH has a unique normal form s1snks_1\cdots s_nk relative to fixed transversals. A normal word of positive length is nonidentity. The represented group and these conclusions are independent of the chosen transversals.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let KK be embedded in GG and HH as in def-free-product-with-amalgamation. By def-axiom-of-choice, choose left-coset transversals SG,SHS_G,S_H containing the identity. A normal word is s1snk,s_1\cdots s_nk, where nNn\in\mathbb N (def-natural-numbers), kKk\in K, every sjs_j is a nonidentity representative from SGS_G or SHS_H, and consecutive representatives come from different factors. Length zero means the word is just kk. The written form depends on the transversals. (Transversal normal-form data for an amalgamated free product).

[L2]

With fixed transversal data, every element of GG and HH acts by a permutation on normal words. The two actions agree on KK, inverses act inversely, and with the library's composition convention one has Pxy=PxPyP_{xy}=P_x\circ P_y. (Factor elements act consistently by permutations on amalgamated normal words).

[L3]

Let G=XRG=\langle X\mid R\rangle and H=YSH=\langle Y\mid S\rangle with disjoint generators, and let f,hf,h embed KK. If TT generates KK and words ut(X),vt(Y)u_t(X),v_t(Y) represent f(t),h(t)f(t),h(t), then GKHXYRS{utvt1:tT}.G\ast_KH\cong\langle X\sqcup Y\mid R\cup S\cup\{u_t v_t^{-1}:t\in T\}\rangle. (A free product with amalgamation has the factor presentations plus the amalgamating relations).

[L4]

Given homomorphisms f:KGf:K\to G and h:KHh:K\to H as in def-group-homomorphism, a pushout is a group PP with homomorphisms iG:GPi_G:G\to P and iH:HPi_H:H\to P such that iGf=iHhi_G\circ f=i_H\circ h, and such that every compatible pair u:GQu:G\to Q, v:HQv:H\to Q factors through a unique w:PQw:P\to Q with wiG=uw\circ i_G=u and wiH=vw\circ i_H=v. The maps f,hf,h need not be injective. (Pushouts of group homomorphisms).

Proof

technique · direct
1.1

The compatible factor permutations give, by the pushout presentation, an action of GKHG\ast_KH on the set of normal words. For a factor product ww, applying PwP_w to the length-zero word performs the deterministic normal-form rewrite of w1w^{-1}; since inversion is a bijection of the group, every element has such a form.

givenL1L2L3L4
2.1

The permutation attached to a normal word sends the length-zero word to the deterministic normal-form rewrite of its inverse. The resulting inversion-normalisation map is an involution: invert the represented factor product again and repeat the uniquely determined transversal rewrites. It preserves syllable length, since multiplying a nontrivial transversal representative by an element of KK cannot put it in KK. Hence a positive-length normal word cannot represent the identity, and equality of two represented elements forces equality of their inverse normal forms and then of the original words.

step 1.1
3.1

Thus existence and uniqueness hold, including the length-zero elements of KK.

step 2.1
4.1

Changing transversals gives another group with the same pushout universal property; the unique factor-compatible isomorphism identifies the two descriptions, so the group and its conclusions do not depend on the choices.

step 3.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 39 results over 14 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources