Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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=XRG=\langle X\mid R\rangle and H=YSH=\langle Y\mid S\rangle with disjoint generators, and let f,hf,h embed KK. If TT generates KK and words ut(X),vt(Y)u_t(X),v_t(Y) represent f(t),h(t)f(t),h(t), then GKHXYRS{utvt1:tT}.G\ast_KH\cong\langle X\sqcup Y\mid R\cup S\cup\{u_t v_t^{-1}:t\in T\}\rangle.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

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

[L2]

For homomorphisms f:KGf:K\to G and h:KHh:K\to H, let NN be the normal closure in GHG\ast H of {jG(f(k))jH(h(k))1:kK}.\{j_G(f(k))j_H(h(k))^{-1}:k\in K\}. Then (GH)/N(G\ast H)/N, with the induced factor maps jGj_G and jHj_H, is a pushout of ff and hh. (A group pushout is the quotient of a free product by the amalgamating relations).

[L3]

Suppose each GiG_i has a presentation XiRi\langle X_i\mid R_i\rangle, with the alphabets replaced by disjoint copies. Then iGiiXi | iRi.\ast_iG_i\cong\left\langle\bigsqcup_iX_i\ \middle|\ \bigcup_iR_i\right\rangle. (A free product has the union presentation of presentations of its factors).

[L4]

Let F(X)F(X) be a free group and let RF(X)R\subseteq F(X) be a set of words, called relations. The group with presentation XR:=F(X)/ ⁣R ⁣F(X)\langle X\mid R\rangle:=F(X)/\langle\!\langle R\rangle\!\rangle_{F(X)} is the quotient by the normal closure of RR. The members of XX are its generators. In this quotient, every relation in RR becomes the identity, as do all consequences forced by normality. (Group presentation by generators and relations).

[L5]

Let GG be a group and RGR\subseteq G. Then  ⁣R ⁣G={g1r1ε1g11gnrnεngn1:nN, giG, riR, εi{1,1}}.\langle\!\langle R\rangle\!\rangle_G=\left\{g_1r_1^{\varepsilon_1}g_1^{-1}\cdots g_nr_n^{\varepsilon_n}g_n^{-1}:n\in\mathbb N,\ g_i\in G,\ r_i\in R,\ \varepsilon_i\in\{1,-1\}\right\}. For n=0n=0 the displayed product is the identity. Replacing every conjugator gig_i by gi1g_i^{-1} gives the equivalent convention gi1riεigig_i^{-1}r_i^{\varepsilon_i}g_i. (The normal closure of RR is the set of finite products of conjugates of elements of RR and their inverses).

Proof

technique · direct
1.1

The union presentation gives GH=XYRSG\ast H=\langle X\sqcup Y\mid R\cup S\rangle.

givenL1L2L3L4L5
2.1

Quotienting by the normal closure of the displayed relations identifies the two images of every generator tTt\in T, hence of every element of KK.

step 1.1
3.1

Conversely the relations for all kKk\in K follow from those for TT 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 · 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