Bourbaki

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 α\alpha is said to be relatively complemented if, for each pair of elements xx, yy of E such that x⩽yx \leqslant y, there exists an element x′x' such that sup⁡ (x,x′)=y\sup\,(x, x') = y and inf⁡ (x,x′)=α\inf\,(x, x') = \alpha. Such an element x′x' is called a relative complement of xx with respect to yy.

\* (a) Show that the set E of vector subspaces of a vector space of dimension ⩾2\geqslant 2, ordered by inclusion, is a relatively complemented lattice, but that if xx, yy are two elements of E such that x⩽yx \leqslant y, there exist in general several distinct relative complements of xx with respect to yy. \*

(b) If E is distributive and relatively complemented, show that if x⩽yx \leqslant y in E, there exists a unique relative complement of xx with respect to yy. E is said to be a Boolean lattice if it is distributive and relatively complemented and if, moreover, it has a greatest element ω\omega. For each x∈x \in E, let x∗x^* be the complement of xx with respect to ω\omega. Then the mapping x→x∗x \to x^* is an isomorphism of E onto the ordered set obtained by endowing E with the opposite ordering, and we have (x∗)∗=x(x^*)^* = x. If A is any set, then the set P(A)\mathfrak{P}(\mathrm{A}) 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 (xλ)(x_\lambda) of elements of E and each y∈y \in E we have

inf⁡ (y,sup⁡λ (xλ))=sup⁡λ (inf⁡ (y,xλ)).\inf\,(y, \sup_\lambda\,(x_\lambda)) = \sup_\lambda\,(\inf\,(y, x_\lambda)).

(Reduce to the case y=αy = \alpha, and use the fact that if inf⁡ (z,xλ)=α\inf\,(z, x_\lambda) = \alpha for every index λ\lambda, then z∗⩾xλz^* \geqslant x_\lambda for every λ\lambda).

Solution

No solution has been written yet.

Cited by

Cites

Transcribed from the printed volume. Not translated.