In this paragraph X will denote a set. Unless otherwise mentioned, the identity element of a monoid will be denoted by e.
1. Free magmas
A sequence of sets Mn(X) is defined by induction on the integer n⩾1 as follows: writing M1(X)=X, for n⩾2, Mn(X) is the set the sum of the sets Mp(X)×Mn−p(X) for 1⩽p⩽n−1. The set the sum of the family (Mn(X))n⩾1 is denoted by M(X); each of the sets Mn(X) is identified with its canonical image in M(X). For every element w of M(X) there exists a unique integer n such that w∈Mn(X); it is called the length of w and denoted by l(w). The set X consists of the elements in M(X) of length 1.
Let w and w′ be in M(X); write p=l(w) and q=l(w′). The image of (w,w′) under the canonical injection of Mp(X)×Mq(X) into the sum set Mp+q(X) is called the composition of w and w′ and is denoted by ww′ or w.w′. Then l(w.w′)=l(w)+l(w′) and every element of M(X) of length ⩾2 can be written uniquely in the form w′w′′ with w′,w′′ in M(X).
The set M(X) with the law of composition (w,w′)↦w.w′ is called the free magma constructed on X (§ 1, no. 1, Definition 1).
Proposition 1
Let M be a magma. Every mapping f of X into M may be extended in a unique way to a morphism of M(X) into M.
By induction on n⩾, mappings fn:Mn(X)→M are defined as follows: let f_1 = f; for n \geq 2, the mapping f_n is defined by fn(w.w′)=fp(w).fn−p(w′) for p=1,2,…,n−1 and (w,w′) in Mp(X)×Mn−p(X). Let g be the mapping of M(X) into M which induces fn on Mn(X) for every integer n≥1. Clearly g is the unique morphism of M(X) into M which extends f.
Let u be a mapping of X into a set Y. By Proposition 1, there exists one and only one homomorphism of M(X) into M(Y) which coincides with u on X. It will be denoted by M(u). If v is a mapping of Y into a set Z, the homomorphism M(v)∘M(u) of M(X) into M(Z) coincides with v∘u on X, whence
M(v)∘M(u)=M(v∘u).
Proposition 2
Let u:X→Y be a mapping. If u is injective (resp. surjective, bijective), so is M(u).
Suppose u is injective. When X is empty, M(X) is empty, hence M(u) is injective. If X is non-empty, there exists a mapping v of Y into X such that v∘u is the identity mapping of X (Set Theory, II, § 3, no. 8, Proposition 8); the mapping M(v)∘M(u)=M(v∘u) is the identity mapping of M(X) and hence M(u) is injective.
When u is surjective, there exists a mapping w of Y into X such that u∘w is the identity mapping of Y (Set Theory, II, § 3, no. 8, Proposition 8). Then M(u)∘M(w)=M(u∘w) is the identity mapping of M(Y) and hence M(u) is surjective.
Finally, if u is bijective, it is injective and surjective and hence M(u) has the same properties.
Let S be a subset of X. By Proposition 2 the injection of S into X can be extended to an isomorphism of M(S) onto a submagma M′(S) of M(X). The magmas M(S) and M′(S) are identified by means of this isomorphism. Then M(S) is the submagma of M(X) generated by S.
Let X be a set and (uα,vα)α∈I be a family of ordered pairs of elements of M(X). Let R be the equivalence relation on M(X) compatible with the law of M(X) and generated by the (uα,vα) (§ 1, no. 6). The magma M(X)/R is called the magma defined by X and the relators(uα,vα)α∈I. Let h be the canonical morphism of M(X) onto M(X)/R. Then M(X)/R is generated by h(X).
Let N be a magma and (nx)x∈X a family of elements of N. Let k be the morphism from M(X) to N such that k(x)=nx for all x∈X (Proposition 1). If k(uα)=k(vα) for all α∈I, there exists one and only one morphism f:M(X)/R→N such that f(h(x))=nx for all x∈X (§ 1, no. 6, Proposition 9).
2. Free monoids
Any finite sequence w=(xi)1≤i≤n of elements of X indexed by an interval [1,n] of N (possibly empty) is called a word constructed on X. The integer n is called the length of the word w and denoted by l(w). There is a unique word of length 0, namely the empty sequence e. X will be identified with the set of words of length 1.
Let w=(xi)1≤i≤m and w′=(xj′)1≤j≤n be two words. The composition of w and w′ is the word u=(yk)1≤k≤m+n defined by
yk={xkxk−m′for 1≤k≤mfor m+1≤k≤m+n.
In other words, the sequence w′′ is obtained by first writing the elements of the sequence w and then those of w′. The composition of w and w′ is generally denoted by ww′ or w.w′; it is sometimes said that it is obtained by juxtaposition of w and w′. Then by construction l(w.w′)=l(w)+l(w′).
The relation we=ew=w is immediately established for every word w. Let w=(xi)1≤i≤m, w′=(xj′)1≤j≤n and w′′=(xk′′)1≤k≤p be three words; clearly the words w(w′w′′) and (ww′)w′′ are both equal to the word (yl)1≤l≤m+n+p defined by
The above shows that the set of words constructed on X with the law of composition (w,w′)↦w.w′ is a monoid with identity element e. It is denoted by Mo(X) and called the free monoid constructed onX. It follows immediately from the definition of product of words that every word w=(xi)1≤i≤n is equal to the product ∏i=1nxi. A word may therefore be written in the form x1…xn.
Proposition 3
Let M be a monoid. Every mapping f of X into M extends uniquely to a homomorphism of Mo(X) into M.
Let g be a homomorphism of Mo(X) into M extending f. If w=(xi)1≤i≤n is a word, then w=∏i=1nxi in the monoid Mo(X), whence
g(w)=i=1∏ng(xi)=i=1∏nf(xi)
in the monoid M (§ 1, no. 2, formula (2)). This proves the uniqueness of g.
Let h(w)=∏i=1nf(xi) for every word w=(xi)1≤i≤n. The associativity theorem (§ 1, no. 3, Theorem 1) and the definition of product in Mo(X) imply h(ww′)=h(w)h(w′). By convention the empty product h(e) is the identity element of M and h(x)=f(x) for x∈X. Hence h is a homomorphism of Mo(x) into M extending f.
Let u:X→Y be a mapping. By Proposition 3, there exists one and only one homomorphism of Mo(X) into Mo(Y) which coincides with u on X; it is denoted by Mo(u). It maps a word (xi)1≤i≤n to the word (u(xi))1≤i≤n. As in the case of magmas (no. 1), the equation Mo(v \circ u) = Mo(v) \circ Mo(u) is established for every mapping v:Y→Z and it can be shown that Mo(u) is injective (resp. surjective, bijective) if u is. For every subset S of X, Mo(S) is identified with the submonoid of Mo(X) generated by S.
Let X be a set and (uα,vα)α∈I be a family of ordered pairs of elements of Mo(X). Let R be the equivalence relation on Mo(X) compatible with the law on Mo(X) and generated by the (uα,vα) (§ 1, no. 6). The monoid Mo(X)/R is called the monoid defined by X and the relators(uα,vα)α∈I. Let h be the canonical morphism of Mo(X) onto Mo(X)/R. Then Mo(X) is generated by h(X).
Let N be a monoid and (nx)x∈X a family of elements of N. Let k be the morphism of Mo(X) into N such that k(x)=nx for all x∈X (Proposition 3). If k(uα)=k(vα) for all α∈I, there exists one and only one magma morphism f:Mo(X)/R→N such that f(h(x))=nx for all x∈X (§ 1, no. 6, Proposition 9); as k is unital, f is a monoid morphism.
3. Amalgamated sum of monoids
Let (Mi)i∈I denote a family of monoids and ei the identity element of Mi. We are given a monoid A and a family of homomorphisms hi:A→Mi (for i∈I).
The set S the sum of the family (Mi)i∈I has elements the ordered pairs (i,x) with i∈I and x∈Mi. For every triple α=(i,x,x′) with i∈I, x,x′ in Mi, write uα=(i,xx′) and vα=(i,x).(i,x′); for every triple λ=(i,j,a) in I×I×A, write pλ=(i,hi(a)) and qλ=(j,hj(a)); for all i∈I, write εi=(i,ei). The monoid M defined by S and the relators (uα,vα), (pλ,qλ) and (εi,e) is called the sum of the family(Mi)i∈Iamalgamated by A. Let ϕ denote the canonical homomorphism of Mo(S) onto M and write ϕi(x)=ϕ(i,x) for (i,x)∈S. It is said that ϕi is the canonical mapping of Mi into M. For all a∈A, the element ϕ(i,hi(a)) is independent of i and denoted by h(a).\footnote{When I is empty, M={e} and h(a)=e for all a∈A.}
The universal property of monoids defined by generators and relators (no. 2) implies the following result:
Proposition 4
(a) *For all i∈I, the mapping ϕi is a homomorphism of Mi into M and ϕi∘hi=h for all i∈I. Further, M is generated by ⋃i∈Iϕi(Mi).
(b) Let M′ be a monoid and f′:Mi→M′ (for i∈I) homomorphisms such that fi∘hi is independent of i∈I. There exists one and only one homomorphism f:M→M′ such that fi=f∘ϕi for all i∈I.
In what follows we shall make the following hypothesis:
(A) For all i∈I, there exists a subset Pi of Mi containing ei such that the mapping (a,p)↦hi(a).p of A×Pi into Mi is bijective.
It implies that the homomorphisms hi are injective. Let x∈M; every finite sequence σ=(a;i1,…,in;p1,…,pn) with a∈A,iα∈I and pα∈Piα for 1≤α≤n, satisfying
x=h(a)⋅α=1∏nϕiα(pα)
is called a decomposition of x. The integer n≥0 is called the length of the decomposition σ and is denoted by l(σ); the sequence (e) is a decomposition of length 0 of the identity element of M. The decomposition σ is called reduced if iα=iα+1 for 1≤α<n and pα=eiα for 1≤α≤n.
Proposition 5
Under hypothesis (A) every element x of M admits a unique reduced decomposition σ. Every decomposition σ′=σ of x satisfies l(σ′)>l(σ).
(A) Uniqueness of a reduced decomposition:
Let Σ denote the set of sequences σ=(a;i1,…,in;p1,…,pn) with n≥0, a∈A,iα∈I and pα∈Piα−{eiα} for 1≤α≤n, such that iα=iα+1 for 1≤α<n. Let Φ denote the mapping of Σ into M defined by
Φ(a;i1,…,in;p1,…,pn)=h(a)⋅α=1∏nϕiα(pα).
A reduced decomposition of x∈M is an element σ of Σ such that Φ(σ)=x.
For all i∈I, let Σi be the subset of Σ consisting of the sequences (e;i1,…,in;p1,…,pn) with i=i1 when n>0. Let
σ=(e;i1,…,in;p1,…,pn)
be in Σi and ξ in Mi; let ξ=hi(a)⋅p with a∈A and p∈Pi, and
Clearly fi,ei is the identity mapping of Σ and fi,xx′=fi,x∘fi,x′ for x,x′ in Mi and fi,hi(a)=fa for a∈A and i∈I.
Then Proposition 4 may be applied to the case where M′ is the monoid of mappings of Σ into itself with law of composition (f,f′)↦f∘f′ and where f_i is the homomorphism x↦fi,x of Mi into M′; then there exists a homomorphism f of M into M′ such that fi,x=f(ϕi(x)) for i∈I and x∈Mi. Let
σ=(a;i1,…,in;p1,…,pn)
be in Σ. Formulae (5) to (7) imply by induction on n the relation
that is σ=f(Φ(σ))(e). This proves that Φ is injective.
(B) Existence of a decomposition:
Let D be the set of elements of M admitting a decomposition. Then e∈D and M is generated by ⋃i∈Iϕi(Mi) and hence by h(A)∪⋃i∈Iϕi(Pi). Then D.ϕi(Pi)⊂D for all i∈I; to prove that D=M, it thus suffices to prove the relation D.h(A)⊂D. This follows from the following more precise lemma:
Lemma 1
Let i1,…,in be in I and pα in Piα for 1≤α≤n. For all a∈A there exists a′∈A and a sequence (pα′)1≤α≤n with pα′∈Piα such that*
Let x∈M and let n be the minimum of the lengths of decompositions of x. We shall prove that every decomposition σ of x of length n is reduced. This will establish the existence of a reduced decomposition of x; the uniqueness of the reduced decomposition then implies l(σ′)>l(σ) for every decomposition σ′=σ of x.
The case n=0 being trivial, suppose n>0. Let
σ=(a;i1,…,in;p1,…,pn)
be a decomposition of x of length n. If there existed an integer α with 1≤α≤n and pα=eiα, the sequence
is a decomposition of x of length n−1, which is a contradiction.
We have thus proved that σ is reduced.
Corollary
Under hypothesis (A) the homomorphisms ϕi and h are injective. For i=j in I, ϕi(Mi)∩ϕj(Mj)=h(A).
First h is injective: if h(a)=h(a′), then (a) and (a′) are two reduced decompositions of the same element of M, whence a=a′. Let i∈I; then h(A)=ϕi(hi(A))⊂ϕi(Mi); the uniqueness of reduced decompositions implies
h(A)∩ϕi(Mi−hi(A))=∅,
whence ϕi(Mi−hi(A))=ϕi(Mi)−h(A).
The injectivity of the homomorphisms ϕi and the relation
ϕi(Mi)∩ϕj(Mj)⊂h(A)
for i=j are then consequences of the following fact: for i,j in I, x in Mi−hi(A) and y in Mj−hj(A), the relation ϕi(x)=ϕj(y) implies i=j and x=y. Let x=hi(a)⋅p and y=hj(b)⋅q with a,b in A, p in Pi−{ei} and y in Pj−{ej}. Then ϕi(x)=h(a)ϕi(p) and ϕj(y)=h(b)ϕj(q) and hence (a;i;p) and (b;j;q) are two reduced decompositions of the same element of M. It follows that i=j,a=b and p=q, whence x=hi(a)p=hj(b)q=y.
When hypothesis (A) is fulfilled, we shall identify each monoid Mi with a submonoid of M by means of ϕi; similarly, we shall identify A with a submonoid of M by h. Then M is generated by ⋃i∈IMi and Mi∩Mj=A for i=j.
Every element of M can be written uniquely in the form a∏α=1npα with a∈A,p1∈Pi1−{e},…,pn∈Pin−{e} and iα=iα+1 for 1≤α<n. Finally, if M′ is a monoid and (fi:Mi→M′) (for i∈I) a family of homomorphisms whose restrictions to A are the same homomorphism of A into M′, there exists one and only one homomorphism f:M→M′ inducing fi on Mi for all i∈I.
Hypothesis (A) is satisfied in two important cases:
(a) A={e}. In this case, there is a family (Mi)i∈I of monoids and M is called the monoidal sum of this family. Each Mi is identified with a submonoid of M and M is generated by ⋃i∈IMi; further, Mi∩Mj={e} for i=j. Every element of M may be written uniquely in the form x1…xn with
x1∈Mi1−{e},…,xn∈Min−{e}
and iα=iα+1 for 1≤α≤n. Finally, for every family of homomorphisms (fi:Mi→M′), there exists a unique homomorphism f:M→M′ whose restriction to Mi is fi for all i∈I.
(b) There is a family of groups (Gi)i∈I containing as subgroup the same group A and hi is the injection of A into Gi. The sum of the family (Gi)i∈I amalgamated by A is then a groupG : the monoid G is generated by ⋃i∈Iϕi(Gi) and every element of ⋃i∈Iϕi(Gi) admits an inverse in G (cf. § 2, no. 3, Corollary 1 to Proposition 4); it is denoted by ∗AGi or G1∗AG2 when I={1,2}. When A consists of the identity element, it is also said that G is the free product of the family(Gi)i∈I of groups and it is denoted by ∗Gi (or G1∗G2 if I={1,2}).†
4. Application to free monoids
Lemma 2
Let M be the monoidal sum of the family (Mx)x∈X defined by Mx=N for all x∈X and let ϕx denote the canonical homomorphism of Mx into M. The mapping x↦ϕx(1) of X into M extends to an isomorphism h of Mo(X) onto M.
Let h be the homomorphism of Mo(X) into M characterized by h(x)=ϕx(1). For every integer n≥0, ϕx(n)=ϕx(1)n=h(x)n and as M is generated by ⋃x∈Xϕx(N), it is also generated by h(X). Hence h is surjective. Moreover, for all x in X, the mapping n↦xn is a homomorphism of N=Mx into Mo(X); there thus exists (no. 3, Proposition 4) a homomorphism h′ of M into Mo(X) such that h′(ϕx(n))=xn for x∈X and n∈N; in particular, h′(h(x))=x for x∈X and hence h′∘h is the identity homomorphism of Mo(X). Therefore h is injective. It has thus been proved that h is bijective.
Proposition 6
Let w be an element of Mo(X). (a) There exist an integer n≥0, elements xα of X and integers m(α)>0 (for
† Note that G1∗G2 is not the "product" of G1 and G2 in the sense of Set Theory, IV, § 2, no. 4 (nor in the sense of the "theory of categories"; in the context of this theory, G1∗G2 is the "sum" of G1 and G2).
1≤α≤n such that xα=xα+1 for 1≤α<n and w=∏α=1nxαm(α). The sequence (xα,m(α))1≤α≤n is determined uniquely by these conditions.
(b) Let p be a positive integer, xβ′ in X and m′(β) in N for 1≤β≤p such that w=∏β=1px′m′(β). Then p≥n. If p=n, then xβ′=xβ and m′(β)=m(β) for 1≤β≤p.
In the notation of Lemma 2, h−1(ϕx(n))=xn for x∈X and n∈N. Proposition 6 then follows from no. 3, Proposition 5.
5. Free groups
Let Gx=Z for all x∈X. The free product of the family (Gx)x∈X is called the free group constructed onX and is denoted by F(X). Let ϕx denote the canonical homomorphism of Gx=Z into F(X). By no. 3, Corollary to Proposition 5, the mapping x↦ϕx(1) of X into F(X) is injective; we shall identify X with its image in F(X) under this mapping. Then X generates F(X) and e∈/X.
Applying no. 3, Proposition 5, we obtain the following result:
Proposition 7
Let g be an element of the free group* F(X). There exist an integern≥0and a sequence(xα,m(α))1≤α≤ndetermined uniquely by the relationsxα∈X, xα=xα+1for1≤α<n, m(α)∈Z, m(α)=0for1≤α≤n, andg=∏α=1nxαm(α).
The free group F(X) enjoys the following universal property:
Proposition 8
Let G be a group and f a mapping of* Xinto G. There exists one and only one homomorphismfˉofF(X)into G which extends f.
The uniqueness of fˉ follows from the fact that the group F(X) is generated by X. For all x in X, let fx be the homomorphism n↦f(x)n of Z into G. By no. 3, Proposition 4, there exists a homomorphism fˉ of F(X) into G such that fˉ(xn)=fx(n) for x∈X and n∈Z; in particular, fˉ(x)=fx(1)=f(x) for all x∈X and hence fˉ extends f.
Let u:X→Y be a mapping. By Proposition 8 there exists one and only one homomorphism of F(X) into F(Y) which coincides with u on X; it is denoted by F(u). As in the case of magmas (no. 1) the formula
F(v∘u)=F(v)∘F(u)
is established for every mapping v:Y→Z and it is shown that F(u) is injective (resp. surjective, bijective) if u is. For every subset S of X, F(S) will be identified with the subgroup of F(X) generated by S.
Let I be a set. In certain cases it is of interest not to identify i in I with its canonical image ϕi(1) in the free group F(I); the latter will be denoted by Ti (or Ti′,Xi,… as the case may be) and called the indeterminate of index i. The free group F(I) is then denoted by F((Ti)i∈I) or F(T1,…,Tn) if I={1,2,…,n}.
Let G be a group and t=(ti)i∈I a family of elements of G. By Proposition 8 there exists a homomorphism ft of F((Ti)i∈I) into G characterized by ft(Ti)=ti for all i∈I. The image of an element w of F((Ti)i∈I) under ft will be denoted by w(t) or w(t1,…,tn) if I={1,2,…,n}; w(t) is said to result from the substitutionTi↦ti in w. In particular, if we take G=F((Ti)i∈I) and (ti)=(Ti)=T,fT is the identity homomorphism of G, whence w(T)=w; for I={1,2,…,n}, then w(T1,…,Tn)=w.
Let G and G′ be two groups, u a homomorphism of G into G′ and t=(t1,…,tn) a finite sequence of elements in G. Let t′=(u(t1),…,u(tn)); the homomorphism u∘ft of F(T1,…,Tn) into G′ maps Ti to u(ti) for 1≤i≤n and hence is equal to ft′; for w in F(T1,…,Tn), then
u(w(t1,…,tn))=w(u(t1),…,u(tn)).
Let w be given in F(T1,…,Tn) and elements v1,…,vn in the free group F(T1′,…,Tm′). The substitution Ti↦vi defines an element w′=w(v1,…,vn) of F(T1′,…,Tm′). Let G be a group, t1,…,tm elements of G and u the homomorphism of F(T1′,…,Tm′) into G characterized by u(Tj′)=tj for 1≤j≤m. Then u(vi)=vi(t1,…,tm) and u(w′)=w(t1,…,tm); formula (8) thus implies
w′(t1,…,tm)=w(v1(t1,…,tm),…,vn(t1,…,tm)).
This justifies the "functional notation" w(t1,…,tn). The reader is left to extend formulae (8) and (9) to the case of arbitrary indexing sets.
6. Presentations of a group
Let G be a group and t=(ti)i∈I a family of elements of G. Let ft be the unique homomorphism of the free group F(I) into G which maps i to ti. The image of ft is the subgroup generated by the elements ti of G. The elements of the kernel of ft are called the relators of the family t. t is called generating (resp. free, basic) if ft is surjective (resp. injective, bijective).
Let G be a group. A presentation of G is an ordered pair (t,r) consisting of a generating family t=(ti)i∈I and a family r=(rj)j∈J of relators such that the kernel Nt of ft is generated by the elements grjg−1 for g∈F(I) and j∈J. It amounts to the same to say that Nt is the normal subgroup of F(I) generated by the rj for j∈J (in other words, the smallest normal subgroup of F(I) containing the elements rj (j∈J), cf. § 4, no. 4). By an abuse of language the generators ti and the relations rj(t)=e are said to constitute a presentation of the group G.
Let I be a set and r=(rj)j∈J a family of elements of the free group F(I). Let N(r) be the normal subgroup of F(I) generated by the rj for j∈J. Let F(I,r)=F(I)/N(r) and τi denote the class of i modulo N(r). The ordered pair (τ,r) with τ=(τi)i∈I is a presentation of the group F(I,r); if G is a group and (t,r) is a presentation of G with t=(ti)i∈I, there exists a unique isomorphism u of F(I,r) onto G such that u(τi)=ti for all i∈I. The group F(I,r) is said to be defined by the generators τi and the relators rj, or by an abuse of language that it is defined by the generators τi and the relationsrj(τ)=e. When I={1,n} and J={1,m}, it is said that F(I,r) is defined by the presentation
⟨τ1,…,τn;r1,…,rm⟩.
If rj=uj−1vj with uj and vj in F(I), this presentation is equally denoted by the symbol
⟨τ1,…,τn;u1=v1,…,um=vm⟩.
Example
(1) The group defined by the presentation ⟨τ;τq=e⟩ is cyclic of order q.
(2) The group defined by the presentation ⟨x,y;xy=yx⟩ is isomorphic to Z×Z.
Proposition 9
Let G be a group, t=(ti)i∈I a generating family of G and r=(rj)j∈J a family of relators of t. The following conditions are equivalent:
(a) The ordered pair(t,r)is a presentation ofG.
(b) LetG′be a group andt′=(ti′)i∈Ia family of elements ofG′. Ifrj(t′)=efor allj∈J, there exists a homomorphismuofGintoG′such thatu(ti)=ti′for alli∈I.
(c) LetGbe a group andtˉ=(tˉi)i∈Ia generating family ofGsuch thatrj(tˉ)=efor allj∈J. Every homomorphism ofGintoGwhich mapstˉitotifor alli∈Iis an isomorphism.
Let f denote the homomorphism of F(I) into G which maps i to ti for all i∈I and N the kernel of f.
(a) ⇒ (b): Suppose that (t,r) is a presentation of G and let t′=(ti′)i∈I be a family of elements of a group G′ with rj(t′)=e for all j∈J. Let f′ be the homomorphism of F(I) into G′ characterized by f′(i)=ti′ for all i∈I. By hypothesis f′(rj)=e for all j∈J and, as N is generated by the elements grjg−1 for j∈J and g∈F(I),f′(N)={e}. As the homomorphism f:F(I)→G is surjective with kernel N, there exists a homomorphism u:G→G′ such that f′=u∘f. Then u(ti)=u(f(i))=f′(i)=ti′.
(b) ⇒ (c): Suppose condition (b) holds. Let t=(ti)i∈I be a generating family of a group G such that rj(t)=e for all j∈J and let v be a homomorphism of G into G such that v(tˉi)=ti for all i∈I. As the family (ti)i∈I generates G, the homomorphism v is surjective. By property (b) there exists a homomorphism u:G→G such that u(ti)=tˉi for all i∈I. Then u(v(tˉi))=tˉi for all i∈I and hence u∘v is the identity on G, which proves that v is injective. Hence v is an isomorphism and condition (c) holds.
(c) ⇒ (a): Suppose condition (c) holds. Let ti′ be the canonical image of i in F(I,r) and t′=(ti′)i∈I; then rj(t′)=e for all j∈J. As rj(t)=e for all j∈J, there exists one and only one homomorphism v of F(I,r) into G such that v(ti)=ti for all i∈I. By (c), v is an isomorphism of F(I,r) onto G which transforms the presentation (t′,r) of F(I,r) into a presentation (t,r) of G.
7. Free commutative groups and monoids
The set ZX of all mappings of X into Z is a commutative group under the law defined by (α+β)(x)=α(x)+β(x) (α,β∈ZX,x∈X); the elements of ZX are sometimes called multiindices. The identity element, denoted by 0, is the constant mapping with value 0. For α∈ZX, the set Sα of x∈X such that α(x)=0 is called the support of α; then S0=∅ and Sα+β⊂Sα∪Sβ for α,β in ZX. Therefore the set Z(X) of mappings α:X→Z of finite support is a subgroup of ZX called the free commutative group constructed on X.
For all x∈X, let δx denote the element of Z(X) defined by
δx(y)={10if y=xif y=x.
Also, for α∈Z(X), the integer ∣α∣, the length of α is defined by the formula
∣α∣=x∈X∑α(x).
The following relations are immediately established:
α=x∈X∑α(x)⋅δx
∣δx∣=1,∣0∣=0
∣α+β∣=∣α∣+∣β∣
for α,β in Z(X) and x in X.
The order relation α≤β is defined in Z(X) by α(x)≤β(x) for all x∈X. The relations α≤β and α′≤β′ imply α+α′≤β+β′, ∣α∣≤∣β∣ and −α≥−β; further, the relation α≤β is equivalent to β−α≥0. The set of elements α≥0 in Z(X) is denoted by N(X); it is the set of mappings of X into N of finite support and it is a submonoid of Z(X) called the free commutative monoid constructed on X. The elements of length 1 are the minimal elements in N(X)−{0} and constitute the set of δx (x∈X).
The monoid N(X) and the group Z(X) enjoy the following universal property.
Proposition 10
Let M be a commutative monoid (resp. group) and f a mapping of X into M. There exists one and only one homomorphism of N(X) (resp. Z(X)) into M such* that g(δx)=f(x) for all x∈X. If M is written additively, theng(α)=∑x∈Xα(x)⋅f(x) for all α in N(X) (resp. Z(X)).
Let g be a homomorphism of N(X) (resp. Z(X)) into M such that g(δx)=f(x) for all x∈X. For all α in N(X) (resp. Z(X)), it follows from (12) that
g(α)=x∈X∑α(x)⋅g(δx)=x∈X∑α(x)⋅f(x),
whence the uniqueness of g.
For all α in N(X) (resp. Z(X)) we write g(α)=∑x∈Xα(x)⋅f(x). Then obviously g(0)=0; for α,β in N(X) (resp. Z(X)),
and hence g is a homomorphism of N(X) (resp. Z(X)) into M. Also, for y in X,
g(δy)=x∈X∑δy(x)⋅f(x);
now δy(x)⋅f(x)=0 for x=y and δy(y)⋅f(y)=f(y), whence g(δy)=f(y).
Let u:X→Y be a mapping. By Proposition 10 there exists one and only one homomorphism of Z(X) into Z(Y) which maps δx to δu(x) for all x∈X. It is denoted by Z(u); it is immediately seen that it maps α∈Z(X) to the element β∈Z(Y) defined by
β(y)=x∈u−1(y)∑α(x).
As in the case of magmas (no. 1), the formula Z(v∘u)=Z(v)∘Z(y) is established for every mapping v:Y→Z; it is also shown that Z(u) is injective (resp. surjective, bijective) if u is.
Let S be a subset of X; if i is the injection of S into X, the mapping f=Z(i) is an isomorphism of Z(S) onto the subgroup H of Z(X) generated by the elements δs for s∈S. By (15),
(f(α))(x)={α(x)0if x∈Sif x∈X−S
and therefore H is the set of elements of Z(X) of support contained in S. Henceforth Z(S) will be identified with H by means of f.
Formula (15) shows that the restriction of Z(u) to N(X) induces a homomorphism N(u) of N(X) into N(Y). Then N(v∘u)=N(v)∘N(u) for every mapping v:Y→Z; further, N(u) is injective (resp. surjective, bijective) if u is. If S is a subset of X,
N(S)=Z(S)∩N(X).
Remark
Let M be the multiplicative monoid of strictly positive integers and let P be the set of prime numbers (§ 4, no. 10, Definition 15). By Proposition 10 there exists a homomorphism u of N(P) into M characterized by u(δp)=p for every prime number p. Then u(α)=∏p∈Ppα(p) for α in N(P) and Theorem 7 of § 4, no. 10 shows that u is an isomorphism of N(P) onto H.
8. Exponential notation
Let M be a monoid, written multiplicatively, and u=(ux)x∈X a family of elements of M, commuting in pairs. Let α be in N(X); the elements uxα(x) and uyα(y) of M commute for x,y in X and there exists a finite subset S of X such that uxα(x)=1 for x in X−S. We may therefore write:
uα=x∈X∏uxα(x).
Let M′ be the submonoid of M generated by the family (ux)x∈X; it is commutative (§ 1, no. 5, Corollary 2 to Proposition 4). There thus exists (no. 7, Proposition 10) a unique homomorphism f of N(X) into M′ such that f(δx)=ux for all x∈X and f(α)=uα for all α in N(X). We deduce the following formulae
uα+β=uα.uβ
u0=1
uδx=ux
for α,β in N(X) and x in X.
Let v=(vx)x∈X be another family of elements of M; suppose that vxvy=vyvx and uxvy=vyux for x,y in X. Then there exists (§ 1, no. 5, Corollary 2 to Proposition 4) a commutative submonoid L of M such that ux∈L and vx∈L for all x∈X. The mapping α↦uα.vα of N(X) into L is then a homomorphism (§ 1, no. 5, Proposition 5) mapping δx to ux.vx. Thus we have the formula
uα.vα=(u.v)α,
where u.v is the family (ux.vx)x∈X.
When M is commutative, uα can be defined for every family u of elements of M and formulae (15) to (20) hold without restriction.
9. Relations between the various free objects
As the free monoid Mo(X) is a magma, Proposition 1, of no. 1 shows the existence of a homomorphism λ:M(X)→Mo(X) whose restriction to X is the identity. Similarly, as the free group F(X) is a monoid the identity mapping of X extends to a homomorphism μ:Mo(X)→F(X) (no. 2, Proposition 3). By no. 4, Proposition 6 and no. 5, Proposition 7, μ is injective. Similarly Proposition 10 of no. 7 and Proposition 8 of no. 5 show the existence of homomorphisms ν:Mo(X)→N(X) and π:F(X)→Z(X) characterized by ν(x)=δx and π(x)=δx for all x∈X. If i is the injection of N(X) into Z(X), the two homomorphisms i∘ν and π∘μ of Mo(X) into Z(X) coincide on X, whence i∘ν=π∘μ. The situation may be summarized by the following commutative diagram:
M(X)λMo(X)↓μF(X)πZ(X)
The homomorphisms λ,μ,ν and π will be called canonical.
Let w be in M(X); it is immediately shown by induction on l(w) that the length of the word λ(w) is equal to that of w. Moreover
ν(x1…xn)=i=1∑nδxi
for x1,…,xn in X, whence ∣ν(x1…xn)∣=n by (13) and (14). In other words,
∣ν(u)∣=l(u)(u∈Mo(X)).
Proposition 11
The canonical homomorphism ν of Mo(X) into N(X) is surjective.* Let w=x1…xn and w′=x1′…xm′ be two elements of Mo(X); in order that ν(w)=ν(w′), it is necessary and sufficient that m=n and that there exist a permutation σ∈Sn with xi′=xσ(i) for 1≤i≤n.
The image of ν is a submonoid I of N(X) containing the elements δx (for x∈X). Formula (12) (no. 7) shows that N(X) is generated by the family (δx)x∈X, where I=N(X). Therefore ν is surjective.
by formula (21) and the commutativity theorem (§ 1, no. 5, Theorem 2).
Conversely, suppose that v(w) and v(w′) are equal to the same element α of N(X); by formula (22), n=∣α∣=m. For all x∈X, let Ix (resp. Ix′) be the set of integers i such that 1≤i≤n and xi=x (resp. xi′=x). Hence (Ix)x∈X and (Ix′)x∈X are partitions of the interval [1,n] of N; further, the formula
α=i=1∑nδxi
shows that α(x) is the cardinal of Ix; similarly the formula
α=i=1∑nδxi′
shows that α(x) is the cardinal of Ix′. There thus exists a permutation σ of [1,n] such that σ(Ix′)=Ix for all x∈X, that is xi′=xσ(i) for i=1,…,n.
Remark
Let S be a subset of X. Recall that we have identified M(S) with a submagma of M(X), Mo(S) with a submonoid of Mo(X) and N(S) with a submonoid of N(X). Then
M(S)=λ−1(Mo(S)).
Clearly λ(M(S))⊂Mo(S). Let w∈λ−1(Mo(S)); we show by induction on l(w) that w∈M(S). It is obvious if l(w)=1. If l(w)>1, we may write w=w1w2 with w1,w2∈M(X), l(w1)<l(w), l(w2)<l(w). Then λ(w1)λ(w2)∈Mo(S), hence λ(w1)∈Mo(S) and λ(w2)∈Mo(S), whence w1∈M(S) and w2∈M(S) by the induction hypothesis and finally w∈M(S).
Also
Mo(S)=v−1(N(S)).
This follows immediately from formula (21).
Further, N(S) is the set of elements of N(X) whose support is contained in S; if (Si)i∈I is a family of subsets of X of intersection S, then N(S)=⋂i∈IN(Si) and formulae (23) and (24) imply