$$ \def\R{\mathbb R} \def\N{\mathbb N} \def\Q{\mathbb Q} \def\Z{\mathbb Z} \newcommand{\st}{~:~} \newcommand{\cee}{\mathsf{C}} \newcommand{\bee}{\mathrm{B}} \def\mathhlyellow#1{\bbox[##fff3bf,2px,border:1px solid ##b7791f]{#1}} \def\mathhlgold#1{\bbox[##ffe8a3,2px,border:1px solid ##b7791f]{#1}} \def\mathhlorange#1{\bbox[##ffddb3,2px,border:1px solid ##c05621]{#1}} \def\mathhlgreen#1{\bbox[##d9f7d7,2px,border:1px solid ##3f8f46]{#1}} \def\mathhlmint#1{\bbox[##d4f5e9,2px,border:1px solid ##2c7a7b]{#1}} \def\mathhlblue#1{\bbox[##dceeff,2px,border:1px solid ##2b6cb0]{#1}} \def\mathhlpurple#1{\bbox[##eadffd,2px,border:1px solid ##6b46c1]{#1}} \def\mathhlpink#1{\bbox[##ffdbe8,2px,border:1px solid ##b83280]{#1}} \def\mathhlred#1{\bbox[##ffd6d6,2px,border:1px solid ##c53030]{#1}} \def\mathhlgray#1{\bbox[##e8ecef,2px,border:1px solid ##64748b]{#1}} \def\mathhlgrey#1{\bbox[##e8ecef,2px,border:1px solid ##64748b]{#1}} $$

9  Boundedness

Highlights

  • Definition of a bounded subset of a metric space
  • Equivalent conditions to boundedness
  • Boundedness in \(\R\) is equivalent to “bounded above and below”

9.1 Preparation

Theorem 9.1 Let \(X\) be a metric space and let \(S\subseteq X.\) Then the following are equivalent.

  1. For any \(a\in X,\) there exists \(r>0\) such that \(S\subseteq \bee_r(a).\)
  2. There exists \(a\in X\) and \(r>0\) such that \(S\subseteq \bee_r(a).\)

In this case, we say \(S\) is bounded.

Desmos Applet 9.1: An illustration of Condition 1 of the boundedness condition. Wherever the point \(a\) is moved, there is a large enough \(r\) so that the set \(S\) lives inside the open ball.

You will prove Theorem 9.1 in Exercise 9.4 below.

Note

Theorem 9.1 is both a theorem and a definition. Once we prove the conditions are equivalent, we can refer to any one of them as “the” definition of bounded.

Exercise 9.2  

  1. If a problem asks you to prove that a set is bounded, which of the two conditions from Theorem 9.1 would you choose to work with, and why?
  2. If a problem tells you to assume that a set is bounded and you need to apply boundedness in order to prove something else, which of the two conditions from Theorem 9.1 would you choose to work with, and why?

Exercise 9.3 Negate each of the two equivalent characterizations of boundedness.

A subset of a metric space that is not bounded is called unbounded.

9.2 Properties of Boundedness

We start with proving that the two definitions of boundedness are in fact equivalent.

Exercise 9.4 Prove Theorem 9.1.

  1. One of the two implications should be very quick to prove!
  2. Note that \(a\) might lie outside of \(S\) for either of the two conditions.

Exercise 9.5 Let \(S=\{(n,n)\in\R^2\st n\in\N\}.\) Draw a picture of \(S\) and give a careful proof that \(S\) is unbounded.

Exercise 9.6 Suppose \(S_1\) and \(S_2\) are bounded subsets of a metric space \(X.\) Prove that \(S_1\cup S_2\) is bounded.

9.3 Boundedness in \(\R\)

As ever, what we really care about is how this concept applies to \(\R\) and how the concepts defined thus far interact. We’ve already defined “bounded above” and “bounded below”. The next theorem will connect these definitions to our new more general definition of “bounded” for metric spaces.

Theorem 9.7 Suppose \(S\subseteq\R.\) Then the following are equivalent.

  1. \(S\) is bounded.
  2. \(S\) has an upper bound and a lower bound.
  3. There exists \(K>0\) such that for all \(x\in S,\) \(|x|<K.\)

Exercise 9.8 Prove Theorem 9.7.

Desmos Applet 9.2: An illustration of the three equivalent conditions for the boundedness of \(S\) in \(\R\): an open ball \(\bee_r(a),\) the set of \(x\) with \(|x|<K,\) and an upper and lower bound, \(u\) and \(l,\) on \(S.\) A hint for Exercise 9.8 is to think about how to construct the variables for one construction from another.

Exercise 9.9 Prove that the complement of a bounded subset of \(\R\) is unbounded.

Review Questions

  1. What does it mean for a subset of a metric space to be bounded? Unbounded?
  2. With Theorem 9.1 and Theorem 9.7, we have four equivalent ways of describing boundedness in \(\R\); what are they?
  3. Building on Review Question 1 from Chapter 6, think about what theorems or facts relate the major concepts we’ve encountered thus far.
G arithmetic arithmetic inequalities inequalities arithmetic--inequalities least upper bounds least upper bounds arithmetic--least upper bounds distance distance arithmetic--distance inequalities--least upper bounds inequalities--distance least upper bounds--distance open sets open sets open sets--arithmetic open sets--inequalities open sets--least upper bounds open sets--distance boundedness boundedness boundedness--arithmetic boundedness--inequalities boundedness--least upper bounds boundedness--distance boundedness--open sets
Figure 9.1