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.
The supremum metric is a metric on the bounded real-valued functions on a nonempty set
Statement
Let be a nonempty set. Call a function bounded when its range is a bounded subset of (Lower bound, bounded below, bounded set), and write
For put and
This is well defined: is nonempty because is, and it is bounded above (step 1.1 below), so its least upper bound exists (Complete ordered field (least-upper-bound property)) and is unique (Suprema and infima are unique).
Then is a metric on (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric), the supremum metric (also called the uniform metric).
The hypotheses ensure that the formula is a finite real-valued metric for every pair in the stated function space. Boundedness of and makes bounded above, and nonemptiness of makes it nonempty. Some unbounded pairs can still have a finite supremum, but allowing all real-valued functions would not give a finite-valued metric: for example, on the functions and make unbounded above (Conventions: , unbounded sets, and the extended reals).
Facts & Assumptions
Given: A nonempty set and bounded functions , with , and for all ; a fixed .
Bounded subset of : is bounded when there are with for every (Lower bound, bounded below, bounded set).
Least-upper-bound property: a nonempty subset of that is bounded above has a least upper bound, that is an upper bound below every upper bound; it is unique (Complete ordered field (least-upper-bound property), Suprema and infima are unique).
Absolute value: ; if and only if ; ; and equals or (Basic properties of the absolute value, Absolute value in an ordered field).
Two-term triangle inequality: (The triangle inequality).
A two-element subset of has a maximum, which is one of the two elements and bounds both (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
Order arithmetic: inequalities may be added and a constant added to both sides, in the strict form of Order is preserved by adding a constant and by adding inequalities and, together with the case of equality settled by totality (Ordered field, Complete ordered field (least-upper-bound property)), in the nonstrict form used below; and by trichotomy together with gives .
Proof
For every the value is or , and while ; so bounds above, and since makes nonempty, exists and is unique.
Symmetry (M2): for every , so and are the same subset of and therefore have the same supremum.
Separation (M1): bounds above, so ; if then and for every , hence for every and ; conversely if then , whose least upper bound is .
For every : , the last inequality because each supremum bounds its own set above.
Triangle inequality (M3): step 2.2 says the real number is an upper bound of , and is the least upper bound of that set, so .
The function therefore satisfies (M1) by step 2.1, (M2) by step 1.2 and (M3) by step 3.1, so it is a metric on .
Remarks
- Why the bounded functions and not all functions. For unbounded the set need not be bounded above and then does not exist, so would not be a function into at all. Texts that write in that case are working in the extended real line, which is introduced on a later page. The suprema taken here are real numbers, and the extended real line is not used for them (Conventions: , unbounded sets, and the extended reals, Which metric axiom list this library uses, the live naming fork between semimetric and pseudometric, and why extended metrics are not treated here).
- The supremum need not be attained, so is genuinely a supremum and not a maximum; the companion page carries a witness.
- The name "uniform metric" points at later material. The quantified definition of uniform convergence of functions appears in Pointwise convergence, uniform convergence, and the uniformly Cauchy condition for sequences of real-valued functions ↗. The later Agreement of the quantified real-valued definition with the later uniform-metric and uniform-topology formulations ↗ records its agreement with convergence in ; this lemma proves only that is a metric on the stated bounded-function space.
Depends on
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Lower bound, bounded below, bounded set
- Suprema and infima are unique
- Complete ordered field (least-upper-bound property)
- The triangle inequality
- Basic properties of the absolute value
- Absolute value in an ordered field
- Every nonempty finite set of reals has a maximum and a minimum
- Maximum and minimum of a set
- Order is preserved by adding a constant and by adding inequalities
- Ordered field
- Conventions: $\sup \emptyset$, unbounded sets, and the extended reals
Used by
- In the bounded real-valued functions on ℕ with the supremum metric, the closed unit ball is closed and bounded and is not compact: the indicator functions of the singletons are pairwise at distance 1 Counterexample
- C([0,1], ℝ) is complete, and on it the uniform metric and the supremum metric induce the same topology Example
- The bounded real-valued functions on a set, with the supremum metric, form a complete metric space Example
- The supremum metric d_∞(f,g) = supₓ |f(x) - g(x)| on the bounded real-valued functions on a set Example
- For a nonempty set X and a metric space (Y,d) the uniform metric barρ(f,g) = supₓ min{d(f(x),g(x)), 1} is a metric on Y^X Lemma
- Functions satisfying a fixed local Lipschitz bound somewhere form a closed subset of C([0,1]) Lemma
- Agreement of the quantified real-valued definition with the later uniform-metric and uniform-topology formulations Remark
- Standing hypotheses on this page: a metric domain, where the target must be metric, and why the compact-open topology is built from metric compactness Remark
- C(K,ℝ) is complete in the supremum metric for every nonempty compact metric space K Theorem
- If (Y,d) is complete then Y^X is complete in the uniform metric, and so is C(X,Y) Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 42 results over 9 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
- Uniform norm (Wikipedia) (standard reference, not scraped)
- Metric space (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 7 (standard reference, not scraped)