Formal ball¶

An ordered pair of a metric-space point and a nonnegative radius, ordered so one pair computationally approximates another; generalized formal balls allow negative radii.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4576
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Domain Theory → Mathematics
Aliases: Generalized formal ball

Core Idea¶

A formal ball is an information object rather than necessarily the geometric subset it resembles, order orientation varies by convention and negative-radius generalized balls denote no ordinary subset. Pairs are ordered by comparing center distance with radius difference, so decreasing radius and converging center represent increasing information and embed a metric space into an ordered domain. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Shrinking Treasure Clues

Imagine a clue in a treasure hunt: 'the treasure is within 10 steps of the big tree.' A better clue might be 'within 2 steps of this rock,' and it fits inside the first clue. A Formal ball is like a clue made of a spot and a how-far number, and smaller clues tell you more. A clue with 'zero steps' tells you the exact spot.

Center-and-Radius Guesses

A Formal ball is a pair: a center point and a radius, a number saying how far off you might be. Mathematicians treat it as a piece of information, like a guess, not just as a round region. One ball counts as better information than another if it sits inside it, which is checked by a rule: the distance between the two centers must be at most the difference in their radii. As the radius shrinks and the centers settle down, you know more and more, and a ball with radius zero is just the exact point.

Balls as Approximations

In a space where distances are defined (a metric space), a Formal ball is a pair (x, r) with a center x and a radius r. It is meant as an approximation, a piece of information, not necessarily the set of points it looks like. Balls are ordered by comparing distance with radius: (x, r) is below (y, s) when d(x, y) ≤ r − s, meaning the second ball is a tighter approximation. So shrinking radii with converging centers represent increasing information. Points themselves appear as balls of radius zero, which embeds the original space inside this ordered structure. Conventions differ on which way the order points, and some versions allow negative radii, which correspond to no ordinary set of points at all.

Formal balls come from domain theory. Given a metric space (X, d), a formal ball is a pair (x, r) with x in X and r a radius, typically nonnegative, though some generalized versions allow any real r. The order is (x, r) ⊑ (y, s) iff d(x, y) ≤ r − s, so moving up the order means smaller radius and a center held within the earlier tolerance, interpreted as gaining information about a point. Points embed as balls of radius zero, giving an embedding of the metric space into an ordered set, the space of formal balls. Whether this poset is directed complete depends on conditions such as completeness of the metric space, and it carries topologies such as Scott, Lawson, or Martin topologies. The key caution is that a formal ball is an information object, not necessarily the geometric ball it resembles: the order direction varies by convention, and negative-radius balls denote no ordinary subset.

Scope of Application¶

Formal ball belongs to domain theory and is useful where the analyst can specify the typed domain theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the metric space and distance, pair x comma r, nonnegative or real radius convention, order inequality d of x y at most r minus s, interpretation as approximation, directed completeness conditions, embedding of points at radius zero and Lawson Scott or Martin topology are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the metric space and distance, pair x comma r, nonnegative or real radius convention, order inequality d of x y at most r minus s, interpretation as approximation, directed completeness conditions, embedding of points at radius zero and Lawson Scott or Martin topology are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Formal ball. Formal ball compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed domain theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the metric space and distance, pair x comma r, nonnegative or real radius convention, order inequality d of x y at most r minus s, interpretation as approximation, directed completeness conditions, embedding of points at radius zero and Lawson Scott or Martin topology are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of domain theory because they reuse the typed domain theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Pairs are ordered by comparing center distance with radius difference, so decreasing radius and converging center represent increasing information and embed a metric space into an ordered domain., and type the carrier, state every parameter and convention in the definition, test that the metric space and distance, pair x comma r, nonnegative or real radius convention, order inequality d of x y at most r minus s, interpretation as approximation, directed completeness conditions, embedding of points at radius zero and Lawson Scott or Martin topology are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Formal ball Domain-specific

Parents (1) — outgoing typed relations

Formal ball is a kind of Representation Prime

It remains its own entry because its identity is fixed by the metric space and distance, pair x comma r, nonnegative or real radius convention, order inequality d of x y at most r minus s, interpretation as approximation, directed completeness conditions, embedding of points at radius zero and Lawson Scott or Martin topology.

Hierarchy path (1) — routes to 1 parentless root

Formal ball → is a kind of Representation → presupposes Abstraction

Neighborhood in Abstraction Space¶

Formal ball sits in a crowded region of the domain-specific corpus (10^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Metric Geometry & Curvature (14 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25