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.
A free product with amalgamation has the factor presentations plus the amalgamating relations
Statement
Let and with disjoint generators, and let embed . If generates and words represent , then
Facts & Assumptions
Given: The objects and hypotheses in the statement.
If and are injective homomorphisms, their pushout is called the free product with amalgamation and is denoted . The quotient construction is thm-group-pushout-as-an-amalgamated-quotient, and injectivity means the trivial-kernel condition of thm-group-homomorphism-injective-iff-trivial-kernel. The notation anticipates identifying with its two images, but injectivity of the canonical maps is a theorem, not part of this definition. (Free products with amalgamation along monomorphisms).
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).
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).
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).
Proof
The union presentation gives .
Quotienting by the normal closure of the displayed relations identifies the two images of every generator , hence of every element of .
Conversely the relations for all follow from those for and their conjugates and products. The quotient is therefore the amalgamated pushout of the preceding theorem.
Depends on
- Free products with amalgamation along monomorphisms
- A group pushout is the quotient of a free product by the amalgamating relations
- A free product has the union presentation of presentations of its factors
- 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
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 38 results over 13 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)