Examine individual changes

'{{About|precise bounds|asymptotic bounds|Big O notation}} {{more footnotes|date=March 2012}} [[File:Illustration of supremum.svg|thumb|300px|A set with upper bounds and its least upper bound.]] In [[mathematics]], especially in [[order theory]], an '''upper bound''' of a [[subset]] ''S'' of some [[partially ordered set]] (''K'', ≤) is an element of ''K'' which is [[greater than or equal to]] every element of ''S''.<ref name="MacLane-Birkhoff" /> The term '''lower bound''' is defined [[duality (order theory)|dually]] as an element of ''K'' which is less than or equal to every element of ''S''. A set with an upper bound is said to be '''bounded from above''' by that bound, a set with a lower bound is said to be '''bounded from below''' by that bound. The terms '''bounded above''' ('''bounded below''') are also used in the mathematical literature for sets that have upper (respectively lower) bounds. == Examples == For example, 5 is a lower bound for the set { 5, 8, 42, 34, 13934 }; so is 4; but 6 is not. Another example: for the set { 42 }, the number 42 is both an upper bound and a lower bound; all other real numbers are either an upper bound or a lower bound for that set. Every subset of the [[natural number]]s has a lower bound, since the natural numbers have a least element (0, or 1 depending on the exact definition of natural numbers). An infinite subset of the natural numbers cannot be bounded from above. An infinite subset of the [[integer]]s may be bounded from below or bounded from above, but not both. An infinite subset of the [[rational number]]s 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. looooooooooooooooooooooooooooool :))))))) ==Bounds of functions== The definitions can be generalized to [[Function (mathematics)|functions]] and even sets of functions. Given a function {{italics correction|{{mvar|f}}}} with [[Domain (mathematics)|domain]] {{mvar|D}} and a partially ordered set {{math|(''K'', ≤)}} as [[codomain]], an element {{mvar|''y''}} of {{mvar|K}} is an upper bound of {{italics correction|{{mvar|f}}}} if {{math|''y'' ≥ {{italics correction|''f''}}(''x'')}} for each {{mvar|x}} in {{mvar|D}}. The upper bound is called ''[[Mathematical jargon#sharp|sharp]]'' if equality holds for at least one value of {{mvar|x}}. Function {{mvar|g}} defined on domain {{mvar|D}} and having the same codomain {{math|(''K'', ≤)}} is an upper bound of {{italics correction|{{mvar|f}}}} if {{math|''g''(''x'') ≥ {{italics correction|''f''}}(''x'')}} for each {{mvar|x}} in {{mvar|D}}. Function {{mvar|g}} 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, with ≤ replacing ≥. ==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. ==References== {{Reflist | refs= <ref name="MacLane-Birkhoff">{{cite book | last1 = Mac Lane| first1 = Saunders | author1-link = Saunders Mac Lane | last2 = Birkhoff| first2 = Garrett | author2-link = Garrett Birkhoff | title = Algebra | place = Providence, RI | publisher = [[American Mathematical Society]] | page = 145 | year = 1991 | isbn = 0-8218-1646-2 }}</ref> <!-- <ref name="Davey-Priestley"> {{cite book| author = B. A. Davey and H. A. Priestley| year =2002| title = Introduction to Lattices and Order| edition = 2nd | publisher = Cambridge University Press| isbn= 0-521-78451-4}} </ref> --> }} [[Category:Order theory]] [[de:Schranke (Mathematik)]] [[es:Mayorante]] [[pl:Kresy dolny i górny]]'