Bourbaki

§ 7. Free monoids, free groups

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)M_n(X) is defined by induction on the integer n⩾1n \geqslant 1 as follows: writing M1(X)=XM_1(X) = X, for n⩾2n \geqslant 2, Mn(X)M_n(X) is the set the sum of the sets Mp(X)×Mn−p(X)M_p(X) \times M_{n-p}(X) for 1⩽p⩽n−11 \leqslant p \leqslant n-1. The set the sum of the family (Mn(X))n⩾1(M_n(X))_{n \geqslant 1} is denoted by M(X)M(X); each of the sets Mn(X)M_n(X) is identified with its canonical image in M(X)M(X). For every element ww of M(X)M(X) there exists a unique integer nn such that w∈Mn(X)w \in M_n(X); it is called the length of ww and denoted by l(w)l(w). The set X consists of the elements in M(X)M(X) of length 1.

Let ww and w′w' be in M(X)M(X); write p=l(w)p = l(w) and q=l(w′)q = l(w'). The image of (w,w′)(w, w') under the canonical injection of Mp(X)×Mq(X)M_p(X) \times M_q(X) into the sum set Mp+q(X)M_{p+q}(X) is called the composition of ww and w′w' and is denoted by ww′ww' or w.w′w.w'. Then l(w.w′)=l(w)+l(w′)l(w.w') = l(w) + l(w') and every element of M(X)M(X) of length ⩾2\geqslant 2 can be written uniquely in the form w′w′′w'w'' with w′,w′′w', w'' in M(X)M(X).

The set M(X)M(X) with the law of composition (w,w′)↦w.w′(w, w') \mapsto 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)M(X) into M.

By induction on n⩾n \geqslant, mappings fn:Mn(X)→Mf_n : M_n(X) \to 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′)f_n(w.w') = f_p(w).f_{n-p}(w') for p=1,2,…,n−1p = 1, 2, \ldots, n-1 and (w,w′)(w, w') in Mp(X)×Mn−p(X)M_p(X) \times M_{n-p}(X). Let gg be the mapping of M(X)M(X) into MM which induces fnf_n on Mn(X)M_n(X) for every integer n≥1n \geq 1. Clearly gg is the unique morphism of M(X)M(X) into MM which extends ff.

Let uu be a mapping of XX into a set YY. By Proposition 1, there exists one and only one homomorphism of M(X)M(X) into M(Y)M(Y) which coincides with uu on XX. It will be denoted by M(u)M(u). If vv is a mapping of YY into a set ZZ, the homomorphism M(v)∘M(u)M(v) \circ M(u) of M(X)M(X) into M(Z)M(Z) coincides with v∘uv \circ u on XX, whence

M(v)∘M(u)=M(v∘u). M(v) \circ M(u) = M(v \circ u).

Proposition 2

Let u:X→Yu : X \to Y be a mapping. If uu is injective (resp. surjective, bijective), so is M(u)M(u).

Suppose uu is injective. When XX is empty, M(X)M(X) is empty, hence M(u)M(u) is injective. If XX is non-empty, there exists a mapping vv of YY into XX such that v∘uv \circ u is the identity mapping of XX (Set Theory, II, § 3, no. 8, Proposition 8); the mapping M(v)∘M(u)=M(v∘u)M(v) \circ M(u) = M(v \circ u) is the identity mapping of M(X)M(X) and hence M(u)M(u) is injective.

When uu is surjective, there exists a mapping ww of YY into XX such that u∘wu \circ w is the identity mapping of YY (Set Theory, II, § 3, no. 8, Proposition 8). Then M(u)∘M(w)=M(u∘w)M(u) \circ M(w) = M(u \circ w) is the identity mapping of M(Y)M(Y) and hence M(u)M(u) is surjective.

Finally, if uu is bijective, it is injective and surjective and hence M(u)M(u) has the same properties.

Let SS be a subset of XX. By Proposition 2 the injection of SS into XX can be extended to an isomorphism of M(S)M(S) onto a submagma M′(S)M'(S) of M(X)M(X). The magmas M(S)M(S) and M′(S)M'(S) are identified by means of this isomorphism. Then M(S)M(S) is the submagma of M(X)M(X) generated by SS.

Let XX be a set and (uα,vα)α∈I(u_\alpha, v_\alpha)_{\alpha \in I} be a family of ordered pairs of elements of M(X)M(X). Let RR be the equivalence relation on M(X)M(X) compatible with the law of M(X)M(X) and generated by the (uα,vα)(u_\alpha, v_\alpha) (§ 1, no. 6). The magma M(X)/RM(X)/R is called the magma defined by XX and the relators (uα,vα)α∈I(u_\alpha, v_\alpha)_{\alpha \in I}. Let hh be the canonical morphism of M(X)M(X) onto M(X)/RM(X)/R. Then M(X)/RM(X)/R is generated by h(X)h(X).

Let NN be a magma and (nx)x∈X(n_x)_{x \in X} a family of elements of NN. Let kk be the morphism from M(X)M(X) to NN such that k(x)=nxk(x) = n_x for all x∈Xx \in X (Proposition 1). If k(uα)=k(vα)k(u_\alpha) = k(v_\alpha) for all α∈I\alpha \in I, there exists one and only one morphism f:M(X)/R→Nf : M(X)/R \to N such that f(h(x))=nxf(h(x)) = n_x for all x∈Xx \in X (§ 1, no. 6, Proposition 9).

2. Free monoids

Any finite sequence w=(xi)1≤i≤nw = (x_i)_{1 \leq i \leq n} of elements of XX indexed by an interval [1,n][1, n] of N\mathbf{N} (possibly empty) is called a word constructed on XX. The integer nn is called the length of the word ww and denoted by l(w)l(w). There is a unique word of length 0, namely the empty sequence ee. X\mathbf{X} will be identified with the set of words of length 1.

Let w=(xi)1≤i≤mw = (x_i)_{1 \leq i \leq m} and w′=(xj′)1≤j≤nw' = (x'_j)_{1 \leq j \leq n} be two words. The composition of ww and w′w' is the word u=(yk)1≤k≤m+nu = (y_k)_{1 \leq k \leq m+n} defined by

yk={xkfor 1≤k≤mxk−m′for m+1≤k≤m+n. y_k = \begin{cases} x_k & \text{for } 1 \leq k \leq m \\ x'_{k-m} & \text{for } m+1 \leq k \leq m+n. \end{cases}

In other words, the sequence w′′w'' is obtained by first writing the elements of the sequence ww and then those of w′w'. The composition of ww and w′w' is generally denoted by ww′ww' or w.w′w.w'; it is sometimes said that it is obtained by juxtaposition of ww and w′w'. Then by construction l(w.w′)=l(w)+l(w′)l(w.w') = l(w) + l(w').

The relation we=ew=wwe = ew = w is immediately established for every word ww. Let w=(xi)1≤i≤mw = (x_i)_{1 \leq i \leq m}, w′=(xj′)1≤j≤nw' = (x'_j)_{1 \leq j \leq n} and w′′=(xk′′)1≤k≤pw'' = (x''_k)_{1 \leq k \leq p} be three words; clearly the words w(w′w′′)w(w'w'') and (ww′)w′′(ww')w'' are both equal to the word (yl)1≤l≤m+n+p(y_l)_{1 \leq l \leq m+n+p} defined by

yl={xlif 1≤l≤mxl−mif m+1≤l≤m+nxl−m−n′′if m+n+1≤l≤m+n+p. y_l = \begin{cases} x_l & \text{if } 1 \leq l \leq m \\ x_{l-m} & \text{if } m+1 \leq l \leq m+n \\ x''_{l-m-n} & \text{if } m+n+1 \leq l \leq m+n+p. \end{cases}

The above shows that the set of words constructed on X\mathbf{X} with the law of composition (w,w′)↦w.w′(w, w') \mapsto w.w' is a monoid with identity element ee. It is denoted by Mo(X)\mathrm{Mo}(\mathbf{X}) and called the free monoid constructed on X\mathbf{X}. It follows immediately from the definition of product of words that every word w=(xi)1≤i≤nw = (x_i)_{1 \leq i \leq n} is equal to the product ∏i=1nxi\prod_{i=1}^n x_i. A word may therefore be written in the form x1…xnx_1 \ldots x_n.

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 gg be a homomorphism of Mo(X)\mathrm{Mo}(\mathbf{X}) into MM extending ff. If w=(xi)1≤i≤nw = (x_i)_{1 \leq i \leq n} is a word, then w=∏i=1nxiw = \prod_{i=1}^n x_i in the monoid Mo(X)\mathrm{Mo}(\mathbf{X}), whence

g(w)=∏i=1ng(xi)=∏i=1nf(xi) g(w) = \prod_{i=1}^n g(x_i) = \prod_{i=1}^n f(x_i)

in the monoid MM (§ 1, no. 2, formula (2)). This proves the uniqueness of gg.

Let h(w)=∏i=1nf(xi)h(w) = \prod_{i=1}^n f(x_i) for every word w=(xi)1≤i≤nw = (x_i)_{1 \leq i \leq n}. The associativity theorem (§ 1, no. 3, Theorem 1) and the definition of product in Mo(X)\mathrm{Mo}(\mathbf{X}) imply h(ww′)=h(w)h(w′)h(ww') = h(w)h(w'). By convention the empty product h(e)h(e) is the identity element of MM and h(x)=f(x)h(x) = f(x) for x∈Xx \in \mathbf{X}. Hence hh is a homomorphism of Mo(x)\mathrm{Mo}(x) into MM extending ff.

Let u:X→Yu : \mathbf{X} \to \mathbf{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(x_i)_{1 \leq i \leq n} to the word (u(xi))1≤i≤n(u(x_i))_{1 \leq i \leq 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→Zv : Y \to 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(u_\alpha, v_\alpha)_{\alpha \in 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α)(u_\alpha, v_\alpha) (§ 1, no. 6). The monoid Mo(X)/R is called the monoid defined by X and the relators (uα,vα)α∈I(u_\alpha, v_\alpha)_{\alpha \in 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(n_x)_{x \in X} a family of elements of N. Let k be the morphism of Mo(X) into N such that k(x)=nxk(x) = n_x for all x∈Xx \in X (Proposition 3). If k(uα)=k(vα)k(u_\alpha) = k(v_\alpha) for all α∈I\alpha \in I, there exists one and only one magma morphism f:Mo(X)/R→Nf : Mo(X)/R \to N such that f(h(x))=nxf(h(x)) = n_x for all x∈Xx \in X (§ 1, no. 6, Proposition 9); as k is unital, f is a monoid morphism.

3. Amalgamated sum of monoids

Let (Mi)i∈I(M_i)_{i \in I} denote a family of monoids and eie_i the identity element of MiM_i. We are given a monoid A and a family of homomorphisms hi:A→Mih_i : A \to M_i (for i∈Ii \in I).

The set S the sum of the family (Mi)i∈I(M_i)_{i \in I} has elements the ordered pairs (i,x)(i, x) with i∈Ii \in I and x∈Mix \in M_i. For every triple α=(i,x,x′)\alpha = (i, x, x') with i∈Ii \in I, x,x′x, x' in MiM_i, write uα=(i,xx′)u_\alpha = (i, xx') and vα=(i,x).(i,x′)v_\alpha = (i, x).(i, x'); for every triple λ=(i,j,a)\lambda = (i, j, a) in I×I×AI \times I \times A, write pλ=(i,hi(a))p_\lambda = (i, h_i(a)) and qλ=(j,hj(a))q_\lambda = (j, h_j(a)); for all i∈Ii \in I, write εi=(i,ei)\varepsilon_i = (i, e_i). The monoid M defined by S and the relators (uα,vα)(u_\alpha, v_\alpha), (pλ,qλ)(p_\lambda, q_\lambda) and (εi,e)(\varepsilon_i, e) is called the sum of the family (Mi)i∈I(M_i)_{i \in I} amalgamated by A. Let ϕ\phi denote the canonical homomorphism of Mo(S) onto M and write ϕi(x)=ϕ(i,x)\phi_i(x) = \phi(i, x) for (i,x)∈S(i, x) \in S. It is said that ϕi\phi_i is the canonical mapping of MiM_i into M. For all a∈Aa \in A, the element ϕ(i,hi(a))\phi(i, h_i(a)) is independent of i and denoted by h(a)h(a).\footnote{When I is empty, M={e}M = \{e\} and h(a)=eh(a) = e for all a∈Aa \in A.}

The universal property of monoids defined by generators and relators (no. 2) implies the following result:

Proposition 4

(a) *For all i∈Ii \in I, the mapping ϕi\phi_i is a homomorphism of MiM_i into M and ϕi∘hi=h\phi_i \circ h_i = h for all i∈Ii \in I. Further, M is generated by ⋃i∈Iϕi(Mi)\bigcup_{i \in I} \phi_i(M_i).

(b) Let M′M' be a monoid and f′:Mi→M′f' : M_i \to M' (for i∈Ii \in I) homomorphisms such that fi∘hif_i \circ h_i is independent of i∈Ii \in I. There exists one and only one homomorphism f:M→M′f : M \to M' such that fi=f∘ϕif_i = f \circ \phi_i for all i∈Ii \in I.

In what follows we shall make the following hypothesis:

(A) For all i∈Ii \in I, there exists a subset PiP_i of MiM_i containing eie_i such that the mapping (a,p)↦hi(a).p(a, p) \mapsto h_i(a).p of A×PiA \times P_i into MiM_i is bijective.

It implies that the homomorphisms hih_i are injective. Let x∈Mx \in M; every finite sequence σ=(a;i1,…,in;p1,…,pn)\sigma = (a; i_1, \ldots, i_n; p_1, \ldots, p_n) with a∈A,iα∈Ia \in A, i_\alpha \in I and pα∈Piαp_\alpha \in P_{i_\alpha} for 1≤α≤n1 \leq \alpha \leq n, satisfying

x=h(a)⋅∏α=1nϕiα(pα) x = h(a) \cdot \prod_{\alpha=1}^n \phi_{i_\alpha}(p_\alpha)

is called a decomposition of xx. The integer n≥0n \geq 0 is called the length of the decomposition σ\sigma and is denoted by l(σ)l(\sigma); the sequence (e)(e) is a decomposition of length 0 of the identity element of MM. The decomposition σ\sigma is called reduced if iα≠iα+1i_\alpha \neq i_{\alpha+1} for 1≤α<n1 \leq \alpha < n and pα≠eiαp_\alpha \neq e_{i_\alpha} for 1≤α≤n1 \leq \alpha \leq n.

Proposition 5

Under hypothesis (A) every element xx of MM admits a unique reduced decomposition σ\sigma. Every decomposition σ′≠σ\sigma' \neq \sigma of xx satisfies l(σ′)>l(σ)l(\sigma') > l(\sigma).

(A) Uniqueness of a reduced decomposition:

Let Σ\Sigma denote the set of sequences σ=(a;i1,…,in;p1,…,pn)\sigma = (a; i_1, \ldots, i_n; p_1, \ldots, p_n) with n≥0n \geq 0, a∈A,iα∈Ia \in A, i_\alpha \in I and pα∈Piα−{eiα}p_\alpha \in P_{i_\alpha} - \{e_{i_\alpha}\} for 1≤α≤n1 \leq \alpha \leq n, such that iα≠iα+1i_\alpha \neq i_{\alpha+1} for 1≤α<n1 \leq \alpha < n. Let Φ\Phi denote the mapping of Σ\Sigma into MM defined by

Φ(a;i1,…,in;p1,…,pn)=h(a)⋅∏α=1nϕiα(pα). \Phi(a; i_1, \ldots, i_n; p_1, \ldots, p_n) = h(a) \cdot \prod_{\alpha=1}^n \phi_{i_\alpha}(p_\alpha).

A reduced decomposition of x∈Mx \in M is an element σ\sigma of Σ\Sigma such that Φ(σ)=x\Phi(\sigma) = x.

For all i∈Ii \in I, let Σi\Sigma_i be the subset of Σ\Sigma consisting of the sequences (e;i1,…,in;p1,…,pn)(e; i_1, \ldots, i_n; p_1, \ldots, p_n) with i≠i1i \neq i_1 when n>0n > 0. Let

σ=(e;i1,…,in;p1,…,pn) \sigma = (e; i_1, \ldots, i_n; p_1, \ldots, p_n)

be in Σi\Sigma_i and ξ\xi in MiM_i; let ξ=hi(a)⋅p\xi = h_i(a) \cdot p with a∈Aa \in A and p∈Pip \in P_i, and

Ψi(ξ,σ)={(a;i1,…,in;p1,…,pn)if p=ei(a;i,i1,…,in;p,p1,…,pn)if p≠ei. \Psi_i(\xi, \sigma) = \begin{cases} (a; i_1, \ldots, i_n; p_1, \ldots, p_n) & \text{if } p = e_i \\ (a; i, i_1, \ldots, i_n; p, p_1, \ldots, p_n) & \text{if } p \neq e_i. \end{cases}

It is immediate that Ψi\Psi_i is a bijection of Mi×ΣiM_i \times \Sigma_i onto Σ\Sigma.

Let i∈Ii \in I and x∈Mix \in M_i; as Ψi\Psi_i is bijective, a mapping fi,xf_{i,x} of Σ\Sigma into itself is defined by

fi,x(Ψi(ξ,σ))=Ψi(xξ,σ)(ξ∈Mi,σ∈Σi). f_{i,x}(\Psi_i(\xi, \sigma)) = \Psi_i(x\xi, \sigma) \quad (\xi \in M_i, \sigma \in \Sigma_i).

Further, for a∈A,faa \in A, f_a denotes the mapping of Σ\Sigma into itself defined by

fa(a′;i1,…,in;p1,…,pn)=(aa′;i1,…,in;p1,…,pn). f_a(a'; i_1, \ldots, i_n; p_1, \ldots, p_n) = (aa'; i_1, \ldots, i_n; p_1, \ldots, p_n).

Clearly fi,eif_{i,e_i} is the identity mapping of Σ\Sigma and fi,xx′=fi,x∘fi,x′f_{i,xx'} = f_{i,x} \circ f_{i,x'} for x,x′x, x' in MiM_i and fi,hi(a)=faf_{i,h_i(a)} = f_a for a∈Aa \in A and i∈Ii \in I.

Then Proposition 4 may be applied to the case where M′M' is the monoid of mappings of Σ\Sigma into itself with law of composition (f,f′)↦f∘f′(f,f') \mapsto f \circ f' and where f_i is the homomorphism x↦fi,xx \mapsto f_{i,x} of MiM_i into M′M'; then there exists a homomorphism ff of MM into M′M' such that fi,x=f(ϕi(x))f_{i,x} = f(\phi_i(x)) for i∈Ii \in I and x∈Mix \in M_i. Let

σ=(a;i1,…,in;p1,…,pn) \sigma = (a; i_1, \ldots, i_n; p_1, \ldots, p_n)
be in Σ\Sigma. Formulae (5) to (7) imply by induction on nn the relation
σ=(fa∘fi1,p1∘⋯∘fin,pn)(e)=f(h(a)ϕi1(p1)…ϕin(pn))(e), \begin{align*} \sigma &= (f_a \circ f_{i_1, p_1} \circ \cdots \circ f_{i_n, p_n})(e) \\ &= f(h(a)\phi_{i_1}(p_1) \ldots \phi_{i_n}(p_n))(e), \end{align*}
that is σ=f(Φ(σ))(e)\sigma = f(\Phi(\sigma))(e). This proves that Φ\Phi is injective.

(B) Existence of a decomposition:

Let DD be the set of elements of MM admitting a decomposition. Then e∈De \in D and MM is generated by ⋃i∈Iϕi(Mi)\bigcup_{i \in I} \phi_i(M_i) and hence by h(A)∪⋃i∈Iϕi(Pi)h(A) \cup \bigcup_{i \in I} \phi_i(P_i). Then D.ϕi(Pi)⊂DD.\phi_i(P_i) \subset D for all i∈Ii \in I; to prove that D=MD = M, it thus suffices to prove the relation D.h(A)⊂DD.h(A) \subset D. This follows from the following more precise lemma:

Lemma 1

Let i1,…,ini_1, \ldots, i_n be in II and pαp_\alpha in PiαP_{i_\alpha} for 1≤α≤n1 \leq \alpha \leq n. For all a∈Aa \in A there exists a′∈Aa' \in A and a sequence (pα′)1≤α≤n(p'_\alpha)_{1 \leq \alpha \leq n} with pα′∈Piαp'_\alpha \in P_{i_\alpha} such that*

ϕi1(p1)…ϕin(pn)h(a)=h(a′)ϕi1(p1′)…ϕin(pn′). \phi_{i_1}(p_1) \ldots \phi_{i_n}(p_n)h(a) = h(a')\phi_{i_1}(p'_1) \ldots \phi_{i_n}(p'_n).
h(a)=ϕin(hin(a))h(a) = \phi_{i_n}(h_{i_n}(a)) and there exists an∈Aa_n \in A and pn′∈Pinp'_n \in P_{i_n} with
pn⋅hin(a)=hin(an)⋅pn′. p_n \cdot h_{i_n}(a) = h_{i_n}(a_n) \cdot p'_n.
It follows that ϕin(pn)h(a)=h(an)ϕin(pn′)\phi_{i_n}(p_n)h(a) = h(a_n)\phi_{i_n}(p'_n), whence
ϕi1(p1)…ϕin−1(pn−1)ϕin(pn)h(a)=ϕi1(p1)…ϕin−1(pn−1)h(an)ϕin(pn′); \phi_{i_1}(p_1) \ldots \phi_{i_{n-1}}(p_{n-1})\phi_{i_n}(p_n)h(a) = \phi_{i_1}(p_1) \ldots \phi_{i_{n-1}}(p_{n-1})h(a_n)\phi_{i_n}(p'_n);
the lemma follows from this by induction on nn.

(C) End of the proof:

Let x∈Mx \in M and let nn be the minimum of the lengths of decompositions of xx. We shall prove that every decomposition σ\sigma of xx of length nn is reduced. This will establish the existence of a reduced decomposition of xx; the uniqueness of the reduced decomposition then implies l(σ′)>l(σ)l(\sigma') > l(\sigma) for every decomposition σ′≠σ\sigma' \neq \sigma of xx.

The case n=0n = 0 being trivial, suppose n>0n > 0. Let

σ=(a;i1,…,in;p1,…,pn) \sigma = (a; i_1, \ldots, i_n; p_1, \ldots, p_n)
be a decomposition of xx of length nn. If there existed an integer α\alpha with 1≤α≤n1 \leq \alpha \leq n and pα=eiαp_\alpha = e_{i_\alpha}, the sequence
(a;i1,…,iα−1,iα+1,…,in;p1,…,pα−1,pα+1,…,pn) (a; i_1, \ldots, i_{\alpha-1}, i_{\alpha+1}, \ldots, i_n; p_1, \ldots, p_{\alpha-1}, p_{\alpha+1}, \ldots, p_n)

would be a decomposition of xx of length n−1n - 1, which is excluded. Suppose that there exists an integer α\alpha with 1≤α<n1 \leq \alpha < n and iα=iα+1i_{\alpha} = i_{\alpha + 1} and let

pαpα+1=hiα(a′)⋅pα′ p_{\alpha} p_{\alpha + 1} = h_{i_{\alpha}}(a') \cdot p'_{\alpha}
with a′∈Aa' \in \mathbf{A} and pα′∈Piαp'_{\alpha} \in P_{i_{\alpha}}; by Lemma 1 there exists elements a′′∈Aa'' \in \mathbf{A},
p1′∈Pi1,…,pα−1′∈Piα−1 p'_{1} \in P_{i_{1}}, \ldots, p'_{\alpha - 1} \in P_{i_{\alpha - 1}}
such that
ϕi1(p1)⋯ϕiα−1(pα−1)h(a′)=h(a′′)ϕi1(p1′)⋯ϕiα−1(pα−1′) \phi_{i_{1}}(p_{1}) \cdots \phi_{i_{\alpha - 1}}(p_{\alpha - 1}) h(a') = h(a'') \phi_{i_{1}}(p'_{1}) \cdots \phi_{i_{\alpha - 1}}(p'_{\alpha - 1})
and the sequence
(aa′′;i1,…,iα−1,iα,iα+2,…,in;p1′,…,pα−1′,pα′,pα+2,…,pn) (aa''; i_{1}, \ldots, i_{\alpha - 1}, i_{\alpha}, i_{\alpha + 2}, \ldots, i_{n}; p'_{1}, \ldots, p'_{\alpha - 1}, p'_{\alpha}, p_{\alpha + 2}, \ldots, p_{n})
is a decomposition of xx of length n−1n - 1, which is a contradiction.

We have thus proved that σ\sigma is reduced.

Corollary

Under hypothesis (A) the homomorphisms ϕi\phi_{i} and hh are injective. For i≠ji \neq j in II, ϕi(Mi)∩ϕj(Mj)=h(A)\phi_{i}(M_{i}) \cap \phi_{j}(M_{j}) = h(\mathbf{A}).

First hh is injective: if h(a)=h(a′)h(a) = h(a'), then (a)(a) and (a′)(a') are two reduced decompositions of the same element of MM, whence a=a′a = a'. Let i∈Ii \in I; then h(A)=ϕi(hi(A))⊂ϕi(Mi)h(\mathbf{A}) = \phi_{i}(h_{i}(\mathbf{A})) \subset \phi_{i}(M_{i}); the uniqueness of reduced decompositions implies

h(A)∩ϕi(Mi−hi(A))=∅, h(\mathbf{A}) \cap \phi_{i}(M_{i} - h_{i}(\mathbf{A})) = \varnothing,
whence ϕi(Mi−hi(A))=ϕi(Mi)−h(A)\phi_{i}(M_{i} - h_{i}(\mathbf{A})) = \phi_{i}(M_{i}) - h(\mathbf{A}).

The injectivity of the homomorphisms ϕi\phi_{i} and the relation

ϕi(Mi)∩ϕj(Mj)⊂h(A) \phi_{i}(M_{i}) \cap \phi_{j}(M_{j}) \subset h(\mathbf{A})
for i≠ji \neq j are then consequences of the following fact: for i,ji, j in II, xx in Mi−hi(A)M_{i} - h_{i}(\mathbf{A}) and yy in Mj−hj(A)M_{j} - h_{j}(\mathbf{A}), the relation ϕi(x)=ϕj(y)\phi_{i}(x) = \phi_{j}(y) implies i=ji = j and x=yx = y. Let x=hi(a)⋅px = h_{i}(a) \cdot p and y=hj(b)⋅qy = h_{j}(b) \cdot q with a,ba, b in A\mathbf{A}, pp in Pi−{ei}P_{i} - \{e_{i}\} and yy in Pj−{ej}P_{j} - \{e_{j}\}. Then ϕi(x)=h(a)ϕi(p)\phi_{i}(x) = h(a)\phi_{i}(p) and ϕj(y)=h(b)ϕj(q)\phi_{j}(y) = h(b)\phi_{j}(q) and hence (a;i;p)(a; i; p) and (b;j;q)(b; j; q) are two reduced decompositions of the same element of MM. It follows that i=j,a=bi = j, a = b and p=qp = q, whence x=hi(a)p=hj(b)q=yx = h_{i}(a)p = h_{j}(b)q = y.

When hypothesis (A) is fulfilled, we shall identify each monoid MiM_{i} with a submonoid of MM by means of ϕi\phi_{i}; similarly, we shall identify A\mathbf{A} with a submonoid of MM by hh. Then MM is generated by ⋃i∈IMi\bigcup_{i \in I} M_{i} and Mi∩Mj=AM_{i} \cap M_{j} = \mathbf{A} for i≠ji \neq j.

Every element of MM can be written uniquely in the form a∏α=1npαa \prod_{\alpha = 1}^{n} p_{\alpha} with a∈A,p1∈Pi1−{e},…,pn∈Pin−{e}a \in \mathbf{A}, p_{1} \in P_{i_{1}} - \{e\}, \ldots, p_{n} \in P_{i_{n}} - \{e\} and iα≠iα+1i_{\alpha} \neq i_{\alpha + 1} for 1≤α<n1 \leq \alpha < n. Finally, if M′M' is a monoid and (fi:Mi→M′)(f_{i}: M_{i} \to M') (for i∈Ii \in I) a family of homomorphisms whose restrictions to A\mathbf{A} are the same homomorphism of A\mathbf{A} into M′M', there exists one and only one homomorphism f:M→M′f: M \to M' inducing fif_{i} on MiM_{i} for all i∈Ii \in I.

Hypothesis (A) is satisfied in two important cases:

(a) A={e}A = \{e\}. In this case, there is a family (Mi)i∈I(M_i)_{i \in I} of monoids and MM is called the monoidal sum of this family. Each MiM_i is identified with a submonoid of MM and MM is generated by ⋃i∈IMi\bigcup_{i \in I} M_i; further, Mi∩Mj={e}M_i \cap M_j = \{e\} for i≠ji \neq j. Every element of MM may be written uniquely in the form x1…xnx_1 \ldots x_n with

x1∈Mi1−{e},…,xn∈Min−{e} x_1 \in M_{i_1} - \{e\}, \ldots, x_n \in M_{i_n} - \{e\}
and iα≠iα+1i_\alpha \neq i_{\alpha+1} for 1≤α≤n1 \leq \alpha \leq n. Finally, for every family of homomorphisms (fi:Mi→M′)(f_i : M_i \to M'), there exists a unique homomorphism f:M→M′f : M \to M' whose restriction to MiM_i is fif_i for all i∈Ii \in I.

(b) There is a family of groups (Gi)i∈I(G_i)_{i \in I} containing as subgroup the same group AA and hih_i is the injection of AA into GiG_i. The sum of the family (Gi)i∈I(G_i)_{i \in I} amalgamated by AA is then a group GG : the monoid GG is generated by ⋃i∈Iϕi(Gi)\bigcup_{i \in I} \phi_i(G_i) and every element of ⋃i∈Iϕi(Gi)\bigcup_{i \in I} \phi_i(G_i) admits an inverse in GG (cf. § 2, no. 3, Corollary 1 to Proposition 4); it is denoted by ∗AGi*_A G_i or G1∗AG2G_1 *_A G_2 when I={1,2}I = \{1, 2\}. When AA consists of the identity element, it is also said that GG is the free product of the family (Gi)i∈I(G_i)_{i \in I} of groups and it is denoted by ∗Gi* G_i (or G1∗G2G_1 * G_2 if I={1,2}I = \{1, 2\}).†

4. Application to free monoids

Lemma 2

Let MM be the monoidal sum of the family (Mx)x∈X(M_x)_{x \in X} defined by Mx=NM_x = \mathbf{N} for all x∈Xx \in X and let ϕx\phi_x denote the canonical homomorphism of MxM_x into MM. The mapping x↦ϕx(1)x \mapsto \phi_x(1) of XX into MM extends to an isomorphism hh of Mo(X)\mathrm{Mo}(X) onto MM.

Let hh be the homomorphism of Mo(X)\mathrm{Mo}(X) into MM characterized by h(x)=ϕx(1)h(x) = \phi_x(1). For every integer n≥0n \geq 0, ϕx(n)=ϕx(1)n=h(x)n\phi_x(n) = \phi_x(1)^n = h(x)^n and as MM is generated by ⋃x∈Xϕx(N)\bigcup_{x \in X} \phi_x(\mathbf{N}), it is also generated by h(X)h(X). Hence hh is surjective. Moreover, for all xx in XX, the mapping n↦xnn \mapsto x^n is a homomorphism of N=Mx\mathbf{N} = M_x into Mo(X)\mathrm{Mo}(X); there thus exists (no. 3, Proposition 4) a homomorphism h′h' of MM into Mo(X)\mathrm{Mo}(X) such that h′(ϕx(n))=xnh'(\phi_x(n)) = x^n for x∈Xx \in X and n∈Nn \in \mathbf{N}; in particular, h′(h(x))=xh'(h(x)) = x for x∈Xx \in X and hence h′∘hh' \circ h is the identity homomorphism of Mo(X)\mathrm{Mo}(X). Therefore hh is injective. It has thus been proved that hh is bijective.

Proposition 6

Let ww be an element of Mo(X)\mathrm{Mo}(X). (a) There exist an integer n≥0n \geq 0, elements xαx_\alpha of XX and integers m(α)>0m(\alpha) > 0 (for

† Note that G1∗G2G_1 * G_2 is not the "product" of G1G_1 and G2G_2 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∗G2G_1 * G_2 is the "sum" of G1G_1 and G2G_2).

1≤α≤n1 \leq \alpha \leq n such that xα≠xα+1x_\alpha \neq x_{\alpha+1} for 1≤α<n1 \leq \alpha < n and w=∏α=1nxαm(α)w = \prod_{\alpha=1}^n x_\alpha^{m(\alpha)}. The sequence (xα,m(α))1≤α≤n(x_\alpha, m(\alpha))_{1 \leq \alpha \leq n} is determined uniquely by these conditions.

(b) Let pp be a positive integer, xβ′x'_\beta in XX and m′(β)m'(\beta) in N\mathbf{N} for 1≤β≤p1 \leq \beta \leq p such that w=∏β=1px′m′(β)w = \prod_{\beta=1}^p {x'}^{m'(\beta)}. Then p≥np \geq n. If p=np = n, then xβ′=xβx'_\beta = x_\beta and m′(β)=m(β)m'(\beta) = m(\beta) for 1≤β≤p1 \leq \beta \leq p.

In the notation of Lemma 2, h−1(ϕx(n))=xnh^{-1}(\phi_x(n)) = x^n for x∈Xx \in X and n∈Nn \in \mathbf{N}. Proposition 6 then follows from no. 3, Proposition 5.

5. Free groups

Let Gx=ZG_x = \mathbf{Z} for all x∈Xx \in X. The free product of the family (Gx)x∈X(G_x)_{x \in X} is called the free group constructed on XX and is denoted by F(X)F(X). Let ϕx\phi_x denote the canonical homomorphism of Gx=ZG_x = \mathbf{Z} into F(X)F(X). By no. 3, Corollary to Proposition 5, the mapping x↦ϕx(1)x \mapsto \phi_x(1) of XX into F(X)F(X) is injective; we shall identify XX with its image in F(X)F(X) under this mapping. Then XX generates F(X)F(X) and e∉Xe \notin X.

Applying no. 3, Proposition 5, we obtain the following result:

Proposition 7

Let g be an element of the free group* F(X)F(X). There exist an integer n≥0n \geq 0 and a sequence (xα,m(α))1≤α≤n(x_\alpha, m(\alpha))_{1 \leq \alpha \leq n} determined uniquely by the relations xα∈Xx_\alpha \in X, xα≠xα+1x_\alpha \neq x_{\alpha+1} for 1≤α<n1 \leq \alpha < n, m(α)∈Zm(\alpha) \in \mathbf{Z}, m(α)≠0m(\alpha) \neq 0 for 1≤α≤n1 \leq \alpha \leq n, and g=∏α=1nxαm(α)g = \prod_{\alpha=1}^n x_\alpha^{m(\alpha)}.

The free group F(X)F(X) enjoys the following universal property:

Proposition 8

Let G be a group and f a mapping of* XX into G. There exists one and only one homomorphism fˉ\bar{f} of F(X)F(X) into G which extends f.

The uniqueness of fˉ\bar{f} follows from the fact that the group F(X)F(X) is generated by XX. For all xx in XX, let fxf_x be the homomorphism n↦f(x)nn \mapsto f(x)^n of Z\mathbf{Z} into GG. By no. 3, Proposition 4, there exists a homomorphism fˉ\bar{f} of F(X)F(X) into GG such that fˉ(xn)=fx(n)\bar{f}(x^n) = f_x(n) for x∈Xx \in X and n∈Zn \in \mathbf{Z}; in particular, fˉ(x)=fx(1)=f(x)\bar{f}(x) = f_x(1) = f(x) for all x∈Xx \in X and hence fˉ\bar{f} extends ff.

Let u:X→Yu : X \to Y be a mapping. By Proposition 8 there exists one and only one homomorphism of F(X)F(X) into F(Y)F(Y) which coincides with uu on XX; it is denoted by F(u)F(u). As in the case of magmas (no. 1) the formula

F(v∘u)=F(v)∘F(u) F(v \circ u) = F(v) \circ F(u)

is established for every mapping v:Y→Zv : Y \to Z and it is shown that F(u)F(u) is injective (resp. surjective, bijective) if uu is. For every subset SS of XX, F(S)F(S) will be identified with the subgroup of F(X)F(X) generated by SS.

Let I be a set. In certain cases it is of interest not to identify ii in I with its canonical image ϕi(1)\phi_i(1) in the free group F(I)F(I); the latter will be denoted by TiT_i (or Ti′,Xi,…T'_i, X_i, \ldots as the case may be) and called the indeterminate of index ii. The free group F(I)F(I) is then denoted by F((Ti)i∈I)F((T_i)_{i \in I}) or F(T1,…,Tn)F(T_1, \ldots, T_n) if I={1,2,…,n}I = \{1, 2, \ldots, n\}.

Let GG be a group and t=(ti)i∈It = (t_i)_{i \in I} a family of elements of GG. By Proposition 8 there exists a homomorphism ftf_t of F((Ti)i∈I)F((T_i)_{i \in I}) into GG characterized by ft(Ti)=tif_t(T_i) = t_i for all i∈Ii \in I. The image of an element ww of F((Ti)i∈I)F((T_i)_{i \in I}) under ftf_t will be denoted by w(t)w(t) or w(t1,…,tn)w(t_1, \ldots, t_n) if I={1,2,…,n}I = \{1, 2, \ldots, n\}; w(t)w(t) is said to result from the substitution Ti↦tiT_i \mapsto t_i in ww. In particular, if we take G=F((Ti)i∈I)G = F((T_i)_{i \in I}) and (ti)=(Ti)=T,fT(t_i) = (T_i) = T, f_T is the identity homomorphism of GG, whence w(T)=ww(T) = w; for I={1,2,…,n}I = \{1, 2, \ldots, n\}, then w(T1,…,Tn)=ww(T_1, \ldots, T_n) = w.

Let GG and G′G' be two groups, uu a homomorphism of GG into G′G' and t=(t1,…,tn)t = (t_1, \ldots, t_n) a finite sequence of elements in GG. Let t′=(u(t1),…,u(tn))t' = (u(t_1), \ldots, u(t_n)); the homomorphism u∘ftu \circ f_t of F(T1,…,Tn)F(T_1, \ldots, T_n) into G′G' maps TiT_i to u(ti)u(t_i) for 1≤i≤n1 \leq i \leq n and hence is equal to ft′f_{t'}; for ww in F(T1,…,Tn)F(T_1, \ldots, T_n), then

u(w(t1,…,tn))=w(u(t1),…,u(tn)). u(w(t_1, \ldots, t_n)) = w(u(t_1), \ldots, u(t_n)).

Let ww be given in F(T1,…,Tn)F(T_1, \ldots, T_n) and elements v1,…,vnv_1, \ldots, v_n in the free group F(T1′,…,Tm′)F(T'_1, \ldots, T'_m). The substitution Ti↦viT_i \mapsto v_i defines an element w′=w(v1,…,vn)w' = w(v_1, \ldots, v_n) of F(T1′,…,Tm′)F(T'_1, \ldots, T'_m). Let GG be a group, t1,…,tmt_1, \ldots, t_m elements of GG and uu the homomorphism of F(T1′,…,Tm′)F(T'_1, \ldots, T'_m) into GG characterized by u(Tj′)=tju(T'_j) = t_j for 1≤j≤m1 \leq j \leq m. Then u(vi)=vi(t1,…,tm)u(v_i) = v_i(t_1, \ldots, t_m) and u(w′)=w(t1,…,tm)u(w') = w(t_1, \ldots, t_m); formula (8) thus implies

w′(t1,…,tm)=w(v1(t1,…,tm),…,vn(t1,…,tm)). w'(t_1, \ldots, t_m) = w(v_1(t_1, \ldots, t_m), \ldots, v_n(t_1, \ldots, t_m)).

This justifies the "functional notation" w(t1,…,tn)w(t_1, \ldots, t_n). The reader is left to extend formulae (8) and (9) to the case of arbitrary indexing sets.

6. Presentations of a group

Let GG be a group and t=(ti)i∈It = (t_i)_{i \in I} a family of elements of GG. Let ftf_t be the unique homomorphism of the free group F(I)F(I) into GG which maps ii to tit_i. The image of ftf_t is the subgroup generated by the elements tit_i of GG. The elements of the kernel of ftf_t are called the relators of the family tt. tt is called generating (resp. free, basic) if ftf_t is surjective (resp. injective, bijective).

Let GG be a group. A presentation of GG is an ordered pair (t,r)(\mathbf{t}, \mathbf{r}) consisting of a generating family t=(ti)i∈I\mathbf{t} = (t_i)_{i \in I} and a family r=(rj)j∈J\mathbf{r} = (r_j)_{j \in J} of relators such that the kernel NtN_t of ftf_t is generated by the elements grjg−1gr_jg^{-1} for g∈F(I)g \in F(I) and j∈Jj \in J. It amounts to the same to say that NtN_t is the normal subgroup of F(I)F(I) generated by the rjr_j for j∈Jj \in J (in other words, the smallest normal subgroup of F(I)F(I) containing the elements rjr_j (j∈Jj \in J), cf. § 4, no. 4). By an abuse of language the generators tit_i and the relations rj(t)=er_j(\mathbf{t}) = e are said to constitute a presentation of the group GG.

Let I be a set and r=(rj)j∈Jr = (r_j)_{j \in J} a family of elements of the free group F(I)F(I). Let N(r)N(r) be the normal subgroup of F(I)F(I) generated by the rjr_j for j∈Jj \in J. Let F(I,r)=F(I)/N(r)F(I, r) = F(I)/N(r) and τi\tau_i denote the class of ii modulo N(r)N(r). The ordered pair (τ,r)(\tau, r) with τ=(τi)i∈I\tau = (\tau_i)_{i \in I} is a presentation of the group F(I,r)F(I, r); if GG is a group and (t,r)(t, r) is a presentation of GG with t=(ti)i∈It = (t_i)_{i \in I}, there exists a unique isomorphism uu of F(I,r)F(I, r) onto GG such that u(τi)=tiu(\tau_i) = t_i for all i∈Ii \in I. The group F(I,r)F(I, r) is said to be defined by the generators τi\tau_i and the relators rjr_j, or by an abuse of language that it is defined by the generators τi\tau_i and the relations rj(τ)=er_j(\tau) = e. When I={1,n}I = \{1, n\} and J={1,m}J = \{1, m\}, it is said that F(I,r)F(I, r) is defined by the presentation

⟨τ1,…,τn;r1,…,rm⟩. \langle \tau_1, \ldots, \tau_n; r_1, \ldots, r_m \rangle.

If rj=uj−1vjr_j = u_j^{-1} v_j with uju_j and vjv_j in F(I)F(I), this presentation is equally denoted by the symbol

⟨τ1,…,τn;u1=v1,…,um=vm⟩. \langle \tau_1, \ldots, \tau_n; u_1 = v_1, \ldots, u_m = v_m \rangle.

Example

(1) The group defined by the presentation ⟨τ;τq=e⟩\langle \tau; \tau^q = e \rangle is cyclic of order qq.

(2) The group defined by the presentation ⟨x,y;xy=yx⟩\langle x, y; xy = yx \rangle is isomorphic to Z×Z\mathbf{Z} \times \mathbf{Z}.

Proposition 9

Let GG be a group, t=(ti)i∈It = (t_i)_{i \in I} a generating family of GG and r=(rj)j∈Jr = (r_j)_{j \in J} a family of relators of tt. The following conditions are equivalent:

(a) The ordered pair (t,r)(t, r) is a presentation of GG.

(b) Let G′G' be a group and t′=(ti′)i∈It' = (t'_i)_{i \in I} a family of elements of G′G'. If rj(t′)=er_j(t') = e for all j∈Jj \in J, there exists a homomorphism uu of GG into G′G' such that u(ti)=ti′u(t_i) = t'_i for all i∈Ii \in I.

(c) Let G‾\overline{G} be a group and tˉ=(tˉi)i∈I\bar{t} = (\bar{t}_i)_{i \in I} a generating family of G‾\overline{G} such that rj(tˉ)=er_j(\bar{t}) = e for all j∈Jj \in J. Every homomorphism of G‾\overline{G} into GG which maps tˉi\bar{t}_i to tit_i for all i∈Ii \in I is an isomorphism.

Let ff denote the homomorphism of F(I)F(I) into GG which maps ii to tit_i for all i∈Ii \in I and NN the kernel of ff.

(a) ⇒\Rightarrow (b): Suppose that (t,r)(t, r) is a presentation of GG and let t′=(ti′)i∈It' = (t'_i)_{i \in I} be a family of elements of a group G′G' with rj(t′)=er_j(t') = e for all j∈Jj \in J. Let f′f' be the homomorphism of F(I)F(I) into G′G' characterized by f′(i)=ti′f'(i) = t'_i for all i∈Ii \in I. By hypothesis f′(rj)=ef'(r_j) = e for all j∈Jj \in J and, as NN is generated by the elements grjg−1gr_jg^{-1} for j∈Jj \in J and g∈F(I),f′(N)={e}g \in F(I), f'(N) = \{e\}. As the homomorphism f ⁣:F(I)→Gf \colon F(I) \to G is surjective with kernel NN, there exists a homomorphism u ⁣:G→G′u \colon G \to G' such that f′=u∘ff' = u \circ f. Then u(ti)=u(f(i))=f′(i)=ti′u(t_i) = u(f(i)) = f'(i) = t'_i.

(b) ⇒\Rightarrow (c): Suppose condition (b) holds. Let t=(ti)i∈It = (t_i)_{i \in I} be a generating family of a group GG such that rj(t)=er_j(t) = e for all j∈Jj \in J and let vv be a homomorphism of G‾\overline{G} into GG such that v(tˉi)=tiv(\bar{t}_i) = t_i for all i∈Ii \in I. As the family (ti)i∈I(t_i)_{i \in I} generates GG, the homomorphism vv is surjective. By property (b) there exists a homomorphism u ⁣:G→G‾u \colon G \to \overline{G} such that u(ti)=tˉiu(t_i) = \bar{t}_i for all i∈Ii \in I. Then u(v(tˉi))=tˉiu(v(\bar{t}_i)) = \bar{t}_i for all i∈Ii \in I and hence u∘vu \circ v is the identity on G‾\overline{G}, which proves that vv is injective. Hence vv is an isomorphism and condition (c) holds.

(c) ⇒\Rightarrow (a): Suppose condition (c) holds. Let ti′t'_i be the canonical image of ii in F(I,r)F(I, r) and t′=(ti′)i∈It' = (t'_i)_{i \in I}; then rj(t′)=er_j(t') = e for all j∈Jj \in J. As rj(t)=er_j(t) = e for all j∈Jj \in J, there exists one and only one homomorphism vv of F(I,r)F(I, r) into GG such that v(ti)=tiv(t_i) = t_i for all i∈Ii \in I. By (c), vv is an isomorphism of F(I,r)F(I, r) onto GG which transforms the presentation (t′,r)(t', r) of F(I,r)F(I, r) into a presentation (t,r)(t, r) of GG.

7. Free commutative groups and monoids

The set ZX\mathbf{Z}^X of all mappings of XX into Z\mathbf{Z} is a commutative group under the law defined by (α+β)(x)=α(x)+β(x)(\alpha + \beta)(x) = \alpha(x) + \beta(x) (α,β∈ZX,x∈X\alpha, \beta \in \mathbf{Z}^X, x \in X); the elements of ZX\mathbf{Z}^X are sometimes called multiindices. The identity element, denoted by 0, is the constant mapping with value 0. For α∈ZX\alpha \in \mathbf{Z}^X, the set SαS_\alpha of x∈Xx \in X such that α(x)≠0\alpha(x) \neq 0 is called the support of α\alpha; then S0=∅S_0 = \varnothing and Sα+β⊂Sα∪SβS_{\alpha+\beta} \subset S_\alpha \cup S_\beta for α,β\alpha, \beta in ZX\mathbf{Z}^X. Therefore the set Z(X)\mathbf{Z}^{(X)} of mappings α:X→Z\alpha : X \to \mathbf{Z} of finite support is a subgroup of ZX\mathbf{Z}^X called the free commutative group constructed on XX.

For all x∈Xx \in X, let δx\delta_x denote the element of Z(X)\mathbf{Z}^{(X)} defined by

δx(y)={1if y=x0if y≠x. \delta_x(y) = \begin{cases} 1 & \text{if } y = x \\ 0 & \text{if } y \neq x. \end{cases}

Also, for α∈Z(X)\alpha \in \mathbf{Z}^{(X)}, the integer ∣α∣|\alpha|, the length of α\alpha is defined by the formula

∣α∣=∑x∈Xα(x). |\alpha| = \sum_{x \in X} \alpha(x).

The following relations are immediately established:

α=∑x∈Xα(x)⋅δx \alpha = \sum_{x \in X} \alpha(x) \cdot \delta_x
∣δx∣=1,∣0∣=0 |\delta_x| = 1, \quad |0| = 0
∣α+β∣=∣α∣+∣β∣ |\alpha + \beta| = |\alpha| + |\beta|

for α,β\alpha, \beta in Z(X)\mathbf{Z}^{(X)} and xx in XX.

The order relation α≤β\alpha \leq \beta is defined in Z(X)\mathbf{Z}^{(X)} by α(x)≤β(x)\alpha(x) \leq \beta(x) for all x∈Xx \in X. The relations α≤β\alpha \leq \beta and α′≤β′\alpha' \leq \beta' imply α+α′≤β+β′\alpha + \alpha' \leq \beta + \beta', ∣α∣≤∣β∣|\alpha| \leq |\beta| and −α≥−β-\alpha \geq -\beta; further, the relation α≤β\alpha \leq \beta is equivalent to β−α≥0\beta - \alpha \geq 0. The set of elements α≥0\alpha \geq 0 in Z(X)\mathbf{Z}^{(X)} is denoted by N(X)\mathbf{N}^{(X)}; it is the set of mappings of XX into N\mathbf{N} of finite support and it is a submonoid of Z(X)\mathbf{Z}^{(X)} called the free commutative monoid constructed on XX. The elements of length 1 are the minimal elements in N(X)−{0}\mathbf{N}^{(X)} - \{0\} and constitute the set of δx\delta_x (x∈Xx \in X).

The monoid N(X)\mathbf{N}^{(X)} and the group Z(X)\mathbf{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)\mathbf{N}^{(X)} (resp. Z(X)\mathbf{Z}^{(X)}) into M such* that g(δx)=f(x)g(\delta_x) = f(x) for all x∈Xx \in X. If M is written additively, then g(α)=∑x∈Xα(x)⋅f(x)g(\alpha) = \sum_{x \in X} \alpha(x) \cdot f(x) for all α\alpha in N(X)\mathbf{N}^{(X)} (resp. Z(X)\mathbf{Z}^{(X)}).

Let gg be a homomorphism of N(X)\mathbf{N}^{(X)} (resp. Z(X)\mathbf{Z}^{(X)}) into M such that g(δx)=f(x)g(\delta_x) = f(x) for all x∈Xx \in X. For all α\alpha in N(X)\mathbf{N}^{(X)} (resp. Z(X)\mathbf{Z}^{(X)}), it follows from (12) that

g(α)=∑x∈Xα(x)⋅g(δx)=∑x∈Xα(x)⋅f(x), g(\alpha) = \sum_{x \in X} \alpha(x) \cdot g(\delta_x) = \sum_{x \in X} \alpha(x) \cdot f(x),
whence the uniqueness of gg.

For all α\alpha in N(X)\mathbf{N}^{(X)} (resp. Z(X)\mathbf{Z}^{(X)}) we write g(α)=∑x∈Xα(x)⋅f(x)g(\alpha) = \sum_{x \in X} \alpha(x) \cdot f(x). Then obviously g(0)=0g(0) = 0; for α,β\alpha, \beta in N(X)\mathbf{N}^{(X)} (resp. Z(X)\mathbf{Z}^{(X)}),

g(α+β)=∑x∈X(α(x)+β(x))⋅f(x)=∑x∈X[α(x)⋅f(x)+β(x)⋅f(x)]=∑x∈Xα(x)⋅f(x)+∑x∈Xβ(x)⋅f(x)=g(α)+g(β) \begin{align*} g(\alpha + \beta) &= \sum_{x \in X} (\alpha(x) + \beta(x)) \cdot f(x) \\ &= \sum_{x \in X} [\alpha(x) \cdot f(x) + \beta(x) \cdot f(x)] \\ &= \sum_{x \in X} \alpha(x) \cdot f(x) + \sum_{x \in X} \beta(x) \cdot f(x) \\ &= g(\alpha) + g(\beta) \end{align*}
and hence gg is a homomorphism of N(X)\mathbf{N}^{(X)} (resp. Z(X)\mathbf{Z}^{(X)}) into M. Also, for yy in XX,
g(δy)=∑x∈Xδy(x)⋅f(x); g(\delta_y) = \sum_{x \in X} \delta_y(x) \cdot f(x);
now δy(x)⋅f(x)=0\delta_y(x) \cdot f(x) = 0 for x≠yx \neq y and δy(y)⋅f(y)=f(y)\delta_y(y) \cdot f(y) = f(y), whence g(δy)=f(y)g(\delta_y) = f(y).

Let u:X→Yu : X \to Y be a mapping. By Proposition 10 there exists one and only one homomorphism of Z(X)\mathbf{Z}^{(X)} into Z(Y)\mathbf{Z}^{(Y)} which maps δx\delta_x to δu(x)\delta_{u(x)} for all x∈Xx \in X. It is denoted by Z(u)\mathbf{Z}^{(u)}; it is immediately seen that it maps α∈Z(X)\alpha \in \mathbf{Z}^{(X)} to the element β∈Z(Y)\beta \in \mathbf{Z}^{(Y)} defined by

β(y)=∑x∈u−1(y)α(x). \beta(y) = \sum_{x \in u^{-1}(y)} \alpha(x).
As in the case of magmas (no. 1), the formula Z(v∘u)=Z(v)∘Z(y)\mathbf{Z}^{(v \circ u)} = \mathbf{Z}^{(v)} \circ \mathbf{Z}^{(y)} is established for every mapping v:Y→Zv : Y \to Z; it is also shown that Z(u)\mathbf{Z}^{(u)} is injective (resp. surjective, bijective) if uu is.

Let S be a subset of X; if i is the injection of S into X, the mapping f=Z(i)f = \mathbf{Z}^{(i)} is an isomorphism of Z(S)\mathbf{Z}^{(S)} onto the subgroup H of Z(X)\mathbf{Z}^{(X)} generated by the elements δs\delta_s for s∈Ss \in S. By (15),

(f(α))(x)={α(x)if x∈S0if x∈X−S (f(\alpha))(x) = \begin{cases} \alpha(x) & \text{if } x \in S \\ 0 & \text{if } x \in X - S \end{cases}

and therefore HH is the set of elements of Z(X)\mathbf{Z}^{(X)} of support contained in SS. Henceforth Z(S)\mathbf{Z}^{(S)} will be identified with HH by means of ff.

Formula (15) shows that the restriction of Z(u)\mathbf{Z}^{(u)} to N(X)\mathbf{N}^{(X)} induces a homomorphism N(u)\mathbf{N}^{(u)} of N(X)\mathbf{N}^{(X)} into N(Y)\mathbf{N}^{(Y)}. Then N(v∘u)=N(v)∘N(u)\mathbf{N}^{(v \circ u)} = \mathbf{N}^{(v)} \circ \mathbf{N}^{(u)} for every mapping v:Y→Zv : Y \to Z; further, N(u)\mathbf{N}^{(u)} is injective (resp. surjective, bijective) if uu is. If SS is a subset of XX,

N(S)=Z(S)∩N(X). \mathbf{N}^{(S)} = \mathbf{Z}^{(S)} \cap \mathbf{N}^{(X)}.

Remark

Let MM be the multiplicative monoid of strictly positive integers and let P\mathfrak{P} be the set of prime numbers (§ 4, no. 10, Definition 15). By Proposition 10 there exists a homomorphism uu of N(P)\mathbf{N}^{(\mathfrak{P})} into MM characterized by u(δp)=pu(\delta_p) = p for every prime number pp. Then u(α)=∏p∈Ppα(p)u(\alpha) = \prod_{p \in \mathfrak{P}} p^{\alpha(p)} for α\alpha in N(P)\mathbf{N}^{(\mathfrak{P})} and Theorem 7 of § 4, no. 10 shows that uu is an isomorphism of N(P)\mathbf{N}^{(\mathfrak{P})} onto HH.

8. Exponential notation

Let MM be a monoid, written multiplicatively, and u=(ux)x∈Xu = (u_x)_{x \in X} a family of elements of MM, commuting in pairs. Let α\alpha be in N(X)\mathbf{N}^{(X)}; the elements uxα(x)u_x^{\alpha(x)} and uyα(y)u_y^{\alpha(y)} of MM commute for x,yx, y in XX and there exists a finite subset SS of XX such that uxα(x)=1u_x^{\alpha(x)} = 1 for xx in X−SX - S. We may therefore write:

uα=∏x∈Xuxα(x). u^\alpha = \prod_{x \in X} u_x^{\alpha(x)}.

Let M′M' be the submonoid of MM generated by the family (ux)x∈X(u_x)_{x \in X}; it is commutative (§ 1, no. 5, Corollary 2 to Proposition 4). There thus exists (no. 7, Proposition 10) a unique homomorphism ff of N(X)\mathbf{N}^{(X)} into M′M' such that f(δx)=uxf(\delta_x) = u_x for all x∈Xx \in X and f(α)=uαf(\alpha) = u^\alpha for all α\alpha in N(X)\mathbf{N}^{(X)}. We deduce the following formulae

uα+β=uα.uβ u^{\alpha + \beta} = u^\alpha . u^\beta
u0=1 u^0 = 1
uδx=ux u^{\delta_x} = u_x

for α,β\alpha, \beta in N(X)\mathbf{N}^{(X)} and xx in XX.

Let v=(vx)x∈Xv = (v_x)_{x \in X} be another family of elements of MM; suppose that vxvy=vyvxv_x v_y = v_y v_x and uxvy=vyuxu_x v_y = v_y u_x for x,yx, y in XX. Then there exists (§ 1, no. 5, Corollary 2 to Proposition 4) a commutative submonoid LL of MM such that ux∈Lu_x \in L and vx∈Lv_x \in L for all x∈Xx \in X. The mapping α↦uα.vα\alpha \mapsto u^\alpha . v^\alpha of N(X)\mathbf{N}^{(X)} into LL is then a homomorphism (§ 1, no. 5, Proposition 5) mapping δx\delta_x to ux.vxu_x . v_x. Thus we have the formula

uα.vα=(u.v)α, u^\alpha . v^\alpha = (u . v)^\alpha,

where u.vu . v is the family (ux.vx)x∈X(u_x . v_x)_{x \in X}.

When M is commutative, uαu^\alpha can be defined for every family uu 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)\lambda : M(X) \to 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)\mu : Mo(X) \to F(X) (no. 2, Proposition 3). By no. 4, Proposition 6 and no. 5, Proposition 7, μ\mu is injective. Similarly Proposition 10 of no. 7 and Proposition 8 of no. 5 show the existence of homomorphisms ν:Mo(X)→N(X)\nu : Mo(X) \to N^{(X)} and π:F(X)→Z(X)\pi : F(X) \to Z^{(X)} characterized by ν(x)=δx\nu(x) = \delta_x and π(x)=δx\pi(x) = \delta_x for all x∈Xx \in X. If ii is the injection of N(X)N^{(X)} into Z(X)Z^{(X)}, the two homomorphisms i∘νi \circ \nu and π∘μ\pi \circ \mu of Mo(X) into Z(X)Z^{(X)} coincide on X, whence i∘ν=π∘μi \circ \nu = \pi \circ \mu. The situation may be summarized by the following commutative diagram:

M(X)→λMo(X)↓μF(X)→πZ(X) \begin{array}{ccc} M(X) & \xrightarrow{\lambda} & Mo(X) \\ & & \downarrow \mu \\ & & F(X) \xrightarrow{\pi} Z^{(X)} \end{array}

The homomorphisms λ,μ,ν\lambda, \mu, \nu and π\pi will be called canonical.

Let w be in M(X); it is immediately shown by induction on l(w)l(w) that the length of the word λ(w)\lambda(w) is equal to that of w. Moreover

ν(x1…xn)=∑i=1nδxi \nu(x_1 \ldots x_n) = \sum_{i=1}^n \delta_{x_i}
for x1,…,xnx_1, \ldots, x_n in X, whence ∣ν(x1…xn)∣=n|\nu(x_1 \ldots x_n)| = n by (13) and (14). In other words,

∣ν(u)∣=l(u)(u∈Mo(X)). |\nu(u)| = l(u) \quad (u \in Mo(X)).

Proposition 11

The canonical homomorphism ν\nu of Mo(X) into N(X)N^{(X)} is surjective.* Let w=x1…xnw = x_1 \ldots x_n and w′=x1′…xm′w' = x'_1 \ldots x'_m be two elements of Mo(X); in order that ν(w)=ν(w′)\nu(w) = \nu(w'), it is necessary and sufficient that m=nm = n and that there exist a permutation σ∈Sn\sigma \in S_n with xi′=xσ(i)x'_i = x_{\sigma(i)} for 1≤i≤n1 \leq i \leq n.

The image of ν\nu is a submonoid I of N(X)N^{(X)} containing the elements δx\delta_x (for x∈Xx \in X). Formula (12) (no. 7) shows that N(X)N^{(X)} is generated by the family (δx)x∈X(\delta_x)_{x \in X}, where I=N(X)I = N^{(X)}. Therefore ν\nu is surjective.

If m=nm = n and xi′=xσ(i)x'_i = x_{\sigma(i)} for 1≤i≤n1 \leq i \leq n, then

ν(w′)=∑i=1nδxi′=∑i=1nδxσ(i)=∑i=1nδxi=ν(w) \nu(w') = \sum_{i=1}^n \delta_{x'_i} = \sum_{i=1}^n \delta_{x_{\sigma(i)}} = \sum_{i=1}^n \delta_{x_i} = \nu(w)

by formula (21) and the commutativity theorem (§ 1, no. 5, Theorem 2).

Conversely, suppose that v(w)v(w) and v(w′)v(w') are equal to the same element α\alpha of N(X)\mathbf{N}^{(X)}; by formula (22), n=∣α∣=mn = |\alpha| = m. For all x∈Xx \in X, let IxI_x (resp. Ix′I'_x) be the set of integers ii such that 1≤i≤n1 \leq i \leq n and xi=xx_i = x (resp. xi′=xx'_i = x). Hence (Ix)x∈X(I_x)_{x \in X} and (Ix′)x∈X(I'_x)_{x \in X} are partitions of the interval [1,n][1, n] of N\mathbf{N}; further, the formula

α=∑i=1nδxi \alpha = \sum_{i=1}^n \delta_{x_i}
shows that α(x)\alpha(x) is the cardinal of IxI_x; similarly the formula
α=∑i=1nδxi′ \alpha = \sum_{i=1}^n \delta_{x'_i}
shows that α(x)\alpha(x) is the cardinal of Ix′I'_x. There thus exists a permutation σ\sigma of [1,n][1, n] such that σ(Ix′)=Ix\sigma(I'_x) = I_x for all x∈Xx \in X, that is xi′=xσ(i)x'_i = x_{\sigma(i)} for i=1,…,ni = 1, \ldots, n.

Remark

Let SS be a subset of XX. Recall that we have identified M(S)M(S) with a submagma of M(X)M(X), Mo(S)Mo(S) with a submonoid of Mo(X)Mo(X) and N(S)N^{(S)} with a submonoid of N(X)N^{(X)}. Then

M(S)=λ−1(Mo(S)). M(S) = \lambda^{-1}(Mo(S)).
Clearly λ(M(S))⊂Mo(S)\lambda(M(S)) \subset Mo(S). Let w∈λ−1(Mo(S))w \in \lambda^{-1}(Mo(S)); we show by induction on l(w)l(w) that w∈M(S)w \in M(S). It is obvious if l(w)=1l(w) = 1. If l(w)>1l(w) > 1, we may write w=w1w2w = w_1 w_2 with w1,w2∈M(X)w_1, w_2 \in M(X), l(w1)<l(w)l(w_1) < l(w), l(w2)<l(w)l(w_2) < l(w). Then λ(w1)λ(w2)∈Mo(S)\lambda(w_1) \lambda(w_2) \in Mo(S), hence λ(w1)∈Mo(S)\lambda(w_1) \in Mo(S) and λ(w2)∈Mo(S)\lambda(w_2) \in Mo(S), whence w1∈M(S)w_1 \in M(S) and w2∈M(S)w_2 \in M(S) by the induction hypothesis and finally w∈M(S)w \in M(S).

Also

Mo(S)=v−1(N(S)). Mo(S) = v^{-1}(N^{(S)}).
This follows immediately from formula (21).

Further, N(S)N^{(S)} is the set of elements of N(X)N^{(X)} whose support is contained in SS; if (Si)i∈I(S_i)_{i \in I} is a family of subsets of XX of intersection SS, then N(S)=⋂i∈IN(Si)N^{(S)} = \bigcap_{i \in I} N^{(S_i)} and formulae (23) and (24) imply

M(S)=⋂i∈IM(Si),Mo(S)=⋂i∈IMo(Si). M(S) = \bigcap_{i \in I} M(S_i), \quad Mo(S) = \bigcap_{i \in I} Mo(S_i).

Exercises

See the exercises for § 7.

Transcribed from the printed edition, 1998, Springer. Not translated.