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 given a sigma-algebra
Definition
Assume the axiom of choice so that the library's conditional-expectation classes are available. Let and be random elements and let be a sigma-algebra. We say that and are conditionally independent given , and write , if for every pair of bounded measurable real functions , This is an equality of almost-everywhere classes and hence does not depend on representatives.
For sigma-algebras , the notation means the same identity for every bounded -measurable and bounded -measurable .
The definition is symmetric. If modulo null sets, it reduces to ordinary independence. If one side is -measurable, conditional independence is automatic because that factor is already known when conditioning. The choices of the zero function or the constant-one function cause no exceptional case.
Depends on
Used by
Dependency tree · two levels
10 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)