Infimum and supremum

Finally, a partially ordered set may have many minimal upper bounds without having a least upper bound. Minimal upper bounds are those upper bounds for which there is no strictly smaller element that also is an upper bound. This does not say that each minimal upper bound is smaller than all other upper bounds, it merely is not greater. The distinction between "minimal" and "least" is only possible when the given order is not a total one. In a totally ordered set, like the real numbers, the concepts are the same.

As an example, let ${\displaystyle S}$ be the set of all finite subsets of natural numbers and consider the partially ordered set obtained by taking all sets from ${\displaystyle S}$ together with the set of integers ${\displaystyle \mathbb {Z} }$ and the set of positive real numbers ${\displaystyle \mathbb {R} ^{+}}$, ordered by subset inclusion as above. Then clearly both ${\displaystyle \mathbb {Z} }$ and ${\displaystyle \mathbb {R} ^{+}}$ are greater than all finite sets of natural numbers. Yet, neither is ${\displaystyle \mathbb {R} ^{+}}$ smaller than ${\displaystyle \mathbb {Z} }$ nor is the converse true: both sets are minimal upper bounds but none is a supremum.

The least-upper-bound property is an example of the aforementioned completeness properties which is typical for the set of real numbers. This property is sometimes called Dedekind completeness.

If an ordered set ${\displaystyle S}$ has the property that every nonempty subset of ${\displaystyle S}$ having an upper bound also has a least upper bound, then ${\displaystyle S}$ is said to have the least-upper-bound property. As noted above, the set ${\displaystyle \mathbb {R} }$ of all real numbers has the least-upper-bound property. Similarly, the set ${\displaystyle \mathbb {Z} }$ of integers has the least-upper-bound property; if ${\displaystyle S}$ is a nonempty subset of ${\displaystyle \mathbb {Z} }$ and there is some number ${\displaystyle n}$ such that every element ${\displaystyle s}$ of ${\displaystyle S}$ is less than or equal to ${\displaystyle n,}$ then there is a least upper bound ${\displaystyle u}$ for ${\displaystyle S,}$ an integer that is an upper bound for ${\displaystyle S}$ and is less than or equal to every other upper bound for ${\displaystyle S.}$ A well-ordered set also has the least-upper-bound property, and the empty subset has also a least upper bound: the minimum of the whole set.

An example of a set that lacks the least-upper-bound property is ${\displaystyle \mathbb {Q} }$, the set of rational numbers. Let ${\displaystyle S}$ be the set of all rational numbers ${\displaystyle q}$ such that ${\displaystyle q^{2}<2.}$ Then ${\displaystyle S}$ has an upper bound (${\displaystyle 1000,}$ for example, or ${\displaystyle 6}$) but no least upper bound in ${\displaystyle \mathbb {Q} }$: If we suppose ${\displaystyle p\in \mathbb {Q} }$ is the least upper bound, a contradiction is immediately deduced because between any two reals ${\displaystyle x}$ and ${\displaystyle y}$ (including ${\displaystyle {\sqrt {2}}}$ and ${\displaystyle p}$) there exists some rational ${\displaystyle p}$, which itself would have to be the least upper bound (if ${\displaystyle p>{\sqrt {2}}}$) or a member of ${\displaystyle S}$ greater than ${\displaystyle p}$ (if ${\displaystyle p<{\sqrt {S}}}$). Another example is the hyperreals; there is no least upper bound of the set of positive infinitesimals.

There is a corresponding greatest-lower-bound property; an ordered set possesses the greatest-lower-bound property if and only if it also possesses the least-upper-bound property; the least-upper-bound of the set of lower bounds of a set is the greatest-lower-bound, and the greatest-lower-bound of the set of upper bounds of a set is the least-upper-bound of the set.

If in a partially ordered set ${\displaystyle P}$ every bounded subset has a supremum, this applies also, for any set ${\displaystyle X,}$ in the function space containing all functions from ${\displaystyle X}$ to ${\displaystyle P,}$ where ${\displaystyle f\leq g}$ if and only if ${\displaystyle f(x)\leq g(x)}$ for all ${\displaystyle x}$ in ${\displaystyle X.}$ For example, it applies for real functions, and, since these can be considered special cases of functions, for real ${\displaystyle n}$-tuples and sequences of real numbers.

The least-upper-bound property is an indicator of the suprema.

The following formulas depend on a notation that conveniently generalizes arithmetic operations on sets: Let the sets ${\displaystyle A,B\subseteq \mathbb {R} ,}$ and scalar ${\displaystyle r\in \mathbb {R} .}$ Define

