Alphabeta Math
Pipeline-generated
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.

✓ 7 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Logarithmic Potential, Capacity, and Riesz Decomposition: Examples and Counterexamples

1 · Prerequisites

2 · Summary

These examples compute the page's central objects in settings where the formulas can be checked explicitly. Normalized arclength on a circle is the unique equilibrium measure of the closed disc, with constant potential log⁡(1/r) and capacity r; pushing the uniform angle measure through x=cos⁡θ gives the arcsine equilibrium measure of [−1,1] and capacity (b−a)/4. The unit disc also exhibits the exact Fekete configuration: the n-th roots of unity maximize the Vandermonde product, with δn=n1/(n−1) and Fekete polynomial Fn(z)=zn−1, while the Chebyshev columns describe the corresponding extremal nodes and alternating extrema on [−1,1] in terms of the arcsine measure.

The remaining examples separate capacity from more familiar notions. Every finite or countable set is capacity-polar, and on the real line two compact null sets can have positive and zero logarithmic capacity; a Cantor measure with energy at most 3log⁡3 gives capacity at least 1/27, while a thin Cantor set whose every probability has infinite energy has capacity zero. For a holomorphic function, the Riesz measure of log⁡∣f∣ is the weighted zero divisor. Finally, the Green function with pole at infinity of the exterior of a circular conductor is log⁡(∣z−a∣/r) in the stated normalization.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Capacity of a disc and its circular equilibrium measure

Statement

Assume the Axiom of Choice. Let a∈C, r>0 and let K:=D(a,r)‾ be the closed disc. Let μ be normalized arclength on the circle ∣z−a∣=r, that is, in the parametrization w=a+reit, dμ=dt/(2π). Then μ is the unique equilibrium measure of K,

Uμ(z)=log⁡1r(∣z−a∣≤r),Uμ(z)=log⁡1∣z−a∣(∣z−a∣≥r),

and cap⁡(K)=r, with Robin constant VK=log⁡(1/r). The same potential, capacity and equilibrium measure hold for the boundary circle ∂K={z:∣z−a∣=r}.

The Axiom of Choice is inherited from the equilibrium framework and supplies Countable Choice for the strict positivity of the zero-mass energy; the calculation of the potential itself is choice-free.

Facts & Assumptions

Given: a point a∈C, a radius r>0, the closed disc K=D(a,r)‾, its boundary circle ∂K, the logarithmic kernel and potential conventions of Logarithmic potential and energy of a positive compactly supported measure, the Robin constant and capacity of Robin constant and logarithmic capacity of a compact set, and the Axiom of Choice (The Axiom of Choice).

[F1]

Uν(z)=∫log⁡1∣z−w∣ dν(w)∈(−∞,+∞] for finite positive Borel ν of compact support; for R>diam⁡supp⁡ν one has kR=k+log⁡R≥0 on the product of the support with itself, kR=k+log⁡R pointwise as extended functions, and I(ν)=∬kR dν dν−ν(C)2log⁡R, independently of R; the mixed energy I(ν,ρ)=∬k dν dρ is symmetric (Logarithmic potential and energy of a positive compactly supported measure).

[F2]

For nonempty compact F, VF=inf⁡ρ∈P(F)I(ρ) and cap⁡(F)=e−VF when VF<+∞ and 0 otherwise (Robin constant and logarithmic capacity of a compact set); a Borel probability measure on F is a finite positive measure carried by F (Probability measures and probability spaces).

[F3]

Assume the Axiom of Choice. A compact nonpolar F has exactly one equilibrium measure, namely the unique ρ∈P(F) with I(ρ)=VF (Existence and uniqueness of the equilibrium measure).

[F4]

Assume Countable Choice. If ν,ρ are finite positive compactly supported Borel measures with equal total mass and finite energy, then I(ν,ρ) is finite, I(ν−ρ)=I(ν)−2I(ν,ρ)+I(ρ) is a real number, I(ν−ρ)≥0, and I(ν−ρ)=0 if and only if ν=ρ (Strict positivity of logarithmic energy for a zero-mass signed charge). The Axiom of Choice implies Countable Choice (AC implies DC implies countable choice, The Axiom of Countable Choice (ACω)).

[F5]

Assume Dependent Choice, supplied by the Axiom of Choice of the statement (AC implies DC implies countable choice). For c∈C, R>0 the harmonic measure ωD(c,R)c of the disc at its centre has, on Borel E⊆∂D(c,R), the form ωD(c,R)c(E)=12π∫{t∈[0,2π): c+Reit∈E}dt, so it is the normalized arclength measure on the circle, a Borel probability measure on ∂D(c,R), and for every Borel f≥0, ∫f dωD(c,R)c=12π∫02πf(c+Reit) dt (Poisson density of harmonic measure on a disc, Harmonic measure on a bounded regular plane domain).

[F6]

Every plane harmonic function satisfies the circle mean-value property (Plane harmonic functions satisfy the mean-value property, The circle and disc mean-value properties); the function z↦log⁡∣z−c∣ is C∞ and harmonic on C∖{c} (Logarithmic modulus is harmonic off its centre, Plane harmonic functions).

[F7]

Jensen's formula: if f is holomorphic on a neighbourhood of the closed unit disc, f(0)≠0, and a1,…,aN are the zeros of f in ∣z∣<1 counted with multiplicity, while f has no zero on ∣z∣=1, then log⁡∣f(0)∣=12π∫02πlog⁡∣f(eit)∣dt−∑klog⁡1∣ak∣. Only this boundary-zero-free case is used below (Jensen's formula on a disc).

[F8]

The complex exponential satisfies ∣eit∣=1 for real t, so ∣a+reit−a∣=r and t↦a+reit parametrizes ∂K (The complex exponential by its power series, exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0); for each c∈C the polynomial ζ↦rζ−c is entire (Complex polynomials are entire with the power-rule derivative, and rational functions are holomorphic wherever their denominator is nonzero).

Verification

technique · direct
1.1F5F2given

Put μ:=ωD(a,r)a, the harmonic measure of the disc K∘=D(a,r) at its centre. By [F5] the measure μ is a Borel probability measure carried by ∂K⊆K, and for every Borel f≥0 one has ∫f dμ=12π∫02πf(a+reit) dt; in particular μ has no atoms, since for a single point w the set {t∈[0,2π):a+reit=w} has at most two elements and Lebesgue measure zero, so μ({w})=0.

1.2F6algebra

The circle average of the kernel. For c∈C put M(c):=12π∫02πlog⁡∣c−reit∣ dt∈[−∞,∞). If ∣c∣>r, then z↦log⁡∣z−c∣ is harmonic on an open set containing the closed disc D(0,r)‾, so the circle mean-value property of [F6] gives M(c)=log⁡∣0−c∣=log⁡∣c∣.

1.3F7F8algebra

If 0<∣c∣<r, apply Jensen's formula [F7] on the unit disc to the entire function f(ζ):=rζ−c, which satisfies f(0)=−c≠0 and has the single zero ζ0=c/r of modulus <1: 12π∫02πlog⁡∣reit−c∣ dt=log⁡∣f(0)∣+log⁡1∣ζ0∣=log⁡∣c∣+log⁡r∣c∣=log⁡r, that is, M(c)=log⁡r.

2.1step 1.3F8algebra

If c=0, the integrand defining M(c) is constantly log⁡r, so M(0)=log⁡r. If ∣c∣=r, rotate the angle to write c=r without changing the average. For 1/2≤s<1, step 1.3 gives M(sr)=log⁡r, and ∣eit−s∣2=(1−s)2+4ssin⁡2(t/2)≥2sin⁡2(t/2). The positive part of log⁡∣r(eit−s)∣ is bounded by log⁡+(2r); its negative part is bounded by ∣log⁡(r2)∣+log⁡−∣sin⁡(t/2)∣. This last function is integrable on [0,2π]: (sin⁡)′(0)=1 (The derivatives of sine and cosine are cosine and minus sine) gives sin⁡v≥v/2 for small positive v, the same bound applies near t=2π, and away from the endpoints the sine has a positive minimum. Thus its only singularities are bounded by constants plus −log⁡t or −log⁡(2π−t), both integrable. Dominated convergence (Dominated convergence) along s↑1 yields M(r)=log⁡r, and rotation gives M(c)=log⁡r for every ∣c∣=r.

3.1step 1.2step 1.3step 2.1F1F5algebra

Consequently, for z∈C and c:=z−a, the substitution w=a+reit and [F5] give Uμ(z)=∫log⁡1∣z−w∣ dμ(w)=12π∫02πlog⁡1∣z−a−reit∣ dt=−M(z−a); by steps 1.2, 1.3 and 2.1 this is log⁡1r when ∣z−a∣≤r and log⁡1∣z−a∣ when ∣z−a∣≥r.

4.1step 1.1step 3.1F1algebra

The energy of μ. Choose R>2r=diam⁡(∂K); by [F1], kR=k+log⁡R≥0 on ∂K×∂K and kR=k+log⁡R pointwise, so the iterated integral of kR against μ⊗μ equals ∫Uμ dμ+log⁡R; since supp⁡μ=∂K and Uμ=log⁡1r there by step 3.1 with ∣z−a∣=r, [F1] gives I(μ)=∫Uμ dμ=log⁡1r, a finite real number.

5.1step 3.1step 4.1F1F2

Let σ∈P(K) be a Borel probability measure on K with I(σ)<+∞; then σ is a finite positive compactly supported measure of total mass 1, and since supp⁡σ⊆K step 3.1 gives Uμ=log⁡1r on supp⁡σ, so by [F1] the mixed energy is I(μ,σ)=∫Uμ dσ=log⁡1r=I(μ).

6.1step 5.1F2F4given

By [F4], whose Countable Choice hypothesis is supplied by the Axiom of Choice of the statement, the pair μ,σ of step 5.1 satisfies I(σ−μ)=I(σ)−2I(μ,σ)+I(μ)=I(σ)−log⁡1r≥0, with equality if and only if σ=μ; hence every σ∈P(K) with finite energy has I(σ)≥log⁡1r=I(μ), with equality only for σ=μ, while σ∈P(K) with I(σ)=+∞ also satisfies I(σ)≥I(μ) since I(μ) is finite. Therefore VK=inf⁡σ∈P(K)I(σ)=I(μ)=log⁡1r, and μ is the unique minimizer.

7.1step 6.1F2F3

By step 6.1 the unique minimizer of the energy over P(K) is μ, so [F3] identifies μ as the equilibrium measure of K and shows it is the only one; the capacity is cap⁡(K)=e−VK=e−log⁡(1/r)=r.

8.1step 5.1step 6.1step 7.1F1F2F3F5

