Alphabeta Math
TheoremStatement: 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 mass distribution principle

Statement

Assume the Axiom of Countable Choice. Let μ be a finite Borel measure on a metric space X and define

μ(E)=inf{μ(B):EB, B Borel}.

Let AX have μ(A)>0, and let s0 be finite. If C>0 and r0>0 satisfy μ(U)C(diamU)s for every nonempty U of diameter less than r0, then

Hs(A)μ(A)/C>0,dimHAs.

For Borel A, μ(A)=μ(A). A bound μ(B(x,r))Crs for every open ball with 0<r<r0 implies the same diameter bound (with the same C) for sets of diameter less than r0. At exponent zero the nonempty-set cost is one.

Facts & Assumptions

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

[F1]

Hausdorff scale values infimise arbitrary-set covering costs. Unnormalised Hausdorff measure

[F2]

Positive Hs(A) implies dimHAs. Hausdorff dimension is the unique critical exponent

[F3]

Outer measures are monotone and countably subadditive on arbitrary subsets. Outer measures

[F4]

A Borel measure is countably additive on disjoint Borel sets and vanishes at the empty set. Measures on sigma-algebras

Proof

1.1

The function μ vanishes on the empty set, is monotone, and agrees with μ on Borel sets: inclusion gives the lower inequality, while the set itself is a candidate hull. It is countably subadditive: for finite jμ(Ej) choose Borel supersets Bj of costs at most μ(Ej)+ε2j1 and use μ(jBj)jμ(Bj). The latter follows by disjointifying the Borel sets and applying countable additivity. Infinite right sides are automatic. Let ε decrease to zero. Thus it is an outer measure.

F3F4
2.1

Fix 0<δ<r0 and any admissible cover (Uj) of A. Subadditivity and the assumed bound give μ(A)jμ(Uj)Cj(diamUj)s. Infimising gives Hδs(A)μ(A)/C, even if no cover exists. Taking the supremum and using the critical-exponent criterion proves both conclusions; at s=0 the dimension bound is the automatic nonnegativity.

F1F2step 1.1
3.1

For the ball hypothesis, fix a nonempty U of diameter d<r0 and one xU. For every d<r<r0, UB(x,r), so μ(U)Crs. Let r decrease to d. If d=0 and s>0 the bound is zero; if s=0 it is C, as required by the covering-cost convention. This proves the sufficient ball condition without evaluating μ on a non-Borel set.

step 1.1given

Depends on

Used by

Dependency tree · two levels

11 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