PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Low Entry average rating: Very high
lowest upper bound (Definition)

Let $ S$ be a set with a partial ordering $ \leq$, and let $ T$ be a subset of $ S$. A lowest upper bound, or supremum, of $ T$ is an upper bound $ x$ of $ T$ with the property that $ x \leq y$ for every upper bound $ y$ of $ T$. The lowest upper bound of $ T$, when it exists, is denoted $ \operatorname{sup}(T)$.

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

Greatest lower bound is defined similarly: a greatest lower bound, or infimum, of $ T$ is a lower bound $ x$ of $ T$ with the property that $ x \geq y$ for every lower bound $ y$ of $ T$. The greatest lower bound of $ T$, when it exists, is denoted $ \operatorname{inf}(T)$.

If $ A = \{a_1,a_2,\ldots,a_n\}$ is a finite set, then the supremum of $ A$ is simply $ \max(A)$, and the infimum of $ A$ is equal to $ \min(A)$.



"lowest upper bound" is owned by djao.
(view preamble)

View style:

Also defines:  least upper bound, greatest lower bound, supremum, infimum
Log in to rate this entry.
(view current ratings)

Cross-references: finite set, lower bound, property, upper bound, subset, partial ordering
There are 80 references to this entry.

This is version 8 of lowest upper bound, born on 2001-10-21, modified 2007-02-15.
Object id is 452, canonical name is LowestUpperBound.
Accessed 18860 times total.

Classification:
AMS MSC06A05 (Order, lattices, ordered algebraic structures :: Ordered sets :: Total order)

Pending Errata and Addenda
None.
[ View all 6 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)