Bourbaki

Lemma 2

Tag 03GT, permanent. Cite it as [Bourbaki, Tag 03GT].

Theory of Sets, chapter I, Appendix 0. Characterization of terms and relations

Every balanced word AA can be put in the form

A=fA1A2…Ap, A=fA_1A_2\ldots A_p,

where the AiA_i are balanced and n(f)=pn(f)=p.

Let ff be the initial sign of AA. By Lemma 1, AA can be written as

fA1A2…Ap, fA_1A_2\ldots A_p,

where the AiA_i are balanced : we need only define AiA_i inductively as the balanced segment of AA which begins at the k(i)k(i)th place, where

k(i)=2+∑j<il(Aj). k(i)=2+\sum_{j<i}l(A_j).

Moreover, we have

1+l(A1)+…+l(Ap)=l(A)=n(A)+1 1+l(A_1)+\ldots+l(A_p)=l(A)=n(A)+1
=n(f)+n(A1)+…+n(Ap)+1 =n(f)+n(A_1)+\ldots+n(A_p)+1
=n(f)+(l(A1)−1)+…+(l(Ap)−1)+1, =n(f)+(l(A_1)-1)+\ldots+(l(A_p)-1)+1,

from which it follows that n(f)=pn(f)=p.

¶ Now that the two lemmas have been proved, it is obvious by induction on the length of AA that every balanced word AA is significant, by reason of Lemma 2 and Proposition 1.

Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

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