Alphabeta Math
Session-authored (Fable 5 assisted)
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.

8 results · all verified · 0 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 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Free Products and Amalgamation — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

C_2 free-product C_2 is the infinite dihedral group, and the product of its generators has infinite order

Example

The free product C2C2C_2\ast C_2 has presentation s,ts2=e, t2=e.\langle s,t\mid s^2=e,\ t^2=e\rangle. This is the standard infinite dihedral group DD_\infty, and stst has infinite order.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

Suppose each GiG_i has a presentation XiRi\langle X_i\mid R_i\rangle, with the alphabets replaced by disjoint copies. Then iGiiXi | iRi.\ast_iG_i\cong\left\langle\bigsqcup_iX_i\ \middle|\ \bigcup_iR_i\right\rangle. (A free product has the union presentation of presentations of its factors).

[L2]

Every element of iIGi\ast_{i\in I}G_i has a unique reduced syllable expression. The identity is represented by the empty word, and no nonempty reduced word represents the identity. (Normal form theorem for free products).

[L3]

For every nNn\in\mathbb N, view nn as its canonical nonnegative integer and put nZ:={nk:kZ}n\mathbb Z:=\{nk:k\in\mathbb Z\}. Then the left cosets of nZn\mathbb Z in (Z,+)(\mathbb Z,+) are exactly the congruence classes modulo nn, and coset addition is the published addition of congruence classes. Thus (Z,+)/nZ=(Z/n,+)(\mathbb Z,+)/n\mathbb Z=(\mathbb Z/n,+) as the same group on the same underlying set. This includes n=0n=0 and n=1n=1. (For every nNn\in\mathbb N, the congruence-class group (Z/n,+)(\mathbb Z/n,+) is the quotient group (Z,+)/nZ(\mathbb Z,+)/n\mathbb Z).

Verification

technique · direct
1.1

The union-presentation theorem gives the displayed presentation from the two cyclic factors.

givenL1L2L3
2.1

For every n>0n>0, the word (st)n(st)^n is a nonempty reduced word, so normal form makes it nonidentity. Hence stst has infinite order and the group is infinite.

step 1.1
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

C_2 free-product C_3 has presentation with only the two factor relations and is infinite

Example

The free product C2C3C_2\ast C_3 has presentation s,ts2=e, t3=e\langle s,t\mid s^2=e,\ t^3=e\rangle and is infinite.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

Suppose each GiG_i has a presentation XiRi\langle X_i\mid R_i\rangle, with the alphabets replaced by disjoint copies. Then iGiiXi | iRi.\ast_iG_i\cong\left\langle\bigsqcup_iX_i\ \middle|\ \bigcup_iR_i\right\rangle. (A free product has the union presentation of presentations of its factors).

[L2]

Every element of iIGi\ast_{i\in I}G_i has a unique reduced syllable expression. The identity is represented by the empty word, and no nonempty reduced word represents the identity. (Normal form theorem for free products).

[L3]

For every nNn\in\mathbb N, view nn as its canonical nonnegative integer and put nZ:={nk:kZ}n\mathbb Z:=\{nk:k\in\mathbb Z\}. Then the left cosets of nZn\mathbb Z in (Z,+)(\mathbb Z,+) are exactly the congruence classes modulo nn, and coset addition is the published addition of congruence classes. Thus (Z,+)/nZ=(Z/n,+)(\mathbb Z,+)/n\mathbb Z=(\mathbb Z/n,+) as the same group on the same underlying set. This includes n=0n=0 and n=1n=1. (For every nNn\in\mathbb N, the congruence-class group (Z/n,+)(\mathbb Z/n,+) is the quotient group (Z,+)/nZ(\mathbb Z,+)/n\mathbb Z).

Verification

technique · direct
1.1

The presentation theorem contributes only the defining relations of the two factors.

givenL1L2L3
2.1

