Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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 Y,Z and a sigma-algebra G, the following are equivalent:

  1. Y⊥ ⁣ ⁣ ⁣⊥Z∣G;
  2. for every bounded measurable g, E[g(Z)∣G∨σ(Y)]=E[g(Z)∣G]a.s.

Conditional independence is preserved by measurable maps of either variable. It is also preserved when a G-measurable random element is adjoined to either side.

Facts & Assumptions

Given: Choice, random elements Y,Z, and G⊆F.

[F1]

Conditional independence is the bounded-product identity of Conditional independence given a sigma-algebra.

[F2]

A lambda-system containing a pi-system contains the sigma-algebra that the pi-system generates. (Dynkin's pi-lambda theorem)

[F3]

A finite known factor may be taken outside conditional expectation when the relevant products are integrable. (Taking out what is known)

[F4]

Conditional expectation through nested sigma-algebras satisfies both tower identities. (Tower property of conditional expectation)

Proof

1.1F1F2F3

Assume (1), fix bounded g, and write [F1, F2, F3] W=E[g(Z)∣G]. For C∈G and measurable A, [F1] and the defining event-integral property give E[1C1{Y∈A}g(Z)]=E[1CE(1{Y∈A}g(Z)∣G)]=E[1CE(1{Y∈A}∣G)W]=E[1C1{Y∈A}W], where the last equality follows by [F3]. The events C∩{Y∈A} form a pi-system generating G∨σ(Y). For fixed g, the events on which the first and last integrals agree form a lambda-system, so [F2] extends the equality to the whole join. Since W is measurable for that join, it is a version of E[g(Z)∣G∨σ(Y)]. This proves (2), including A=∅ and A equal to the whole state space.

1.2F1F3F4

Conversely assume (2), put H=G∨σ(Y), and take [F1, F3, F4] bounded f,g. By [F3], (2), and [F4], E[f(Y)g(Z)∣G]=E[E(f(Y)g(Z)∣H)∣G]=E[f(Y)E(g(Z)∣H)∣G]=E[f(Y)W∣G]=E[f(Y)∣G]W. This is [F1], so (1) follows.

1.3F1

If ϕ and ψ are measurable, substitute f∘ϕ and [F1] g∘ψ in [F1]; boundedness and measurability are preserved. Hence ϕ(Y)⊥ ⁣ ⁣ ⁣⊥ψ(Z)∣G.

2.1step 1.1step 1.2∎

If V is G-measurable, then [step 1.1, step 1.2] G∨σ(Y,V)=G∨σ(Y). Thus criterion (2) is unchanged after replacing Y by (Y,V). Symmetry gives the corresponding claim on the Z side. Constant, one-point, and zero-valued V 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