The boundary circle. The circle ∂K is compact and nonempty and P(∂K)⊆P(K), so its Robin constant satisfies V∂K≥VK; conversely every σ∈P(∂K) is a probability carried by K with supp⁡σ⊆∂K⊆K, so step 3.1 gives Uμ=log⁡1r on supp⁡σ and the argument of steps 5.1 and 6.1 applies verbatim to yield I(σ)≥I(μ) with equality only for σ=μ; hence V∂K=VK=log⁡1r and cap⁡(∂K)=r, with unique equilibrium measure μ, which is carried by ∂K.

9.1step 3.1step 7.1step 8.1F4F5given∎

Combining steps 3.1, 7.1 and 8.1 gives the displayed potential, the capacity r of both K and ∂K, the Robin constant VK=log⁡(1/r), and the identification of normalized arclength as the unique equilibrium measure of each of the two compact sets. Two choice principles are spent in the calculation, both supplied by the Axiom of Choice of the statement: Countable Choice in step 6.1 through [F4], and Dependent Choice in steps 1.1, 3.1 and 8.1 through [F5].

Remarks

Where the disc enters. Steps 1.3 and 2.1 are the only places where the specific geometry is used: Jensen's formula computes the circle average of log⁡∣c−reit∣ exactly when the singular point stays inside or on the circle, and the mean-value property computes it when the singular point is outside. The two formulas agree on ∣c∣=r, which is why the potential is continuous across the boundary of K.

Uniqueness is strict convexity. Step 6.1 does not merely bound I(σ) below by I(μ): the strict positivity of the zero-mass charge σ−μ gives equality only for σ=μ, which is what makes the equilibrium measure unique rather than merely minimal.

Choice. The statement assumes the Axiom of Choice; it is used only to supply Countable Choice for Strict positivity of logarithmic energy for a zero-mass signed charge and to supply, through AC implies DC implies countable choice, the Dependent Choice hypothesis of the harmonic-measure interface [F5] used in the proof at steps 1.1, 3.1 and 8.1. The circle computation, the atom argument and the energy comparison are otherwise choice-free.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Arcsine equilibrium measure and capacity of a segment

Statement

Assume the Axiom of Choice. Let a<b and let K=[a,b]. The unique equilibrium measure of K has the density

dμK(x)=dxπ(x−a)(b−x)(a<x<b),

that is, μK is the pushforward of dx/(π1−x2) on (−1,1) under x↦a+b2+b−a2x, and its potential is

UμK(x)=log⁡4b−a  (a≤x≤b),UμK(z)=log⁡4b−a−log⁡∣w+(z)∣  (z∉K),

where w+(z) is the root of w2−22z−a−bb−aw+1=0 of modulus at least 1. In particular cap⁡(K)=(b−a)/4 and VK=log⁡4b−a. For [a,b]=[−1,1] this says dμ=dxπ1−x2, Uμ=log⁡2 on [−1,1] and cap⁡([−1,1])=12.

The Axiom of Choice enters through the equilibrium identification, through Dependent Choice for the normalized-arclength harmonic-measure interface [F5], and through Countable Choice for strict energy positivity [F4] and the Lebesgue–Stieltjes identification [F9]. The Joukowski and scaling calculations are choice-free.

Facts & Assumptions

Given: real numbers a<b, the segment K=[a,b], the logarithmic kernel and potential conventions of Logarithmic potential and energy of a positive compactly supported measure, the Robin constant and capacity of Robin constant and logarithmic capacity of a compact set, and the Axiom of Choice (The Axiom of Choice).

[F1]

Uν(z)=∫log⁡1∣z−w∣ dν(w)∈(−∞,+∞] for finite positive Borel ν of compact support, and for R>diam⁡supp⁡ν one has I(ν)=∬(k+log⁡R) dν dν−ν(C)2log⁡R, independently of R; the mixed energy I(ν,ρ)=∬k dν dρ is symmetric (Logarithmic potential and energy of a positive compactly supported measure).

[F2]

For nonempty compact F, VF=inf⁡ρ∈P(F)I(ρ) and cap⁡(F)=e−VF when VF<+∞ and 0 otherwise; a Borel probability measure on F is a finite positive measure carried by F (Robin constant and logarithmic capacity of a compact set, Probability measures and probability spaces).

[F3]

Assume the Axiom of Choice: a compact nonpolar F has exactly one equilibrium measure, the unique minimizer of I over P(F) (Existence and uniqueness of the equilibrium measure).

[F4]

Assume Countable Choice: for finite positive compactly supported ν,ρ with equal mass and finite energy, I(ν,ρ) is finite, I(ν−ρ)=I(ν)−2I(ν,ρ)+I(ρ) is real, I(ν−ρ)≥0, and I(ν−ρ)=0 only for ν=ρ (Strict positivity of logarithmic energy for a zero-mass signed charge); the Axiom of Choice implies Countable Choice (AC implies DC implies countable choice, The Axiom of Countable Choice (ACω)).

[F5]

With μ1 the normalized arclength measure on the unit circle, i.e. the harmonic measure at the centre of the unit disc, Uμ1(c)=log⁡1∣c∣ for ∣c∣≥1 and Uμ1(c)=0 for ∣c∣≤1, and I(μ1)=0, with cap⁡D(0,1)‾=1 (Capacity of a disc and its circular equilibrium measure).

[F6]

Image measures. If ν is a Borel probability measure on a measurable space X and φ:X→Y is Borel measurable, then φ∗ν(E):=ν(φ−1(E)) is a Borel probability measure on Y and ∫f dφ∗ν=∫f∘φ dν for every nonnegative Borel f; for continuous φ on a metric space the preimages of Borel sets are Borel, indicators give the identity by definition, simple functions by linearity, and general f by monotone convergence (Measures on sigma-algebras, Probability measures and probability spaces, Monotone convergence for the integral).

[F7]

The complex exponential has ∣eit∣=1, (eit+e−it)/2=cos⁡t, and the modulus is multiplicative: ∣uv∣=∣u∣∣v∣ and ∣u/v∣=∣u∣/∣v∣ for v≠0 (The complex exponential by its power series, exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0, Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive); every complex number has a square root, and more generally every nonzero complex number has an n-th root (The n-th roots of a complex number and the n distinct roots of unity for every n≥1).

[F8]

The arcsine density defines a measure: for a nonnegative Borel function h on R, the set function E↦∫Eh(x) dx is a measure (The indefinite integral of a nonnegative measurable function is a measure); the derivatives (arcsin⁡y)′=1/1−y2 and (arccos⁡y)′=−1/1−y2 hold for −1<y<1 (For −1<y<1, (arcsin⁡y)′=1/1−y2 and (arccos⁡y)′=−1/1−y2, Principal inverse sine and inverse cosine), and a function with a continuous derivative on [u,v] is the derivative of its primitive there (The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)).

[F9]

Assume Countable Choice: a Borel measure on R that is finite on compacts is determined by its distribution function Fμ(x)=μ((0,x]) for x≥0, Fμ(x)=−μ((x,0]) for x<0: two such measures with equal distribution functions coincide, and Fμ(b)−Fμ(a)=μ((a,b]) for a<b (The distribution function of a Borel measure on R, normalized at 0, Assuming countable choice, finite-on-compacts Borel measures on R correspond to nondecreasing right-continuous functions modulo constants).

Verification

technique · direct
1.1F6given

Put μ1:=ωD(0,1)0, the normalized arclength measure on the unit circle of [F5], and let φ(t):=cos⁡t; define ν:=φ∗λ where λ is normalized Lebesgue measure on [0,π], that is, ν(E)=λ({t∈[0,π]:cos⁡t∈E}) for Borel E⊆R. By [F6] the set function ν is a Borel probability measure concentrated on [−1,1], and ∫f dν=1π∫0πf(cos⁡t) dt for every nonnegative Borel f.

1.2F7algebra

The Joukowski factorization. Let z∈C and let s satisfy s2=z2−1 with s=0 when z=±1, which exists by [F7]; put w+:=z+s and w−:=z−s, so that w++w−=2z, w+w−=z2−s2=1, and w2−2zw+1=(w−w+)(w−w−) for all w. Interchanging the two roots if necessary, ∣w+∣≥1≥∣w−∣, because ∣w+∣∣w−∣=1.

1.3F8algebra

The arcsine density of ν. Define the nonnegative Borel function ρ(x):=1π1−x2 for −1<x<1 and ρ(x):=0 otherwise, and let η:=E↦∫Eρ dx be the measure of [F8]. For −1<x<1 its distribution function is Fη(x)=1π∫0xdy1−y2=1πarcsin⁡x for x≥0, and Fη(x)=−1π∫x0dy1−y2=1πarcsin⁡x for x<0, the primitive being [F8]; hence Fη(x)=1π(π2−arccos⁡x) on (−1,1) with η a probability because arcsin⁡1−arcsin⁡(−1)=π.

2.1step 1.2F7algebra

For real t with w=eit the identity z−cos⁡t=(2zw−w2−1)/(2w)=−(w−w+)(w−w−)2w holds, and taking moduli with ∣w∣=1 gives ∣z−cos⁡t∣=12∣eit−w+∣ ∣eit−w−∣; both sides vanish simultaneously, and if z∉[−1,1] then w+≠w− and neither root lies on the unit circle.

2.2step 1.1step 1.3F9algebra

The distribution function of ν of step 1.1 is the same: for 0≤x<1, Fν(x)=1π∣{t∈[0,π]:0<cos⁡t≤x}∣=1π(π2−arccos⁡x) because cos⁡ decreases on [0,π], and for −1<x<0 the same computation of {t:cos⁡t∈(x,0]}=[π2,arccos⁡x) gives Fν(x)=1π(π2−arccos⁡x); both distributions equal −12 for x≤−1 and 12 for x≥1.

3.1step 2.1F1F5F6algebra

The potential of ν. By [F6] and step 2.1, applied to the positive and negative parts of the logarithmic kernel separately, the symmetry of cos⁡t gives Uν(z)=1π∫0πlog⁡1∣z−cos⁡t∣ dt=12π∫02πlog⁡1∣z−cos⁡t∣ dt=log⁡2+Uμ1(w+)+Uμ1(w−). Indeed, step 2.1 writes log⁡1∣z−cos⁡t∣=log⁡2−log⁡∣eit−w+∣−log⁡∣eit−w−∣, and each negative logarithm has circle average equal to the corresponding unit-circle potential.

3.2step 1.3step 2.2F9

By step 2.2 the two Borel probability measures ν and η on R, both finite on compacts, have equal distribution functions; by [F9] they coincide, so ν has the density ρ(x)=1π1−x2 on (−1,1), as claimed for [a,b]=[−1,1].

4.1step 3.1F1F5F7algebra

