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 algebra closed under countable disjoint unions is a sigma-algebra
Statement
Let be an algebra of subsets of . If the union of every pairwise disjoint sequence in belongs to , then is a sigma-algebra on .
Facts & Assumptions
Given: An algebra on with the stated closure under countable disjoint unions, and a sequence in .
An algebra is closed under complements and finite unions (Algebras of subsets).
A sigma-algebra is an algebra closed under countable unions (Sigma-algebras).
Proof
For put . The union with is finite and is empty when , so [L1] gives . The sets are pairwise disjoint and .
The assumed disjoint-union closure applied to gives . Thus has the countable-union axiom in [L2] and is a sigma-algebra.
Depends on
Used by
Dependency tree · one level
2 results within one dependency step 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
- R. F. Bass, Real Analysis for Graduate Students, version 5.0, Section 2.1 (standard reference, not scraped)