How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Epsilon characterisation of the supremum
Statement
Let be nonempty and bounded above, and let be an upper bound of (Complete ordered field (least-upper-bound property)). Then
In words: among the upper bounds of , the supremum is exactly the one that cannot be lowered by any positive amount and still bound .
Facts & Assumptions
Given: A nonempty that is bounded above, and an upper bound of ; since is nonempty and bounded above, exists.
Supremum: exactly when is an upper bound of and for every upper bound of ; and every nonempty subset of that is bounded above has such a least upper bound (Complete ordered field (least-upper-bound property)).
The least upper bound is unique, so the equation says precisely that is a least upper bound of (Suprema and infima are unique).
The order is total: for exactly one of , , holds, so the negation of is ; and holds exactly when (Complete ordered field (least-upper-bound property), Ordered field). (Translation invariance follows in one line from that last equivalence, since , but no step below uses it and it is not claimed here as a quoted result.)
Proof
For the forward implication assume , that is, is an upper bound of that is every upper bound of , and let be arbitrary.
For the converse implication assume that is an upper bound of such that for every there exists with , and let be an arbitrary upper bound of .
Since , we have .
By totality either or ; in the second case put , so that and .
The element is not an upper bound of : if it were, the leastness of among upper bounds would give , which contradicts by trichotomy.
In that second case the hypothesis applied to yields with , so fails, contradicting that is an upper bound of ; the second case is therefore impossible and .
Failing to be an upper bound of means precisely that some does not satisfy , and by totality that says ; since was arbitrary, the forward implication is proved.
Since was an arbitrary upper bound of , we get for every upper bound ; as is itself an upper bound, is a least upper bound of , hence by uniqueness, which proves the converse implication.
Both implications hold, so for an upper bound of a nonempty set bounded above, if and only if for every there is with .
Depends on
Used by
- Every nondegenerate interval of ℝ is uncountable Corollary
- On (0,1) the identity is bounded with no greatest value and x ↦ 1/x is continuous and unbounded, so the extreme value theorem needs compactness and not merely boundedness of the domain Counterexample
- The identity on (0,1) is bounded with no greatest value, and on [0,∞) it is continuous and unbounded Counterexample
- For bounded f on [a,b] and a partition P: the infimum mᵢ and supremum Mᵢ of f on the i-th subinterval, and the lower and upper Darboux sums L(f,P) = ∑ᵢ mᵢ Δᵢ and U(f,P) = ∑ᵢ Mᵢ Δᵢ Definition
- Assuming the Axiom of Choice, compactness of [0,1] derived from the subbase lemma alone, using only the rays as a subbasis and the least upper bound property Example
- sup(0,1) = 1 and inf(0,1) = 0, with neither attained Example
- sup{q ∈ ℚ : q > 0, q² < 2} = √2 in ℝ, and no supremum in ℚ Example
- The supremum metric d_∞(f,g) = supₓ |f(x) - g(x)| on the bounded real-valued functions on a set Example
- FALSE: a continuous real function on a bounded domain attains a greatest value False statement
- FALSE: the supremum of a set belongs to the set False statement
- Epsilon characterisation of the infimum Lemma
- Supremum of a scalar multiple Lemma
- Supremum of a sumset: sup(S + T) = sup S + sup T Lemma
- Supremum of a translate: sup(a + S) = a + sup S Lemma
- The graph of the piecewise-linear map oscillating between 0 and 1 on the intervals [1/(n+2), 1/(n+1)] is path-connected, its closure adds the segment {0} × [0,1], and that closure is connected, is not path-connected because no path joins the segment to the graph, and is not locally connected Lemma
- Conventions: sup ∅, unbounded sets, and the extended reals Remark
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value Theorem
- A nondecreasing sequence bounded above converges to the supremum of its range, and a nonincreasing sequence bounded below to the infimum Theorem
- A subset of ℝ is connected if and only if it is order-convex, that is, an interval Theorem
- Every open subset of ℝ is a countable disjoint union of open intervals, namely its order components Theorem
- Existence and uniqueness of n-th roots: a unique a^1/n ≥ 0 with (a^1/n)ⁿ = a Theorem
- Extreme value theorem: a continuous real function on a nonempty compact subset of ℝ attains a greatest and a least value Theorem
- One-sided limits of a monotone function always exist: for f nondecreasing on an interval I and c ∈ I, lim_x → c⁻ f(x) = sup{f(x) : x ∈ I, x < c} whenever I has points below c, lim_x → c⁺ f(x) = inf{f(x) : x ∈ I, x > c} whenever it has points above c, and these satisfy lim_x → c⁻ f(x) ≤ f(c) ≤ lim_x → c⁺ f(x) Theorem
- ℝ is uncountable (Cantor's nested intervals, 1874) Theorem
- Riemann's criterion on a nondegenerate rectangle in ℝᵐ: integrability is equivalent to arbitrarily small Darboux gaps Theorem
- Riemann's criterion: a bounded f on [a,b] is Darboux integrable if and only if for every real ε > 0 there is a partition P with U(f,P) - L(f,P) < ε Theorem
- Rudin 4.20, the sharp converse: on a noncompact E ⊆ ℝ there is an unbounded continuous function and a bounded continuous function with no greatest value, and if E is bounded there is a continuous function on E that is not uniformly continuous Theorem
- Semicontinuous extreme value theorem: an upper semicontinuous function on a nonempty compact K ⊆ ℝ is bounded above and attains a maximum, and a lower semicontinuous one is bounded below and attains a minimum Theorem
- The Cantor function is well defined, satisfies c(x) ≤ c(y) whenever x ≤ y, is surjective onto [0,1], and is constant on every interval removed from the Cantor set Theorem
- The Darboux and Riemann definitions agree: a bounded f on [a,b] is Darboux integrable with integral I if and only if for every real ε > 0 there is a real δ > 0 such that |S(f,P,ξ) - I| < ε for every tagged partition of mesh below δ Theorem
- The multidimensional Darboux and tagged-mesh definitions of the Riemann integral agree Theorem
- The rational-supremum construction of real powers agrees with the exponential construction Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 6 results over 6 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Infimum and supremum (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 (standard reference, not scraped)
- T. Tao, Analysis I, 3rd ed. (standard reference, not scraped)
- David H. Ernst, An Introduction to Proof via Inquiry-Based Learning, Section 5.1 (standard reference, not scraped)
- John K. Hunter, An Introduction to Real Analysis (standard reference, not scraped)