Alphabeta Math
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 C2∗C2 has presentation ⟨s,t∣s2=e, t2=e⟩. This is the standard infinite dihedral group D∞, and st has infinite order.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

Suppose each Gi has a presentation ⟨Xi∣Ri⟩, with the alphabets replaced by disjoint copies. Then ∗iGi≅⟨⨆iXi | ⋃iRi⟩. (A free product has the union presentation of presentations of its factors).

[L2]

Every element of ∗i∈IGi 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 n∈N, view n as its canonical nonnegative integer and put nZ:={nk:k∈Z}. Then the left cosets of nZ in (Z,+) are exactly the congruence classes modulo n, and coset addition is the published addition of congruence classes. Thus (Z,+)/nZ=(Z/n,+) as the same group on the same underlying set. This includes n=0 and n=1. (For every n∈N, the congruence-class group (Z/n,+) is the quotient group (Z,+)/nZ).

Verification

technique · direct
1.1

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

givenL1L2L3
2.1

For every n>0, the word (st)n is a nonempty reduced word, so normal form makes it nonidentity. Hence st 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 C2∗C3 has presentation ⟨s,t∣s2=e, t3=e⟩ and is infinite.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

Suppose each Gi has a presentation ⟨Xi∣Ri⟩, with the alphabets replaced by disjoint copies. Then ∗iGi≅⟨⨆iXi | ⋃iRi⟩. (A free product has the union presentation of presentations of its factors).

[L2]

Every element of ∗i∈IGi 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 n∈N, view n as its canonical nonnegative integer and put nZ:={nk:k∈Z}. Then the left cosets of nZ in (Z,+) are exactly the congruence classes modulo n, and coset addition is the published addition of congruence classes. Thus (Z,+)/nZ=(Z/n,+) as the same group on the same underlying set. This includes n=0 and n=1. (For every n∈N, the congruence-class group (Z/n,+) is the quotient group (Z,+)/nZ).

Verification

technique · direct
1.1

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

givenL1L2L3
2.1

For n∈N, the words (st)n are reduced; the n=0 word is empty and positive n 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,H, the factor maps g↦(g,e) and h↦(e,h) induce a canonical surjection π:G∗H↠G×H. Every cross-commutator lies in ker⁡π, and if g,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)i∈I, a free product is a group F with homomorphisms ιi:Gi→F in the sense of def-group-homomorphism, such that for every group H and every family of homomorphisms fi:Gi→H, there is a unique homomorphism f:F→H satisfying f∘ιi=fi for all i. It is denoted ∗i∈IGi. Injectivity of the maps ιi is not part of this definition. (The free product of an arbitrary family of groups).

[L2]

Every element of ∗i∈IGi 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 G and H be groups. Their external direct product has underlying set G×H:={(g,h):g∈G, h∈H} and componentwise operation (g,h)(g′,h′):=(gg′,hh′). The fact that this operation makes G×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×H with componentwise multiplication).

[L4]

For groups G and H, the componentwise operation of def-external-direct-product-of-groups makes G×H a group. Its identity is (eG,eH), and (g,h)−1=(g−1,h−1). Moreover the coordinate maps πG(g,h)=g and πH(g,h)=h are group homomorphisms. (G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections).

[L5]

Let G be a group. For g,h∈G, their commutator is [g,h]:=ghg−1h−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=hgh−1g−1=[h,g]. The commutator subgroup, or derived subgroup, is the subgroup generated by all commutators: [G,G]:=⟨{[g,h]:g,h∈G}⟩. The generated subgroup notation is that of def-generated-subgroup. (Commutators [g,h]=ghg−1h−1 and the commutator subgroup [G,G]).

Verification

technique · direct
1.1

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

givenL1L2L3L4L5
2.1

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

step 1.1
3.1

For nonidentity g∈G, h∈H, the word ghg−1h−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 ∗i∈IGi 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 n∈N, view n as its canonical nonnegative integer and put nZ:={nk:k∈Z}. Then the left cosets of nZ in (Z,+) are exactly the congruence classes modulo n, and coset addition is the published addition of congruence classes. Thus (Z,+)/nZ=(Z/n,+) as the same group on the same underlying set. This includes n=0 and n=1. (For every n∈N, the congruence-class group (Z/n,+) is the quotient group (Z,+)/nZ).

Refutation

technique · direct
1.1

Take the two abelian groups C2=⟨s⟩ and C2=⟨t⟩.

givenL1L2
2.1

In C2∗C2, the words st and ts are distinct reduced words by normal-form uniqueness.

step 1.1
3.1

Thus s and t 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,n, amalgamating infinite cyclic groups ⟨x⟩ and ⟨y⟩ along maps sending a generator to xm and yn gives ⟨x,y∣xm=yn⟩. Both cyclic factor maps remain injective.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