For nNn\in\mathbb N, the words (st)n(st)^n are reduced; the n=0n=0 word is empty and positive nn have distinct lengths. Normal form therefore makes them pairwise distinct, proving infinitude.

step 1.1
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

The canonical surjection from a free product to the direct product of its factors

Example

For groups G,HG,H, the factor maps g(g,e)g\mapsto(g,e) and h(e,h)h\mapsto(e,h) induce a canonical surjection π:GHG×H.\pi:G\ast H\twoheadrightarrow G\times H. Every cross-commutator lies in kerπ\ker\pi, and if g,hg,h are nonidentity then that commutator is nonidentity in the free product.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

For a family (Gi)iI(G_i)_{i\in I}, a free product is a group FF with homomorphisms ιi:GiF\iota_i:G_i\to F in the sense of def-group-homomorphism, such that for every group HH and every family of homomorphisms fi:GiHf_i:G_i\to H, there is a unique homomorphism f:FHf:F\to H satisfying fιi=fif\circ\iota_i=f_i for all ii. It is denoted iIGi\ast_{i\in I}G_i. Injectivity of the maps ιi\iota_i is not part of this definition. (The free product of an arbitrary family of groups).

[L2]

Every element of iIGi\ast_{i\in I}G_i has a unique reduced syllable expression. The identity is represented by the empty word, and no nonempty reduced word represents the identity. (Normal form theorem for free products).

[L3]

Let GG and HH be groups. Their external direct product has underlying set G×H:={(g,h):gG, hH}G\times H:=\{(g,h):g\in G,\ h\in H\} and componentwise operation (g,h)(g,h):=(gg,hh).(g,h)(g',h') := (gg',hh'). The fact that this operation makes G×HG\times H a group, with the indicated identity and inverses, is proved in thm-external-direct-product-is-a-group. Until that result is used, this definition introduces only the set and its componentwise binary operation. (The external direct product G×HG\times H with componentwise multiplication).

[L4]

For groups GG and HH, the componentwise operation of def-external-direct-product-of-groups makes G×HG\times H a group. Its identity is (eG,eH)(e_G,e_H), and (g,h)1=(g1,h1).(g,h)^{-1}=(g^{-1},h^{-1}). Moreover the coordinate maps πG(g,h)=g\pi_G(g,h)=g and πH(g,h)=h\pi_H(g,h)=h are group homomorphisms. (G×HG\times H is a group with identity (eG,eH)(e_G,e_H), coordinatewise inverses, and homomorphic coordinate projections).

[L5]

Let GG be a group. For g,hGg,h\in G, their commutator is [g,h]:=ghg1h1.[g,h]:=ghg^{-1}h^{-1}. This convention is fixed throughout; some sources use its inverse. By the inverse laws of lem-group-inverse-laws, one has [g,h]1=hgh1g1=[h,g][g,h]^{-1}=hgh^{-1}g^{-1}=[h,g]. The commutator subgroup, or derived subgroup, is the subgroup generated by all commutators: [G,G]:={[g,h]:g,hG}.[G,G]:=\langle\{[g,h]:g,h\in G\}\rangle. The generated subgroup notation is that of def-generated-subgroup. (Commutators [g,h]=ghg1h1[g,h]=ghg^{-1}h^{-1} and the commutator subgroup [G,G][G,G]).

Verification

technique · direct
1.1

Free-product universality gives π\pi, and every (g,h)=(g,e)(e,h)(g,h)=(g,e)(e,h) lies in its image, so it is surjective.

givenL1L2L3L4L5
2.1

The two factor images commute in G×HG\times H, hence [g,h][g,h] maps to the identity.

step 1.1
3.1

For nonidentity gGg\in G, hHh\in H, the word ghg1h1ghg^{-1}h^{-1} is a nonempty reduced word, so normal form makes it nonidentity. Thus the kernel is generally nontrivial.

step 2.1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

FALSE: a free product of abelian groups is abelian

Statement

