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.
Free Products and Amalgamation — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Free Groups and Presentations
- Free Products and Amalgamation
- Group Homomorphisms and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Relations, Functions, and Quotients
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
C_2 free-product C_2 is the infinite dihedral group, and the product of its generators has infinite order
Example
The free product has presentation This is the standard infinite dihedral group , and has infinite order.
Facts & Assumptions
Given: The objects and hypotheses in the example.
Suppose each has a presentation , with the alphabets replaced by disjoint copies. Then (A free product has the union presentation of presentations of its factors).
Every element of 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).
For every , view as its canonical nonnegative integer and put . Then the left cosets of in are exactly the congruence classes modulo , and coset addition is the published addition of congruence classes. Thus as the same group on the same underlying set. This includes and . (For every , the congruence-class group is the quotient group ).
Verification
The union-presentation theorem gives the displayed presentation from the two cyclic factors.
For every , the word is a nonempty reduced word, so normal form makes it nonidentity. Hence has infinite order and the group is infinite.
C_2 free-product C_3 has presentation with only the two factor relations and is infinite
Example
The free product has presentation and is infinite.
Facts & Assumptions
Given: The objects and hypotheses in the example.
Suppose each has a presentation , with the alphabets replaced by disjoint copies. Then (A free product has the union presentation of presentations of its factors).
Every element of 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).
For every , view as its canonical nonnegative integer and put . Then the left cosets of in are exactly the congruence classes modulo , and coset addition is the published addition of congruence classes. Thus as the same group on the same underlying set. This includes and . (For every , the congruence-class group is the quotient group ).
Verification
The presentation theorem contributes only the defining relations of the two factors.
For , the words are reduced; the word is empty and positive have distinct lengths. Normal form therefore makes them pairwise distinct, proving infinitude.
The canonical surjection from a free product to the direct product of its factors
Example
For groups , the factor maps and induce a canonical surjection Every cross-commutator lies in , and if are nonidentity then that commutator is nonidentity in the free product.
Facts & Assumptions
Given: The objects and hypotheses in the example.
For a family , a free product is a group with homomorphisms in the sense of def-group-homomorphism, such that for every group and every family of homomorphisms , there is a unique homomorphism satisfying for all . It is denoted . Injectivity of the maps is not part of this definition. (The free product of an arbitrary family of groups).
Every element of 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).
Let and be groups. Their external direct product has underlying set and componentwise operation The fact that this operation makes 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 with componentwise multiplication).
For groups and , the componentwise operation of def-external-direct-product-of-groups makes a group. Its identity is , and Moreover the coordinate maps and are group homomorphisms. ( is a group with identity , coordinatewise inverses, and homomorphic coordinate projections).
Let be a group. For , their commutator is This convention is fixed throughout; some sources use its inverse. By the inverse laws of lem-group-inverse-laws, one has . The commutator subgroup, or derived subgroup, is the subgroup generated by all commutators: The generated subgroup notation is that of def-generated-subgroup. (Commutators and the commutator subgroup ).
Verification
Free-product universality gives , and every lies in its image, so it is surjective.
The two factor images commute in , hence maps to the identity.
For nonidentity , , the word is a nonempty reduced word, so normal form makes it nonidentity. Thus the kernel is generally nontrivial.
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.
Every element of 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).
For every , view as its canonical nonnegative integer and put . Then the left cosets of in are exactly the congruence classes modulo , and coset addition is the published addition of congruence classes. Thus as the same group on the same underlying set. This includes and . (For every , the congruence-class group is the quotient group ).
Refutation
Take the two abelian groups and .
In , the words and are distinct reduced words by normal-form uniqueness.
Thus and do not commute, so their free product is nonabelian and the claim is false.
Amalgamating infinite cyclic groups by multiplication by m and n gives the presentation with relation x^m=y^n
Example
For positive integers , amalgamating infinite cyclic groups and along maps sending a generator to and gives Both cyclic factor maps remain injective.
Facts & Assumptions
Given: The objects and hypotheses in the example.
Let and with disjoint generators, and let embed . If generates and words represent , then (A free product with amalgamation has the factor presentations plus the amalgamating relations).
The canonical maps and are injective. (The factor maps into a free product with amalgamation are injective).
Every class in contains exactly one reduced word. (Every class in contains exactly one reduced word).
For every set , the group together with is a free group on in the sense of def-free-group. (The word-quotient group satisfies the universal property of the free group on ).
Let be a free group and let be a set of words, called relations. The group with presentation is the quotient by the normal closure of . The members of are its generators. In this quotient, every relation in becomes the identity, as do all consequences forced by normality. (Group presentation by generators and relations).
Let be a group and . Then For the displayed product is the identity. Replacing every conjugator by gives the equivalent convention . (The normal closure of is the set of finite products of conjugates of elements of and their inverses).
Verification
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.
The maps from the edge group are injective because and the factors have infinite order.
The amalgamated-presentation theorem adds exactly the relation , equivalently , and the factor-embedding theorem preserves both cyclic factors.
Amalgamating C_2 inside C_4 and C_6 gives the presentation with a^2=b^3
Example
Embed as the unique order-two subgroup of and . Their amalgamated free product has presentation
Facts & Assumptions
Given: The objects and hypotheses in the example.
Let and with disjoint generators, and let embed . If generates and words represent , then (A free product with amalgamation has the factor presentations plus the amalgamating relations).
The canonical maps and are injective. (The factor maps into a free product with amalgamation are injective).
Inside , the images of and intersect exactly in their common image of . (The two factor images intersect exactly in the amalgamated subgroup).
Every subgroup of a cyclic group is cyclic. If , then the least positive integer for which satisfies . (Every subgroup of a cyclic group is cyclic; the least positive exponent in a nontrivial subgroup supplies a generator).
Verification
Enumerating the cyclic powers shows that is the unique element of order in and is the unique element of order in . The edge maps send the nonidentity element of to these elements, so both maps are injective.
The amalgamated-presentation theorem gives the displayed presentation.
Factor embedding keeps copies of and , and the intersection theorem says their images meet exactly in the common .
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.
For a pushout of and , 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).
For homomorphisms and , let be the normal closure in of Then , with the induced factor maps and , is a pushout of and . (A group pushout is the quotient of a free product by the amalgamating relations).
For every , view as its canonical nonnegative integer and put . Then the left cosets of in are exactly the congruence classes modulo , and coset addition is the published addition of congruence classes. Thus as the same group on the same underlying set. This includes and . (For every , the congruence-class group is the quotient group ).
Refutation
Take , , , with trivial and the identity.
The amalgamating relation kills the generator of , so the quotient construction makes the pushout trivial. Equivalently, kernel collapse kills .
The canonical map is not injective, refuting the claim.
A pushout along an isomorphism recovers the other group
Example
Let be an isomorphism and any homomorphism. The pushout is , with legs and . For example, pushing along reduction modulo gives .
Facts & Assumptions
Given: The objects and hypotheses in the example.
Given homomorphisms and as in def-group-homomorphism, a pushout is a group with homomorphisms and such that , and such that every compatible pair , factors through a unique with and . The maps need not be injective. (Pushouts of group homomorphisms).
Group isomorphisms, automorphisms and the set . An isomorphism is a bijective group homomorphism (def-group-homomorphism, def-injection-surjection-bijection). When , it is an automorphism of . Write (Group isomorphisms, automorphisms and the set ).
The inverse of a bijective group homomorphism is a group homomorphism. If is a bijective group homomorphism, then its set-theoretic inverse is a group homomorphism. (The inverse of a bijective group homomorphism is a group homomorphism).
For every , view as its canonical nonnegative integer and put . Then the left cosets of in are exactly the congruence classes modulo , and coset addition is the published addition of congruence classes. Thus as the same group on the same underlying set. This includes and . (For every , the congruence-class group is the quotient group ).
Verification
The two displayed legs agree on : .
For a compatible pair , , one has , so is the unique mediator from .
In the cyclic example this says the leg is reduction modulo , the leg is the identity, and every compatible cocone factors uniquely through .
Sources
Standard references
Recommended treatments; not extraction sources.