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.
Disjoint groups of an independent sigma-algebra family remain independent
Statement
Let be an independent family of sigma-algebras on a probability space, and let be pairwise disjoint index sets. For each , define
Then the sigma-algebras are independent.
Facts & Assumptions
Given: An independent family and pairwise disjoint index sets .
Independence of sigma-algebras means finite intersections of events from distinct member sigma-algebras satisfy the product formula. (Independent sigma-algebras and independent events)
Independent pi-systems containing the whole space generate independent sigma-algebras. (Independent pi-systems generate independent sigma-algebras)
Proof
For each , let be the class consisting of together with all finite intersections , where is finite and for every . Each contains and is closed under finite intersections, so it is a pi-system. Moreover by definition of .
Fix for each . Because the index sets are pairwise disjoint, the event is a finite intersection of events taken from distinct members of the original independent family. Hence [L1] gives
Step 1.2 says that the pi-systems are independent. Applying [L2] and using step 1.1 yields independence of for every .
Depends on
Used by
Dependency tree · two levels
6 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
- Rick Durrett, Probability: Theory and Examples, 5th ed., Theorem 2.1.9 (standard reference, not scraped)