Skip to content
Tutorials Center
My learning

Topics

Lesson 6 of 37 · The Real Numbers

Supremum and Infimum

Understand upper bounds, the supremum (least upper bound) and the infimum, with the epsilon characterization and worked examples you can run.

A set of numbers may have no largest element, yet still have a natural "top edge". The open interval (0, 1) has no maximum, but 1 is clearly its ceiling. The supremum captures that ceiling precisely. It is the central concept of the real numbers, and later it is the engine behind the proofs about limits, continuity and integrals.

Bounds

Let S be a nonempty subset of ℝ.

  • u is an upper bound of S if s ≤ u for every s ∈ S. If one exists, S is bounded above.
  • l is a lower bound if l ≤ s for every s ∈ S. If one exists, S is bounded below.
  • S is bounded if it is bounded above and below.

Example: S = (0, 1). Every number u ≥ 1 is an upper bound; every l ≤ 0 is a lower bound. A set like ℕ is bounded below but not above.

Supremum and infimum

The supremum of S, written sup S, is the least upper bound: a number M such that

  1. M is an upper bound of S, and
  2. if u is any upper bound of S, then M ≤ u.

The infimum, inf S, is the greatest lower bound, defined symmetrically.

If sup S ∈ S it is called the maximum. So:

Set sup inf max / min exist?
[0, 1] 1 0 both
(0, 1) 1 0 neither
{1/n : n ∈ ℕ} 1 0 max 1; no min
{x ∈ ℚ : x² < 2} √2 -√2 neither, and sup is not in ℚ

The last row shows why completeness matters: within ℚ that set has upper bounds but no least one. In ℝ it does.

The epsilon characterization

This is the most useful tool.

Theorem. M = sup S if and only if M is an upper bound of S and for every ε > 0 there exists s ∈ S with s > M - ε.

Proof (⇒). If M - ε were an upper bound, it would be smaller than the least upper bound M, a contradiction. So M - ε is not an upper bound: some s ∈ S exceeds it.

Proof (⇐). If u < M were an upper bound, take ε = M - u > 0. Then some s has s > M - ε = u, contradicting that u is an upper bound. So every upper bound is ≥ M. ∎

In words: you can find elements of S as close below the supremum as you like.

Python Approach the supremum from below

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Computing a supremum: worked example

Let S = { x/(x + 1) : x > 0 }. Since x/(x + 1) = 1 - 1/(x + 1) < 1, the number 1 is an upper bound. For the epsilon test, given ε > 0 we need x with 1/(x + 1) < ε, which holds for x > 1/ε. So sup S = 1. It is not attained.

For an infimum, use the same pattern: show m is a lower bound and that for each ε some element lies below m + ε.

Python Estimate sup and inf numerically

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Sampling suggests values; the epsilon characterization proves them.

Useful facts

  • If A ⊆ B are bounded above, then sup A ≤ sup B.
  • For cA = {ca : a ∈ A} with c > 0: sup(cA) = c · sup A. With c < 0 the sup becomes an inf: sup(cA) = c · inf A.
  • For A + B = {a + b}: sup(A + B) = sup A + sup B.
  • inf S = -sup(-S), so every statement about infima follows from one about suprema.
flowchart LR
  A["S bounded above"] --> B["set of all upper bounds"]
  B --> C["least element = sup S"]

The supremum is the smallest of all upper bounds.

Check your understanding

Quick check · 4 questions

of 4 answered You scored / 4 · perfect!

  1. 1. What is sup of the set (0, 1)?

    1 is an upper bound and nothing smaller is, even though 1 is not in the set.
  2. 2. Which statement characterizes M = sup S?

    That is the epsilon characterization: no number smaller than M can be an upper bound.
  3. 3. What is inf of {1/n : n in ℕ}?

    0 is a lower bound and for any ε > 0 there is n with 1/n < ε. Note that 0 is not in the set.
  4. 4. If A ⊆ B and both are bounded above, then

    Any upper bound of B is an upper bound of A, so the least upper bound of A cannot exceed that of B.

Summary

  • An upper bound caps a set; the supremum is the least upper bound, the infimum the greatest lower bound.
  • A sup need not belong to the set; if it does, it is the maximum.
  • M = sup S iff M bounds S above and for each ε > 0 some s ∈ S has s > M - ε.
  • inf S = -sup(-S), so results about sup carry over to inf.

Next: The Completeness Axiom and the Archimedean Property