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.
Robin constant and logarithmic capacity of a compact set
Definition
Let be compact and nonempty, and let be the set of Borel probability measures on (Probability measures and probability spaces), viewed as measures on carried by . Every has compact support contained in , so its logarithmic energy is the quantity of Logarithmic potential and energy of a positive compactly supported measure; indeed the kernel is bounded below on : it is when , and for the only measure of when is a singleton.
The Robin constant of is
The set is nonempty: it contains the Dirac measure at any point of (The Dirac set function at a point). Put . If , all energies are and we set . Otherwise is not a singleton, and is a nonempty subset of bounded below by , so Every nonempty set bounded below has an infimum gives its real infimum. Set in this case. Adding the value does not change any real lower bound, so this is exactly the extended infimum displayed above. The logarithmic capacity of is
with the real exponential function (The real exponential function and the number by a power series). Thus for every nonempty compact , and for the empty set one uses the separate convention
Remarks
Zero capacity as total divergence of the energy. For nonempty compact , holds exactly when , that is, exactly when for every : the set lies in , so its infimum is precisely when all its members are . Such a set is called polar; this is the defining dichotomy used throughout the page.
Monotonicity under inclusion. If are nonempty compact sets, then every Borel probability measure on , extended by zero to the Borel subsets of , is a Borel probability measure on with the same energy; hence , the infimum over the larger set is no larger, , and . The explicit case is consistent with this: the empty set is contained in every set.
Normalization. The sign rather than is the convention of the cited sources: it makes a length, for instance for a disc. The constant and the capacity determine each other whenever .
Choice. No choice principle is used in this definition. Choosing a point of a nonempty compact set to exhibit nonemptiness of is a single selection from a nonempty set; the infimum is a set-theoretic construction on a fixed set of extended reals.
Depends on
Used by
- Capacity-polar sets, quasi-everywhere, and subharmonic polar sets Definition
- Fekete points and the transfinite diameter of a compact set Definition
- Green function with a pole at infinity Definition
- Arcsine equilibrium measure and capacity of a segment Example
- Capacity of a disc and its circular equilibrium measure Example
- Chebyshev extremals and the exact disk Fekete polynomial Example
- Finite and countable planar sets have zero logarithmic capacity Example
- Infinity-pole Green function recovered from a circular conductor Example
- Two Cantor sets with different logarithmic capacities Example
- Compact capacity-zero sets and subharmonic minus-infinity loci Lemma
- Monic polynomial lower bounds for the Chebyshev constant and capacity Lemma
- Reciprocity inequality for logarithmic potentials Proposition
- Existence and uniqueness of the equilibrium measure Theorem
- Fekete–Szegő equality of logarithmic capacity, transfinite diameter, and Chebyshev constant Theorem
- Frostman inequalities and quasi-everywhere equilibrium equality Theorem
- Green function at infinity from the equilibrium potential Theorem
Dependency tree · two levels
23 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- E. B. Saff, Logarithmic Potential Theory with Applications to Approximation Theory, §1 (standard reference, not scraped)
- B. Khoruzhenko, LTCC Potential Theory notes, §3 (standard reference, not scraped)