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.

Version: v2 · 2026-09-19 · History
Domain-specific #: 1434
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Potential Theory, Capacity Theory → Mathematics

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.

How would you explain it like I'm…

How Comfy the Spread-Out Is

Imagine putting a fixed handful of kids who don't like to be squeezed onto a shape, and letting them spread out as far apart as they can. On a roomy shape they can spread out and feel comfy; on a shape that is just one tiny dot they are squished terribly. Mathematicians call how comfy they can get the shape's capacity, and it is not the same as how long or how big the shape is.

The Charge-Spreading Size

Mathematicians have a special way to measure how 'big' a set of points is, called capacity. Imagine spreading a fixed amount of electric charge over the set so that the pieces push on each other as little as possible. The less pushing is left over at the best spreading, the larger the capacity. This is different from length or area: a thin wire in space has no volume but still has some capacity, while a single point has none. Also, the capacity of two sets put together is not simply their capacities added up.

Energy-Based Capacity of a Set

In potential theory, the capacity of a set is a way of measuring its size by solving an optimization problem about energy. One version places a unit amount of charge on the set, finds the arrangement with minimum energy, and defines capacity as the reciprocal of that minimum energy. Capacity is monotone (bigger sets have at least as much capacity) but not additive, so it behaves differently from length, area, or volume. In particular, having zero area or volume is not the same as having zero capacity. There are several typed versions, such as Newtonian, logarithmic, condenser, and Sobolev capacities, and you have to say which one and which normalization you mean. It is also not simply the physical capacitance of an object unless the mathematical normalization is spelled out.

A potential-theoretic capacity is a monotone, nonadditive set function whose value comes from an extremal problem. In the charge-energy form, one minimizes the energy of a unit mass distributed on a compact set under a kernel (Newtonian in higher dimensions, logarithmic in the plane) and takes a reciprocal of that minimal energy; in the admissible-function form (condenser or Sobolev capacity), one minimizes an energy integral over functions meeting a potential or boundary constraint on the set. Values defined on compact sets are extended to general sets by inner approximation from compact subsets and outer approximation from open supersets. Capacity is distinct from Lebesgue measure: sets of measure zero can have positive capacity, so zero measure must not be treated as zero capacity. Its correct use requires naming the capacity type, ambient dimension, kernel or function space, normalization, admissible class, and boundary conditions, and never mixing kernels from different dimensions. Sets of zero capacity (polar or negligible sets) are the exceptional sets that potential theory and Sobolev theory can ignore, which supports 'quasi-everywhere' statements and the handling of boundary and obstacle problems.

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.
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) — outgoing typed relations

Capacity of a set is a kind of Optimization Prime

The reference potential-theoretic capacities are literally defined by minimizing energy or admissible-function cost; the resulting nonadditive set-size semantics form the DS residual.

Hierarchy path (1) — routes to 1 parentless root

Capacity of a set → is a kind of Optimization

Neighborhood in Abstraction Space¶

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

Family — Wavelets & Function-Space Approximation (19 abstractions)

Nearest neighbors

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