Definition:Complete Ordered Set

From ProofWiki
Jump to navigation Jump to search


Let $\left({S, \preceq}\right)$ be an ordered set.

Then $\left({S, \preceq}\right)$ is a complete ordered set if and only if:

$\forall S' \subseteq S: \inf S', \sup S' \in S$

That is, if and only if all subsets of $S$ have both a supremum and an infimum.

Also see