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.
Finite-measure sets are approximable in measure by sets from a countable generating algebra
Statement
Assume the Axiom of Countable Choice.
Let be a sigma-finite measure space whose sigma-algebra is countably generated. Then there is a countable algebra such that for every with and every there exists with
Facts & Assumptions
Given: The Axiom of Countable Choice, a sigma-finite measure space with countably generated.
A countable generator yields a countable algebra (A countable generator of a sigma-algebra yields a countable algebra of sets).
Sigma-finite measures admit an increasing exhaustion by measurable finite-measure sets (Finite, sigma-finite, and semifinite measures).
If two families contain one another inside generated sigma-algebras, then they generate the same sigma-algebra (Two families generate the same sigma-algebra when each lies in the sigma-algebra generated by the other, The sigma-algebra generated by a family of sets).
Continuity from below and the symmetric-difference measure calculus are available (Continuity from below for measures, Measure of a set difference when the smaller set has finite measure).
Proof
Let be a countable generator of , and choose a [L1, L2, L3, given, choose] sigma-finite exhaustion by [L2]. Apply [L1] to the countable family to obtain a countable algebra . Because , [L3] gives .
Fix and let be the family of measurable subsets [L4, algebra] for which every admits with and . Because , the family contains . On the finite-measure space , the class is a sigma-algebra: complements are handled inside , and increasing unions are handled by approximating one large stage and using continuity from below. Therefore is a sigma-algebra containing the trace of , so it contains every measurable subset of .
Now let with and let . [L4, choose, algebra] By [L4], choose so large that . Since is a measurable subset of , the construction above yields with and . Then So finite-measure sets are approximable by members of the countable algebra .
Depends on
- A countable generator of a sigma-algebra yields a countable algebra of sets
- The sigma-algebra generated by a family of sets
- Finite, sigma-finite, and semifinite measures
- Two families generate the same sigma-algebra when each lies in the sigma-algebra generated by the other
- Continuity from below for measures
- Measure of a set difference when the smaller set has finite measure
Used by
Dependency tree · two levels
17 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
- Richard L. Wheeden and Antoni Zygmund, Measure and Integral: An Introduction to Real Analysis (standard reference, not scraped)