lowest upper bound


Let S be a set with a partial ordering , and let T be a subset of S. A lowest upper bound, or supremumMathworldPlanetmath, of T is an upper boundMathworldPlanetmath x of T with the property that xy for every upper bound y of T. The lowest upper bound of T, when it exists, is denoted sup(T).

A lowest upper bound of T, when it exists, is unique.

Greatest lower bound is defined similarly: a greatest lower bound, or infimumMathworldPlanetmath, of T is a lower bound x of T with the property that xy for every lower bound y of T. The greatest lower bound of T, when it exists, is denoted inf(T).

If A={a1,a2,,an} is a finite setMathworldPlanetmath, then the supremum of A is simply max(A), and the infimum of A is equal to min(A).

Title lowest upper bound
Canonical name LowestUpperBound
Date of creation 2013-03-22 11:52:18
Last modified on 2013-03-22 11:52:18
Owner djao (24)
Last modified by djao (24)
Numerical id 13
Author djao (24)
Entry type Definition
Classification msc 06A05
Defines least upper bound
Defines greatest lower bound
Defines supremum
Defines infimum