Definition:Supremum/Ordered Set
Contents |
Definition
Let $\left({S, \preceq}\right)$ be a poset.
Let $T \subseteq S$.
An element $c \in S$ is the supremum of $T$ in $S$ if:
- $(1): \quad c$ is an upper bound of $T$ in $S$
- $(2): \quad c \preceq d$ for all upper bounds $d$ of $T$ in $S$.
The supremum of $T$ is denoted $\sup \left({T}\right)$.
The supremum of $x_1, x_2, \ldots, x_n$ is denoted $\sup \left\{{x_1, x_2, \ldots, x_n}\right\}$.
If there exists a supremum of $T$ (in $S$), we say that $T$ admits a supremum (in $S$).
The supremum of $T$ is often called the least upper bound of $T$ and denoted $\operatorname{lub} \left({T}\right)$.
Also defined as
Some sources refer to the supremum as being the upper bound. Using this convention, any element greater than this is not considered to be an upper bound.
Linguistic Note
The plural of supremum is suprema, although the (incorrect) form supremums can occasionally be found if you look hard enough.
Also see
Sources
- Paul R. Halmos: Naive Set Theory (1960)... (previous)... (next): $\S 14$: Order
- Seth Warner: Modern Algebra (1965)... (previous)... (next): $\S 14$
- T.S. Blyth: Set Theory and Abstract Algebra (1975): $\S 7$
- W.A. Sutherland: Introduction to Metric and Topological Spaces (1975): Definition $1.1.2$
- K.G. Binmore: Mathematical Analysis: A Straightforward Approach (1977)... (previous)... (next): $\S 2.6$
