Upper Bound is Dual to Lower Bound

From ProofWiki
Jump to navigation Jump to search

Theorem

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

Let $a \in S$ and $T \subseteq S$.


The following are dual statements:

$a$ is an upper bound for $T$
$a$ is a lower bound for $T$


Proof

By definition, $a$ is an upper bound for $T$ iff:

$\forall t \in T: t \preceq a$

The dual of this statement is:

$\forall t \in T: a \preceq t$

by Dual Pairs (Order Theory).


By definition, this means $a$ is a lower bound for $T$.


The converse follows from Dual of Dual Statement (Order Theory).

$\blacksquare$


Also see