Alphabeta Math
False statementConstruction: AI-adaptedVerification: 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 measure is countably additive on every subset

Statement

Assume the Axiom of Choice. The assertion “Hs is countably additive on every disjoint family of arbitrary subsets of Rn” is false, already for n=s=1.

Facts & Assumptions

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

[F1]

Under Countable Choice, H1 equals Lebesgue outer measure on every subset of the line. One-dimensional Hausdorff measure on the line is Lebesgue outer measure

[F2]

Assuming Choice, a Vitali set V[0,1] is not Lebesgue measurable. Assuming the Axiom of Choice, a Vitali set is not Lebesgue measurable

[F3]

Carathéodory measurability of V requires μ(T)=μ(TV)+μ(TV) for every test set T. Carathéodory measurable sets

Refutation

1.1

By the Vitali theorem there is a nonmeasurable V. Therefore some TR fails its Carathéodory splitting identity. Let A=TV and B=TV; these are disjoint and their union is T. Thus Lebesgue outer measure fails finite additivity on this pair. Full Choice here supplies in particular the Countable Choice hypothesis of the line comparison.

F2F3
2.1

The line equality transfers this failure to H1. Add empty sets after A,B to make a disjoint sequence; its sum is still H1(A)+H1(B) and differs from H1(T). Neither piece can be empty, since such a splitting would be automatic. Hence countable additivity on all subsets is false.

F1step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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