Bourbaki

Proposition 6

Tag 05FP, permanent. Cite it as [Bourbaki, Tag 05FP].

Algebra, chapter I, § 7. Free monoids, free groups

*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.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

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