Deep Dive into Bounds and Extrema of Sets: Supremum & Infimum
Why does this topic matter? Imagine building a bridge. You calculate the maximum load the bridge can handle. But what if the load never reaches a specific maximum, but instead creeps infinitely close to a certain value? What separates the Real Numbers ($\mathbb{R}$) from the Rational Numbers ($\mathbb{Q}$)? The Greeks discovered, to their horror, that $\sqrt{2}$ cannot be expressed as a fraction. This meant the rational number line has "holes". If you walk along the rational number line looking for $\sqrt{2}$, you will fall into the abyss. The concept of the Supremum (Least Upper Bound) is the mathematical glue invented to patch these holes, creating the continuum we call the Real Number Line.
Deep Intuition: The Invisible Ceiling
Let us step away from formulas for a moment.
Imagine you are in a room with a balloon. You let the balloon go, and it floats upwards until it hits the ceiling. The ceiling acts as an Upper Bound. The balloon cannot go higher than the ceiling. In fact, the roof of the building is also an upper bound. The clouds are an upper bound. The moon is an upper bound.
But among all these upper bounds, the ceiling of the room is special. It is the lowest possible upper bound. This is your Supremum (Least Upper Bound).
Now, imagine a set of numbers that gets closer and closer to $1$, but never quite reaches it:
$S = \{0.9, 0.99, 0.999, \dots\}$
Is $1$ in the set? No. Can we say $1$ is the "maximum" of the set? No, because a maximum must belong to the set. However, $1$ acts as an invisible ceiling that the set approaches but never penetrates. The number $1$ is the Supremum.
Key Intuitive Difference between Maximum and Supremum:
- Maximum: You can touch the ceiling, and the ceiling belongs to you.
- Supremum: The lowest possible ceiling. You might touch it, or you might only get infinitely close to it. Every maximum is a supremum, but not every supremum is a maximum.
Formal Definitions
Let us rigorously define these concepts. Let $S$ be a non-empty subset of $\mathbb{R}$.
- Upper Bound: A real number $M$ is called an upper bound of $S$ if $x \le M$ for all $x \in S$.
- Lower Bound: A real number $m$ is called a lower bound of $S$ if $m \le x$ for all $x \in S$.
If $S$ has an upper bound, it is said to be bounded above. If $S$ has a lower bound, it is bounded below. A set bounded both above and below is simply called bounded.
A real number $u$ is called the supremum of $S$, denoted as $u = \sup S$, if it satisfies two conditions:
- $u$ is an upper bound of $S$ ($\forall x \in S, x \le u$).
- If $v$ is any other upper bound of $S$, then $u \le v$ (it is the least among all upper bounds).
A real number $w$ is called the infimum of $S$, denoted as $w = \inf S$, if:
- $w$ is a lower bound of $S$ ($\forall x \in S, w \le x$).
- If $t$ is any other lower bound of $S$, then $t \le w$ (it is the greatest among all lower bounds).
Classification and Types of Extrema
Understanding the subtle classification is crucial for CSIR NET Part C multiple-choice questions.
| Set Characteristics | Example | Supremum & Infimum Behavior |
|---|---|---|
| Bounded, has Max & Min | $[0, 1]$ | $\max = \sup = 1$, $\min = \inf = 0$ |
| Bounded, NO Max or Min | $(0, 1)$ | $\sup = 1 \notin S$, $\inf = 0 \notin S$ |
| Bounded above, Unbounded below | $(-\infty, 5]$ | $\max = \sup = 5$, $\inf = -\infty$ |
| Bounded below, Unbounded above | $\{1, 2, 3, \dots \}$ | $\min = \inf = 1$, $\sup = \infty$ |
| Unbounded in both directions | $\mathbb{Z}$ | $\sup = \infty$, $\inf = -\infty$ |
| Empty Set | $\emptyset$ | $\sup = -\infty$, $\inf = \infty$ (See Advanced Section) |
Major Theorems (With Full Proofs)
Every non-empty subset of $\mathbb{R}$ that is bounded above has a supremum in $\mathbb{R}$.
Importance: This is NOT a theorem we prove from simpler real number properties; it is an axiom that defines $\mathbb{R}$. The rational numbers $\mathbb{Q}$ do NOT have this property.
Let $S$ be a non-empty subset of $\mathbb{R}$ bounded above, and let $u \in \mathbb{R}$. Then $u = \sup S$ if and only if:
- $x \le u$ for all $x \in S$ (i.e., $u$ is an upper bound).
- For every $\epsilon > 0$, there exists an $x_\epsilon \in S$ such that $u - \epsilon < x_\epsilon$.
Intuition: If $u$ is the lowest possible ceiling, then if you lower the ceiling even by a microscopic amount $\epsilon$, it is no longer a ceiling! Some element $x_\epsilon$ from the set will "poke through" the lowered ceiling $u - \epsilon$.
Proof:
Forward Direction ($\implies$): Let $u = \sup S$. By definition, $u$ is an upper bound, so condition (1) holds. Suppose for contradiction that condition (2) fails. Then there exists some $\epsilon > 0$ such that NO element of $S$ is strictly greater than $u - \epsilon$. This means $x \le u - \epsilon$ for all $x \in S$. But this implies $u - \epsilon$ is an upper bound for $S$. Since $\epsilon > 0$, $u - \epsilon < u$. This contradicts the fact that $u$ is the least upper bound. Hence, condition (2) must hold.
Reverse Direction ($\impliedby$): Assume conditions (1) and (2) hold. Condition (1) means $u$ is an upper bound. To show it is the least upper bound, let $v$ be any upper bound of $S$. We must show $u \le v$. Assume for contradiction that $v < u$. Then $u - v > 0$. Let $\epsilon = u - v$. By condition (2), there exists $x \in S$ such that $x > u - \epsilon = u - (u - v) = v$. So $x > v$. But $v$ is an upper bound, so $x \le v$. Contradiction ($x > v$ and $x \le v$). Thus, $u \le v$, proving $u = \sup S$. $\blacksquare$
Let $A$ and $B$ be non-empty subsets of $\mathbb{R}$ bounded above. Define $A+B = \{a+b : a \in A, b \in B\}$. Then:
$$ \sup(A+B) = \sup A + \sup B $$
Proof:
Let $u = \sup A$ and $v = \sup B$. We must show $\sup(A+B) = u+v$.
Step 1 (Upper Bound): For any $x \in A+B$, $x = a+b$ for some $a \in A, b \in B$. Since $a \le u$ and $b \le v$, we have $a+b \le u+v$. Thus, $u+v$ is an upper bound for $A+B$. Therefore, $\sup(A+B) \le u+v$.
Step 2 (Least Upper Bound): Let $\epsilon > 0$. By the Approximation Property for $A$ and $B$, there exist $a \in A$ and $b \in B$ such that:
$a > u - \frac{\epsilon}{2}$ and $b > v - \frac{\epsilon}{2}$.
Adding these inequalities yields:
$a+b > u + v - \epsilon$.
Since $a+b \in A+B$, this shows that no number strictly less than $u+v$ can be an upper bound for $A+B$. By the $\epsilon$-characterization, $\sup(A+B) = u+v$. $\blacksquare$
Let $S \subset \mathbb{R}$ be non-empty and bounded above. Define $cS = \{cx : x \in S\}$.
- If $c \ge 0$, then $\sup(cS) = c \cdot \sup S$.
- If $c < 0$, then $\sup(cS) = c \cdot \inf S$.
Proof idea for $c < 0$: Multiplying by a negative number flips inequalities. The "ceiling" flips to become the "floor", so the supremum maps to the infimum.
Deep Worked Examples
Mastery comes through exposure to diverse sets. Here are carefully selected examples ranging from basic to advanced.
Solution:
A finite set always contains its bounds.
$\sup S = \max S = 8$, $\inf S = \min S = -5$. $\blacksquare$
Solution:
Upper bounds are $[1, \infty)$. The least is $1$. Lower bounds are $(-\infty, 0]$. The greatest is $0$.
$\sup S = 1, \inf S = 0$. Neither belongs to $S$. $\blacksquare$
Solution:
The maximum value is clearly $1$ for $n=1$. The sequence decreases towards $0$ but never reaches it. By Archimedean property, $\inf S = 0$.
$\sup S = 1$ (belongs to $S$), $\inf S = 0$ (does not belong). $\blacksquare$
Solution:
Split into even and odd $n$.
Even $n=2k$: $1 - \frac{1}{2k} \to 1$. Terms are $1/2, 3/4, 5/6, \dots$ which are bounded above by $1$.
Odd $n=2k-1$: $-\left(1 - \frac{1}{2k-1}\right) \to -1$. Terms are $0, -2/3, -4/5, \dots$ bounded below by $-1$.
$\sup S = 1, \inf S = -1$. $\blacksquare$
Solution:
To maximize $a-b$, we need to maximize $a$ and minimize $b$.
$\sup(A-B) = \sup A - \inf B = 5 - 1 = 4$.
To minimize $a-b$, minimize $a$ and maximize $b$.
$\inf(A-B) = \inf A - \sup B = 0 - 3 = -3$. $\blacksquare$
Common Mistakes & Misconceptions
❌ Exam Traps to Avoid
Wrong: "$\sup(A-B) = \sup A - \sup B$" | Correct: $\sup(A-B) = \sup A - \inf B$ (See Example 5).
Wrong: "Every subset of $\mathbb{R}$ has a supremum." | Correct: The Completeness Axiom requires the set to be bounded above. If $S = \mathbb{N}$, there is no real upper bound. We write $\sup \mathbb{N} = \infty$.
Wrong: "The supremum of $a_n = \frac{(-1)^n}{n}$ is $0$ because the limit is $0$." | Correct: Limits describe asymptotic behavior; extrema describe absolute bounds. $\sup \{a_n\} = \frac{1}{2}$ (for $n=2$), and $\inf \{a_n\} = -1$ (for $n=1$).
Advanced Insights (Expert Level)
What do top 1% students notice that others don't?
1. The Empty Set Paradox:
What is the supremum of the empty set $\emptyset$? By definition, an upper bound of $\emptyset$ is a number $u$ such that $\forall x \in \emptyset, x \le u$. This statement is vacuously true for every real number! So, every real number is an upper bound. The least upper bound would logically be $-\infty$. Thus, mathematically, $\sup \emptyset = -\infty$ and $\inf \emptyset = \infty$. Notice the bizarre inversion: $\sup \emptyset < \inf \emptyset$.
2. Dedekind Cuts & Order Completeness:
The fact that $\mathbb{R}$ has the supremum property is equivalent to saying $\mathbb{R}$ has no "gaps". Richard Dedekind formalized this by defining real numbers as "cuts" of rational numbers. The supremum of a set of lower rationals simply defines the real number at the cut.
3. Functions vs Sets:
When we talk about the supremum of a function $f: X \to \mathbb{R}$, we are strictly talking about the supremum of its image set: $\sup f = \sup \{f(x) : x \in X\}$.
- Look for Monotonicity: If a sequence defining a set is strictly increasing, its supremum is its limit as $n \to \infty$. If decreasing, its limit is its infimum.
- Calculus Tricks: If a set is defined by $f(x)$ on an interval, simply find the global extrema using $f'(x) = 0$. Evaluate $f$ at the critical points and the boundaries.
- Density Answers: If you see sets defined over $\mathbb{Q}$ or involving fractions, leverage the density of $\mathbb{Q}$ and irrational numbers in $\mathbb{R}$.
⚡ Quick Revision Summary:
- Supremum (LUB): Least Upper Bound. Exists for any bounded above non-empty subset of $\mathbb{R}$.
- Infimum (GLB): Greatest Lower Bound. Exists for any bounded below non-empty subset of $\mathbb{R}$.
- $\sup(A+B) = \sup A + \sup B$
- $\sup(A-B) = \sup A - \inf B$
- $\sup(c \cdot A) = c \cdot \sup A$ (if $c > 0$) and $c \cdot \inf A$ (if $c < 0$).
- $\sup(A \cup B) = \max(\sup A, \sup B)$
- The Completeness Axiom fundamentally distinguishes $\mathbb{R}$ from $\mathbb{Q}$.
How did you find this post?
Tap a reaction — counts are saved permanently.
Found this helpful?
This article is free and will always remain so. If it helped you understand a concept or prepare for your exam, a small token of appreciation keeps this resource going for the next student.