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 subset of a set of finite signed measure also has finite signed measure
Statement
Let be a signed measure on , let , and suppose . Then every measurable subset also satisfies .
Facts & Assumptions
Given: A signed measure , a measurable set with finite value , and a measurable subset .
A signed measure takes at most one infinite sign and is additive on disjoint measurable unions. (A signed measure is countably additive and takes at most one infinite value)
Proof
The sets and are disjoint and have union , so [L1] gives
If , then the at-most-one-infinite-sign clause in [L1] [L1, step 1.1] forces , so the right side of step 1.1 is , contradicting the finiteness of . The same argument with the signs reversed rules out . Therefore .
The subset was arbitrary, so every measurable subset of has finite [step 2.1] ∎ signed measure.
Depends on
Used by
Dependency tree · two levels
4 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, §6.6 (standard reference, not scraped)