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 free product with amalgamation has the factor presentations plus the amalgamating relations

Statement

Let G=⟨X∣R⟩ and H=⟨Y∣S⟩ with disjoint generators, and let f,h embed K. If T generates K and words ut(X),vt(Y) represent f(t),h(t), then G∗KH≅⟨X⊔Y∣R∪S∪{utvt−1:t∈T}⟩.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

If f:K→G and h:K→H are injective homomorphisms, their pushout is called the free product with amalgamation and is denoted G∗KH. 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 K with its two images, but injectivity of the canonical maps G,H→G∗KH is a theorem, not part of this definition. (Free products with amalgamation along monomorphisms).

[L2]

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. (A group pushout is the quotient of a free product by the amalgamating relations).

[L3]

Suppose each Gi has a presentation ⟨Xi∣Ri⟩, with the alphabets replaced by disjoint copies. Then ∗iGi≅⟨⨆iXi | ⋃iRi⟩. (A free product has the union presentation of presentations of its factors).

[L4]

Let F(X) be a free group and let R⊆F(X) be a set of words, called relations. The group with presentation ⟨X∣R⟩:=F(X)/⟨ ⁣⟨R⟩ ⁣⟩F(X) is the quotient by the normal closure of R. The members of X are its generators. In this quotient, every relation in R becomes the identity, as do all consequences forced by normality. (Group presentation by generators and relations).

[L5]

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

The union presentation gives G∗H=⟨X⊔Y∣R∪S⟩.

givenL1L2L3L4L5
2.1

Quotienting by the normal closure of the displayed relations identifies the two images of every generator t∈T, hence of every element of K.

step 1.1
3.1

Conversely the relations for all k∈K follow from those for T and their conjugates and products. The quotient is therefore the amalgamated pushout of the preceding theorem.

step 2.1∎

Depends on

Used by

Dependency tree · two levels

19 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