• ${\displaystyle A\neq \varnothing }$ if and only if ${\displaystyle \sup A\geq \inf A,}$ and otherwise ${\displaystyle -\infty =\sup \varnothing <\inf \varnothing =\infty .}$[2]
• ${\displaystyle rA=\{r\cdot a:a\in A\}}$; the scalar product of a set is just the scalar multiplied by every element in the set.
• ${\displaystyle A+B=\{a+b:a\in A,b\in B\}}$; called the Minkowski sum, it is the arithmetic sum of two sets is the sum of all possible pairs of numbers, one from each set.
• ${\displaystyle A\cdot B=\{a\cdot b:a\in A,b\in B\}}$; the arithmetic product of two sets is all products of pairs of elements, one from each set.

In those cases where the infima and suprema of the sets ${\displaystyle A}$ and ${\displaystyle B}$ exist, the following identities hold:

• ${\displaystyle p=\inf A}$ if and only if for every ${\displaystyle \epsilon >0}$ there is an ${\displaystyle x\in A}$ with ${\displaystyle x<p+\epsilon ,}$ and ${\displaystyle x\geq p}$ for every ${\displaystyle x\in A.}$
• ${\displaystyle p=\sup A}$ if and only if for every ${\displaystyle \epsilon >0}$ there is an ${\displaystyle x\in A}$ with ${\displaystyle x>p-\epsilon ,}$ and ${\displaystyle x\leq p}$ for every ${\displaystyle x\in A.}$
• If ${\displaystyle A\subseteq B}$ and then ${\displaystyle \inf A\geq \inf B}$ and ${\displaystyle \sup A\leq \sup B.}$

• If ${\displaystyle r>0}$ then ${\displaystyle \inf(r\cdot A)=r\left(\inf A\right)}$ and ${\displaystyle \sup(r\cdot A)=r\left(\sup A\right).}$
• If ${\displaystyle r\leq 0}$ then ${\displaystyle \inf(r\cdot A)=r\left(\sup A\right)}$ and ${\displaystyle \sup(r\cdot A)=r\left(\inf A\right).}$
• ${\displaystyle \inf(A+B)=\left(\inf A\right)+\left(\inf B\right)}$ and ${\displaystyle \sup(A+B)=\left(\sup A\right)+\left(\sup B\right).}$
• If ${\displaystyle A}$ and ${\displaystyle B}$ are nonempty sets of positive real numbers then ${\displaystyle \inf(A\cdot B)=\left(\inf A\right)\cdot \left(\inf B\right)}$ and similarly for suprema ${\displaystyle \sup(A\cdot B)=\left(\sup A\right)\cdot \left(\sup B\right)}$.[3]

• The infimum of the set of numbers {2, 3, 4} is 2. The number 1 is a lower bound, but not the greatest lower bound, and hence not the infimum.
• More generally, if a set has a smallest element, then the smallest element is the infimum for the set. In this case, it is also called the minimum of the set.
• ${\displaystyle \inf\{1,2,3,\ldots \}=1.}$
• ${\displaystyle \inf\{x\in \mathbb {R} \mid 0<x<1\}=0.}$
• ${\displaystyle \inf \left\{x\in \mathbb {Q} \mid x^{3}>2\right\}={\sqrt[{3}]{2}}.}$
• ${\displaystyle \inf \left\{(-1)^{n}+{\tfrac {1}{n}}\mid n=1,2,3,\ldots \right\}=-1.}$
• If x_{${\displaystyle n}$} is a decreasing sequence with limit x, then inf x_{${\displaystyle n}$} = x.

• The supremum of the set of numbers {1, 2, 3} is 3. The number 4 is an upper bound, but it is not the least upper bound, and hence is not the supremum.
• ${\displaystyle \sup\{x\in \mathbb {R} \mid 0<x<1\}=\sup\{x\in \mathbb {R} \mid 0\leq x\leq 1\}=1.}$
• ${\displaystyle \sup \left\{(-1)^{n}-{\tfrac {1}{n}}\mid n=1,2,3,\ldots \right\}=1.}$
• ${\displaystyle \sup\{a+b\mid a\in A,b\in B\}=\sup A+\sup B.}$
• ${\displaystyle \sup\{x\in \mathbb {Q} \mid x^{2}<2\}={\sqrt {2}}.}$

In the last example, the supremum of a set of rationals is irrational, which means that the rationals are incomplete.

One basic property of the supremum is

${\displaystyle \sup\{f(t)+g(t)\mid t\in A\}\leq \sup\{f(t)\mid t\in A\}+\sup\{g(t)\mid t\in A\}}$

for any functionals ${\displaystyle f}$ and ${\displaystyle g.}$

The supremum of a subset ${\displaystyle S}$ of (ℕ,|) where | denotes "divides", is the lowest common multiple of the elements of ${\displaystyle S.}$

The supremum of a subset ${\displaystyle S}$ of (P,⊆), where ${\displaystyle P}$ is the power set of some set, is the supremum with respect to ⊆ (subset) of a subset ${\displaystyle S}$ of ${\displaystyle P}$ is the union of the elements of ${\displaystyle S.}$