TOPIC 1 / 2
Suprema, Epsilon Bounds & Compactness
For a long equation, swipe sideways inside its formula box to see every term.
Meaning & notation
Epsilon proofs guarantee requested accuracy. Suprema describe sharp bounds, even outside a set. Compactness prevents continuous functions from losing extrema through missing boundaries or infinity.
- Supremum and maximum
- An upper bound dominates every element of a set. Its least possible value is the supremum. A maximum is an upper bound that also belongs to the set.
- Sequence limit
- A sequence converges to L when every positive tolerance eventually bounds all errors . The threshold N may depend on , but not on the later index n.
- Compact set
- A set is compact when every cover by open sets has a finite subcover. In finite-dimensional Euclidean space, this is equivalent to being closed and bounded.
Conditions before calculation
- Real completeness guarantees a real supremum for a nonempty subset of R bounded above; neither emptiness nor an unbounded set meets this statement.
- The closed-and-bounded criterion applies in Rᵈ with its usual distance and finite d; it is not a general criterion in arbitrary metric spaces.
- The extreme value theorem needs a continuous real-valued function on a nonempty compact domain. A function-limit statement uses a cluster point of its domain.
Why the method works
1. Read the quantifiers in order
The challenger chooses first; then choose one integer N that controls every later term. A threshold chosen separately for each n would not establish convergence.
2. Prove sharpness, not just boundedness
To prove s is a supremum, show it bounds the set and that every smaller candidate fails. An element within below s supplies the second part.
3. Control a function locally
For near 2, factor the error. First impose so ; then a delta independent of the approaching x forces the requested error.
Worked examples
EXAMPLE 1
For positive integers n, find the limit and supremum of , and decide whether a maximum exists.
Every term is below 4 because the subtracted fraction is positive.
Given , choose N=⌈⌉. For , the denominator exceeds .
Thus terms get above every proposed upper bound smaller than 4. No term equals 4, and increasing n strictly increases the term.
Conclusion: The limit and supremum are 4; there is no maximum.
EXAMPLE 2
Find the extrema of on the interval [−1,3].
The interval is nonempty, closed, and bounded; the polynomial is continuous, so extrema exist.
Complete the square. Its smallest possible square is zero, reached at .
On this interval, , with equality at −1. Therefore the largest square is 9.
Conclusion: The minimum is −4 at ; the maximum is 5 at .
Pitfalls & counterexamples
Tempting claim: A bounded domain guarantees that a continuous function attains its bounds.
Correction: The compactness hypothesis cannot be replaced by boundedness alone.
Test the claim: The continuous function on (−1,3) has supremum 3 but no maximum.
Check your understanding
Does the set {} contain its supremum?
Write a reason before opening the explanation. This reflection is not graded or saved.
Compare your reasoning
No; its supremum is 1.
Every term is smaller than 1, while arbitrarily large n make the difference arbitrarily small.
Connect this idea
Quantifier control prepares uniform convergence. Compactness links local continuity to global bounds and supports rigorous existence arguments in optimization.
Reference reading
Use these texts to study the underlying definitions and theorems in greater depth. The explanations and examples above are written for Numerive.