Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Upper and lower bounds
Summary
In mathematics, particularly in order theory, an upper bound or majorant of a subset S of some preordered set (K, ≤) is an element of K that is greater than or equal to every element of S.
Dually, a lower bound or minorant of S is defined to be an element of K that is less than or equal to every element of S.
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.
For example, 5 is a lower bound for the set S = (as a subset of the integers or of the real numbers, etc.), and so is 4. On the other hand, 6 is not a lower bound for S since it is not smaller than every element in S.
The set S = has 42 as both an upper bound and a lower bound; all other numbers are either an upper bound or a lower bound for that S.
Every subset of the natural numbers has a lower bound since the natural numbers have a least element (0 or 1, depending on convention). An infinite subset of the natural numbers cannot be bounded from above. An infinite subset of the integers may be bounded from below or bounded from above, but not both. An infinite subset of the rational numbers may or may not be bounded from below, and may or may not be bounded from above.
Every finite subset of a non-empty totally ordered set has both upper and lower bounds.
The definitions can be generalized to functions and even to sets of functions.
Given a function with domain D and a preordered set (K, ≤) as codomain, an element y of K is an upper bound of if y ≥ (x) for each x in D. The upper bound is called sharp if equality holds for at least one value of x. It indicates that the constraint is optimal, and thus cannot be further reduced without invalidating the inequality.
Similarly, a function g defined on domain D and having the same codomain (K, ≤) is an upper bound of , if g(x) ≥ (x) for each x in D.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood