Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Upper and lower bounds
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Majorant and minorant in mathematics}} {{About|precise bounds|asymptotic bounds|Big O notation}} [[File:Illustration of supremum.svg|thumb|300px|A set with upper bounds and its least upper bound]] In [[mathematics]], particularly in [[order theory]], an '''upper bound''' or '''majorant'''<ref name=schaefer/> of a [[subset]] {{mvar|S}} of some [[Preorder|preordered set]] {{math|(''K'', β€)}} is an [[Element (mathematics)|element]] of {{mvar|K}} that is {{nobr|[[greater than or equal to]]}} every element of {{mvar|S}}.<ref name="MacLane-Birkhoff" /><ref>{{Cite web|url=https://www.mathsisfun.com/definitions/upper-bound.html|title=Upper Bound Definition (Illustrated Mathematics Dictionary)|website=Math is Fun|access-date=2019-12-03}}</ref> [[Duality (order theory)|Dually]], a '''lower bound''' or '''minorant''' of {{mvar|S}} is defined to be an element of {{mvar|K}} that is less than or equal to every element of {{mvar|S}}. A set with an upper (respectively, lower) bound is said to be '''bounded from above''' or '''majorized'''<ref name=schaefer/> (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.<ref>{{Cite web|url=http://mathworld.wolfram.com/UpperBound.html|title=Upper Bound|last=Weisstein|first=Eric W.|website=mathworld.wolfram.com|language=en|access-date=2019-12-03}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)