Let G=⟨X∣R⟩ and H=⟨Y∣S⟩ with disjoint generators, and let f,h embed K. If T generates K and words ut(X),vt(Y) represent f(t),h(t), then G∗KH≅⟨X⊔Y∣R∪S∪{utvt−1:t∈T}⟩. (A free product with amalgamation has the factor presentations plus the amalgamating relations).

[L2]

The canonical maps G→G∗KH and H→G∗KH are injective. (The factor maps into a free product with amalgamation are injective).

[L3]

Every class in W(X)/∼ contains exactly one reduced word. (Every class in W(X)/∼ contains exactly one reduced word).

[L4]

For every set X, the group Fword(X)=W(X)/∼ together with iword(x)=[x] is a free group on X in the sense of def-free-group. (The word-quotient group W(X)/∼ satisfies the universal property of the free group on X).

[L5]

Let F(X) be a free group and let R⊆F(X) be a set of words, called relations. The group with presentation ⟨X∣R⟩:=F(X)/⟨ ⁣⟨R⟩ ⁣⟩F(X) is the quotient by the normal closure of R. The members of X are its generators. In this quotient, every relation in R becomes the identity, as do all consequences forced by normality. (Group presentation by generators and relations).

[L6]

Let G be a group and R⊆G. Then ⟨ ⁣⟨R⟩ ⁣⟩G={g1r1ε1g1−1⋯gnrnεngn−1:n∈N, gi∈G, ri∈R, εi∈{1,−1}}. For n=0 the displayed product is the identity. Replacing every conjugator gi by gi−1 gives the equivalent convention gi−1riεigi. (The normal closure of R is the set of finite products of conjugates of elements of R 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>0 and the factors have infinite order.

step 1.1
3.1

The amalgamated-presentation theorem adds exactly the relation xmy−n=e, equivalently xm=yn, 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 C2 as the unique order-two subgroup of C4=⟨a⟩ and C6=⟨b⟩. Their amalgamated free product has presentation ⟨a,b∣a4=e, b6=e, a2=b3⟩.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

Let G=⟨X∣R⟩ and H=⟨Y∣S⟩ with disjoint generators, and let f,h embed K. If T generates K and words ut(X),vt(Y) represent f(t),h(t), then G∗KH≅⟨X⊔Y∣R∪S∪{utvt−1:t∈T}⟩. (A free product with amalgamation has the factor presentations plus the amalgamating relations).

[L2]

The canonical maps G→G∗KH and H→G∗KH are injective. (The factor maps into a free product with amalgamation are injective).

[L3]

Inside G∗KH, the images of G and H intersect exactly in their common image of K. (The two factor images intersect exactly in the amalgamated subgroup).

[L4]

Every subgroup H of a cyclic group G=⟨g⟩ is cyclic. If H≠{e}, then the least positive integer d for which gd∈H satisfies H=⟨gd⟩. (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 a2 is the unique element of order 2 in C4 and b3 is the unique element of order 2 in C6. The edge maps send the nonidentity element of C2 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 C4 and C6, and the intersection theorem says their images meet exactly in the common C2.

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:K→G and h:K→H, iH(h(ker⁡f))={e},iG(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:K→G and h:K→H, let N be the normal closure in G∗H of {jG(f(k))jH(h(k))−1:k∈K}. Then (G∗H)/N, with the induced factor maps jG and jH, is a pushout of f and h. (A group pushout is the quotient of a free product by the amalgamating relations).

[L3]

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

Refutation

technique · direct
1.1

Take K=C2, G=1, H=C2, with f:K→G trivial and h:K→H the identity.

givenL1L2L3
2.1

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

step 1.1
3.1

The canonical map H=C2→1 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:K→G be an isomorphism and h:K→H any homomorphism. The pushout is H, with legs h∘f−1:G→H and idH. For example, pushing C4←≅C4→C2 along reduction modulo 2 gives C2.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

Given homomorphisms f:K→G and h:K→H as in def-group-homomorphism, a pushout is a group P with homomorphisms iG:G→P and iH:H→P such that iG∘f=iH∘h, and such that every compatible pair u:G→Q, v:H→Q factors through a unique w:P→Q with w∘iG=u and w∘iH=v. The maps f,h need not be injective. (Pushouts of group homomorphisms).

[L2]

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

[L3]

The inverse of a bijective group homomorphism is a group homomorphism. If f:G→H is a bijective group homomorphism, then its set-theoretic inverse f−1:H→G is a group homomorphism. (The inverse of a bijective group homomorphism is a group homomorphism).

[L4]

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

Verification

technique · direct
1.1

The two displayed legs agree on K: (h∘f−1)∘f=h.

givenL1L2L3L4
2.1

For a compatible pair u:G→Q, v:H→Q, one has u=v∘h∘f−1, so v is the unique mediator from H.

step 1.1
3.1

In the cyclic example this says the C4 leg is reduction modulo 2, the C2 leg is the identity, and every compatible cocone factors uniquely through C2.

step 2.1∎

Sources