Since ∣w+∣≥1≥∣w−∣, [F5] gives Uμ1(w+)=log⁡1∣w+∣ and Uμ1(w−)=0, so step 3.1 yields Uν(z)=log⁡2−log⁡∣w+∣ for z∉[−1,1]; if z∈[−1,1] then z=cos⁡τ and s is purely imaginary with ∣w+∣=∣w−∣=1, so the same identity gives Uν(z)=log⁡2. In particular Uν=log⁡2 on [−1,1].

4.2step 3.2F1F6algebra

Scaling. Let α:=a+b2, β:=b−a2>0 and T(x):=α+βx, so T maps [−1,1] bijectively onto [a,b]. Put μ:=T∗ν; by [F6] the measure μ is a Borel probability on [a,b], and for finite positive compactly supported measures the identities k(Tu,Tv)=k(u,v)−log⁡β, hence, writing M:=ρ(C), I(T∗ρ)=I(ρ)−M2log⁡β and UT∗ρ(Tx)=Uρ(x)−Mlog⁡β, follow by substituting ∣Tu−Tv∣=β∣u−v∣ and the shift convention of [F1]. For probabilities M=1, which is the case used in steps 7.1 and 8.1; the density transforms by dx=d(T−1y)=dyβ and 1−x2=1β(y−a)(b−y), so dμ=dy/(π(y−a)(b−y)) on (a,b).

5.1step 4.1F1F2given

The energy and minimality. Choose R>2; by [F1] and step 4.1 with z∈[−1,1], I(ν)=∫Uν dν=log⁡2, a finite real number. For any Borel probability σ on [−1,1] with I(σ)<+∞, the support of σ lies in [−1,1], so Uν=log⁡2 on supp⁡σ by step 4.1, and [F1] gives I(ν,σ)=∫Uν dσ=log⁡2=I(ν).

6.1step 5.1F2F3F4given

By [F4], whose Countable Choice hypothesis is supplied by the Axiom of Choice of the statement, the pair ν,σ of step 5.1 satisfies I(σ−ν)=I(σ)−2I(ν,σ)+I(ν)=I(σ)−log⁡2≥0, with equality if and only if σ=ν; hence every σ∈P([−1,1]) has I(σ)≥log⁡2=I(ν) with equality only for σ=ν, so V[−1,1]=log⁡2, cap⁡([−1,1])=12, and ν is the unique equilibrium measure of [−1,1], with Uν=log⁡2 on [−1,1].

7.1step 4.1step 6.1step 4.2algebra

Applying steps 6.1 and 4.1 to μ=T∗ν with the identities of step 4.2 gives I(μ)=I(ν)−log⁡β=log⁡2β=log⁡4b−a, Uμ(x)=log⁡2−log⁡β=log⁡4b−a for x∈[a,b], and Uμ(y)=log⁡4b−a−log⁡∣w+(z)∣ for y∉[a,b] with z=(2y−a−b)/(b−a) and w+ the root of modulus at least 1 of w2−2zw+1=0.

8.1step 6.1step 4.2step 7.1F2F3

Every Borel probability σ on [a,b] is the pushforward T∗ρ of the Borel probability ρ:=T∗−1σ on [−1,1], and step 4.2 applied to ρ gives I(σ)=I(ρ)−log⁡β≥log⁡2−log⁡β=log⁡4b−a=I(μ), with equality if and only if ρ=ν, that is, if and only if σ=μ; hence VK=log⁡4b−a, cap⁡(K)=e−VK=b−a4, and μ is the unique equilibrium measure of K=[a,b].

9.1step 4.2step 7.1step 8.1F4given∎

Steps 4.2, 7.1 and 8.1 give the stated density, potential, capacity and uniqueness, with the case [a,b]=[−1,1] recovered by α=0, β=1. The Axiom of Choice enters through [F3], supplies Dependent Choice for [F5], and supplies Countable Choice for [F4] and [F9]; the Joukowski factorization and scaling computation are choice-free.

Remarks

Why the Joukowski variable appears. The quadratic w2−2zw+1 has the two roots w± with w+w−=1, so one lies inside and one outside the unit circle (both on it when z∈[−1,1]). The identity of step 2.1 turns the logarithm of ∣z−cos⁡t∣ into a sum of two logarithms of the form log⁡∣eit−c∣, whose circle average is known from the disc example; that is exactly the point at which the interval computation uses Capacity of a disc and its circular equilibrium measure.

The density is identified, not assumed. Step 1.3 defines the arcsine density measure independently, and step 3.2 identifies it with the pushforward ν through the Lebesgue–Stieltjes correspondence, using the arcsin primitive; no change-of-variables formula with a vanishing derivative at the endpoints is invoked.

Choice. The Axiom of Choice is used in [F3] to identify the energy minimizer as the equilibrium measure, and it supplies Dependent Choice for [F5] and Countable Choice for [F4] and [F9]. The image-measure construction, Joukowski factorization, and scaling computation are choice-free.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Chebyshev extremals and the exact disk Fekete polynomial

Statement

Assume the Axiom of Choice. Let K=D(a,R)‾ be a closed disc with R>0, and let [−1,1]⊆R⊆C be the real unit interval, with the extremal norms tn and Chebyshev constant cheb⁡ of Chebyshev constant of a compact planar set and the capacity of Robin constant and logarithmic capacity of a compact set.

  1. For the disc, tn(K)=Rn and cheb⁡(K)=R=cap⁡(K), attained by the monic polynomial (z−a)n.
  2. For the interval, tn([−1,1])=21−n and cheb⁡([−1,1])=12=cap⁡([−1,1]), attained by the monic Chebyshev polynomial 21−nTn.
  3. For each n≥2 the n-th roots of unity form an n-point Fekete tuple of the closed unit disc, with Fekete polynomial Fn(z)=zn−1; and δn(D(0,1)‾)=n1/(n−1).
  4. The empirical probability measures of these tuples converge weakly to normalized arclength on the unit circle, and ∥zn−1∥D(0,1)‾=2, so the n-th root of its norm tends to 1=cheb⁡(D(0,1)‾).

The Axiom of Choice is inherited from the equilibrium theory that supplies the two capacity values and the weak convergence; the Cauchy estimate, the minimax comparison, the Vandermonde determinant and the Gram–Schmidt bound are choice-free.

Facts & Assumptions

Given: a closed disc K=D(a,R)‾ with R>0, the interval [−1,1], the closed unit disc D(0,1)‾, and the conventions of Chebyshev constant of a compact planar set, Fekete points and the transfinite diameter of a compact set and Robin constant and logarithmic capacity of a compact set.

[F1]

For nonempty compact K: ∥p∥K=sup⁡z∈K∣p(z)∣ is finite and attained, tn(K)=inf⁡{∥p∥K:p monic of degree n} is a real number, cheb⁡(K)=inf⁡n≥1tn(K)1/n, and for the disc and the interval the capacities are cap⁡(D(a,R)‾)=R and cap⁡([−1,1])=12 (Chebyshev constant of a compact planar set, Capacity of a disc and its circular equilibrium measure, Arcsine equilibrium measure and capacity of a segment).

[F2]

For nonempty compact K and n≥2 the n-th Fekete diameter is δn(K)=(max⁡z∈Kn∏i<j∣zi−zj∣)2/[n(n−1)], tuples attaining the maximum are Fekete tuples, and the associated polynomial Fn(Z)=∏j(Z−zj) is monic of degree n (Fekete points and the transfinite diameter of a compact set, Formal complex polynomials, evaluation, degree, leading coefficient, and monic polynomials).

[F3]

Assume the Axiom of Choice. For every compact K one has cap⁡(K)=τ(K)=cheb⁡(K); if cap⁡(K)>0, then the empirical probability measures of any sequence of n-point Fekete tuples of K converge weakly to the unique equilibrium measure μK (Fekete–Szegő equality of logarithmic capacity, transfinite diameter, and Chebyshev constant, Weak convergence of borel probability measures).

[F4]

Let f be holomorphic on D(a,R) and let 0<r<R with ∣f(ζ)∣≤M on ∣ζ−a∣=r; then ∣f(n)(a)∣≤n!M/rn (Cauchy's inequalities bound every derivative by a boundary bound on a compactly contained circle). A complex polynomial P(z)=∑k=0nakzk is entire with P′(z)=∑k=1nkakzk−1, so by iteration the n-th derivative of a monic polynomial of degree n is the constant n! (Complex polynomials are entire with the power-rule derivative, and rational functions are holomorphic wherever their denominator is nonzero).

[F5]

For n≥1 the polynomial Pn=21−nTn is monic of degree n, and for every monic real polynomial q of degree n one has max⁡x∈[−1,1]∣q(x)∣≥21−n=max⁡x∈[−1,1]∣Pn(x)∣ (For n≥1, 21−nTn is the minimax monic polynomial of degree n on [−1,1], Chebyshev polynomials of the first and second kinds by their three-term recurrences, Tn(cos⁡θ)=cos⁡(nθ) and Un(cos⁡θ)sin⁡θ=sin⁡((n+1)θ) for every n∈N).

[F6]

A complex polynomial p of degree n has real part Re⁡p, a real polynomial whose xn coefficient is the real part of the xn coefficient of p; hence Re⁡p is monic of degree n when p is monic, and ∣Re⁡p(x)∣≤∣p(x)∣ for every real x (Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials, C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2), Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[F7]

Determinant conventions and rules: the determinant is the Leibniz sum det⁡(A)=∑σsgn⁡(σ)∏iaσ(i),i (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix); it is alternating and multilinear in the rows and columns (The Leibniz determinant is column-multilinear, alternating and normalized over every commutative ring); det⁡(AB)=det⁡Adet⁡B (For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)); and the determinant of an upper triangular matrix is the product of its diagonal entries (The determinant of a triangular matrix is the product of its diagonal entries).

[F9]

The n-th roots of unity ωj=exp⁡(2πij/n), j=0,…,n−1, are n distinct complex numbers of modulus one, and zn−1 has exactly these n roots, each of multiplicity one (The n-th roots of a complex number and the n distinct roots of unity for every n≥1, The complex exponential by its power series, exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0, Integer powers in the complex field); a monic polynomial of degree n with this root list is ∏j(z−ωj), by uniqueness of the root factorisation (A complex polynomial of degree n has exactly n roots counted with multiplicity). The Vandermonde polynomial is Δn(x1,…,xn)=∏i<j(xi−xj) (The Vandermonde polynomial Δn=∏i<j(xi−xj)).

[F10]

Limits and roots: t1/n→1 for every fixed t>0 (For every a>0, a1/n→1); sums, products and quotients of convergent sequences converge to the corresponding combination (Algebra of limits: sums, scalar multiples, products and quotients); nonnegative n-th roots exist and are monotone (Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a, Monotonicity of x↦xn and of n↦an).

