Bourbaki

Lemma 2

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

Theory of Sets, chapter III, § 2. Well-ordered sets

Let EE be a well-ordered set and let S\mathfrak{S} be a set of segments of EE with the following properties : (1) every union of segments belonging to S\mathfrak{S} belongs to S\mathfrak{S}; (2) if Sx∈SS_x\in\mathfrak{S}, then Sx∪{x}∈SS_x\cup\{x\}\in\mathfrak{S}. Then every segment of EE belongs to S\mathfrak{S}.

Suppose that there are segments of EE which do not belong to S\mathfrak{S}, and let SS be the smallest of them (no. 1, Proposition 2). If SS has no greatest element, then SS is the union of the segments of SS distinct from SS itself, and these segments belong to S\mathfrak{S} by virtue of the definition of SS; hence S∈SS\in\mathfrak{S}, which is absurd. If, on the other hand, SS has a greatest element aa, then S=Sa∪{a}S=S_a\cup\{a\}, and since SaS_a is a segment of SS distinct from SS, we have Sa∈SS_a\in\mathfrak{S}; but then also S∈SS\in\mathfrak{S}, which again is absurd.

¶ For greater convenience we shall place ourselves in a theory T\mathscr{T} in which EE is a set well-ordered by a relation written x≤yx\leq y. We have then the following criteria :

C59. (Principle of transfinite induction). *Let R{x}R\{x\} be a relation in T\mathscr{T} (xx not being a constant of T\mathscr{T}) such that the relation

(x∈E and (∀y)((y∈E and y<x)⇒R{y}))⇒R{x} (x\in E\text{ and }(\forall y)((y\in E\text{ and }y<x)\Rightarrow R\{y\}))\Rightarrow R\{x\}

is a theorem in T\mathscr{T}. Under these conditions the relation (x∈E)⇒R{x}(x\in E)\Rightarrow R\{x\} is a theorem in T\mathscr{T}.*

Let S\mathfrak{S} be the set of segments SS of EE such that (y∈S)⇒R{y}(y\in S)\Rightarrow R\{y\}. It is clear that every union of segments belonging to S\mathfrak{S} also belongs to S\mathfrak{S}. On the other hand, if Sx∈SS_x\in\mathfrak{S}, we have R{x}R\{x\} by hypothesis; hence (y∈Sx∪{y})⇒R{y}(y\in S_x\cup\{y\})\Rightarrow R\{y\} by the method of disjunction of cases. Hence (Lemma 2) E∈SE\in\mathfrak{S}, which proves the criterion.

¶ In the applications of C59, the relation

x∈E and (∀y)((y∈E and y<x)⇒R{y}) x\in E\text{ and }(\forall y)((y\in E\text{ and }y<x)\Rightarrow R\{y\})

is usually called the “inductive hypothesis”.

¶ In what follows, for every mapping gg of a segment SS of EE into a set FF, and for each x∈Sx\in S we shall denote by g(x)g^{(x)} the mapping of the segment Sx=]←,x[S_x=]\leftarrow,x[ of EE onto g(Sx)g(S_x) which coincides with gg on SxS_x. With this notation we have

C60. (Definition of a mapping by transfinite induction.) Let uu be a letter, T{u}\mathrm{T}\{u\} a term in the theory T\mathscr{T}. There exists a set UU and a mapping ff of EE onto UU such that for all x∈Ex\in E we have f(x)=T{f(x)}f(x)=\mathrm{T}\{f^{(x)}\}. Furthermore, the set UU and the mapping ff are uniquely determined by these conditions.

Let us first prove the uniqueness. Suppose that f′f' and U′\mathrm{U}' also satisfy the conditions of the criterion. Let S\mathfrak{S} be the set of segments S of E such that ff and f′f' coincide on S. It is clear that every union of segments belonging to S\mathfrak{S} also belongs to S\mathfrak{S}. On the other hand, if Sx∈S\mathrm{S}_x \in \mathfrak{S}, then ff and f′f' agree on Sx\mathrm{S}_x and therefore f(x)=f′(x)f^{(x)} = {f'}^{(x)}; consequently

f(x)=T{f(x)}=T{f′(x)}=f′(x),f(x) = \mathrm{T}\{f^{(x)}\} = \mathrm{T}\{{f'}^{(x)}\} = f'(x),

which shows that Sx∪{x}∈S\mathrm{S}_x \cup \{x\} \in \mathfrak{S}. It follows that E∈S\mathrm{E} \in \mathfrak{S} (Lemma 2), hence f′=ff' = f and U′=f′(E)=f(E)=U\mathrm{U}' = f'(\mathrm{E}) = f(\mathrm{E}) = \mathrm{U}.

¶ Now let S1\mathfrak{S}_1 denote the set of segments S of E for which there exists a set US\mathrm{U_S} and a mapping fSf_\mathrm{S} of S onto US\mathrm{U_S} such that for all x∈Sx \in \mathrm{S} we have fS(x)=T{f(x)}f_\mathrm{S}(x) = \mathrm{T}\{f^{(x)}\}. For each S∈S1\mathrm{S} \in \mathrm{S}_1, fSf_\mathrm{S} and US\mathrm{U_S} are uniquely determined, by the first part of the proof; in particular, if S′\mathrm{S}' and S′′\mathrm{S}'' are two segments belonging to S1\mathfrak{S}_1 such that S′⊂S′′\mathrm{S}' \subset \mathrm{S}'', then fS′f_{\mathrm{S}'} is the mapping of S′\mathrm{S}' onto fS′′(S′)f_{\mathrm{S}''}(\mathrm{S}') which agrees with fS′′f_{\mathrm{S}''} on S′\mathrm{S}'. From this remark it follows that every union of segments belonging to S1\mathfrak{S}_1 also belongs to S1\mathfrak{S}_1 (Chapter II, § 4, no. 6, Proposition 7). On the other hand, if Sx∈S1\mathrm{S}_x \in \mathfrak{S}_1, we define on S=Sx∪{x}\mathrm{S} = \mathrm{S}_x \cup \{x\} a function fSf_\mathrm{S} extending fSxf_{\mathrm{S}_x} by putting

fS(x)=T{fSx}f_\mathrm{S}(x) = \mathrm{T}\{f_{\mathrm{S}_x}\}

(Chapter II, § 4, no. 7, Proposition 8); since fS(x)=fSxf_\mathrm{S}^{(x)} = f_{\mathrm{S}_x}, it is obvious that Sx∪{x}∈S1\mathrm{S}_x \cup \{x\} \in \mathfrak{S}_1. Hence (Lemma 2) E∈S1\mathrm{E} \in \mathfrak{S}_1, and the proof is complete.

¶ Usually this criterion is applied in situations where there exists a set F such that for every mapping h of a segment of E onto a subset of F we have T{h}∈F\mathrm{T}\{h\} \in \mathrm{F}. Then the set U obtained by applying C60 is a subset of F. For, with the notation used above, let S2\mathfrak{S}_2 be the subset of S1\mathfrak{S}_1 consisting of segments S of E such that US⊂F\mathrm{U_S} \subset \mathrm{F}. It is evident that every union of segments belonging to S2\mathfrak{S}_2 also belongs to S2\mathfrak{S}_2; on the other hand, the hypothesis on F implies that if Sx∈S2\mathrm{S}_x \in \mathfrak{S}_2, we have Sx∪{x}∈S2\mathrm{S}_x \cup \{x\} \in \mathfrak{S}_2. The assertion now follows from Lemma 2.

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.