Let $A=[0,1)\times [0,1]$ have dictionary topology. Does it have the least upper bound property?
My answer: Yes, any element of the form $B=\{1 \times m: m\in [0,1]\}$ can be the least upper bound. Am I correct?
Let $A=[0,1)\times [0,1]$ have dictionary topology. Does it have the least upper bound property?
My answer: Yes, any element of the form $B=\{1 \times m: m\in [0,1]\}$ can be the least upper bound. Am I correct?
This linear order does have the least upper bound property, but what you’ve written doesn’t prove it. You need to start with an arbitrary non-empty $S\subseteq A$ that has an upper bound $u=\langle x_0,y_0\rangle\in A$ and show that $S$ has a least upper bound in $A$.
HINT: Let $S_0=\{x\in[0,1):S\cap(\{x\}\times[0,1])\ne\varnothing\}$. Show that $S_0$ has an upper bound in $[0,1)$ and conclude that it has a least upper bound $s_0$. Then let $S_1=\{y\in[0,1]:\langle s_0,y\rangle\in S\}$, show that $S_1$ has a least upper bound $s_1\in[0,1]$, and finally prove that $\langle s_0,s_1\rangle$ is the least upper bound of $S$ in $A$.