Bourbaki

Lemma 3

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

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

Let E be a set, let S\mathfrak{S} be a subset of P(E)\mathfrak{P}(\mathrm{E}), and let pp be a mapping of S\mathfrak{S} into E such that p(X)∉Xp(\mathrm{X}) \notin \mathrm{X} for all X∈S\mathrm{X} \in \mathfrak{S}. Then there exists a subset M of E and a well-ordering Γ\Gamma on M such that, if x⩽yx \leqslant y denotes the relation y∈Γ⟨x⟩y \in \Gamma\langle x \rangle and Sx\mathrm{S}_x denotes the segment ]←,x]]\leftarrow, x],

(1) for all x∈Mx \in \mathrm{M} we have Sx∈S\mathrm{S}_x \in \mathfrak{S} and p(Sx)=xp(\mathrm{S}_x) = x;

(2) M∉S\mathrm{M} \notin \mathfrak{S}.

Let M\mathfrak{M} be the set of subsets G of E×E\mathrm{E} \times \mathrm{E} satisfying the following conditions :

(a) G is the graph of a well-ordering on pr1G=U\mathrm{pr}_1 \mathrm{G} = \mathrm{U};

(b) if x⩽yx \leqslant y denotes the relation (x,y)∈G(x, y) \in \mathrm{G} on U, then for each x∈Ux \in \mathrm{U} the segment Sx\mathrm{S}_x is such that Sx∈S\mathrm{S}_x \in \mathfrak{S} and p(Sx)=xp(\mathrm{S}_x) = x.

¶ We shall show that if G and G' are two elements of M and if U, U' denote their first projections, then one of the two sets U, U' is contained in the other and that if, for example, U⊂U′\mathrm{U} \subset \mathrm{U}', then G=G′∩(U×U)\mathrm{G} = \mathrm{G}' \cap (\mathrm{U} \times \mathrm{U}) (in other words, that the order relation on U is induced by the order relation on U') and U is a segment of U'.

¶ Consider the set V of elements x∈U∩U′x \in \mathrm{U} \cap \mathrm{U}' such that the segments with endpoint xx are the same in U and U', and such that the orderings induced on this segment by the orderings on U and U' are identical. It is clear that V is a segment in both U and U' and that the orderings induced on V are the same; our assertion will therefore be proved if we show that either V=U\mathrm{V} = \mathrm{U} or V=U′\mathrm{V} = \mathrm{U}'. Let us argue by contradiction and suppose that V≠U\mathrm{V} \neq \mathrm{U} and V≠U′\mathrm{V} \neq \mathrm{U}'. Let xx be the least element of U−V\mathrm{U} - \mathrm{V} in U and let x′x' be the least element of U′−V\mathrm{U}' - \mathrm{V} in U'; we have V=Sx\mathrm{V} = \mathrm{S}_x in U, and V=Sx′\mathrm{V} = \mathrm{S}_{x'} in U'. But by hypothesis, V∈S\mathrm{V} \in \mathfrak{S} and

x=p(Sx),x′=p(Sx′),x = p(\mathrm{S}_x), \qquad x' = p(\mathrm{S}_{x'}),

so that x=x′x = x'. Hence by definition x∈Vx \in \mathrm{V}, which is absurd.

¶ We may therefore apply Proposition 3 of no. 1 to the set of first projections U=pr1G\mathrm{U} = \mathrm{pr}_1 \mathrm{G} (where G∈M\mathrm{G} \in \mathfrak{M}) and thus obtain a well-ordered set

M=⋃G∈Mpr1G.\mathrm{M} = \bigcup_{\mathrm{G} \in \mathfrak{M}} \mathrm{pr}_1 \mathrm{G}.

It is easily seen that the graph of the ordering on M belongs to M\mathfrak{M}. If we had M∈S\mathrm{M} \in \mathrm{S}, then, putting a=p(M)a = p(\mathrm{M}), we should have a∉Ma \notin \mathrm{M}. We could therefore adjoin to M the element aa as greatest element, and the set M′=M∪{a}\mathrm{M}' = \mathrm{M} \cup \{a\} would be well-ordered. Since M=Sa\mathrm{M} = \mathrm{S}_a in M', we should have Sa∈S\mathrm{S}_a \in \mathfrak{S} and p(Sa)=ap(\mathrm{S}_a) = a; the graph of the ordering on M' would therefore belong to M\mathfrak{M}, which is absurd.

Note that if ∅∉S\emptyset \notin \mathfrak{S} (and in particular if S\mathfrak{S} is empty), the set M whose existence is asserted by Lemma 3 is the empty set; this follows from condition 1 of Lemma 3.

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

Cites

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