False claim: the free product of abelian groups is abelian.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Every element of iIGi\ast_{i\in I}G_i has a unique reduced syllable expression. The identity is represented by the empty word, and no nonempty reduced word represents the identity. (Normal form theorem for free products).

[L2]

For every nNn\in\mathbb N, view nn as its canonical nonnegative integer and put nZ:={nk:kZ}n\mathbb Z:=\{nk:k\in\mathbb Z\}. Then the left cosets of nZn\mathbb Z in (Z,+)(\mathbb Z,+) are exactly the congruence classes modulo nn, and coset addition is the published addition of congruence classes. Thus (Z,+)/nZ=(Z/n,+)(\mathbb Z,+)/n\mathbb Z=(\mathbb Z/n,+) as the same group on the same underlying set. This includes n=0n=0 and n=1n=1. (For every nNn\in\mathbb N, the congruence-class group (Z/n,+)(\mathbb Z/n,+) is the quotient group (Z,+)/nZ(\mathbb Z,+)/n\mathbb Z).

Refutation

technique · direct
1.1

Take the two abelian groups C2=sC_2=\langle s\rangle and C2=tC_2=\langle t\rangle.

givenL1L2
2.1

In C2C2C_2\ast C_2, the words stst and tsts are distinct reduced words by normal-form uniqueness.

step 1.1
3.1

Thus ss and tt do not commute, so their free product is nonabelian and the claim is false.

step 2.1
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

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
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

Amalgamating C_2 inside C_4 and C_6 gives the presentation with a^2=b^3

Example

Embed C2C_2 as the unique order-two subgroup of C4=aC_4=\langle a\rangle and C6=bC_6=\langle b\rangle. Their amalgamated free product has presentation a,ba4=e, b6=e, a2=b3.\langle a,b\mid a^4=e,\ b^6=e,\ a^2=b^3\rangle.

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]

Inside GKHG\ast_KH, the images of GG and HH intersect exactly in their common image of KK. (The two factor images intersect exactly in the amalgamated subgroup).

[L4]

Every subgroup HH of a cyclic group G=gG=\langle g\rangle is cyclic. If H{e}H\ne\{e\}, then the least positive integer dd for which gdHg^d\in H satisfies H=gdH=\langle g^d\rangle. (Every subgroup of a cyclic group is cyclic; the least positive exponent in a nontrivial subgroup supplies a generator).

Verification

technique · direct
1.1

Enumerating the cyclic powers shows that a2a^2 is the unique element of order 22 in C4C_4 and b3b^3 is the unique element of order 22 in C6C_6. The edge maps send the nonidentity element of C2C_2 to these elements, so both maps are injective.

givenL1L2L3L4
2.1

The amalgamated-presentation theorem gives the displayed presentation.

step 1.1
3.1

Factor embedding keeps copies of C4C_4 and C6C_6, and the intersection theorem says their images meet exactly in the common C2C_2.

step 2.1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

FALSE: canonical factor maps into every group pushout are injective

Statement

False claim: both canonical factor maps into every group pushout are injective.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

For a pushout of f:KGf:K\to G and h:KHh:K\to H, iH(h(kerf))={e},iG(f(kerh))={e}.i_H(h(\ker f))=\{e\},\qquad i_G(f(\ker h))=\{e\}. Hence canonical factor maps in an arbitrary group pushout need not be injective. No equality with their full kernels is asserted. (The kernels of the amalgamating maps are killed in the opposite canonical maps to a group pushout).

[L2]

For homomorphisms f:KGf:K\to G and h:KHh:K\to H, let NN be the normal closure in GHG\ast H of {jG(f(k))jH(h(k))1:kK}.\{j_G(f(k))j_H(h(k))^{-1}:k\in K\}. Then (GH)/N(G\ast H)/N, with the induced factor maps jGj_G and jHj_H, is a pushout of ff and hh. (A group pushout is the quotient of a free product by the amalgamating relations).