Verification

technique · direct
1.1F1F4algebra

Disc: Cauchy lower bound. Let p be a monic complex polynomial of degree n and K=D(a,R)‾. By [F4] the polynomial p is entire, so it is holomorphic on D(a,R′) for every R′>R, and its n-th derivative is the constant p(n)=n!; applying Cauchy's inequality [F4] with r=R and M=∥p∥K, and noting that ∣p∣≤∥p∥K holds on the circle ∣ζ−a∣=R, gives n!=∣p(n)(a)∣≤n!∥p∥K/Rn, hence ∥p∥K≥Rn.

1.2F5F6algebra

Interval: complex-to-real reduction. Let p be a monic complex polynomial of degree n and put q:=Re⁡p. By [F6] the polynomial q is a monic real polynomial of degree n with ∣q(x)∣≤∣p(x)∣ for all real x, so max⁡x∈[−1,1]∣q(x)∣≤∥p∥[−1,1]; the minimax theorem [F5] gives 21−n≤max⁡x∈[−1,1]∣q(x)∣, so ∥p∥[−1,1]≥21−n.

1.3F7algebra

Vandermonde determinant. For m≥1 and w0,…,wm−1∈C the matrix Vm=(wjk)j,k=0m−1 satisfies det⁡Vm=∏i<j(wj−wi). Indeed for m=1 both sides are 1; for m≥2, replacing the j-th row of Vm by itself minus the first row does not change the determinant by [F7], because the determinant is multilinear and alternating and the subtracted term has two equal rows; the new j-th row is (wj−w0)(0,q1(wj),…,qm−1(wj)) with qk(z)=zk−1+zk−2w0+⋯+w0k−1, so multilinearity [F7] factors ∏j≥1(wj−w0) out of the last m−1 rows; the remaining matrix has first row (1,w0,…,w0m−1) and, below it, zeros in the first column, which Leibniz's formula [F7] evaluates as the determinant of the (m−1)×(m−1) matrix of the polynomials qk at w1,…,wm−1; since qk(z)=zk−1+(lower order terms), the basis change from (1,z,…,zm−2) to (q1,…,qm−1) is unitriangular and hence a determinant-preserving sequence of column operations [F7], so that last determinant equals det⁡Vm−1(w1,…,wm−1).

1.4F7F8algebra

Gram–Schmidt (Hadamard) bound. Let c0,…,cm−1∈Cm be the columns of a matrix A. If they are linearly dependent then det⁡A=0 by the alternating multilinearity in [F7]; otherwise [F8] supplies an orthonormal list e0,…,em−1 with span⁡(e0,…,ek)=span⁡(c0,…,ck) for every k, and writing uk:=ck−∑j<k⟨ck,ej⟩ej one has ck=∑j≤k⟨ck,ej⟩ej, so A=QR with Q the matrix of the ej and R upper triangular with diagonal entries Rkk=⟨ck,ek⟩=∥uk∥; moreover ∥uk∥≤∥ck∥, because uk is orthogonal to ∑j<k⟨ck,ej⟩ej and Pythagoras [F8] gives ∥ck∥2=∥uk∥2+∥∑j<k⟨ck,ej⟩ej∥2. The matrix Q has orthonormal columns, so it is a linear isometry of Cm and ∣det⁡Q∣=1 by [F8]; hence by [F7] ∣det⁡A∣=∣det⁡Q∣ ∣det⁡R∣=∏kRkk=∏k∥uk∥≤∏k∥ck∥.

2.1step 1.1F1algebra

Disc: extremal value. The monic polynomial (z−a)n has ∥(z−a)n∥K=Rn, so step 1.1 gives tn(K)=Rn for every n≥1; hence cheb⁡(K)=inf⁡n≥1tn(K)1/n=inf⁡n≥1R=R.

2.2step 1.2F5F10algebra

Interval: extremal value and Chebyshev constant. By [F5] the monic polynomial Pn=21−nTn has max⁡x∈[−1,1]∣Pn(x)∣=21−n, so step 1.2 gives tn([−1,1])=21−n; therefore cheb⁡([−1,1])=inf⁡n≥12(1−n)/n, and since 2(1−n)/n=21/n/2 with 21/n→1 by [F10], that infimum is 12.

2.3step 1.3F9algebra

Vandermonde identity by induction. Induction on m in the recursion of step 1.3 gives det⁡Vm=∏j≥1(wj−w0)⋅∏1≤i<j≤m−1(wj−wi)=∏i<j(wj−wi) for every m≥1; in particular ∣Δn(z0,…,zn−1)∣=∣det⁡Vn∣ by [F9].

3.1step 2.1F1

Disc: capacity. By [F1], cap⁡(K)=R, so cheb⁡(K)=R=cap⁡(K).

3.2step 2.2F1

Interval: capacity. By [F1], cap⁡([−1,1])=12, so cheb⁡([−1,1])=12=cap⁡([−1,1]).

3.3step 2.3F2F8F9algebra

Unit disc: universal bound. Let z0,…,zn−1∈D(0,1)‾ and A=(zjk)j,k=0n−1. Its columns are ck=(zjk)j=0n−1 with ∥ck∥2=∑j∣zj∣2k≤n by [F8], [F9] and ∣zj∣≤1; and ∣det⁡A∣=∣Δn(z)∣ by step 2.3, so [F2] gives the Fekete bound ∏i<j∣zi−zj∣≤nn/2.

4.1step 1.4step 3.3F2F9algebra

Unit disc: the roots of unity are Fekete. Let ωj=exp⁡(2πij/n), j=0,…,n−1, which are n distinct points of the unit circle by [F9]. For k≠ℓ put d:=k−ℓ and r:=ω1 d; then rn=(ω1 n)d=1 and r≠1, since r=1 would give exp⁡(2πid/n)=1, forcing n∣d by the kernel statement of ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ, contrary to 0<∣d∣<n. The cyclic-shift computation of For n≥2, the sum of all n-th roots of unity is zero, applied to the list 1,r,…,rn−1 in place of 1,ζ,…,ζn−1 (multiply S=∑j<nr j by r and compare rS with S using rn=1), gives (r−1)S=0, hence S=0; since ωj d=r j by the integer power laws of [F9], the inner product ⟨ck,cℓ⟩=∑jωj kωj ℓ‾=∑jωj k−ℓ vanishes, the conjugate being the inverse because ∣ωj∣=1. Each column has norm n, since ∣ωj2k∣=1. The Gram–Schmidt residuals of an orthogonal list are the columns themselves, so step 1.4 gives ∣det⁡A∣=nn/2; by step 3.3 this is the maximum of ∏i<j∣zi−zj∣ over the closed unit disc, so the roots of unity form an n-point Fekete tuple and δn(D(0,1)‾)=n1/(n−1). The associated monic polynomial is Fn(z)=∏j(z−ωj)=zn−1 by [F9].

5.1step 4.1F1F3

Weak convergence of the empirical measures. The closed unit disc is compact with cap⁡(D(0,1)‾)=1>0 by [F1], and its equilibrium measure is normalized arclength on the unit circle, which we denote μ (Capacity of a disc and its circular equilibrium measure); since the tuple of step 4.1 is a Fekete tuple for every n≥2, [F3] gives 1n∑jδωj⇒μ.

5.2step 2.1step 3.1step 4.1F10algebra

The norm limit. On the closed unit disc, ∣zn−1∣≤∣z∣n+1≤2 by the modulus laws, with equality exactly at the points with zn=−1, which exist on the unit circle; hence ∥zn−1∥D(0,1)‾=2 and ∥Fn∥1/n=21/n→1, and this limit is cheb⁡(D(0,1)‾)=cap⁡(D(0,1)‾)=1 by steps 2.1 and 3.1 with a=0 and R=1.

6.1step 2.1step 3.1step 2.2step 3.2step 4.1step 5.1step 5.2F1F3∎

Assembly. Steps 2.1, 3.1, 2.2, 3.2 prove the disc and interval identities tn=Rn, tn=21−n and the matching Chebyshev constants and capacities; step 4.1 proves the Fekete property of the roots of unity with Fn(z)=zn−1 and the value δn=n1/(n−1); step 5.1 proves weak convergence to normalized arclength; and step 5.2 proves the norm value 2 and the limit of its n-th roots. The Axiom of Choice is used only through [F3] and the capacity values of [F1].

Remarks

Where the two halves of the calculation meet. The first six steps compute the monic extremal norms and combine them with the known capacities of the disc and the interval; steps 1.3, 1.4, 2.3, 3.3 and 4.1 compute the Fekete diameters of the unit disc exactly, with the Vandermonde determinant reducing the Fekete problem to the classical Gram–Schmidt bound for column norms, and with the Fourier columns of the roots-of-unity matrix attaining equality. Step 5.1 then identifies the limit of the empirical measures with the equilibrium measure supplied by Capacity of a disc and its circular equilibrium measure, and step 5.2 confirms the consistency of the Fekete-polynomial norms with the general norm limit of Fekete–Szegő equality of logarithmic capacity, transfinite diameter, and Chebyshev constant.

Why the interval reduction is legitimate. For a monic complex polynomial p on a real interval the real part Re⁡p is again monic — its leading coefficient is Re⁡(1)=1 — and it never exceeds p in modulus on real arguments, so a minimax bound for monic real polynomials applies without loss. This is the only place where the real interval differs from the disc, where Cauchy's estimate handles complex coefficients directly.

Choice. The example states the Axiom of Choice because it quotes the two capacity values from the equilibrium examples and the weak convergence from Fekete–Szegő equality of logarithmic capacity, transfinite diameter, and Chebyshev constant; the determinant, Gram–Schmidt and minimax computations are choice-free.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Chebyshev extremal nodes converge to the arcsine equilibrium measure

Statement

Assume the Axiom of Choice. For n≥1 let xk,n:=cos⁡kπn for 0≤k≤n and let νn:=1n+1∑k=0nδxk,n. Then νn converges weakly, as n→∞, to the arcsine equilibrium measure dx/(π1−x2) of [−1,1], and the points x0,n,…,xn,n are exactly the points of [−1,1] at which the Chebyshev polynomial Tn attains its extreme values ±1, alternately signed.

Facts & Assumptions

Given: the nodes xk,n=cos⁡kπn, the empirical measures νn, the Chebyshev polynomials Tn of Chebyshev polynomials of the first and second kinds by their three-term recurrences, and the Axiom of Choice.

[F1]

