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.
Hahn decomposition for signed measures, unique up to total-variation-null sets
Statement
Assume the Axiom of Choice. Let be a signed measure on . Then there exist measurable sets such that is positive for , and is negative for .
Separately, without any choice axiom, if two such decompositions and are given, then is null for and hence has total variation . This conditional comparison does not assume the general existence assertion.
Facts & Assumptions
Given: A signed measure on in the sense of A signed measure is countably additive and takes at most one infinite value, and the Axiom of Choice (The Axiom of Choice).
A measurable set is positive, negative, or null according to the signs of the signed measures of all its measurable subsets. (Positive, negative, and null sets for a signed measure)
Under AC, a measurable set of positive finite signed measure contains a positive subset whose signed measure is at least as large. (A set of positive finite signed measure contains a positive subset of at least the same mass)
A set is null for a signed measure exactly when its total variation there is . (A set is null for a signed measure exactly when its total variation is zero there)
Proof
A signed measure omits at least one infinite sign. Replacing by swaps positive and negative sets, so first work in the case for every measurable . Put ; the empty set is admissible. If , for every the family of positive sets with is nonempty. If , use instead the nonempty family with . AC selects from these families simultaneously. Set . This is the optimizing-sequence use of AC; the positive-subset supplier [L2] has its separate stated AC use.
For measurable , set . These are disjoint measurable subsets of positive sets, with union . Thus countable additivity gives . Hence is positive and is finite in the chosen sign convention. For each , positivity of gives . The branch would imply for every , impossible. Therefore is finite and , whence .
Put . If a measurable had , its value would be finite by the chosen sign convention. By [L2] it would contain a positive subset with . Disjoint positive sets have positive union, by splitting each measurable subset between them; hence would be positive and , a contradiction. Thus every measurable subset of has nonpositive value, so is negative.
If the original sign was reversed, interchange the two sets just constructed; they then form a positive/negative partition for the original measure. For any two decompositions of that measure, lies in both a positive set and a negative set , and similarly lies in . Every measurable subset of either difference therefore has value zero. Splitting a measurable subset of their disjoint union into its two parts proves that is null. By [L3] its total variation is zero. This uniqueness argument itself makes no sequence choices.
Depends on
Positive, negative, and null sets for a signed measure
A set is null for a signed measure exactly when its total variation is zero there
A set of positive finite signed measure contains a positive subset of at least the same mass
A signed measure is countably additive and takes at most one infinite value
The Axiom of Choice