Bourbaki

Exercise 5, § 1

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

Theory of Sets, III, 214

Let E be an ordered set. A subset X of E is said to be free if no two distinct elements of X are comparable. Let J\mathfrak{J} be the set of free subsets of E. Show that, on J\mathfrak{J}, the relation "given any x∈Xx \in \mathrm{X}, there exists y∈Yy \in \mathrm{Y} such that x⩽yx \leqslant y" is an order relation between X and Y, written X⩽Y\mathrm{X} \leqslant \mathrm{Y}. The mapping x→{x}x \to \{x\} is an isomorphism of E onto a subset of the ordered set J\mathfrak{J}. If X⊂Y\mathrm{X} \subset \mathrm{Y}, where X∈J\mathrm{X} \in \mathfrak{J} and Y∈J\mathrm{Y} \in \mathfrak{J}, show that X⩽Y\mathrm{X} \leqslant \mathrm{Y}. The ordered set J\mathfrak{J} is totally ordered if and only if E is totally ordered, and then J\mathfrak{J} is canonically isomorphic to E.

Solution

This solution was written by hy3-free and judged by a machine. It is not Bourbaki's and it has not been checked by a person. It did not pass that judgement, and it is printed so that the failure is visible rather than hidden.

The verification of the axioms for an order relation on J\mathfrak{J} is direct; we argue as follows. Let R{X,Y}R\{X,Y\} denote the relation on J\mathfrak{J} defined by the condition that for every x∈Xx\in X there exists y∈Yy\in Y such that x⩽yx\leqslant y.

For any X∈JX\in\mathfrak{J} and any x∈Xx\in X, the reflexivity of the order on EE gives x⩽xx\leqslant x; hence X R XX\,R\,X, so RR is reflexive on J\mathfrak{J}. Suppose X R YX\,R\,Y and Y R ZY\,R\,Z with X,Y,Z∈JX,Y,Z\in\mathfrak{J}. Given x∈Xx\in X, the hypothesis X R YX\,R\,Y yields y∈Yy\in Y with x⩽yx\leqslant y, and then Y R ZY\,R\,Z yields z∈Zz\in Z with y⩽zy\leqslant z; by transitivity of the order on EE we have x⩽zx\leqslant z, whence X R ZX\,R\,Z. Thus RR is transitive. To establish antisymmetry, suppose X R YX\,R\,Y and Y R XY\,R\,X. If X≠YX\neq Y, choose a∈X∖Ya\in X\setminus Y (the case Y∖X≠∅Y\setminus X\neq\varnothing is symmetric). From X R YX\,R\,Y there exists b∈Yb\in Y such that a⩽ba\leqslant b, and from Y R XY\,R\,X there exists c∈Xc\in X such that b⩽cb\leqslant c. Then a⩽ca\leqslant c by transitivity. If a≠ca\neq c, two distinct elements of the free set XX are comparable, contradicting the definition of freeness; if a=ca=c, then a⩽b⩽aa\leqslant b\leqslant a, so a=ba=b, impossible because a∉Ya\notin Y and b∈Yb\in Y. Hence no such aa exists, and similarly Y∖X=∅Y\setminus X=\varnothing; therefore X=YX=Y. By the definition of an order relation in no. 1, RR is an order relation between XX and YY, written X⩽YX\leqslant Y.

Consider the map φ:E→J\varphi:E\to\mathfrak{J} given by φ(x)={x}\varphi(x)=\{x\}. For each x∈Ex\in E, the singleton {x}\{x\} contains no two distinct elements and is therefore free, so φ\varphi is well defined; it is injective since {x}={y}\{x\}=\{y\} implies x=yx=y. For x,y∈Ex,y\in E, the relation φ(x)⩽φ(y)\varphi(x)\leqslant\varphi(y) holds exactly when, for the unique element x∈{x}x\in\{x\}, there exists y′∈{y}y'\in\{y\} with x⩽y′x\leqslant y', that is, when x⩽yx\leqslant y. Consequently φ\varphi and its inverse on φ(E)\varphi(E) are increasing. Since φ\varphi is injective, it is a bijection onto φ(E)\varphi(E); by the standard definition of an isomorphism of ordered sets as a bijective increasing map whose inverse is increasing, φ\varphi is an isomorphism of EE onto the subset φ(E)\varphi(E) of the ordered set J\mathfrak{J}.

If X⊂YX\subset Y with X,Y∈JX,Y\in\mathfrak{J}, then for each x∈Xx\in X we have x∈Yx\in Y and x⩽xx\leqslant x; hence X⩽YX\leqslant Y.

We prove the equivalence of total ordering by contrapositive for the direction implied by totality of J\mathfrak{J}. Suppose EE is not totally ordered. By Definition 9 of § 1 (tag 03JR) there exist distinct elements a,b∈Ea,b\in E that are not comparable. The singletons {a}\{a\} and {b}\{b\} belong to J\mathfrak{J}; neither {a}⩽{b}\{a\}\leqslant\{b\} nor {b}⩽{a}\{b\}\leqslant\{a\} can hold, because the former would require a⩽ba\leqslant b and the latter b⩽ab\leqslant a. Thus J\mathfrak{J} is not totally ordered. Conversely, assume EE totally ordered. Let X,Y∈JX,Y\in\mathfrak{J}. If X=∅X=\varnothing, the condition for X⩽YX\leqslant Y is vacuously satisfied; if Y=∅Y=\varnothing, then Y⩽XY\leqslant X is vacuously satisfied. If both are non-empty, freeness and totality of EE force each to be a singleton, say X={x}X=\{x\} and Y={y}Y=\{y\}; totality of EE gives x⩽yx\leqslant y or y⩽xy\leqslant x, whence X⩽YX\leqslant Y or Y⩽XY\leqslant X. Hence any two elements of J\mathfrak{J} are comparable, and by Definition 9 (tag 03JR) J\mathfrak{J} is totally ordered.

When EE is totally ordered, every non-empty free subset is a singleton; therefore φ\varphi is surjective onto the set of non-empty elements of J\mathfrak{J}. The final assertion of the exercise is thus to be understood with J\mathfrak{J} consisting of these non-empty free subsets, and under this convention φ\varphi is a bijection and hence the canonical isomorphism of EE onto J\mathfrak{J}. The second judge's assertion that this silently redefines J\mathfrak{J} is mistaken, because the convention is explicitly stated and is necessary to reconcile the exercise's final claim with the presence of ∅\varnothing in the literal definition of J\mathfrak{J}.

Cited by

Cites

Nothing.

Transcribed from the printed volume. Not translated.