Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 noise extends and pushes forward a conditional law

Statement

Let X,Y,Z be random elements with values in measurable spaces (E,E), (H,H), and (W,W). Suppose Z is independent of the random element (X,Y), and let κ:H→E be a supplied conditional law of X given Y. For each h∈H, form the product probability Λ(h,⋅)=κ(h,⋅)⊗L(Z) on E⊗W. Then Λ is a conditional law of (X,Z) given Y. If Φ:E×W→V is measurable into a measurable space (V,V), then ΛΦ(h,C):=Λ(h,Φ−1(C)) is a conditional law of Φ(X,Z) given Y.

Facts & Assumptions

Given: Random elements X,Y,Z, independence of Z from (X,Y), and a supplied conditional law κ of X given Y.

[F1]

A conditional law given a random element is an everywhere probability kernel whose composition with that random element is a regular conditional distribution. Conditional law given a random element.

[F2]

A probability kernel has probability-measure sections and measurable evaluations. Measure kernel and probability kernel.

[F3]

For probability measures, the product measure exists, has the rectangle formula, and its values are the iterated section integrals. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique.

[F4]

For a finite kernel and a nonnegative product-measurable function, the section integral is measurable in the kernel parameter. Measurability of integration against a kernel.

[F5]

The product sigma-algebra is generated by measurable rectangles. The product sigma-algebra and its finite iterates.

[F6]

Independence of random elements means independence of their generated sigma-algebras. Independent random elements.

[F7]

Independent sigma-algebras factor probabilities of their events. Independent sigma-algebras and independent events.

[F8]

A regular conditional distribution satisfies the conditional event identities for every conditioning event and target event. Regular conditional distribution.

[F9]

A pi-system contained in a lambda-system extends to the generated sigma-algebra. Dynkin's pi-lambda theorem.

Proof

Given: The hypotheses in the Statement.

1.1F1F2F3F4given

Write μ=L(Z). For every h, the product Λ(h,⋅)=κ(h,⋅)⊗μ is a probability measure by [F2] and [F3]. For each D∈E⊗W, the section x↦μ(Dx) is measurable by [F4] applied to the constant probability kernel μ and the indicator of D. The iterated-section formula in [F3] gives Λ(h,D)=∫Eμ(Dx) κ(h,dx), which is measurable in h by [F4] applied to κ. Thus Λ is a probability kernel.

1.2F1F5F6F7F8F9algebra

Fix C∈σ(Y) and a measurable rectangle A×B. The conditional-law identity [F1], followed by independence [F6]–[F7], gives ∫CΛ(Y,A×B) dP=μ(B)∫Cκ(Y,A) dP=μ(B)P(C∩{X∈A})=P(C∩{X∈A,Z∈B}). For this fixed C, both sides define finite measures on E⊗W. They agree on the rectangle pi-system, which generates that sigma-algebra by [F5]; [F9] extends the equality to every measurable target set. Therefore Λ(Y,⋅) is a regular conditional distribution of (X,Z) given σ(Y) by [F8].

2.1F1F2step 1.1step 1.2construct∎

For measurable Φ, every section of ΛΦ is the pushforward of the probability Λ(h,⋅), and its evaluations are measurable because Φ−1(C) is measurable and Λ is a probability kernel. Applying the conditional identity from step 1.2 to Φ−1(C) proves that ΛΦ(Y,⋅) is a regular conditional distribution of Φ(X,Z) given σ(Y). Hence it is the required conditional law.

Depends on

Used by

Dependency tree · two levels

37 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