The greatest lower bound of an ordered set is the largest number in such that for all in .
For example, let be the set of all real numbers, and let . Then is the greatest lower bound of . Notice how the greatest lower bound differs from the minima of a set in that the greatest lower bound of a set might not even belong to the set.
An ordered set is said to have the greatest-lower-bound property if the following holds true:
If is not empty, and is bounded below, then has a greatest lower bound.
Which of the following ordered sets (under their usual order) does not have the greatest-lower-bound property?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Consider the intersection of the rational numbers with the open interval (e, 3). Presume that a greatest lower bound exists. Then it must be a rational q with either q>e or q<e. If q>e, then there exists a rational number p, because the rationals are dense in the reals, such that q>p>e, meaning that q is not in fact a lower bound. If q<e, then again by the density of the rationals in the reals there exists a rational k such that q<k<e and because k<e, k must also be a rational lower bound on the set and thus q is not the greatest lower bound. Because the presumption that a greatest lower bound exists leads to a contradiction, there must be no greatest lower bound.