on the lexicographic order on $\mathbb{C}$

313 Views Asked by At

I know that the lexicographic order on $\mathbb{C}$ turns it into an ordered set. I just wonder if under this ordering, $\mathbb{C}$ has the least upper bound property

1

There are 1 best solutions below

0
On BEST ANSWER

No. The set $$\{ z \in \mathbb{C} : \Re z < 0 \}$$ is bounded above by $1$, and has no supremum.