Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Amalgamating infinite cyclic groups by multiplication by m and n gives the presentation with relation x^m=y^n

Example

For positive integers m,nm,n, amalgamating infinite cyclic groups x\langle x\rangle and y\langle y\rangle along maps sending a generator to xmx^m and yny^n gives x,yxm=yn.\langle x,y\mid x^m=y^n\rangle. Both cyclic factor maps remain injective.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

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).

[L2]

The canonical maps GGKHG\to G\ast_KH and HGKHH\to G\ast_KH are injective. (The factor maps into a free product with amalgamation are injective).

[L3]

Every class in W(X)/W(X)/{\sim} contains exactly one reduced word. (Every class in W(X)/W(X)/{\sim} contains exactly one reduced word).

[L4]

For every set XX, the group Fword(X)=W(X)/F_{\mathrm{word}}(X)=W(X)/{\sim} together with iword(x)=[x]i_{\mathrm{word}}(x)=[x] is a free group on XX in the sense of def-free-group. (The word-quotient group W(X)/W(X)/{\sim} satisfies the universal property of the free group on XX).

[L5]

Let F(X)F(X) be a free group and let RF(X)R\subseteq F(X) be a set of words, called relations. The group with presentation XR:=F(X)/ ⁣R ⁣F(X)\langle X\mid R\rangle:=F(X)/\langle\!\langle R\rangle\!\rangle_{F(X)} is the quotient by the normal closure of RR. The members of XX are its generators. In this quotient, every relation in RR becomes the identity, as do all consequences forced by normality. (Group presentation by generators and relations).

[L6]

Let GG be a group and RGR\subseteq G. Then  ⁣R ⁣G={g1r1ε1g11gnrnεngn1:nN, giG, riR, εi{1,1}}.\langle\!\langle R\rangle\!\rangle_G=\left\{g_1r_1^{\varepsilon_1}g_1^{-1}\cdots g_nr_n^{\varepsilon_n}g_n^{-1}:n\in\mathbb N,\ g_i\in G,\ r_i\in R,\ \varepsilon_i\in\{1,-1\}\right\}. For n=0n=0 the displayed product is the identity. Replacing every conjugator gig_i by gi1g_i^{-1} gives the equivalent convention gi1riεigig_i^{-1}r_i^{\varepsilon_i}g_i. (The normal closure of RR is the set of finite products of conjugates of elements of RR and their inverses).

Verification

technique · direct
1.1

The one-generator empty-relator word model is infinite cyclic: its reduced words are the distinct powers of its generator, and the word-quotient freeness theorem gives the singleton universal property.

givenL1L2L3L4L5L6
2.1

The maps from the edge group are injective because m,n>0m,n>0 and the factors have infinite order.

step 1.1
3.1

The amalgamated-presentation theorem adds exactly the relation xmyn=ex^m y^{-n}=e, equivalently xm=ynx^m=y^n, and the factor-embedding theorem preserves both cyclic factors.

step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 49 results over 17 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