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.
Conditional-independence equivalences and preservation
Statement
Assume Choice. For random elements and a sigma-algebra , the following are equivalent:
- ;
- for every bounded measurable ,
Conditional independence is preserved by measurable maps of either variable. It is also preserved when a -measurable random element is adjoined to either side.
Facts & Assumptions
Given: Choice, random elements , and .
Conditional independence is the bounded-product identity of Conditional independence given a sigma-algebra.
A lambda-system containing a pi-system contains the sigma-algebra that the pi-system generates. (Dynkin's pi-lambda theorem)
A finite known factor may be taken outside conditional expectation when the relevant products are integrable. (Taking out what is known)
Conditional expectation through nested sigma-algebras satisfies both tower identities. (Tower property of conditional expectation)
Proof
Assume (1), fix bounded , and write [F1, F2, F3] . For and measurable , [F1] and the defining event-integral property give where the last equality follows by [F3]. The events form a pi-system generating . For fixed , the events on which the first and last integrals agree form a lambda-system, so [F2] extends the equality to the whole join. Since is measurable for that join, it is a version of . This proves (2), including and equal to the whole state space.
Conversely assume (2), put , and take [F1, F3, F4] bounded . By [F3], (2), and [F4], This is [F1], so (1) follows.
If and are measurable, substitute and [F1] in [F1]; boundedness and measurability are preserved. Hence .
If is -measurable, then [step 1.1, step 1.2] . Thus criterion (2) is unchanged after replacing by . Symmetry gives the corresponding claim on the side. Constant, one-point, and zero-valued are included.
Depends on
Used by
Dependency tree · two levels
26 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
- Aldous-Chewi probability notes, Lecture 9 (standard reference, not scraped)
- Varadhan, Probability Theory, Chapter 4 (standard reference, not scraped)