Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

102 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