Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-26
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.

Open ball, closed ball and sphere 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), let xXx \in X and let rRr \in \mathbb{R} with r>0r > 0 (Order on the reals). Define

B(x,r):={yX:d(x,y)<r},Bˉ(x,r):={yX:d(x,y)r},S(x,r):={yX:d(x,y)=r}.B(x,r) := \{\, y \in X : d(x,y) < r \,\}, \qquad \bar B(x,r) := \{\, y \in X : d(x,y) \le r \,\}, \qquad S(x,r) := \{\, y \in X : d(x,y) = r \,\}.

B(x,r)B(x,r) is the open ball, Bˉ(x,r)\bar B(x,r) the closed ball and S(x,r)S(x,r) the sphere of centre xx and radius rr. The radius is always a strictly positive real; a ball of radius 00 or of negative radius is never written in this library.

Immediate consequences of the definitions. For every xXx \in X and r>0r > 0:

  • xB(x,r)x \in B(x,r), because d(x,x)=0<rd(x,x) = 0 < r (axiom (M1) of Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric); in particular open and closed balls are nonempty.
  • B(x,r)Bˉ(x,r)B(x,r) \subseteq \bar B(x,r) and S(x,r)Bˉ(x,r)S(x,r) \subseteq \bar B(x,r), and Bˉ(x,r)\bar B(x,r) is the disjoint union of B(x,r)B(x,r) and S(x,r)S(x,r), by trichotomy of the order of R\mathbb{R} (Complete ordered field (least-upper-bound property), Ordered field): each yy satisfies exactly one of d(x,y)<rd(x,y) < r, d(x,y)=rd(x,y) = r, d(x,y)>rd(x,y) > r.
  • If 0<sr0 < s \le r then B(x,s)B(x,r)B(x,s) \subseteq B(x,r) and Bˉ(x,s)Bˉ(x,r)\bar B(x,s) \subseteq \bar B(x,r), by transitivity of the order.
  • Nonnegativity of the metric (Nonnegativity of a metric is a consequence of the other axioms, not an axiom) is what forces the radius convention, and it forces it for the open ball only: if r0r \le 0 then B(x,r)={y:d(x,y)<r}B(x,r) = \{y : d(x,y) < r\} is empty, because d(x,y)0rd(x,y) \ge 0 \ge r for every yy. The other two sets behave differently at r=0r = 0, and the convention r>0r > 0 excludes them for uniformity rather than for emptiness: Bˉ(x,0)=S(x,0)={x}\bar B(x,0) = S(x,0) = \{x\}, since d(x,y)0d(x,y) \le 0 together with d(x,y)0d(x,y) \ge 0 gives d(x,y)=0d(x,y) = 0 and hence y=xy = x by (M1). For r<0r < 0 all three sets are empty.

A sphere may be empty, and so the three sets are not on a par. For r>0r > 0 the open and closed balls always contain xx, but nothing in the definition produces a point at distance exactly rr from xx. If a metric takes only the values 00 and 11, as the discrete metric on the companion page does, then S(x,2)=S(x,2) = \emptyset while B(x,2)=Bˉ(x,2)B(x,2) = \bar B(x,2) is the whole space. So nonemptiness of a sphere is never available by convention: where it is used, it is proved.

The ambient space is part of the notation. B(x,r)B(x,r) depends on (X,d)(X,d) and not on xx and rr alone. When more than one space or more than one metric is in play we write BX(x,r)B_X(x,r), or Bd(x,r)B_d(x,r), and likewise for Bˉ\bar B and SS. This matters as soon as subspaces appear (Isometry, isometric embedding, and the subspace metric on a subset): a ball of a subspace is the trace on it of a ball of the ambient space, and the two are different sets.

Remarks

Depends on

Used by

…and 91 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 18 results over 7 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