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
Ψi(ξ,σ)={(a;i1,…,in;p1,…,pn)(a;i,i1,…,in;p,p1,…,pn)if p=eiif p=ei.
It is immediate that Ψi is a bijection of Mi×Σi onto Σ.
Let i∈I and x∈Mi; as Ψi is bijective, a mapping fi,x of Σ into itself is defined by
fi,x(Ψi(ξ,σ))=Ψi(xξ,σ)(ξ∈Mi,σ∈Σi).
Further, for a∈A,fa denotes the mapping of Σ into itself defined by
fa(a′;i1,…,in;p1,…,pn)=(aa′;i1,…,in;p1,…,pn).
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
σ=(fa∘fi1,p1∘⋯∘fin,pn)(e)=f(h(a)ϕi1(p1)…ϕin(pn))(e), 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:
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.