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 group pushout is the quotient of a free product by the amalgamating relations
Statement
For homomorphisms and , let be the normal closure in of Then , with the induced factor maps and , is a pushout of and .
Facts & Assumptions
Given: The objects and hypotheses in the statement.
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).
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).
Let be a group and let . The family is nonempty because by def-normal-subgroup. Its intersection is normal by lem-intersection-of-normal-subgroups. The normal closure of in is It contains and is contained in every normal subgroup of that contains . Thus it is the smallest normal subgroup of containing . (The normal closure of a subset of a group).
Let be a group and let be a normal subgroup (def-normal-subgroup). The quotient group, or factor group, has the left cosets as its elements (def-coset, def-index), with product Independence of the chosen representatives is proved in thm-coset-multiplication-well-defined-iff-normal, and the group axioms are proved in thm-quotient-group-laws. (The quotient group and coset product ).
A homomorphism that kills a normal subgroup factors uniquely through the quotient group. If , is a homomorphism, and , then there is a unique homomorphism such that and . (A homomorphism that kills a normal subgroup factors uniquely through the quotient group).
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
In the quotient every amalgamating relator is trivial, so the two induced maps agree on .
Given compatible maps and , free-product universality gives . Compatibility makes every displayed relator lie in , hence .
The quotient universal property gives a unique extending and . Uniqueness follows because the factor images generate the quotient.
The argument allows trivial groups and arbitrary kernels without change.
Depends on
- Pushouts of group homomorphisms
- The free product of an arbitrary family of groups
- The normal closure of a subset of a group
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- A homomorphism that kills a normal subgroup factors uniquely through the quotient group
- The normal closure of $R$ is the set of finite products of conjugates of elements of $R$ and their inverses
Used by
- Free products with amalgamation along monomorphisms Definition
- FALSE: canonical factor maps into every group pushout are injective False statement
- The kernels of the amalgamating maps are killed in the opposite canonical maps to a group pushout Proposition
- A free product with amalgamation has the factor presentations plus the amalgamating relations Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 31 results over 15 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)