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 “ is countably additive on every disjoint family of arbitrary subsets of ” is false, already for .
Facts & Assumptions
Given: The objects, conventions, and hypotheses in the statement above.
Under Countable Choice, equals Lebesgue outer measure on every subset of the line. One-dimensional Hausdorff measure on the line is Lebesgue outer measure
Assuming Choice, a Vitali set is not Lebesgue measurable. Assuming the Axiom of Choice, a Vitali set is not Lebesgue measurable
Carathéodory measurability of requires for every test set . Carathéodory measurable sets
Refutation
By the Vitali theorem there is a nonmeasurable . Therefore some fails its Carathéodory splitting identity. Let and ; these are disjoint and their union is . Thus Lebesgue outer measure fails finite additivity on this pair. Full Choice here supplies in particular the Countable Choice hypothesis of the line comparison.
The line equality transfers this failure to . Add empty sets after to make a disjoint sequence; its sum is still and differs from . Neither piece can be empty, since such a splitting would be automatic. Hence countable additivity on all subsets is false.
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
- Fremlin 264C,I; existing Vitali theorem (standard reference, not scraped)