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 group G : 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}).†
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.