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.
A set of positive finite signed measure contains a positive subset of at least the same mass
Statement
Assume the Axiom of Choice. Let be a signed measure on and let satisfy . Then there exists a positive set such that
Facts & Assumptions
Given: A signed measure , a measurable set with , and the Axiom of Choice (The Axiom of Choice).
A measurable set is positive when every measurable subset has nonnegative signed measure. (Positive, negative, and null sets for a signed measure)
Every measurable subset of has finite signed measure. (A subset of a set of finite signed measure also has finite signed measure)
If a disjoint union has finite signed measure, then the resulting real series converges absolutely. (If a disjoint union has finite signed measure, then the signed-measure series converges absolutely)
Proof
For each and measurable , put . If is positive, prescribe the subset . Otherwise : if it is finite, the subsets with form a nonempty family; if it is , use the nonempty family with . Apply AC to this set-indexed family of nonempty admissible-subset families to fix a selector . Define recursively , , and . The are pairwise disjoint, have finite nonpositive values by [L2], and satisfy when is finite, and otherwise. This selector is the precise use of AC; no minimal choice principle is asserted.
Put and . Because , [L2] makes finite, and [L3] makes absolutely convergent. Thus , and only finitely many terms satisfy . The branch therefore occurs only finitely often. For some and every , is finite and . Comparison proves convergence of the tail , and in particular . No assertion about summing earlier infinite values is needed.
If is measurable, then for every , so by definition of . Letting in step 2.1 gives , so [L1] shows that is positive.
Because every term is nonpositive, step 2.1 gives Hence .
Steps 3.1 and 3.2 give a positive subset with .
Depends on
Used by
Dependency tree · two levels
8 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
- John K. Hunter, Measure Theory, Lemma 6.17 (standard reference, not scraped)
- Richard F. Bass, Real Analysis for Graduate Students, Proposition 12.4 (standard reference, not scraped)