Exercise 3, § 1
Tag 03JX, permanent. Cite it as [Bourbaki, Tag 03JX].
Theory of Sets, III, 213
Let I be an ordered set and let be a family of non-empty ordered sets indexed by I.
(a) Let F be the sum (Chapter II, § 4, no. 8) of the family ; for each , let be the index such that ; and let G be the graph consisting of all pairs such that either or else and in . Show that G is the graph of an ordering on F. The set F endowed with this ordering is called the ordinal sum of the family (relative to the ordering on I) and is denoted by . Show that the equivalence relation corresponding to the partition of F satisfies conditions (C) and (C′) of Exercise 2, and that the quotient ordered set (Exercise 2) is canonically isomorphic to I.
(b) If the set I is the ordinal sum of a family of ordered sets, where L is an ordered set, show that the ordered set is canonically isomorphic to the ordinal sum , where ("associativity" of the ordinal sum). If I is the linearly ordered set , we write for the ordinal sum of and . Show that and are not necessarily isomorphic.
(c) An ordinal sum is right directed if and only if I is right directed and is right directed for each maximal element of I.
(d) An ordinal sum is totally ordered if and only if I and each is totally ordered.
(e) An ordinal sum is a lattice if and only if the following conditions are satisfied :
(I) The set I is a lattice, and for each pair of non-comparable indices in I, (resp. ) has a least (resp. greatest) element.
(II) For each and each pair of elements of such that the set is bounded above (resp. bounded below) in , the set has a least upper bound (resp. greatest lower bound) in .
(III) For each such that contains a set of two elements which has no upper bound (resp. lower bound) in , the set of indices such that (resp. ) has a least element (resp. greatest element) , and has a least element (resp. greatest element).
Solution
No solution has been written yet.
Cited by
- Exercise 11, § 1
- Exercise 19, § 1
- Proposition 3, § 1
- Exercise 10, § 2
- Exercise 13, § 2
- Exercise 9, § 2
- Exercise 32, § 6