Bourbaki

Exercise 29, § 6

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

Theory of Sets, III, 249

(a) In an ordered set E, every finite union of Noetherian subsets (with respect to the induced ordering) is Noetherian.

(b) An ordered set E is Noetherian if and only if for each a∈Ea \in \mathrm{E} the interval ]a,→[]a, \rightarrow[ is Noetherian.

(c) Let E be an ordered set such that the ordered set obtained by endowing E with the opposite ordering is Noetherian. Let uu be a letter and let T{u}\mathrm{T}\{u\} be a term. Show that there exists a set U and a mapping ff of E onto U such that for each x∈Ex \in \mathrm{E} we have f(x)=T{f(x)}f(x) = \mathrm{T}\{f^{(x)}\}, where f(x)f^{(x)} denotes the mapping of ]←,x[]\leftarrow, x[ onto f(]←,x[)f(]\leftarrow, x[) which coincides with ff on this interval. Furthermore, U and ff are determined uniquely by this condition.

(d) Let E be a Noetherian ordered set such that every finite subset of E has a least upper bound in E. Show that, if E has a least element, then E is a complete lattice (§ 1, Exercise 11); and that if E has no least element, the set E′E' obtained by adjoining a least element to E (§ 1, no. 7, Proposition 3) is a complete lattice.

Solution

No solution has been written yet.

Cited by

Nothing.

Cites

Transcribed from the printed volume. Not translated.