Consider linear order $(R,<)$, would there be two sub-orders $(X,<), (Y,<)$ of it such that $X,Y$ are uncountable, which are incomparable in the following sense: There does not exist order preserving embeddings from $X$ to $Y$ or $Y$ to $X$. If so, how many would those subsets be? Thanks in advance! By saying an embedding f from Y to X, it is required that f is a function and $x<y \rightarrow f(x) < f(y)$ but f does not need to be surjective.
Incomparable subsets of real numbers with usual order relation
345 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail AtThere are 3 best solutions below
On
I believe $X = \{0, \frac{1}{2}, \frac{1}{3}, \frac{1}{4}, \ldots \}$ and the set $Y = 1 - X$ would work, with the induced orders. If $f$ is an order-preserving injection $f:X \rightarrow Y$, then $f(0)$ certainly can't be 1, so it must have the form $f(0) = 1 - \frac{1}{n}$. Now, $f(\frac{1}{3})$ can't be 1 either, since $\frac{1}{3} < \frac{1}{2}$, so $f(\frac{1}{3}) = 1 - \frac{1}{m}$ for some $m$, and so now we have infinitely elements of $Y$ lying between $1 - \frac{1}{n}$ and $1 - \frac{1}{m}$, which is false.
A symmetric argument should give no injections from $Y$ to $X$.
On
To give a concrete example based on Asaf's answer: let $X=\{1,2,3,\ldots\}$, and let $Y=\{\ldots,-3,-2,-1\}$. If $f:X\rightarrow Y$ is one-to-one and satisfies $f(1)=a$, then we need $f(X-\{1\}) \subseteq \{a+1,a+2,\ldots,-2,-1\}$ in order for $f$ to be order-preserving. But the latter set is finite, so this is impossible; there is no order-preserving map from $(X,<)$ to $(Y,<)$.
Theorem. There is a family $\{X_\alpha:\alpha<2^\omega\}$ of subsets of $\Bbb R$ such that each is a dense linear order of cardinality $2^\omega$, and if $f:X_\alpha\to X_\beta$ is an order-preserving injection, then $\alpha=\beta$, and $f$ is the identity on $X_\alpha$.
This is adapted from Theorem 3.2 of my old paper A characterization of well-orders, Fundamenta Mathematicae 111.1 (1981) 71-76.