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 , 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.
Depends on
- A free product with amalgamation has the factor presentations plus the amalgamating relations
- The factor maps into a free product with amalgamation are injective
- Every class in $W(X)/{\sim}$ contains exactly one reduced word
- The word-quotient group $W(X)/{\sim}$ satisfies the universal property of the free group on $X$
- Group presentation by generators and relations
- The normal closure of $R$ is the set of finite products of conjugates of elements of $R$ and their inverses
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
- George D. Torres, Combinatorial Group Theory, §2 (standard reference, not scraped)
- B. H. Neumann, Lectures on Topics in the Theory of Infinite Groups, Ch. 9 (standard reference, not scraped)