Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11
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 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.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[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]

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).

[L3]

Let G be a group and let S⊆G. The family NS:={N:N⊴G and S⊆N} is nonempty because G⊴G by def-normal-subgroup. Its intersection is normal by lem-intersection-of-normal-subgroups. The normal closure of S in G is ⟨ ⁣⟨S⟩ ⁣⟩G:=⋂N∈NSN. It contains S and is contained in every normal subgroup of G that contains S. Thus it is the smallest normal subgroup of G containing S. (The normal closure of a subset of a group).

[L4]

Let G be a group and let N⊴G be a normal subgroup (def-normal-subgroup). The quotient group, or factor group, G/N has the left cosets G/N:={gN:g∈G} as its elements (def-coset, def-index), with product (gN)(hN):=ghN. 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 G/N and coset product (gN)(hN)=ghN).

[L5]

A homomorphism that kills a normal subgroup factors uniquely through the quotient group. If N⊴G, f:G→H is a homomorphism, and N⊆ker⁡f, then there is a unique homomorphism fˉ:G/N→H such that fˉ(gN)=f(g) and f=fˉ∘π. (A homomorphism that kills a normal subgroup factors uniquely through the quotient group).

[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).

Proof

technique · direct
1.1

In the quotient every amalgamating relator is trivial, so the two induced maps agree on K.

givenL1L2L3L4L5L6
2.1

Given compatible maps u:G→Q and v:H→Q, free-product universality gives ϕ:G∗H→Q. Compatibility makes every displayed relator lie in ker⁡ϕ, hence N⊆ker⁡ϕ.

step 1.1
3.1

The quotient universal property gives a unique ϕˉ:(G∗H)/N→Q extending u and v. Uniqueness follows because the factor images generate the quotient.

step 2.1
4.1

The argument allows trivial groups and arbitrary kernels without change.

step 3.1∎

Depends on

Used by

Dependency tree · two levels

17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources