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.
An outer measure on two points need not be regular
Statement refuted
Every outer measure is regular: every subset has a Carathéodory measurable hull of the same outer measure.
Facts & Assumptions
Given: The set and , , .
An outer measure on a set is a function that vanishes at the empty set, is monotone, and is countably subadditive. (Outer measures)
A set is Carathéodory measurable for when for every . (Carathéodory measurable sets)
A measurable hull of is a Carathéodory measurable set with ; the outer measure is regular when every subset has a measurable hull. (Measurable hulls and regular outer measures)
Counterexample
Exhausting the four subsets proves normalization and monotonicity. For subadditivity, a union equal to a singleton has a singleton member of total cost at least , while a union equal to either has an member of cost or contains both singleton contributions of total cost ; hence [F1] holds.
For either singleton , the test in [F2] would require , so neither singleton is measurable; and are measurable directly.
The only measurable superset of a singleton is , whose outer measure is larger than the singleton value ; therefore [F3] gives no measurable hull for either singleton, and the outer measure is not regular.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 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.