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.
Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
Definition
Let be a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric) and let .
Bounded subset. is bounded if or there are and a real with (Open ball, closed ball and sphere in a metric space). The space is a bounded metric space if is a bounded subset of itself.
Diameter, for nonempty bounded only. Suppose is nonempty and bounded, and put
Then is nonempty, since is, and it is bounded above: fixing and with , every satisfy by the triangle inequality, symmetry (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric) and addition of inequalities (Order is preserved by adding a constant and by adding inequalities, Ordered field), so is an upper bound of (Lower bound, bounded below, bounded set). Hence has a least upper bound in by the least-upper-bound property (Complete ordered field (least-upper-bound property)), and that bound is unique (Suprema and infima are unique). Define
Distance from a point to a set, for nonempty only. Let and let be nonempty, and put . Then is nonempty and bounded below by , since a metric is nonnegative (Nonnegativity of a metric is a consequence of the other axioms, not an axiom, Lower bound, bounded below, bounded set), so it has a greatest lower bound (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)), unique by Suprema and infima are unique. Define
Distance between two sets, for nonempty and only. Put , again nonempty and bounded below by , and define
Every one of the three scope restrictions is load bearing. In this library and denote real numbers and are written only after existence has been established; the extended real line is introduced on a later page and is not used for the suprema and infima taken here, and no convention is in force in this development (Conventions: , unbounded sets, and the extended reals). Accordingly:
- is defined exactly when is nonempty and bounded. It is not defined for , and it is not defined, not even as an infinite value, for an unbounded .
- is defined exactly when , and exactly when both and are nonempty. No boundedness is needed for these two, because is always a lower bound.
Remarks
- Diameter and the distance functions are nonnegative. For nonempty bounded and any we have , so ; and , because is a lower bound of the sets they are infima of (Nonnegativity of a metric is a consequence of the other axioms, not an axiom, Greatest lower bound (infimum)).
- is not a metric on the nonempty subsets of . It is symmetric and vanishes on , but two distinct disjoint sets can be at distance , so the separation axiom (M1) of Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric fails; the witness is on the companion page. The letter is reused for three different functions here, the metric, the point-to-set distance and the set-to-set distance, only because the arguments make the intended one unambiguous.
- is the special case , since , and the two infima therefore agree by uniqueness (Suprema and infima are unique).
Depends on
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Open ball, closed ball and sphere in a metric space
- Lower bound, bounded below, bounded set
- Greatest lower bound (infimum)
- Every nonempty set bounded below has an infimum
- Suprema and infima are unique
- Complete ordered field (least-upper-bound property)
- Nonnegativity of a metric is a consequence of the other axioms, not an axiom
- Conventions: $\sup \emptyset$, unbounded sets, and the extended reals
- Order is preserved by adding a constant and by adding inequalities
- Ordered field
Used by
- A subset of ℝⁿ with the product topology is compact exactly when it is closed and bounded, the product topology being the Euclidean metric topology Corollary
- For n ≥ 1 every bounded sequence in ℝⁿ has a convergent subsequence Corollary
- For n≥1, every Euclidean closed ball and every Euclidean sphere of positive radius is compact Corollary
- A continuous function on [0,1] can have unbounded variation Counterexample
- 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
- ℕ with the discrete metric is bounded and is not totally bounded Counterexample
- 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
- On ℕ with d(m,n) = 1 + 1/(m+n) for m ≠ n the sets {n, n+1, …} are nested, closed, bounded and complete with empty intersection Counterexample
- ℝ carries both an unbounded and a bounded metric inducing the same topology Counterexample
- Refuted: a pointwise bounded family of continuous functions is equicontinuous. The spikes are bounded by 1 everywhere and are not equicontinuous at 0 Counterexample
- Refuted: convergence uniformly on every compact subset of ℝ implies uniform convergence. The maps x ↦ x/(n+1) separate the two Counterexample
- ℝⁿ is closed and unbounded and is not compact for n≥1 Counterexample
- The cover of (0,1) by the intervals (1/(k+2), 1) has no Lebesgue number, so the Lebesgue number lemma needs compactness Counterexample
- ℤ and {n + 1/n : n ≥ 2} are disjoint closed subsets of ℝ at distance 0, so the set-to-set distance is not a metric Counterexample
- Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces Definition
- Finite ε-net and totally bounded metric space Definition
- Jordan inner and outer content and Jordan measurable bounded sets in ℝᵐ Definition
- Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space Definition
- The Riemann integral of a bounded function over a bounded Jordan measurable set Definition
- [0,1] and the Cantor set are compact, by Heine-Borel and by closedness inside [0,1]; and, assuming the Axiom of Choice, so is [0,1]^ℕ, by Tychonoff Example
- Every nonempty closed subset A of ℝ is the zero set of x ↦ d(x, A) and the intersection of the open sets {x : d(x,A) < 1/(n+1)}, worked for [0,1] and for {0} Example
- In a metric space the function d(x,A)/(d(x,A) + d(x,B)) separates two disjoint closed sets outright, so the metric case spends no choice principle Example
- min(|x-y|, 1) on ℝ has the usual topology and diameter at most 1 Example
- On C(ℝ, ℝ) the compact-open topology has the sets {g : sup_[-m,m] |f-g| < ε} as a neighbourhood base, and ℝ is locally compact so evaluation is continuous Example
- ℝ^* is homeomorphic to the unit circle by inverse stereographic projection, and ℕ^* is the ordinal space ω + 1 Example
- The 1-Lipschitz maps of a metric space into ℝ form a uniformly equicontinuous family, and the distance functions x ↦ d(x,A) all belong to it Example
- The cover of [0,1] by (-1, 2/3) and (1/3, 2) has Lebesgue number 1/3, and no larger one Example
- The distance from a point to a nonempty compact set is attained at a point of that set, and two disjoint compact sets are at positive distance Example
- The distance ψ(x) = d(x, ℤ) from a real number to the integers is 1-Lipschitz, hence uniformly continuous, takes values in [0,1/2], and vanishes exactly on ℤ Example
- The map (x,z) ↦ x · z on ℝ × ℝ and its transpose z ↦ (x ↦ x · z) traced through the exponential law Example
- FALSE: a bounded metric space is totally bounded False statement
- FALSE: a closed and bounded subset of a metric space is compact False statement
- FALSE: a pointwise convergent sequence of continuous functions converges uniformly on every compact set False statement
- FALSE: a sequence in ℝⁿ whose coordinate sequences are each bounded converges False statement
- FALSE: boundedness of a metric space is determined by its topology False statement
- FALSE: in every normed space a closed bounded set is compact False statement
- FALSE: in the substitution theorem the continuity of f may be weakened to integrability, f∘φ still being integrable False statement
- FALSE: the evaluation map on C(X,Y) with the compact-open topology is continuous for every metric X False statement
- |d(x,A) - d(y,A)| ≤ d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz Lemma
- A definite quadratic form has a uniform signed bound on the Euclidean unit sphere Lemma
…and 22 more results.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 35 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
- Bounded set (Wikipedia) (standard reference, not scraped)
- Diameter (Wikipedia) (standard reference, not scraped)
- Hausdorff distance (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (standard reference, not scraped)
- R. Gardner, Introduction to Topology, notes on Munkres Section 20: The Metric Topology (East Tennessee State University) (standard reference, not scraped)