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.

Hausdorff dimension is monotone and countably stable

Statement

Assume the Axiom of Countable Choice. For any countable family of subsets of a metric space,

dimH(k0Ak)=supk0dimHAk.

Inclusion implies monotonicity of dimension. Every at most countable set, including the empty set, has dimension zero.

Facts & Assumptions

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

[F1]

Below the critical dimension the Hausdorff measure is infinite, and above it the measure is zero. Hausdorff dimension is the unique critical exponent

[F2]

Hausdorff outer measures are monotone and countably subadditive under Countable Choice. Hausdorff measure is an outer measure

Proof

1.1

If AB, every exponent with Hs(B)=0 also has Hs(A)=0. Infimising zero exponents gives dimHAdimHB, including empty zero-exponent sets. Thus the dimension of the union is at least D=supkdimHAk.

F2
2.1

If D= that lower bound is equality. If D<, for every t>D all Ht(Ak) vanish, so countable subadditivity makes their union null. Its dimension is at most every t>D, hence at most D. This includes D=0.

F1F2step 1.1
3.1

An at most countable set has a cover by its singletons, whose total cost is zero for each t>0. The empty set has the empty cover. Thus their dimensions are zero; one point and every finite set are included.

given

Depends on

Used by

Dependency tree · two levels

12 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