Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 under kernel extension and conditioning

Statement

Assume AC. Let L,R,C,V be random elements in arbitrary measurable spaces. Suppose L⊥ ⁣ ⁣ ⁣⊥R∣σ(C) and that the joint law of (L,R,C,V) is obtained from the law of (L,R,C) by a probability kernel K(l,c,dv) depending only on (l,c). Then (L,V)⊥ ⁣ ⁣ ⁣⊥R∣σ(C),L⊥ ⁣ ⁣ ⁣⊥R∣σ(C,V). No regular conditional law on an unspecified measurable space is assumed: K is supplied in the hypotheses.

Facts & Assumptions

[F1]

Conditional independence is the bounded-function conditional-product identity, and conditional expectation is determined by its event integrals. Conditional independence given a sigma-algebra, Conditional expectation given a sigma algebra

[F2]

Integration of a bounded measurable function against a supplied probability kernel is measurable. Measure kernel and probability kernel, Measurability of integration against a kernel

[F3]

Dynkin's theorem, simple approximation and monotone convergence extend identities on generating rectangles to bounded measurable functions. Dynkin's pi-lambda theorem, Every nonnegative measurable function is the increasing limit of simple measurable functions, Monotone convergence for the integral

[F4]

Conditional expectations satisfy the tower property under AC. Tower property of conditional expectation, The Axiom of Choice

Proof

technique · test conditional expectations on rectangle events, then enlarge the conditioning sigma-algebra

Given: The random elements, supplied kernel and conditional independence in the statement.

1.1givenF1F3construct

Fix bounded measurable g(R) and set r=E[g(R)∣σ(C)]. Conditional independence implies E[h(L)b(C)g(R)]=E[h(L)b(C)r] for every bounded measurable h,b: test its conditional-product identity against b(C) and then the defining conditional expectation of h(L). Rectangle indicators generate σ(L,C), so [F3] gives E[Hg(R)]=E[Hr] for every bounded σ(L,C)-measurable H. Equivalently E[g(R)∣σ(L,C)]=r. All extensions can be made for each fixed g: the class of testing events is a lambda-system by complements and disjoint countable unions; bounded versions and monotone convergence justify the sums. No common null set for all functions is needed.

2.1F1F2F3step 1.1algebra

For bounded measurable h(l,v) define H(l,c)=∫h(l,v)K(l,c,dv), bounded and measurable by [F2]. Kernel integration gives E[b(C)h(L,V)g(R)]=E[b(C)H(L,C)g(R)]=E[b(C)H(L,C)r]=E[b(C)h(L,V)r], where the middle identity is step 1.1. Thus E[h(L,V)g(R)∣σ(C)]=E[h(L,V)∣σ(C)]r. In taking out bounded measurable conditioning factors here, the event-integral definition first proves the rule for simple factors and [F3] proves it for bounded factors. This proves the first claimed independence. Testing the same calculation with rectangle factors in (L,V,C) and using [F3] also gives E[g(R)∣σ(L,V,C)]=r.

3.1F1F4step 2.1algebra∎

Since r is σ(C)-measurable, [F4] yields E[g(R)∣σ(C,V)]=r. For bounded f(L), conditioning first on σ(L,V,C) in step 2.1 and then on σ(C,V) gives E[f(L)g(R)∣σ(C,V)]=E[f(L)∣σ(C,V)]r. The bounded-factor rule justified in step 2.1 applies at both stages. This is the second claimed independence by [F1]. Singleton state spaces and constant kernels obey the same identities.

Source notes

Aldous–Chewi Lecture 9, Definition 9.1 and the complete Splice Lemma 9.2 proof give the conditional-expectation testing method. Their Borel-space disintegration assertion is not imported: the present lemma assumes its kernel and proves the stated arbitrary-space extension locally.

Depends on

Used by

Dependency tree · two levels

35 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