The supremum of a set is the least element that is greater than or equal to every element of that set, relative to a specified ordering. Written , it gives the sharpest upper bound on , but need not belong to . The concept is fundamental in mathematical analysis, where it expresses the completeness of the real numbers, and in the study of partially ordered sets, where it generalizes the idea of taking a maximum.
Definition
Let be a subset of a partially ordered set . An element is an upper bound of if
An element is the supremum of if:
- is an upper bound of ;
- for every upper bound of .
Thus, a supremum must both bound the set from above and be no larger than any other upper bound. If it exists, it is unique: if and both satisfy the definition, then and , so antisymmetry gives .
The order-dual concept is the infimum, or greatest lower bound, denoted . It is obtained by reversing all inequalities in the definition.
For an indexed collection, common notation includes
For a function , the expression
means the supremum of its set of values .
Supremum versus maximum
A maximum of is an element of that is greater than or equal to every other element of . A supremum is not required to belong to .
Consequently:
- If has a maximum, then .
- If exists and belongs to , then it is the maximum.
- A set can have a supremum without having a maximum.
For example,
but the open interval has no maximum. Every number in it is smaller than another number in the same interval. By contrast,
Every nonempty finite subset of a totally ordered set has a maximum and therefore a supremum. This does not extend to arbitrary partial orders: two incomparable elements need not have either a maximum or a supremum.
Supremum in the real numbers
The real numbers have the least-upper-bound property: every nonempty subset of that is bounded above has a supremum in . This is a form of order completeness and can be used as an axiom characterizing the real number system among ordered fields.
The assumptions are essential. A real set that is unbounded above has no real supremum. The empty set also has no supremum in , since every real number is an upper bound of it and there is no least real number.
Approximation characterization
For a nonempty set , a real number equals if and only if:
for every ;
for every , there exists such that
The second condition says that elements of can be found arbitrarily close to from below, possibly equal to . If it failed for some , then would itself be an upper bound, contradicting leastness.
For example, let
Every element is less than , and the elements approach , so , although .
Dependence on the ambient ordered set
A supremum is always relative to an ambient ordered set. Consider
where denotes the rational numbers.
Viewed as a subset of , this set has supremum . Viewed as a subset of , it is bounded above but has no supremum, because its least real upper bound is not rational. This illustrates the failure of order completeness in .
More generally, changing the ambient ordered set can change the supremum or whether one exists.
Extended real numbers and the empty set
In the extended real line
every subset has a supremum. An unbounded-above subset of has supremum , and
These conventions follow directly from the order definition. Every element of the ambient ordered set is an upper bound of the empty set, so its supremum, when one exists, is the least element of that ambient set.
Accordingly, depends on the setting: in the ordered interval , it is , whereas in it does not exist.
Basic properties
For nonempty, bounded-above real sets and , the following identities and inequalities hold.
Monotonicity. If , then
Union.
Translation. For ,
Positive scaling. For ,
Order reversal. If is also bounded below, then for ,
In particular,
Independent sums.
Here the two variables vary independently. For functions on the same nonempty domain, only an inequality holds in general:
assuming the two suprema on the right are finite. Equality can fail because the functions may be large at different points.
Sequences, limits, and attainment
If is nonempty and has finite supremum , then for every positive integer , an element can be chosen so that
The resulting sequence converges to . Thus every finite real supremum can be approached by a sequence of elements of the set.
For an increasing real sequence bounded above,
This is the monotone convergence theorem for sequences, a basic consequence of real completeness. The limit need not equal any individual term.
Whether a function attains its supremum requires additional conditions. The extreme value theorem states that a continuous real-valued function on a nonempty compact space attains both its supremum and its infimum. Without suitable hypotheses, the supremum may be finite but unattained, as with on .
Suprema also define the limit superior of a sequence:
interpreted in the extended real line. This construction records the limiting behavior of the upper bounds of successive tails.
Suprema in partial orders
In a partial order, the existence of upper bounds does not guarantee a supremum. For example, suppose , with and incomparable, both below and , and and incomparable. Then has two upper bounds but no least upper bound.
For a pair of elements, the supremum is often called their join, written
A lattice is a partially ordered set in which every pair has both a supremum and an infimum. A complete lattice has suprema and infima for all subsets, including the empty set.
Examples show that a supremum need not resemble a numerical maximum:
- In the power set of a set , ordered by inclusion, the supremum of a family of subsets is their union.
- Among linear subspaces of a vector space, ordered by inclusion, the supremum of a family is the linear span of their union, not generally the union itself.
- Among positive integers ordered by divisibility, the supremum of two integers is their least common multiple.
These examples also show why a supremum can exist even when the elements being compared are incomparable.
Applications in analysis and optimization
Optimization
In mathematical optimization, the value
is the best upper value of an objective function over a feasible set . This value is distinct from an optimizer: an optimizer is a feasible point satisfying .
For example,
but no finite positive attains that value. Writing “supremum” rather than “maximum” avoids assuming that an optimizer exists.
Function norms and uniform convergence
For a bounded real- or complex-valued function on a nonempty set , the supremum norm is
It measures the greatest magnitude of the function, allowing for the possibility that this magnitude is approached but never attained.
The corresponding distance
is central to uniform convergence: a sequence converges uniformly to precisely when these suprema tend to zero.
Essential supremum
In measure theory, the essential supremum disregards exceptional sets of measure zero. For a measurable real-valued function,
with extended-real conventions when needed.
For example, on with Lebesgue measure, a function equal to at one point and elsewhere has ordinary supremum but essential supremum . The distinction is fundamental in spaces, particularly , where the norm is the essential supremum of the absolute value rather than the pointwise supremum.