ThmDex – An index of mathematical definitions, results, and conjectures.
▼ Set of symbols
▼ Alphabet
▼ Deduction system
▼ Theory
▼ Zermelo-Fraenkel set theory
▼ Set
▼ Binary cartesian set product
▼ Binary relation
▼ Binary endorelation
▼ Preordering relation
▼ Partial ordering relation
▼ Partially ordered set
▼ Maximal element
▼ Maximum element
Definition D296
Set upper bound
Formulation 0
Let $P = (X, {\preceq})$ be a D1103: Partially ordered set such that
(i) \begin{equation} X \neq \emptyset \end{equation}
(ii) $E \subseteq X$ is a D78: Subset
A D2218: Set element $a \in X$ is an upper bound of $E$ in $P$ if and only if \begin{equation} \forall \, x \in E : (x, a) \in {\preceq} \end{equation}
Formulation 1
Let $P = (X, {\preceq})$ be a D1103: Partially ordered set such that
(i) \begin{equation} X \neq \emptyset \end{equation}
(ii) $E \subseteq X$ is a D78: Subset
A D2218: Set element $a \in X$ is an upper bound of $E$ in $P$ if and only if \begin{equation} \forall \, x \in E : x \preceq a \end{equation}
Formulation 2
Let $P = (X, {\preceq})$ be a D1103: Partially ordered set such that
(i) \begin{equation} X \neq \emptyset \end{equation}
(ii) $E \subseteq X$ is a D78: Subset
A D2218: Set element $a \in X$ is an upper bound of $E$ in $P$ if and only if \begin{equation} E \preceq a \end{equation}
Children
▶ D552: Set of upper bounds