The multiple-angle identity Tn(cos⁡θ)=cos⁡(nθ) holds for all real θ (Tn(cos⁡θ)=cos⁡(nθ) and Un(cos⁡θ)sin⁡θ=sin⁡((n+1)θ) for every n∈N), and ∣cos⁡u∣≤1 for real u, with cos⁡(kπ)=(−1)k (Parity and the Pythagorean identity for sine and cosine).

[F2]

The arcsine measure μ of [−1,1] is the unique equilibrium measure of [−1,1], and for every continuous f on [−1,1] one has ∫f dμ=1π∫0πf(cos⁡θ) dθ (Arcsine equilibrium measure and capacity of a segment).

[F3]

Dirac measures are probability measures, finite nonnegative weighted sums of measures are measures, and νn is therefore a Borel probability measure on [−1,1] (The Dirac set function at a point, A Dirac set function is a probability measure, Nonnegative scalar multiples and countable weighted sums of measures are measures).

[F4]

Weak convergence νn⇒μ means ∫f dνn→∫f dμ for every bounded continuous real f (Weak convergence of borel probability measures).

[F5]

A continuous real function on the closed bounded interval [0,π] is Riemann integrable, and its uniform-mesh Riemann sums converge to the integral: 1m∑j=0m−1g(jπm)→1π∫0πg(θ) dθ (apply Every continuous function on a closed nondegenerate rectangle in Rm is Riemann integrable in dimension 1, then The Darboux and Riemann definitions agree: a bounded f on [a,b] is Darboux integrable with integral I if and only if for every real ε>0 there is a real δ>0 such that ∣S(f,P,ξ)−I∣<ε for every tagged partition of mesh below δ). Its Riemann integral equals its Lebesgue integral by A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral, whose Countable Choice hypothesis is supplied by the assumed Axiom of Choice through AC implies DC implies countable choice.

Verification

technique · direct
1.1F3givenalgebra

For each n≥1 the points xk,n=cos⁡kπn lie in [−1,1]; since cos⁡ is strictly decreasing on [0,π] and kπn are strictly increasing for k=0,…,n, the n+1 points are pairwise distinct, and by [F3] each νn is a Borel probability measure on [−1,1].

1.2F1givenalgebra

By the multiple-angle identity [F1], Tn(xk,n)=cos⁡(kπ)=(−1)k; moreover every x∈[−1,1] is x=cos⁡θ for some θ∈[0,π], so ∣Tn(x)∣=∣cos⁡(nθ)∣≤1 for every x∈[−1,1], with equality exactly at the points where ∣cos⁡nθ∣=1, that is, where nθ is an integer multiple of π.

1.3F5given

Weak convergence. Let f be a continuous real function on [−1,1] and put g(θ):=f(cos⁡θ); then g is continuous on [0,π], so [F5] applied with m=n gives 1n∑k=0n−1g(kπn)→1π∫0πg(θ) dθ.

2.1step 1.2

Consequently the points xk,n are precisely the points of [−1,1] at which Tn attains ±1, with alternating signs, which is the second assertion.

2.2step 1.3algebra

The empirical sum 1n+1∑k=0ng(kπn) differs from 1n∑k=0n−1g(kπn) by at most 2nsup⁡[0,π]∣g∣, which tends to 0, so it has the same limit 1π∫0πg dθ.

3.1step 2.2F2F3algebra

By the definition of νn and [F3], ∫f dνn=1n+1∑k=0nf(xk,n)=1n+1∑k=0ng(kπn), and by [F2] the limit 1π∫0πg dθ equals ∫f dμ; hence ∫f dνn→∫f dμ for every continuous f on [−1,1].

4.1step 2.1step 3.1F2F4given∎

Since [−1,1] is compact, every continuous real f on it is bounded; step 3.1 therefore gives convergence of integrals for every bounded continuous test function on the metric space [−1,1]. By [F4] this is νn⇒μ, which together with step 2.1 proves both assertions.

Remarks

Why the weights are 1n+1. The extremal points of Tn are the n+1 points cos⁡kπn; the Riemann sum of step 1.3 is naturally indexed by k=0,…,n−1, and step 2.2 records that replacing n weights by n+1 weights and adjoining the endpoint θ=π changes the average by O(1/n) only. The endpoint contribution vanishes in the limit and does not affect the weak limit.

The limit is the equilibrium measure. The identification of the limit with the arcsine measure is exactly the equilibrium computation of Arcsine equilibrium measure and capacity of a segment; this example supplies the discrete approximation of that measure by Chebyshev nodes.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Finite and countable planar sets have zero logarithmic capacity

Statement

Assume the Axiom of Countable Choice. Every finite or countable set E⊆C is capacity-polar in the compact/local sense of Capacity-polar sets, quasi-everywhere, and subharmonic polar sets: every compact F⊆E satisfies cap⁡(F)=0 for the logarithmic capacity of Robin constant and logarithmic capacity of a compact set. Moreover E is contained in the −∞ locus of an explicitly constructed subharmonic function on C that is not identically −∞, so E is also subharmonically polar.

The Axiom of Countable Choice is used through the local integrability and subharmonicity of compactly supported logarithmic potentials (Distributional Laplacian of a compact logarithmic potential), which enters the construction of the witness; the diagonal +∞ of the logarithmic kernel and the countable atom computation of the energy are choice-free.

Facts & Assumptions

Given: an at most countable set E⊆C, the logarithmic kernel k(z,w)=log⁡(1/∣z−w∣) with diagonal value +∞, the potentials Uμ, pμ=−Uμ and the energy I(μ) of Logarithmic potential and energy of a positive compactly supported measure, the Robin constant VF and capacity cap⁡(F) of Robin constant and logarithmic capacity of a compact set, and the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)).

[F1]

k(z,w)=log⁡1∣z−w∣∈(−∞,+∞] is Borel, equals +∞ exactly when z=w, and pμ(z)=∫log⁡∣z−w∣ dμ(w)∈[−∞,+∞) for every finite positive Borel measure μ of compact support; for R>diam⁡(supp⁡μ) one has kR=k+log⁡R≥0 on the product of the support with itself and I(μ)=∬kR dμ dμ−μ(C)2log⁡R, independently of R (Logarithmic potential and energy of a positive compactly supported measure).

[F2]

For nonempty compact F, VF=inf⁡ν∈P(F)I(ν) and cap⁡(F)=e−VF when VF<+∞, cap⁡(F)=0 when VF=+∞; cap⁡(∅)=0; and cap⁡(F)=0 holds exactly when I(ν)=+∞ for every Borel probability ν on F (Robin constant and logarithmic capacity of a compact set).

[F3]

Capacity-polar means that every compact subset has capacity zero, and subharmonically polar means that every point of the set lies in a complex domain carrying a subharmonic function that is −∞ on the part of the set lying in that domain (Capacity-polar sets, quasi-everywhere, and subharmonic polar sets).

[F4]

Assume ACω: for a finite positive Borel measure μ with nonempty compact support, pμ is locally integrable on C and subharmonic on the domain C, and harmonic on C∖supp⁡μ (Distributional Laplacian of a compact logarithmic potential, A complex domain is a nonempty connected open subset of C).

[F5]

For every a∈C the function z↦log⁡∣z−a∣ is subharmonic on C (The logarithm of the modulus of a holomorphic function is subharmonic) and is C∞ and harmonic on C∖{a} (Logarithmic modulus is harmonic off its centre); a real function is harmonic when it is C2 and uxx+uyy=0 (Plane harmonic functions), and a C2 function with uxx+uyy≥0 is subharmonic (A C^2 function is subharmonic exactly when its Laplacian is nonnegative).

[F6]

Nonnegative linear combinations of finitely many subharmonic functions are subharmonic (Positive linear combinations and finite maxima preserve subharmonicity); in particular, by [F5] a sum of a subharmonic function and a harmonic function is subharmonic.

[F8]

Differentiation under the integral sign: if f:X×I→C has x↦f(x,t) integrable for every t in an open interval I, is differentiable in t for almost every x, has measurable t-derivative, and the t-derivative is dominated in modulus by an integrable g independent of t, then t↦∫f(x,t) dμ(x) is differentiable on I with derivative ∫∂tf dμ (Differentiation under the integral sign).

[F9]

Dirac measures are probability measures, and finite or countable nonnegative weighted sums of measures are measures, with the integral identity ∫g d(∑jcjμj)=∑jcj∫g dμj for nonnegative Borel g, by the pointwise definition and monotone convergence (The Dirac set function at a point, Probability measures and probability spaces, Nonnegative scalar multiples and countable weighted sums of measures, Nonnegative scalar multiples and countable weighted sums of measures are measures, Monotone convergence for the integral).

[F11]

Subharmonicity on a complex domain means: upper semicontinuity, no connected component carrying the value −∞ identically, and the circle mean inequality at every closed disc contained in the domain (Subharmonic functions on plane domains); every subharmonic function on a plane domain is locally integrable (Plane subharmonic functions are locally integrable).

[F12]

A subset of an at most countable set is at most countable, a set is countably infinite when it is in bijection with N, and a finite or countably infinite set can be listed without repetitions (Finite, countably infinite, countable, uncountable).

Verification

technique · direct
1.1givenF3

The statements to prove are the capacity-polarity of E and the existence of a subharmonic witness with E in its −∞ locus; two elementary cases come first, and the countably infinite case occupies the rest of the proof.

1.2F2F3F5given

The empty case. If E=∅ there is no compact subset to test, so E is capacity-polar by [F3] and [F2], and the zero function u≡0 is of class C2 with vanishing Laplacian, hence harmonic and therefore subharmonic on the domain C by [F5], while its −∞ locus is empty; so the statement holds for E=∅.

1.3F12given

A compact at most countable set has capacity zero. Let F⊆E be compact and nonempty; by [F12] the set F is at most countable, so it can be listed without repetitions as F={b1,b2,… } (the list is finite when F is finite and otherwise is a bijection with N; for F⊆E with E in bijection with N the listing comes from ordering the corresponding subset of N, which uses no choice). Let ν be a Borel probability measure on F; by countable additivity over the disjoint singletons 1=ν(F)=∑iν({bi}), so some index i0 has m:=ν({bi0})>0, since otherwise the sum would be 0.

1.4F5F6F9F12algebra

The finite nonempty case and its witness. Let E={a1,…,am} be finite and nonempty, listed without repetitions by [F12], and put cj:=2−j∈(0,∞) and σ:=∑j=1mcjδaj; by [F9] the set function σ is a finite positive Borel measure carried by E, and for every nonnegative Borel g one has ∫g dσ=∑j=1mcjg(aj). Put u(z):=pσ(z)=∑j=1mcjlog⁡∣z−aj∣; since the sum is finite and each z↦log⁡∣z−aj∣ is subharmonic by [F5], [F6] makes u subharmonic on C. At z=aj every summand with index k≠j is the finite number log⁡∣aj−ak∣ because the points are distinct, while the j-th summand is −∞, so u(aj)=−∞; thus E lies in the −∞ locus of the subharmonic function u, which is not identically −∞ because it is finite at every point outside the finite set E.

