7
$\begingroup$

Consider the partial order $(P(\omega),\subseteq)$. Let $L$ be a dense linear suborder. Does $L$ have a countable dense subset?

(Note that it contains a copy of $\mathbb R$, via Dedekind cuts of $\mathbb Q$.)

$\endgroup$
2
  • 1
    $\begingroup$ What are you doing, man? I have so many things to do. Why you gotta go and ask nice questions like that??? $\endgroup$
    – Asaf Karagila
    Nov 8, 2019 at 15:43
  • 4
    $\begingroup$ If $L$ is a linearly ordered subset of $P(\omega)$, then $x\preceq y\iff\forall X\in L\,(x\in X\to y\in X)$ defines a total preorder on $\omega$ (which is dense if $L$ is dense), and elements of $L$ are $\preceq$-upper subsets. This easily implies that it is separable. $\endgroup$ Nov 8, 2019 at 16:03

2 Answers 2

14
$\begingroup$

For any $a\neq b\in\omega$ pick a set $A_{ab}\in L$ such that $a\in A_{ab},b\not\in A_{ab}$, if such exists, and let $D$ be the set of all $A_{ab}$ we have picked. We claim $D$ is dense in $L$.

Let $X,Y\in L$ with $X\subsetneq Y$. Pick any $Z$ such that $X\subsetneq Z\subsetneq Y$ and take $a\in Z\setminus X,b\in Y\setminus Z$. Then $Z$ is an element containing $a$ but not $b$, so $A_{ab}\in D$ exists. We have $A_{ab}\not\subseteq X$, so $X\subseteq A_{ab}$, and $Y\not\subseteq A_{ab}$, so $A_{ab}\subseteq Y$. Hence $D$ contains an element $A_{ab}$ strictly between $X$ and $Y$, so $D$ is a dense countable subset of $L$.

Note that countable choice was used in the proof, but it is unavoidable, since (\mathbb R and hence also) $P(\omega)$ can contain a finite Dedekind-infinite subset, and this will necessarily contain no dense countable subset.

$\endgroup$
11
$\begingroup$

Note that the lexicographic order of $2^\omega$ is a linear extension of $(\mathcal P(\omega),\subseteq)$, namely if $A\subseteq B$, then $\min(A\mathbin{\triangle}B)\in B$, which means that the first point that the sets differ must be in $B$.

But $2^\omega$ is hereditarily separable, and therefore every linear suborder of $\mathcal P(\omega)$ is separable.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.