Bourbaki

Exercise 1, § 1

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

Theory of Sets, IV, 289

Let SS be the set of signs PP, XX, x1,…,xnx_1,\ldots,x_n, the letters xix_i being of weight 00, PP of weight 11, and XX of weight 22. Let TT be a balanced word in L(S)L(S). Such a word will be called an echelon type on x1,…,xnx_1,\ldots,x_n.

Let E1,…,EnE_1,\ldots,E_n be nn terms in a theory stronger than the theory of sets. For each echelon type TT on x1,…,xnx_1,\ldots,x_n define a term T(E1,…,En)T(E_1,\ldots,E_n) as follows :

(i) If TT is a letter xix_i, then T(E1,…,En)T(E_1,\ldots,E_n) is the set EiE_i.

(ii) If TT is of the form PUPU, then T(E1,…,En)T(E_1,\ldots,E_n) is the set

P(U(E1,…,En)). \mathfrak{P}(U(E_1,\ldots,E_n)).

(iii) If TT is of the form XUVXUV, where UU and VV are assemblies antecedent to TT, then T(E1,…,En)T(E_1,\ldots,E_n) is the set U(E1,…,En)×V(E1,…,En)U(E_1,\ldots,E_n)\times V(E_1,\ldots,E_n).

Show that, for each echelon type TT on x1,…,xnx_1,\ldots,x_n, T(E1,…,En)T(E_1,\ldots,E_n) is an echelon on the terms E1,…,EnE_1,\ldots,E_n, and conversely (proof by induction on the length of the echelon type or of the echelon construction scheme). T(E1,…,En)T(E_1,\ldots,E_n) is called the realization of the echelon type TT on the terms E1,…,EnE_1,\ldots,E_n. More precisely, every echelon on nn distinct letters can be written in exactly one way in the form T(x1,…,xn)T(x_1,\ldots,x_n), where TT is an echelon type.

Also show how one may associate with an echelon type TT on nn letters, and nn mappings f1,…,fnf_1,\ldots,f_n, a canonical extension of these mappings. Deduce that if two echelon construction schemes SS, S′S' on nn letters are such that S(x1,…,xn)=S′(x1,…,xn)S(x_1,\ldots,x_n)=S'(x_1,\ldots,x_n) (x1,…,xnx_1,\ldots,x_n being distinct letters), then

⟨f1,…,fn⟩S=⟨f1,…,fn⟩S′. \langle f_1,\ldots,f_n\rangle^S=\langle f_1,\ldots,f_n\rangle^{S'}.
Solution

No solution has been written yet.

Cited by

Cites

Nothing.

Transcribed from the printed volume. Not translated.