1.2 Least upper bounds

Going back to A:={a∈ℝ:0≤a≤1}A:=\{a\in\mathbb{R}:0\leq a\leq 1\} from Example 1.2 with upper bound 11, notice that there are many other upper bounds for this set. For instance, 22 is also an upper bound for AA since it is also true that a≤2a\leq 2 for all a∈Aa\in A. Indeed, any number x≥1x\geq 1 is an upper bound for AA.

Exercise 1.8.

Let A⊆ℝA\subseteq\mathbb{R}. Show that upper bounds are never unique: in particular, if x∈ℝx\in\mathbb{R} is an upper bound for AA, then there exists some y∈ℝy\in\mathbb{R} with y≠xy\neq x such that yy is also an upper bound for AA.

Continuing with the set A:={a∈ℝ:0≤a≤1}A:=\{a\in\mathbb{R}:0\leq a\leq 1\} from Example 1.2, note that any number x∈ℝx\in\mathbb{R} satisfying x<1x<1 is not an upper bound for AA, since 1∈A1\in A. From these observations, we see that the upper bounds for AA in ℝ\mathbb{R} are precisely those numbers x≥1x\geq 1.

Exercise 1.9.

Find all the upper bounds for the following sets:

  1. (i)
    ​

    {a∈ℝ:3≤a≤4}\{a\in\mathbb{R}:3\leq a\leq 4\};

  2. (ii)
    ​

    {a∈ℝ:0≤a≤1}∪{a∈ℝ:3≤a≤4}\{a\in\mathbb{R}:0\leq a\leq 1\}\cup\{a\in\mathbb{R}:3\leq a\leq 4\}.

In Example 1.2 the upper bound 11 is special: it is the least possible (one might say most efficient) upper bound for AA. This leads to the following important definition.

Definition 1.10.

Let A⊆ℝA\subseteq\mathbb{R}. We say s∈ℝs\in\mathbb{R} is a least upper bound (or supremum) for AA if both

  1. (i)
    ​

    ss is an upper bound for AA, and

  2. (ii)
    ​

    if x∈ℝx\in\mathbb{R} is an upper bound for AA, then x≥sx\geq s.

In this case, we write s=supAs=\sup A.

Exercise 1.11.

Let A⊆ℝA\subseteq\mathbb{R}. Show that if a least upper bound for AA exists, then it must be unique. In other words, if s1s_{1}, s2∈ℝs_{2}\in\mathbb{R} are least upper bounds for AA, then s1=s2s_{1}=s_{2}.

In light of the previous exercise, if A⊆ℝA\subseteq\mathbb{R} has a least upper bound, then we can refer to it as the (definite article) least upper bound or the supremum of AA.

Example 1.12.

For the set A:={a∈ℝ:0≤a≤1}A:=\{a\in\mathbb{R}:0\leq a\leq 1\}, we know from Example 1.2 that

  1. 1.
    ​

    The number 11 is an upper bound for AA;

  2. 2.
    ​

    If x∈ℝx\in\mathbb{R} is an upper bound for AA, then x≥1x\geq 1.

Hence the least upper bound for AA is 11: in other words, supA=1\sup A=1.

Exercise 1.13.

Find the least upper bound of each of the sets from Exercise 1.9.

So far our examples have been fairly straightforward and do not provide a particularly new insight into numbers. However, the following example is going to change all that!

Example 1.14 (Important example!).

Suppose we temporarily restrict ourselves to the world of rational numbers. Consider the set of rational numbers S:={a∈ℚ:a2≤2}S:=\{a\in\mathbb{Q}:a^{2}\leq 2\}.

If a≥2a\geq 2, then a2≥4a^{2}\geq 4 and so a∉Sa\notin S. It therefore follows that 22 is an upper bound for SS (why?), so SS is bounded above.

However, there are smaller upper bounds. For instance, 1.51.5 is an upper bound. So too is 1.421.42 and 1.4151.415 and 1.41431.4143 (can you see where these numbers are coming from?). We can in fact form a whole sequence of upper bounds which get successively smaller.

What we would like to say is that 2\sqrt{2} is the least upper bound for SS. However, we know that 2\sqrt{2} does not exist in ℚ\mathbb{Q}. Using these observations, one can show that, although the set is bounded above, SS has no least upper bound in ℚ\mathbb{Q}. You are asked to make this line of reasoning precise later in Exercise 1.48. Thus, although S⊆ℚS\subseteq\mathbb{Q}, to find the supremum of SS we need to leave the world of rationals, and enter the reals.

Example 1.14 is very important, since it helps motivate the completeness axiom.