[L3]

For every nNn\in\mathbb N, view nn as its canonical nonnegative integer and put nZ:={nk:kZ}n\mathbb Z:=\{nk:k\in\mathbb Z\}. Then the left cosets of nZn\mathbb Z in (Z,+)(\mathbb Z,+) are exactly the congruence classes modulo nn, and coset addition is the published addition of congruence classes. Thus (Z,+)/nZ=(Z/n,+)(\mathbb Z,+)/n\mathbb Z=(\mathbb Z/n,+) as the same group on the same underlying set. This includes n=0n=0 and n=1n=1. (For every nNn\in\mathbb N, the congruence-class group (Z/n,+)(\mathbb Z/n,+) is the quotient group (Z,+)/nZ(\mathbb Z,+)/n\mathbb Z).

Refutation

technique · direct
1.1

Take K=C2K=C_2, G=1G=1, H=C2H=C_2, with f:KGf:K\to G trivial and h:KHh:K\to H the identity.

givenL1L2L3
2.1

The amalgamating relation kills the generator of HH, so the quotient construction makes the pushout trivial. Equivalently, kernel collapse kills h(kerf)=Hh(\ker f)=H.

step 1.1
3.1

The canonical map H=C21H=C_2\to1 is not injective, refuting the claim.

step 2.1
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

A pushout along an isomorphism recovers the other group

Example

Let f:KGf:K\to G be an isomorphism and h:KHh:K\to H any homomorphism. The pushout is HH, with legs hf1:GHh\circ f^{-1}:G\to H and idH\mathrm{id}_H. For example, pushing C4C4C2C_4\xleftarrow{\cong}C_4\to C_2 along reduction modulo 22 gives C2C_2.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

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

[L2]

Group isomorphisms, automorphisms and the set Aut(G)\operatorname{Aut}(G). An isomorphism f:GHf:G\to H is a bijective group homomorphism (def-group-homomorphism, def-injection-surjection-bijection). When G=HG=H, it is an automorphism of GG. Write Aut(G):={f:GG:f is an automorphism}.\operatorname{Aut}(G):=\{f:G\to G:f\text{ is an automorphism}\}. (Group isomorphisms, automorphisms and the set Aut(G)\operatorname{Aut}(G)).

[L3]

The inverse of a bijective group homomorphism is a group homomorphism. If f:GHf:G\to H is a bijective group homomorphism, then its set-theoretic inverse f1:HGf^{-1}:H\to G is a group homomorphism. (The inverse of a bijective group homomorphism is a group homomorphism).

[L4]

For every nNn\in\mathbb N, view nn as its canonical nonnegative integer and put nZ:={nk:kZ}n\mathbb Z:=\{nk:k\in\mathbb Z\}. Then the left cosets of nZn\mathbb Z in (Z,+)(\mathbb Z,+) are exactly the congruence classes modulo nn, and coset addition is the published addition of congruence classes. Thus (Z,+)/nZ=(Z/n,+)(\mathbb Z,+)/n\mathbb Z=(\mathbb Z/n,+) as the same group on the same underlying set. This includes n=0n=0 and n=1n=1. (For every nNn\in\mathbb N, the congruence-class group (Z/n,+)(\mathbb Z/n,+) is the quotient group (Z,+)/nZ(\mathbb Z,+)/n\mathbb Z).

Verification

technique · direct
1.1

The two displayed legs agree on KK: (hf1)f=h(h\circ f^{-1})\circ f=h.

givenL1L2L3L4
2.1

For a compatible pair u:GQu:G\to Q, v:HQv:H\to Q, one has u=vhf1u=v\circ h\circ f^{-1}, so vv is the unique mediator from HH.

step 1.1
3.1

In the cyclic example this says the C4C_4 leg is reduction modulo 22, the C2C_2 leg is the identity, and every compatible cocone factors uniquely through C2C_2.

step 2.1

Sources