B2.11

Logic, Computation and Set Theory | Part II, 2001

Let UU be an arbitrary set, and P(U)\mathcal{P}(U) the power set of UU. For XX a subset of P(U)\mathcal{P}(U), the dual X∨X^{\vee} of XX is the set {y⊆U:(∀x∈X)(y∩x≠∅)}\{y \subseteq U:(\forall x \in X)(y \cap x \neq \emptyset)\}.

(i) Show that X⊆Y→Y∨⊆X∨X \subseteq Y \rightarrow Y^{\vee} \subseteq X^{\vee}.

Show that for {Xi:i∈I}\left\{X_{i}: i \in I\right\} a family of subsets of P(U)\mathcal{P}(U)

(⋃{Xi:i∈I})∨=⋂{Xi∨:i∈I}\left(\bigcup\left\{X_{i}: i \in I\right\}\right)^{\vee}=\bigcap\left\{X_{i}^{\vee}: i \in I\right\}

(ii) Consider S={X⊆P(U):X⊆X∨}S=\left\{X \subseteq \mathcal{P}(U): X \subseteq X^{\vee}\right\}. Show that SS, ⊆\subseteq is a chain-complete poset.

State Zorn's lemma and use it to deduce that there exists XX with X=X∨X=X^{\vee}.

Show that if X=X∨X=X^{\vee} then the following hold:

XX is closed under superset; for all U′⊆U,XU^{\prime} \subseteq U, X contains either U′U^{\prime} or U\U′U \backslash U^{\prime}.

Typos? Please submit corrections to this page on GitHub.