Give an example of a simply ordered set without the least upper bound property. In Theorem 27.1 in Topology by Munkres, he states "Let $X$ be a simply ordered set having the least upper bound property.  In the order topology, each closed interval in $X$ is compact."
(The LUB property is if a subset is bounded above, then it has a LUB.)
I don't understand how you could have a simply ordered set (a chain) WITHOUT the LUB property.  If a subset is bounded and it is a chain, then how can it not have a LUB?
Can someone give an example?
Thanks!
 A: $\Bbb Q$
Added: $\{q\in\Bbb Q:q<\sqrt2\}$ is a chain, it’s bounded above by $2$, say, and it has no least upper bound in $\Bbb Q$, because $\sqrt2$ is irrational.
A: Consider $(-1,0)\cup(0,1)$ with the natural ordering (which is linear). $(-1,0)$ has no least upper bound although it is bounded (eg. by $1/2$).
A: $\{0,1\}\times\Bbb Z$ ordered lexicographically. The subset $\{0\}\times\Bbb N$ is bounded from above but has no least upper bound.
A: Up to isomorphism, the minimal example is the set 
$$
\left\{-\frac{1}{n}\;;\;n\geq 1\right\}=-\frac{1}{\mathbb{N}^*}\quad\mbox{in}\quad\frac{1}{\mathbb{Z}^*}=\left\{\frac{1}{n}\;;\;|n|\geq 1\right\}
$$
with the obvious ordering.
A: According to the strict definitions given by the OP, the null set fails to have a Least Upper Bound while still being simply ordered.
The Least Upper Bound of a set, as defined at the Wikipedia page he links to requires that it be a member of that set.  The null set, having no members, clearly lacks a LUB.
However, the definition given for being simply ordered does not require that the set have any elements.  Indeed, a set can only lack the property if it has a pair of elements that are not comparable.
So, the null set is indeed Simply Ordered without having the Least Upper Bound property. 
A: Perhaps your source of confusion is this: if a chain has a greatest element then that serves as a least upper bound, since it is an upper bound (since it is greatest) and is less than or equal to any upper bound for the chain because it's an element of it.
However! Not every chain need have a greatest element! Here's how you might think about this:
Depending on your level of pedantry, you may regard the empty set as a chain (every pair of elements from it is orderable, after all). Then certainly it doesn't have a greatest element, since it has no elements at all. Does it have a least upper bound? Well, every element of the poset is trivially an upper bound for the empty set, so a least upper bound is precisely a least element. We'll assume the poset itself is non-empty, so that the empty set does have an upper bound. Let's call it $u_0$. How can this upper bound fail to be least? Well, there must be another upper bound smaller than it, say $u_1 < u_0$. Likewise, there must be another upper bound smaller than that, and so on: you must have an infinite descending chain $u_0 > u_1 > u_2 > \dots$ and as long as there's nothing below the entire chain, there can't be a least element. The negative integers are the most obvious example.
So if you accept the empty chain as a chain, in the simply ordered set of the negative integers it has upper bounds but no least upper bound.
But that's not terribly satisfying. What about non-empty chains? Well, suppose your poset has an element $x_0$. One of two things can happen: either $x_0$ is maximal for the chain, or some $x_1$ has $x_1 > x_0$. Is $x_1$ maximal? Maybe, or maybe there's an $x_2 > x_1$, and so on. If this set is to avoid having a maximal element (hence a least upper bound) it must go upwards forever – an ascending chain. It should be bounded – okay, just invent an element that goes above the entire ascending chain. But it can't have a least upper bound – this precisely means the set of upper bounds can't have a least element, and as we discussed before that basically means we need an infinite descending chain.
So if we have an infinite ascending chain of elements, and an infinite descending chain of upper bounds for it, we'll fail to have a least upper bound again.
The lesson to be learnt here is that posets are very flexible structures, and you can form one by just listing elements and placing them relative to each other: it's not like, say, a group, where there is quite a lot of rigidity to the structure, or a field, where you get barely any choice at all.
Indeed, one possible approach would be to take the real numbers, find a subset $C$ with a least upper bound $u$, but $u \not \in C$. Form a new poset by removing $u$ from the reals. Now $C$ doesn't have a least upper bound anymore!
A: One more answer, not discussed till now.
Consider $A = \{x,y,z\}$. So $\mathbb{P}(A)=  \{\phi, \{x\}, \{y\}, \{z\}, \{x, y\}, \{y,z\}, \{x, z\}, A\}$. 
Consider partial order relation $<$ on $\mathbb{P}(A)$ as $a<b$ iff $a\subset b$.
Consider the element $\phi \in \mathbb{P}(A)$. See nay element of $\mathbb{P}(A)$ is an upper bound of the set $\phi$. What is the least upper bound ? Not exists.
