Bourbaki

Proposition 1

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

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

In a well-ordered set E, every segment of E other than E itself is an interval ]←,a[]\leftarrow, a[, where a∈Ea \in \mathrm{E}.

Let S be a segment of E such that S≠E\mathrm{S} \neq \mathrm{E}. Since E−S\mathrm{E} - \mathrm{S} is not empty, it has a least element aa. By virtue of Definition 2, the relation x⩾ax \geqslant a implies x∉Sx \notin \mathrm{S}; otherwise we would have a∈Sa \in \mathrm{S}, which is absurd. Hence E−S\mathrm{E} - \mathrm{S} is the interval [a,→[[a, \rightarrow[, and S is the interval ]←,a[]\leftarrow, a[.

¶ For every element xx in a totally ordered set E the segment ]←,x[]\leftarrow, x[ is called the segment with endpoint x, and is denoted by Sx\mathrm{S}_x.

Note that if E is well-ordered and not empty, Sx\mathrm{S}_x has a least element α\alpha and consequently is also the interval [α,x[[\alpha, x[.

Let E be a totally ordered set. The union A of the Sx\mathrm{S}_x, as xx runs through E, is E if E has no greatest element; and if E has a greatest element bb, we have A=E−{b}\mathrm{A} = \mathrm{E} - \{b\}.

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.