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.
Independent pi-systems generate independent sigma-algebras
Statement
Let be a family of pi-systems in a probability space , and assume for every . If the family is independent, then the sigma-algebras are independent.
Facts & Assumptions
Given: Pi-systems with for every , and assume the family is independent.
Independence of sigma-algebras and event classes is checked on finite subfamilies. (Independent sigma-algebras and independent events)
If a lambda-system contains a pi-system, then it contains the sigma-algebra generated by that pi-system. (Dynkin's pi-lambda theorem)
Proof
By [L1], it suffices to fix a finite list of distinct indices and prove that are independent.
Fix for and define Because , the class contains . It is closed under relative differences of nested sets and under increasing countable unions because both sides of the defining identity are countably additive in . Since the original pi-systems are independent, every lies in . Therefore [L2] gives .
Repeat the construction of step 1.2 for the coordinates , each time freezing already-promoted later coordinates in and keeping the earlier coordinates inside the original pi-systems. Each stage produces a lambda-system containing the relevant pi-system, so [L2] successively replaces every by . Hence
Since the finite choice of indices was arbitrary, the full family is independent.
Depends on
Used by
Dependency tree · two levels
9 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., Section 2.1.1 (standard reference, not scraped)
- S. R. S. Varadhan, Probability Theory, Section 3.1 (standard reference, not scraped)