Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

The sharp interval bound for Cantor measure

Statement

Assume the Axiom of Countable Choice. Set s=log2/log3. For every interval IR,

μc(I)(diamI)s.

In particular, for every nonempty bounded UR, its induced Cantor outer measure satisfies μc(U)(diamU)s.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Under the standing Countable Choice hypothesis, every level-m basic Cantor interval has mass 2m. Cantor basic intervals have their expected masses

[F2]

For αR, positive-base powers are differentiable with derivative αxα1. Continuity and derivatives of positive-base real powers

[F3]

Measures are continuous from below on increasing measurable sequences. Continuity from below for measures

[F4]

Under the standing Countable Choice hypothesis, μc is an atomless probability concentrated on C. The Cantor measure is a singular atomless probability measure concentrated on the Cantor set

Proof

1.1

Here 0<s<1 and 3s=2. For a,b,c0 with a,cb, one has as+cs(a+b+c)s. Indeed the function (x+y)sxs is nonincreasing in x>0 for fixed y0, by its derivative; continuity extends this to x=0. Increasing a to b and then c to b can only decrease (a+b+c)sascs, whose final value is bs(3s2)=0. If b=0 all three numbers are zero.

F2
1.2

Fix m. For each basic interval J at a level m and each interval I, let NJ(I) count the level-m basic descendants contained in IJ. We prove 2mNJ(I)diam(IJ)s by induction upwards from level m. At that level the count is zero or one; a count of one forces diameter at least 3m and hence the desired bound. Empty intersections have count and diameter zero.

given
2.1

For an earlier J, its two children have length b and are separated by a gap of length b. If I meets neither child the count is zero. If I meets only one child, use its inductive bound and diameter monotonicity. If it meets both, put a=diam(IJleft) and c=diam(IJright). Then a,cb and diam(IJ)a+b+c. Adding the two inductive bounds and using the first step proves the claim for J. Thus for J=[0,1] the total number Nm(I) of level-m intervals contained in I satisfies 2mNm(I)diam(I)s.

step 1.1step 1.2
3.1

For a bounded open interval I, let Em be the union of all level-m basic intervals wholly contained in I. These sets need not increase as subsets of the line, but EmC do increase: each point of C lies in a child of its previous interval. Their union is CI because basic diameters tend to zero. They have measure 2mNm(I) by disjointness, concentration and cylinder masses. Continuity from below therefore gives μc(I)diam(I)s.

F1F3F4step 2.1
4.1

Other bounded interval endpoint conventions change at most two points, which have zero mass, so the same bound holds. A singleton has mass zero, and an empty interval has mass zero; an unbounded interval has infinite diameter and the inequality is immediate. Finally a nonempty bounded U lies in [infU,supU], whose length is exactly its diameter. This Borel superset bounds μc(U) as claimed.

F4step 3.1

Depends on

Used by

Dependency tree · two levels

21 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