Because the generating sets are disjoint, the free product has the presentation
This is immediate from the universal property of a group presentation: a map out of this presented group is exactly a pair of homomorphisms from and to the target group.
A reduced word is either the empty word or a product
in which every syllable is a nonidentity element of or , and consecutive syllables belong to different factors.
Let be the set of reduced words. Each acts on the right of : if the last syllable lies in , append ; if it lies in , multiply it by and delete it when the product is the identity. Define the action of each analogously. These rules give genuine actions of the two factors by permutations of , hence an action of the free group . Every relation in acts trivially, so the action factors through the displayed presentation of .
The element represented by a reduced word sends the empty word to . Therefore two reduced words representing the same element induce the same permutation and have the same value on the empty word. They must be identical. This proves the normal form theorem for a free product.
Let be a nonempty reduced word. If its first syllable belongs to , choose any nonidentity . The reduced form of begins with an -syllable, whereas that of begins with the original -syllable; reduction at the right end cannot change the first syllable. Hence . The same argument with a nonidentity applies when begins in . No nonidentity element is therefore central, and
Choose distinct nonidentity elements and , and put
Expand a freely reduced word in . At a boundary where two syllables from one factor meet, their product is one of , , , or , all nonidentity by the choices above. Every other boundary already alternates between the factors. Thus the expansion reduces to a nonempty reduced word in and cannot represent the identity. The homomorphism from the rank-two free group sending its free generators to is injective, so

Articles by others on the same topic (0)

There are currently no matching articles.