Capacity of a set¶
Assign a potential-theoretic size to a set through an extremal energy or admissible-function problem, detecting thinness and polar sets beyond additive volume.
Core Idea¶
A potential-theoretic capacity is a monotone set function whose value is defined through an extremal charge-energy or admissible-function problem; Newtonian, logarithmic, condenser, and Sobolev capacities are typed variants. One optimizes energy under a potential or boundary constraint, or takes the reciprocal of minimal energy for unit mass, and extends compact-set values by inner and outer approximation. 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.
Scope of Application¶
Capacity of a set belongs to potential theory and is useful where the analyst can specify subsets of a declared ambient domain together with a kernel, energy, boundary condition, or admissible function space, then evaluate the set value is tied to a declared extremal potential-theory problem and satisfies the corresponding monotonicity and regularity properties. The scope is broad within that domain but bounded by the need for the set value is tied to a declared extremal potential-theory problem and satisfies the corresponding monotonicity and regularity properties. The family identity is accepted only with an explicit type declaration; formulas and comparison theorems cannot be moved among capacities without their hypotheses.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the set value is tied to a declared extremal potential-theory problem and satisfies the corresponding monotonicity and regularity properties the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because capacity also names engineering throughput and physical storage ability, unrelated without the potential-theoretic roles.
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 Capacity of a set. Capacity of a set 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: subsets of a declared ambient domain together with a kernel, energy, boundary condition, or admissible function space. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the set value is tied to a declared extremal potential-theory problem and satisfies the corresponding monotonicity and regularity properties independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of potential theory because they reuse subsets of a declared ambient domain together with a kernel, energy, boundary condition, or admissible function space, One optimizes energy under a potential or boundary constraint, or takes the reciprocal of minimal energy for unit mass, and extends compact-set values by inner and outer approximation., and name the capacity type, ambient dimension, kernel or function space, normalization, admissible class, boundary condition, and treatment of noncompact or nonmeasurable sets. A theorem, diagnostic, or modeling warning can travel when those roles remain literal.
Relationships to Other Abstractions¶
Current abstraction Capacity of a set Domain-specific
Parents (1) — more general patterns this builds on
-
Capacity of a set is a kind of Optimization Prime
The proposed strict upward parent is
prime:optimization.
Hierarchy path (1) — routes to 1 parentless root
- Capacity of a set → Optimization
Neighborhood in Abstraction Space¶
Capacity of a set sits in a moderately populated region (44th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Function Spaces & Analytic Regularity (15 abstractions)
Nearest neighbors
- Harmonic measure — 0.89
- Locally integrable function — 0.89
- Ba space — 0.89
- Integration by parts operator — 0.89
- Absorbing set — 0.89
Computed from structural-signature embeddings · 2026-09-08