Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 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)(X,d) be a metric space (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric) and let A,BXA, B \subseteq X.

Bounded subset. AA is bounded if A=A = \emptyset or there are x0Xx_0 \in X and a real r>0r > 0 with AB(x0,r)A \subseteq B(x_0, r) (Open ball, closed ball and sphere in a metric space). The space (X,d)(X,d) is a bounded metric space if XX is a bounded subset of itself.

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

D(A):={d(a,b):a,bA}R.D(A) := \{\, d(a,b) : a, b \in A \,\} \subseteq \mathbb{R}.

Then D(A)D(A) is nonempty, since AA is, and it is bounded above: fixing x0x_0 and rr with AB(x0,r)A \subseteq B(x_0,r), every a,bAa, b \in A satisfy d(a,b)d(a,x0)+d(x0,b)<r+rd(a,b) \le d(a,x_0) + d(x_0,b) < r + r by the triangle inequality, symmetry (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = 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+rr + r is an upper bound of D(A)D(A) (Lower bound, bounded below, bounded set). Hence D(A)D(A) has a least upper bound in R\mathbb{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):=supD(A).\operatorname{diam}(A) := \sup D(A).

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

Distance between two sets, for nonempty AA and BB only. Put E(A,B):={d(a,b):aA, bB}E(A,B) := \{\, d(a,b) : a \in A,\ b \in B \,\}, again nonempty and bounded below by 00, and define

d(A,B):=infE(A,B).d(A,B) := \inf E(A,B).

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

  • diam(A)\operatorname{diam}(A) is defined exactly when AA is nonempty and bounded. It is not defined for A=A = \emptyset, and it is not defined, not even as an infinite value, for an unbounded AA.
  • d(x,A)d(x,A) is defined exactly when AA \ne \emptyset, and d(A,B)d(A,B) exactly when both AA and BB are nonempty. No boundedness is needed for these two, because 00 is always a lower bound.

Remarks

Depends on

Used by

…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