1.5F9givenalgebra

The countably infinite case: the measure and the potential. Let E={a1,a2,… } be a listing without repetitions of a countably infinite set, and put cj:=2−j/(1+log⁡(1+∣aj∣))>0 and σ:=∑j=1∞cjδaj. Since cj(1+log⁡(1+∣aj∣))=2−j, one has ∑jcj(1+log⁡(1+∣aj∣))=1<+∞ and in particular σ(C)=∑jcj≤1; by [F9] the weighted sum σ is a finite positive Borel measure with ∫g dσ=∑jcjg(aj) for every nonnegative Borel g, so applying this to g(w)=log⁡(1+∣w∣) gives the finite logarithmic moment ∫log⁡(1+∣w∣) dσ(w)=∑jcjlog⁡(1+∣aj∣)≤1<+∞.

2.1F1F9givenalgebra

With ν, F and bi0 as in step 1.3, choose R>diam⁡(F) and put kR(z,w)=k(z,w)+log⁡R≥0 on F×F; at the diagonal point (bi0,bi0) one has kR=+∞, and the atom {bi0} carries ν-mass m>0. The inner integral at z=bi0 is +∞: for every real M the nonnegative function w↦kR(bi0,w) satisfies kR(bi0,w)≥M1{bi0}(w), so by monotonicity of the integral this inner integral is at least M m for every real M and hence equals +∞. Therefore the iterated double integral of the nonnegative function kR against ν⊗ν is infinite, and [F1] gives I(ν)=+∞.

2.2step 1.5F9given

Put u(z):=pσ(z)=∫log⁡∣z−w∣ dσ(w)∈[−∞,+∞). At z=aj0 the positive part is finite because log⁡+∣aj0−w∣≤log⁡(1+∣aj0∣)+log⁡(1+∣w∣) has finite σ-integral by step 1.5, while the negative part satisfies log⁡−∣aj0−w∣≥M1{aj0}(w) for every real M and σ({aj0})=cj0>0, so ∫log⁡−∣aj0−w∣ dσ(w)=+∞ by monotonicity of the integral; therefore u(aj0)=∫log⁡+−∫log⁡−=−∞, that is, u=−∞ on E.

2.3step 1.5givenalgebra

Local decomposition of the potential. Fix N≥1 with N≥∣a1∣, so that the disc below meets E, and split σ into the finite positive Borel measures σN:=σ ⁣↾{∣w∣≤2N+1} and σN:=σ ⁣↾{∣w∣>2N+1}, whose pointwise sum is σ. For z∈D(0,N) and w with ∣w∣>2N+1 one has ∣z−w∣≥∣w∣−N>N+1>1, so the two extended integrals ∫{∣w∣≤2N+1}log⁡∣z−w∣ dσ(w) and ∫{∣w∣>2N+1}log⁡∣z−w∣ dσ(w) have finite positive parts by the logarithmic moment in step 1.5; the compact part may have infinite negative part, while the tail has zero negative part and finite integral. Thus their sum is a well-defined extended integral and u(z)=pσN(z)+pσN(z) for pσN(z):=∫{∣w∣>2N+1}log⁡∣z−w∣ dσ(w)∈R.

3.1step 1.3step 2.1F2F3

Since every Borel probability ν on F has I(ν)=+∞ by step 2.1, the characterization [F2] gives VF=+∞ and cap⁡(F)=0, and the empty compact set also has cap⁡(∅)=0 by [F2]; as F⊆E was an arbitrary compact subset, E is capacity-polar. This proves the first assertion for every at most countable E, including the finite case.

3.2step 2.3F4given

The first summand in step 2.3 is subharmonic on C: σN is a finite positive Borel measure with nonempty compact support supp⁡σN⊆{∣w∣≤2N+1}, so [F4], whose hypothesis ACω is the standing assumption, gives that pσN is locally integrable and subharmonic on the domain C.

3.3step 1.5step 2.3F5F8algebra

The second summand of step 2.3 is harmonic on D(0,N). Fix w with ∣w∣>2N+1 and write z=x+iy; on D(0,N) the function z↦log⁡∣z−w∣ is smooth with ∣z−w∣>N+1, and it is harmonic off w by [F5]. The differentiation theorem [F8] applies to the two real parameters: the integrand is σN-integrable for every z∈D(0,N) since 0<log⁡∣z−w∣≤log⁡2+log⁡(1+∣w∣) and ∫log⁡(1+∣w∣) dσN(w)<+∞ by step 1.5, and the partial derivatives of order one and two in x and y are bounded on D(0,N)×{∣w∣>2N+1} by constants (N+1)−1 and (N+1)−2, which are σN-integrable because σN(C)≤1. Applying [F8] to the x-parameter and to the y-parameter, and then to the resulting first partial derivatives, shows that pσN is twice continuously differentiable on D(0,N) with second partial derivatives obtained by differentiating under the integral (continuity of these derivatives follows from their pointwise continuity and the same integrable bounds by Dominated convergence); since ∂x2log⁡∣z−w∣+∂y2log⁡∣z−w∣=0 for z≠w by [F5], summing gives (∂x2+∂y2)pσN(z)=∫(∂x2+∂y2)log⁡∣z−w∣ dσN(w)=0 on D(0,N), so pσN is harmonic there by [F5].

4.1step 2.2step 3.2step 3.3F3F5F6F11

On D(0,N) the function u=pσN+pσN is subharmonic: the first summand is subharmonic on C, hence on D(0,N), by step 3.2, the second is harmonic, hence subharmonic by the C2 criterion of [F5], and a sum of two subharmonic functions is subharmonic by [F6]. Since every z0∈C lies in some such disc D(0,N) with N≥∣a1∣ and N>∣z0∣, the function u meets the defining conditions of [F11] on the domain C: it is upper semicontinuous because upper semicontinuity is local and holds on each D(0,N) by subharmonicity there, it is not identically −∞ on any D(0,N) because it is subharmonic there, and the circle mean inequality holds at every closed disc of C because each such disc is contained in some D(0,N) on which u is subharmonic. Therefore u is subharmonic on C and not identically −∞; by step 2.2 it is −∞ on E, so E lies in the −∞ locus of the explicitly constructed subharmonic function u, and for every x∈E the single neighbourhood Ux:=C with witness u exhibits the local condition of [F3], so E is subharmonically polar.

5.1step 1.2step 3.1step 1.4step 4.1F4F12given∎

The first assertion of the statement was proved in step 3.1 for every at most countable E without further choice, the listings being supplied by countability itself ([F12]) and the atom computation being choice-free; steps 1.4 and 4.1 construct the witness in the finite and countably infinite cases, and step 1.2 covers the empty set. The only choice principle spent anywhere is the Countable Choice of [F4] used in step 3.2, which is the standing hypothesis ACω. This proves both assertions.

Remarks

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Two Cantor sets with different logarithmic capacities

Statement

Assume the Axiom of Choice. Let C⊆[0,1] be the middle-thirds Cantor set with Cantor measure μc (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds, The Cantor measure). Then

I(μc)≤3log⁡3<+∞,hencecap⁡(C)≥e−3log⁡3=127>0.

Let ℓn:=e−4n for n≥1 and let K⊆[0,1] be the nested binary Cantor set constructed as follows: K0=[0,1] is one closed cell, and each level-(n−1) cell [a,a+s] is replaced by the two disjoint closed cells [a,a+ℓn] and [a+s−ℓn,a+s], with Kn the union of the resulting 2n cells and K:=⋂n≥0Kn. Then every Borel probability ν on K has I(ν)=+∞, so VK=+∞ and cap⁡(K)=0.

Both C and K are uncountable compact Lebesgue-null subsets of [0,1]. Thus Lebesgue measure and cardinality alone do not determine logarithmic capacity.

Facts & Assumptions

Given: the Cantor set C and its Cantor measure μc, the number ℓn=e−4n, the Axiom of Choice, and the capacity and energy conventions of Robin constant and logarithmic capacity of a compact set and Logarithmic potential and energy of a positive compactly supported measure.

[F1]

For a finite positive Borel measure ν of compact support and R>diam⁡(supp⁡ν) one has I(ν)=∬kR dν dν−ν(C)2log⁡R with kR(z,w)=log⁡(R/∣z−w∣), and VK=inf⁡ν∈P(K)I(ν) with cap⁡(K)=e−VK when VK<+∞ and 0 otherwise (Logarithmic potential and energy of a positive compactly supported measure, Robin constant and logarithmic capacity of a compact set).

[F2]

The Cantor set C=⋂nCn is compact, uncountable and λ1(C)=0; every x∈C is Φ(a)=∑k≥0ak3−k−1 for a unique sequence a with values in {0,2}, the first m digits determine the level-m basic interval Ib=[∑j=1m2bj3−j,∑j=1m2bj3−j+3−m], and b↦Φ((2bk)k≥0) is a bijection from {0,1}N onto C (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds, The Cantor set is exactly the set of ∑k≥1ak3−k with every ak∈{0,2}, and this gives a bijection with {0,1}N, The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points).

[F3]

Assume Countable Choice. The Cantor measure μc is a Borel probability measure with μc(R∖C)=0, it is atomless, and μc(Ib)=2−m for every level-m basic interval Ib (The Cantor measure, The Cantor measure is a singular atomless probability measure concentrated on the Cantor set, Cantor basic intervals have their expected masses).

[F4]

Layer cake for p=1: for a measure space (X,A,ρ) and a measurable f≥0 one has ∫Xf dρ=∫0∞ρ({f>t}) dt, both sides allowed to be +∞ (For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function).

[F5]

The product measure μc⊗μc is a measure on R2 with (μc⊗μc)(A×B)=μc(A)μc(B), and Tonelli's theorem computes integrals of nonnegative product-measurable integrands as iterated integrals (The product measure of two sigma-finite measure spaces, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[F6]

Finite Cauchy–Schwarz: (∑k<nak)2≤n∑k<nak2 for reals ak (The Cauchy-Schwarz inequality for finite sums).

[F7]

A nested sequence of closed bounded intervals whose lengths tend to 0 has an intersection that is exactly one point (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 0), and the recursive construction of the families (Kn) is licensed by the recursion theorem (The recursion theorem).

[F8]

