3
$\begingroup$

Problem:

can anyone come up with an ordering of $\mathbb{N}$ different than the standard one we know, where we can find a subset $S\subset \mathbb{N}$ in a way such that $\sup(S)$ exists in $\mathbb{N}$, but $\sup(S)$ does not belong to the set $S$?

$\mathbb{N}$: the set of natural numbers.

4 Answers 4

3

An example with applications in dynamical systems is Sharkovski's order. In it $ \sup\{2\,k+1:k\ge1\}=6. $

10

HINT: There is a bijection between $\Bbb N$ and $\Bbb Q$, and $\Bbb Q\cap(0,1)$ is such a set in $\Bbb Q$.

7

The simplest way is to maintain the standard order on $\mathbb{N} \setminus \{1\}$ and make $1 > n$ for all $n \ne 1$. That way, for $S = \mathbb{N} \setminus \{1\}$ you have $\sup S = 1 \notin S$.

6

Let $A$ consist of the rationals together with $\sqrt{2}$. Then $A$ is countable, so there is a bijection $\phi$ from $\mathbb{N}$ to $A$. For any pair of natural numbers $a$ and $b$, we say that $a\prec b$ iff $\phi(a)\lt \phi(b)$ in the ordinary ordering of $A$.

Then $\prec$ is a "non-standard" ordering of $\mathbb{N}$.

Let $K\subset A$ consist of all numbers $x$ in $A$ such that $x\lt \sqrt{2}$, and let $S=\phi^{-1}(K)$.

Remark: As long as we do not ask for any kind of interaction between the ordering and the ordinary structure of $\mathbb{N}$, anything that can happen in a countably infinite set can be replicated in $\mathbb{N}$.

  • 1
    I think it is not worthwhile for you to write out the details. If you really want to, first write out a proof that $\sqrt{2}$ is the sup of the set of rationals $\lt \sqrt{2}$. Certainly is upper bound, and nothing cheaper will do, since if we pick any element $b\lt \sqrt{2}$ of our set, there is always another rational $c$ such that $b\lt c\lt \sqrt{2}$. Then translate that back into our convoluted $\phi^{-1}$, which codes ordinary facts into facts about $\mathbb{N}$ and the funny order. The translation task is so mechanical that once you see it can be done, it becomes not worth doing.2012-10-10