Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-02 (claude-opus-5)
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 (X,d) be a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric) and let A,B⊆X.

Bounded subset. A is bounded if A=∅ or there are x0∈X and a real r>0 with A⊆B(x0,r) (Open ball, closed ball and sphere in a metric space). The space (X,d) is a bounded metric space if X is a bounded subset of itself.

Diameter, for nonempty bounded A only. Suppose A is nonempty and bounded, and put

D(A):={ d(a,b):a,b∈A }⊆R.

Then D(A) is nonempty, since A is, and it is bounded above: fixing x0 and r with A⊆B(x0,r), every a,b∈A satisfy d(a,b)≤d(a,x0)+d(x0,b)<r+r by the triangle inequality, symmetry (Metric space: d(x,y)=0 iff x=y, 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 r+r is an upper bound of D(A) (Lower bound, bounded below, bounded set). Hence D(A) has a least upper bound in R by the least-upper-bound property (Complete ordered field (least-upper-bound property)), and that bound is unique (Suprema and infima are unique). Define

diam⁡(A):=sup⁡D(A).

Distance from a point to a set, for nonempty A only. Let x∈X and let A be nonempty, and put E(x,A):={ d(x,a):a∈A }. Then E(x,A) is nonempty and bounded below by 0, 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

d(x,A):=inf⁡E(x,A).

Distance between two sets, for nonempty A and B only. Put E(A,B):={ d(a,b):a∈A, b∈B }, again nonempty and bounded below by 0, and define

d(A,B):=inf⁡E(A,B).

Every one of the three scope restrictions is load bearing. In this library sup⁡ and inf⁡ 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 sup⁡∅=−∞ is in force in this development (Conventions: sup⁡∅, unbounded sets, and the extended reals). Accordingly:

  • diam⁡(A) is defined exactly when A is nonempty and bounded. It is not defined for A=∅, and it is not defined, not even as an infinite value, for an unbounded A.
  • d(x,A) is defined exactly when A≠∅, and d(A,B) exactly when both A and B are nonempty. No boundedness is needed for these two, because 0 is always a lower bound.

Remarks

Depends on

Used by

…and 62 more results.

Dependency tree · two levels

26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources