Amalgamated free product

Given homomorphisms $i_A:C\to A$ and $i_B:C\to B$, the amalgamated free product $A{\ast }_{C}B$ comes with homomorphisms from $A$ and $B$ that agree on $C$. It is universal with this property: every compatible pair of homomorphisms $A\to H$ and $B\to H$ factors uniquely through $A{\ast }_{C}B$.

The free product $A\ast B$ is the amalgamated free product over the trivial group. Its nonidentity elements have unique reduced alternating normal forms.

Given group homomorphisms $f_A:A\to H$ and $f_B:B\to H$, there is exactly one group homomorphism $A\ast B\to H$ extending both. Its value on an alternating normal form is the product of the factor-map values. Thus the free product is the coproduct in the category of groups.

A free product $A\ast B$ is nontrivial as a splitting when both factors differ from the trivial group. Alternating words $(ab{)}^r$ with $a,b\ne 1$ in different factors show that every such splitting gives an infinite group. The distinct normal forms $ab$ and $ba$ also show that the group is not an abelian group.

For nontrivial groups $A,B$, the Cayley graph of $A\ast B$ with $S=(A\setminus \{1\})\cup (B\setminus \{1\})$ has the edges of the Bass-Serre tree as its vertices. Two such vertices are adjacent exactly when the tree edges share an endpoint. Mapping each group element to its tree-edge midpoint is an isometry on the vertex metrics and has image within distance $1/2$ of every tree point, hence gives a quasi-isometry of metric graphs. The normal form theorem for a free product identifies $|g{|}_S$ with reduced syllable length. The factor subgroups have diameter one in this metric.

Every element of a free product $G\ast H$ has a unique expression $u_1\cdots u_n$ in which each $u_i$ is a nonidentity element of one factor and adjacent syllables belong to different factors. The identity corresponds to the empty word.

A syllable is a nonidentity element of one factor in a free product word. A reduced normal form has successive syllables in different factors; its syllable length is the number of these elements. This length records factor elements, rather than letters in a chosen generating set.