Upper and lower bounds
In mathematics, particularly in order theory, an upper bound or majorant of a subset of some preordered set is an element of that is every element of .
≈ 2 min read
Upper and lower bounds. encyclopegia.org, snapshot enwiki-001327844467. /a/upper-and-lower-bounds
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, particularly in order theory, an upper bound or majorant of a subset of some preordered set is an element of that is every element of . Dually, a lower bound or minorant of is defined to be an element of that is less than or equal to every element of .
A set with an upper (respectively, lower) bound is said to be bounded from above or majorized (respectively bounded from below or minorized) by that bound. The terms bounded above (bounded below) are also used in the mathematical literature for sets that have upper (respectively lower) bounds.
Bounds of functions
The definitions can be generalized to functions and even to sets of functions. Given a function with domain and a preordered set as codomain, an element of is an upper bound of if for each in . The upper bound is called sharp if equality holds for at least one value of .
It indicates that the constraint is optimal, and thus cannot be further reduced without invalidating the inequality. Similarly, a function defined on domain and having the same codomain is an upper bound of , if for each in . The function is further said to be an upper bound of a set of functions, if it is an upper bound of each function in that set.
The notion of lower bound for (sets of) functions is defined analogously, by replacing ≥ with ≤.
Tight bounds
An upper bound is said to be a tight upper bound, a least upper bound, or a supremum, if no smaller value is an upper bound. Similarly, a lower bound is said to be a tight lower bound, a greatest lower bound, or an infimum, if no greater value is a lower bound.
Exact upper bounds
An upper bound of a subset of a preordered set is said to be an exact upper bound for if every element of that is strictly majorized by is also majorized by some element of . Exact upper bounds of reduced products of linear orders play an important role in PCF theory.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1327844467 under CC BY-SA 4.0; modifications have been made.