Ma · Mathematics

Why Does a Nonempty Bounded Set of Reals Have a Supremum?

Published By the 9to5Science editorial team

At a glance

  1. 1. Check the hypotheses

    The set must be nonempty and bounded above in the real numbers.

  2. 2. Use completeness

    The least-upper-bound property of the real numbers guarantees a supremum.

  3. 3. Verify the candidate

    Show it is an upper bound and that no smaller number is an upper bound.

A supremum is the smallest number that is at least as large as every element of a set. The existence question is answered by a defining property of the real numbers: every nonempty subset of R\mathbb{R} that is bounded above has a supremum in R\mathbb{R}. This property is called completeness or the least-upper-bound property.

The existence theorem

Let A⊆RA\subseteq\mathbb{R} be nonempty and bounded above. Then there is a real number ss such that:

  1. ss is an upper bound for AA: a≤sa\le s for every a∈Aa\in A.
  2. ss is no larger than any other upper bound for AA.

That number is written s=sup⁡As=\sup A. The second condition is what makes it the least upper bound.

In a standard real-analysis course, this is usually taken as an axiom or established earlier in the construction of the real numbers. It cannot be derived just from the usual order and field rules: the rational numbers satisfy those rules, but are not complete.

How the definition verifies a supremum

To prove that a proposed number ss is sup⁡A\sup A, show both of the following:

  • Upper-bound condition: every a∈Aa\in A satisfies a≤sa\le s.
  • Arbitrarily-close condition: for every ε>0\varepsilon>0, some a∈Aa\in A satisfies s−ε<as-\varepsilon<a.

The second condition says that no number strictly below ss can still be an upper bound. Indeed, if u<su<s, take ε=s−u>0\varepsilon=s-u>0. Then there is an a∈Aa\in A with a>s−ε=ua>s-\varepsilon=u, so uu is not an upper bound.

This is often the most practical way to identify a supremum once existence is guaranteed.

Worked example: the interval (0,1)(0,1)

Let A=(0,1)A=(0,1). Every element of AA is less than 11, so 11 is an upper bound. Now let u<1u<1 be any smaller real number. Choose 0<ε<min⁡{1,1−u}0<\varepsilon<\min\{1,1-u\}. The number a=1−εa=1-\varepsilon belongs to (0,1)(0,1) and is greater than uu. Thus uu is not an upper bound.

Therefore sup⁡A=1\sup A=1. But 1∉A1\notin A, so AA has no maximum. A maximum must be an element of the set; a supremum does not have to be.

Why completeness matters

Consider the set of rational numbers

B={q∈Q:q>0 and q2<2}.B=\{q\in\mathbb{Q}: q>0\text{ and }q^2<2\}.

It is nonempty and bounded above in Q\mathbb{Q}. In R\mathbb{R}, its supremum is 2\sqrt{2}. But 2\sqrt{2} is irrational, so it is not in Q\mathbb{Q}. In fact, BB has no supremum that is a rational number: any rational upper bound below 2\sqrt{2} is not an upper bound, while any rational upper bound above 2\sqrt{2} is not the least one.

So the theorem is specific to a complete number system such as R\mathbb{R}. The same assertion is false for arbitrary ordered fields, including Q\mathbb{Q}.

If the real numbers are defined using Dedekind cuts, the existence theorem can be seen directly. A real number is represented by the rationals below it. For a nonempty family of real numbers bounded above, take the union of their corresponding sets of lower rationals. That union is itself a Dedekind cut and represents the least upper bound. This is one construction that builds completeness into R\mathbb{R}.

Common mistakes

  • Forgetting nonemptiness: Under the usual real-valued definition, the empty set has no supremum in R\mathbb{R}; every real number is an upper bound, and there is no least real number.
  • Forgetting boundedness above: A set unbounded above has no real supremum. In the extended real numbers, one may assign it supremum +∞+\infty instead.
  • Confusing supremum with maximum: The supremum may lie outside the set, as 11 does for (0,1)(0,1).
  • Trying to prove completeness from order rules alone: Completeness is an additional property distinguishing R\mathbb{R} from Q\mathbb{Q}.

When working within real analysis, use the theorem once you have checked that the set is nonempty and bounded above. Then identify the candidate and verify that it is an upper bound that can be approached from within the set.

References

  1. Stephen Abbott, Understanding Analysis
  2. Walter Rudin, Principles of Mathematical Analysis

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.