Exercise 17, § 1
Tag 03UD, permanent. Cite it as [Bourbaki, Tag 03UD].
Theory of Sets, III, 218
Bourbaki marks this one as harder than the rest.
A lattice E which has a least element is said to be relatively complemented if, for each pair of elements , of E such that , there exists an element such that and . Such an element is called a relative complement of with respect to .
\* (a) Show that the set E of vector subspaces of a vector space of dimension , ordered by inclusion, is a relatively complemented lattice, but that if , are two elements of E such that , there exist in general several distinct relative complements of with respect to . \*
(b) If E is distributive and relatively complemented, show that if in E, there exists a unique relative complement of with respect to . E is said to be a Boolean lattice if it is distributive and relatively complemented and if, moreover, it has a greatest element . For each E, let be the complement of with respect to . Then the mapping is an isomorphism of E onto the ordered set obtained by endowing E with the opposite ordering, and we have . If A is any set, then the set of all subsets of A, ordered by inclusion, is a Boolean lattice.
(c) If E is a complete Boolean lattice (Exercise 11), show that for each family of elements of E and each E we have
(Reduce to the case , and use the fact that if for every index , then for every ).
Solution
No solution has been written yet.
Cited by
- ac-vii-s0 not in this corpus
- Exercise 18, § 1
- Exercise 22, § 1