Under Countable Choice, the Axiom of Choice yields Countable Choice (The Axiom of Countable Choice (ACω), AC implies DC implies countable choice); a subset of a countable set is countable (Finite, countably infinite, countable, uncountable); and a set is Lebesgue-null when it is contained in the union of countably many intervals of arbitrarily small total length (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

Verification

technique · direct
1.1F2F3F8

By [F3] and [F8] the Cantor measure μc is a Borel probability with μc(C)=1 and no atoms, so μc⊗μc({(x,x):x∈C})=∫μc({x}) dμc(x)=0; by [F2] the set C is compact and uncountable with λ1(C)=0.

1.2F2F3

For every m≥0 and every word b∈{0,1}m the level-m basic interval Ib has μc(Ib)=2−m, and by [F2] the intervals Ib, b∈{0,1}m, are the digit cylinders and are pairwise disjoint.

2.1step 1.2F2F5

If x=Φ(a) and y=Φ(a′) have different first m digits, let k<m be the first index with ak≠ak′; then ∣x−y∣≥2⋅3−k−1−∑j>k2⋅3−j−1=3−k−1≥3−m, so {∣x−y∣<3−m} is contained in the set where the first m digits agree, that is, in ⋃bIb×Ib with the Ib of step 1.2. Hence (μc⊗μc)({∣x−y∣<3−m})≤∑b∈{0,1}mμc(Ib)2=2m⋅2−2m=2−m.

2.2step 1.1F7F8

The construction of the cells is licensed by [F7]. For n=1, 2ℓ1=2e−4<1=ℓ0; for n≥2, ℓn=ℓn−14 and ℓn−1≤e−4, so 2ℓn/ℓn−1=2ℓn−13≤2e−12<1. Thus the two children of each level-(n−1) cell are disjoint closed intervals of length ℓn contained in it, and (Kn) is a nested sequence of nonempty compact sets with 2n cells of length ℓn at level n. Therefore K=⋂nKn is compact and nonempty, and λ1(K)=0 because the level-n cells cover K and their total length 2nℓn=2ne−4n→0.

3.1step 2.1F1F4F5

Since μc has total mass 1 and support in [0,1], [F1] gives I(μc)=∬log⁡1∣x−y∣ dμc(x) dμc(y); applying [F4] on the product measure of [F5] and splitting the integral at t=mlog⁡3, I(μc)=∫0∞(μc⊗μc)({∣x−y∣<e−t}) dt≤log⁡3+∑m≥0(log⁡3) (μc⊗μc)({∣x−y∣<3−m})≤log⁡3+(log⁡3)∑m≥02−m=3log⁡3<+∞, where step 2.1 bounds each dyadic piece. Therefore VC≤I(μc)<+∞ and cap⁡(C)=e−VC≥e−3log⁡3=127>0.

3.2step 2.2F6

For a Borel probability ν on K put mn,k:=ν(In,k) for the 2n level-n cells In,k of step 2.2; since ν is carried by K⊆⋃kIn,k and the cells are pairwise disjoint, ∑kmn,k=1, so by [F6] with the constant list 1 one has 1=(∑kmn,k)2≤2n∑kmn,k2, that is, ∑kmn,k2≥2−n.

4.1step 3.2F1F4F5

With ν, the cells In,k and the masses mn,k of step 3.2, [F1] gives I(ν)=∬log⁡1∣x−y∣ dν(x) dν(y) because ν is a probability on [0,1]; two points of one level-n cell satisfy ∣x−y∣≤ℓn, so for t<4n the event of lying in the same level-n cell is contained in {∣x−y∣<e−t} and hence (ν⊗ν)({∣x−y∣<e−t})≥∑kmn,k2≥2−n; by [F4] and [F5], I(ν)≥∑n≥1∫4n−14n2−n dt=∑n≥1(4n−4n−1)2−n=34∑n≥12n=+∞.

5.1step 4.1F1

Every ν∈P(K) has I(ν)=+∞ by step 4.1, so the infimum VK is +∞ and cap⁡(K)=0 by [F1].

6.1step 1.1step 3.1step 2.2step 5.1F2F7F8∎

For each b∈{0,1}N the cells In,b↾n form a nested family of closed intervals with lengths ℓn→0, so by [F7] their intersection contains exactly one point φ(b)∈K; distinct infinite words differ at some level n, where their cells are disjoint, so φ is injective. If K were countable then its subset φ({0,1}N) would be countable by [F8], and since {0,1}N is in bijection with C by [F2] and C is uncountable, that is impossible; hence K is uncountable. Thus C has positive capacity and K has zero capacity although both are uncountable compact Lebesgue-null sets.

Remarks

Where the thin geometric decay is used. In step 4.1 the level-n cells have length ℓn=e−4n, so the time window (4n−1,4n) in the layer-cake formula sees the whole level-n cell mass; the divergent series ∑n3⋅2n−1 is what forces I(ν)=+∞. The zero-capacity conclusion here uses the divergent weighted logarithmic windows, not merely summability of ∑n2nℓn or decay faster than every exponential. For example, lengths ℓn=e−n2 also decay faster than every exponential, but the equal-branch probability (the pushforward of μc under the binary coding map) has finite energy: pairs first separated at level n have distance at least ℓn−1−2ℓn, with ℓ0=1, and have probability 2−n, while the diagonal has probability zero because the probability of agreeing through level m is 2−m→0. Thus their energy contribution is bounded by 2−n((n−1)2+C) for a fixed constant C, a summable series. The middle-thirds scaling likewise gives finite energy by step 3.1.

Choice. The statement assumes the Axiom of Choice, but the proof uses only Countable Choice, through the Cantor measure and cylinder-mass suppliers [F3] and the general conversion [F8]; with those suppliers granted, the construction of K, the layer-cake computations and the cardinality argument are choice-free.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Riesz measure of a log modulus records the holomorphic zeros

Statement

Assume Dependent Choice. Let Ω⊆C be a complex domain and let f be holomorphic on Ω, not identically zero on any connected component of Ω. Put u:=log⁡∣f∣, subharmonic on Ω (The logarithm of the modulus of a holomorphic function is subharmonic), with Riesz measure μu=(2π)−1Δu (Distributional Riesz measure of a plane subharmonic function). Then

μu=∑a∈Z(f)ord⁡a(f) δa,

where Z(f)={a∈Ω:f(a)=0}, the integers ord⁡a(f)≥1 are the vanishing orders (The order of a zero is the exponent in its local holomorphic factorization) and δa is the unit Dirac measure at a (The Dirac set function at a point); the sum is a locally finite positive measure on Ω. In particular log⁡∣f∣ has no Riesz mass on Ω∖Z(f).

Facts & Assumptions

Given: a complex domain Ω, a holomorphic f on Ω not identically zero on any component, the function u=log⁡∣f∣, and Dependent Choice.

[F1]

A holomorphic function on a complex domain that vanishes on a neighbourhood of a point vanishes identically: that neighbourhood supplies an accumulating set of zeros for Identity theorem for holomorphic functions. Thus the given nonzero f cannot have infinite order anywhere, since infinite order is equivalent to local vanishing by The order of a zero is the exponent in its local holomorphic factorization. For a∈Ω, a holomorphic function has finite order m=ord⁡a(f) at a exactly when f(z)=(z−a)mg(z) on a neighbourhood of a with g holomorphic and g(a)≠0; f(a)=0 holds exactly when m≥1, and if m=0 then f≠0 near a (The order of a zero is the exponent in its local holomorphic factorization).

[F2]

The function u=log⁡∣f∣ is subharmonic on Ω (The logarithm of the modulus of a holomorphic function is subharmonic); a zero-free holomorphic h on a disc admits h=exp⁡L with L holomorphic (A nonvanishing holomorphic function on a disc has a holomorphic logarithm); a holomorphic function on an open set is smooth, and its real part is C2 with Δ(Re⁡L)=0 wherever L is holomorphic (Holomorphic functions are real analytic and smooth in their two real coordinates, The C2 real and imaginary parts of a holomorphic function satisfy Laplace's equation and form a harmonic-conjugate pair).

[F3]

Under Dependent Choice the Riesz functional μu(φ)=(2π)−1∫ΩuΔφ dA is a positive Radon measure, and it is the unique positive Radon measure representing μu on Cc∞(Ω) (The distributional Riesz functional of a subharmonic function is a positive Radon measure, Distributional Riesz measure of a plane subharmonic function); moreover (2π)−1∫log⁡∣z−a∣ Δφ dA=φ(a) for every φ∈Cc∞(C), that is, μlog⁡∣⋅−a∣=δa (Distributional Laplacian of a compact logarithmic potential); Dependent Choice yields Countable Choice (Dependent choice implies countable choice).

[F4]

For h∈C2 on an open set, ΔTh=TΔh; in particular if Δh=0 pointwise then ∫hΔφ dA=0 for every compactly supported smooth test function φ (Distributional differentiation is continuous and commutes).

[F5]

A δa is a probability measure concentrated at a, finite or countable nonnegative sums of measures are measures, and every bounded infinite subset of R2≅C has an accumulation point (The Dirac set function at a point, Nonnegative scalar multiples and countable weighted sums of measures are measures, For n≥1 every bounded sequence in Rn has a convergent subsequence).

[F6]

If a compact C lies in an open set U⊆R2, there is a smooth compactly supported cutoff in U equal to 1 on a neighbourhood of C (Test function cutoffs and euclidean localization).

[F7]

Under Countable Choice, every Borel measure finite on compact sets on a second-countable locally compact Hausdorff space is Radon (Locally finite Borel measures on second-countable LCH spaces are regular); Dependent Choice supplies Countable Choice by Dependent choice implies countable choice.

Verification

technique · direct
1.1F1given

Let a∈Ω with f(a)=0 and let m:=ord⁡a(f)≥1 by [F1]. By [F1] there are a disc D(a,r)⊆Ω and a holomorphic zero-free g on it with f(z)=(z−a)mg(z), so f(z)≠0 for 0<∣z−a∣<r: every zero of f is isolated.

1.2F6given

Fix φ∈Cc∞(Ω). If φ=0 the identity is immediate; otherwise put K0:=supp⁡φ. For each x∈K0 there are concentric relatively compact discs V⋐D⋐Ω with x∈V and D‾ containing at most one zero of f, since zeros are isolated. These smaller discs form an open cover of K0; compactness gives finitely many pairs (Vi,Di) with the Vi covering K0. By [F6], choose βi∈Cc∞(Di) with βi≥0 and βi=1 on a neighbourhood of Vi‾. On W:=⋃iVi the sum S:=∑iβi is positive. Define φi:=φβi/S on W and zero off W; since K0⋐W, each φi∈Cc∞(Di), and ∑iφi=φ.

2.1step 1.1F5F7F8

Let K⊆Ω be compact and suppose it contained infinitely many distinct zeros of f. By [F5] the infinite bounded set Z(f)∩K has an accumulation point z∗∈K⊆Ω; continuity gives f(z∗)=0, contradicting the isolation of zeros from step 1.1. Thus each compact subset meets Z(f) finitely. Since Ω is second-countable and every zero is isolated, Z(f) is at most countable: assign each zero the least element of a fixed enumerated basis that contains it and no other zero; distinct zeros receive distinct basis elements. The countable sum λ:=∑a∈Z(f)ord⁡a(f) δa is a positive Borel measure by [F5], locally finite by the compact finiteness just proved. The open set Ω is second-countable and locally compact Hausdorff by [F8]; Dependent Choice supplies the Countable Choice of [F7], so λ is Radon.

2.2step 1.2F1F2F3F4

For each Di from step 1.2, either f has no zero, or it has exactly one zero ai of order mi. In the latter case the local factorization [F1] extends Fi(z):=f(z)/(z−ai)mi holomorphically and without zeros throughout Di; in the zero-free case set Fi:=f and mi:=0. Then u=milog⁡∣z−ai∣+log⁡∣Fi∣ on Di when mi>0, and u=log⁡∣Fi∣ when mi=0. By [F2], log⁡∣Fi∣ is harmonic, so its Riesz functional vanishes by [F4]; the point-mass normalization [F3] therefore gives μu(φi)=miφi(ai)=∫φi dλ when mi>0, and both sides are zero when mi=0.

3.1step 1.2step 2.2

Summing the local identities of step 2.2 over the finite partition φ=∑iφi from step 1.2 gives μu(φ)=∑iμu(φi)=∑i∫φi dλ=∫φ dλ for every φ∈Cc∞(Ω).

4.1step 2.1step 3.1F3∎

Since λ is a positive Radon measure by step 2.1 that represents μu on all smooth compactly supported tests, the uniqueness clause of [F3] gives μu=λ=∑a∈Z(f)ord⁡a(f)δa, which is the asserted formula; in particular every compact subset of Ω∖Z(f) carries no λ-mass, so log⁡∣f∣ has no Riesz mass off the zero set.

Remarks

The vanishing order is exactly the Riesz mass. Step 3.1 shows the mass at a zero a is the order m=ord⁡a(f), not merely a positive integer: the factor mlog⁡∣z−a∣ contributes mδa through the normalization Δlog⁡∣z−a∣=2πδa, while the zero-free factor F contributes nothing.

Finite local cover. Each compact test support is covered by finitely many discs on which the zero divisor has at most one point. A finite smooth partition subordinate to this cover reduces the distributional identity to the local factorization at each zero.

Choice. Dependent Choice is used through Countable Choice in the Riesz representation, kernel-normalization and local-regularity suppliers, and through the Bolzano–Weierstrass accumulation step. The finite cover, cutoffs, factorization and harmonicity calculations use no further choice.

ExampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-10-02Open item page →

Infinity-pole Green function recovered from a circular conductor

Statement

Assume the Axiom of Choice. Let a∈C, r>0, let K:=D(a,r)‾ be the closed disc, and let Ω:={z∈C:∣z−a∣>r} be its exterior. Then the normalized infinity-pole Green function of Ω is

gΩ(z,∞)=g(z):=log⁡∣z−a∣r(z∈Ω),

so that gΩ(z,∞)=VK−UμK(z) on Ω. Moreover g has boundary limit 0 at every point of the boundary circle {z:∣z−a∣=r}, with no exceptional set, and g(z)−log⁡∣z∣→−log⁡r as ∣z∣→∞.

The Axiom of Choice is spent through the equilibrium-measure input (Capacity of a disc and its circular equilibrium measure and Green function at infinity from the equilibrium potential); the explicit radial computations for g are choice-free.

Facts & Assumptions

Given: a∈C, r>0, the closed disc K:=D(a,r)‾, its exterior Ω:={z:∣z−a∣>r}, the Axiom of Choice, and the conventions of Logarithmic potential and energy of a positive compactly supported measure, Robin constant and logarithmic capacity of a compact set, Capacity-polar sets, quasi-everywhere, and subharmonic polar sets and Green function with a pole at infinity.

[F1]

Assume the Axiom of Choice. With K:=D(a,r)‾ and μ the normalized arclength measure dμ=dt/(2π) on the circle w=a+reit, μ is the unique equilibrium measure of K, Uμ(z)=log⁡1r(∣z−a∣≤r),Uμ(z)=log⁡1∣z−a∣(∣z−a∣≥r), and cap⁡(K)=r with Robin constant VK=log⁡(1/r); the same potential, capacity and equilibrium measure hold for the boundary circle (Capacity of a disc and its circular equilibrium measure).

[F2]

A Green function of Ω with pole at infinity and Robin constant VK is a function g:Ω→R that is positive and harmonic on Ω, satisfies g(z)−log⁡∣z∣→VK as ∣z∣→∞, is locally bounded near every point of ∂Ω, and has boundary limit 0 outside a Borel capacity-polar subset of ∂Ω; if existence and uniqueness hold the function is written gΩ(⋅,∞) (Green function with a pole at infinity).

[F3]

A compact set K with cap⁡(K)>0 is nonempty, Ω:=Ω(K) denotes the unbounded connected component of C∖K and is a complex domain with compact boundary ∂Ω⊆K, and VK=inf⁡μ∈P(K)I(μ) is a real number (Green function with a pole at infinity, Robin constant and logarithmic capacity of a compact set).

[F4]

Assume the Axiom of Choice. For K⊆C compact with cap⁡(K)>0, the unbounded component Ω of C∖K, the equilibrium measure μK and VK=log⁡1cap⁡(K), the function g(z)=VK−UμK(z) satisfies properties 1-4 of [F2], every function satisfying properties 1-4 equals it, and gΩ(z,∞)=VK−UμK(z) on Ω; hence K has exactly one Green function with pole at infinity (Green function at infinity from the equilibrium potential).

[F5]

For every a∈C the function ua(z)=log⁡∣z−a∣ is smooth and harmonic on C∖{a}; no choice principle is required (Logarithmic modulus is harmonic off its centre, Plane harmonic functions).

[F6]

If K⊆C is compact, the complement C∖K has exactly one unbounded connected component and every other component is bounded; for K=D(a,r)‾ that component is {z:∣z−a∣>r}, which is therefore a complex domain (The complement of a compact plane set has exactly one unbounded connected component, A complex domain is a nonempty connected open subset of C).

[F7]

A set is capacity-polar when every compact subset of it has capacity zero; ∅ is capacity-polar, and a subset of a capacity-polar set is capacity-polar (Capacity-polar sets, quasi-everywhere, and subharmonic polar sets).

[F8]

The Axiom of Choice implies Dependent Choice, which implies Countable Choice (AC implies DC implies countable choice).

Verification

technique · direct
1.1F1F3F6given

Setup. With K=D(a,r)‾ and Ω={z:∣z−a∣>r}, [F6] identifies Ω with the unbounded connected component of C∖K and makes it a complex domain with ∂Ω={z:∣z−a∣=r}; by [F1] cap⁡(K)=r>0, VK=log⁡1r, and the equilibrium measure μK has potential UμK(z)=log⁡1∣z−a∣ for ∣z−a∣≥r and UμK(z)=log⁡1r for ∣z−a∣≤r.

1.2F5algebragiven

Positivity and harmonicity. Define g(z):=log⁡∣z−a∣r for z∈Ω. Then g(z)>0 on Ω, since ∣z−a∣>r; and g is harmonic on Ω, because log⁡∣z−a∣ is harmonic on the open set C∖{a}⊇Ω by [F5] and subtracting the constant log⁡r leaves its Laplacian zero.

1.3givenalgebra

Boundary values, local boundedness and the infinity normalization. If ξ∈∂Ω, that is ∣ξ−a∣=r, then for z∈Ω, ∣g(z)−0∣=log⁡∣z−a∣r→log⁡rr=0 as z→ξ, and for every δ>0 one has sup⁡{g(z):z∈Ω, ∣z−ξ∣<δ}≤log⁡r+δr<+∞; moreover g(z)−log⁡∣z∣=log⁡∣z−a∣∣z∣−log⁡r→−log⁡r as ∣z∣→∞, because ∣z−a∣∣z∣→1 and log⁡ is continuous at 1.

2.1step 1.1step 1.2F1

Identification with the equilibrium potential. On Ω one has ∣z−a∣>r, so by [F1] UμK(z)=log⁡1∣z−a∣ there and VK−UμK(z)=log⁡1r−log⁡1∣z−a∣=log⁡∣z−a∣r=g(z).

2.2step 1.2step 1.3F2F7

The explicit function is a Green function. Steps 1.2 and 1.3 give properties 1, 2 and 3 of [F2] for g with Robin constant VK=log⁡1r; property 4 holds with the exceptional set E:=∅, because step 1.3 gives the boundary limit 0 at every point of ∂Ω, and ∅ is Borel and capacity-polar by [F7]. Hence g is a Green function of Ω with pole at infinity and Robin constant VK in the sense of [F2].

3.1step 1.1step 2.1step 2.2F4

Uniqueness and the notation. By step 1.1, K is compact with cap⁡(K)=r>0, so [F4] applies and gives: the Green function of Ω with pole at infinity exists, every function satisfying properties 1-4 of [F2] equals VK−UμK, and the notation gΩ(⋅,∞) is licensed with gΩ(z,∞)=VK−UμK(z) on Ω. By step 2.2 the function g satisfies properties 1-4, so g=VK−UμK=gΩ(⋅,∞) on Ω by step 2.1, and the boundary and normalization assertions are step 1.3.

4.1step 2.1step 3.1F1F4F8∎

Assembly and choice. Assertions of the Statement are exactly steps 2.1 and 3.1 (identification, notation, boundary limit on the entire circle and the infinity normalization); the boundary set is empty, so no exceptional set is needed. The Axiom of Choice is used only through [F1] and [F4], which by [F8] also supply Dependent and Countable Choice to their equilibrium-measure and Frostman inputs; the radial computations of steps 1.2, 1.3 and 2.1 are choice-free.

Remarks

Direct radial computation, not the general quasi-everywhere machinery. The properties of g are verified here by direct radial computation: positivity and harmonicity came from log⁡∣z−a∣ being harmonic off its centre, the boundary limit 0 holds at every boundary point because g=log⁡(∣z−a∣/r) extends continuously to the closed exterior with value 0 on the circle, and the normalization at infinity is the elementary limit log⁡(∣z−a∣/∣z∣)→0. In particular the exceptional set in property 4 of Green function with a pole at infinity may be taken empty here; the general quasi-everywhere uniqueness theorem (Green function at infinity from the equilibrium potential) is invoked only for the uniqueness clause, where the ordinary maximum principle on the exterior alone would not suffice for candidates whose boundary limit is assumed only quasi-everywhere.

Sources