Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Disintegration of a joint law on standard borel spaces

Statement

Assume AC. Let λ be a probability on (E×T,ST), where E and T are standard-Borel spaces, and let β(B)=λ(E×B) be its second marginal. There is a probability kernel K:(T,T)(E,S) such that

λ(A×B)=BK(y,A)β(dy)(AS, BT).

It is unique as a kernel outside a single measurable β-null set. For every nonnegative product-measurable f:E×T[0,],

f(x,y)λ(d(x,y))=T(Ef(x,y)K(y,dx))β(dy).

In particular this applies to the joint law of random elements (X,Y), with β=PY; the direction is the law of X given Y.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

Under AC the first coordinate has an everywhere RCD given the second-coordinate sigma-algebra; the same repaired construction supplies a countable determining algebra on E. Existence of regular conditional distributions for standard borel targets.

[F3]

Two RCDs of the same standard-Borel variable agree as measures almost surely. Simultaneous ae uniqueness of regular conditional distributions.

[F4]

The repaired local integral interface supplies nonnegative additivity, monotone convergence, and bounded decreasing convergence. Simultaneous rational conditional distribution function versions.

[F5]

A lambda-system containing rectangles contains the product sigma-algebra. Dynkin's pi-lambda theorem.

[F6]

Prescribed nonnegative simple approximants increase pointwise to every nonnegative measurable test. Every nonnegative measurable function is the increasing limit of simple measurable functions.

[F8]

AC supplies RCD existence, bin-lift factorization and the countable determining algebra. The Axiom of Choice.

Proof

technique · direct
1.1

On (E×T,ST,λ) use the coordinate maps X and Y. Both targets are nonempty because the product carries a probability. By [F1], X has an RCD L given σ(Y); by [F2] it factors as K(Y,) for a probability kernel K. The RCD identity gives λ(A×B)=1B(Y)K(Y,A)dλ. We prove the needed marginal substitution locally. For g=1C, g(Y)dλ=λ(Y1C)=β(C)=gdβ. Finite additivity from [F4] gives this for nonnegative simple g; apply [F6] and the local monotone convergence [F4] to get it for every nonnegative measurable g. Taking g(y)=1B(y)K(y,A) yields the rectangle formula.

F1F2F4F6F8
2.1

We also prove kernel-integral measurability locally. Let M be the product-measurable sets C for which every section Cy belongs to S and yK(y,Cy) is measurable. It contains rectangles: each section is A or empty and its evaluation is 1B(y)K(y,A). It contains the whole product. Under complements, (Cc)y=(Cy)c is measurable and its evaluation is 1K(y,Cy). Under pairwise disjoint countable unions, the sections are measurable disjoint unions, while sectionwise countable additivity gives the evaluation as a pointwise limit of measurable partial sums, measurable by [F7]. Thus [F5] gives both properties for every product event. Let D be the product events satisfying the iterated indicator identity. It contains rectangles by step 1.1 and the whole product by normalization. Complements subtract from the finite total one. For disjoint CjD, sectionwise countable additivity and monotone convergence from [F4], first under K(y,) and then under β, prove the union identity. Hence [F5] gives every product event.

step 1.1F4F5F7
3.1

Finite nonnegative combinations of step 2.1 give both measurability and the iterated formula for nonnegative simple f. For arbitrary nonnegative f, use the prescribed snf of [F6]. Apply the locally proved monotone convergence [F4] under λ, in every probability section K, and then under β. By [F7] the inner limit is measurable. These passages give the displayed formula, including value infinity, with no subtraction.

step 2.1F4F6F7
4.1

If K and J both satisfy the rectangle formula, their compositions with Y are RCDs of X given σ(Y): the collection {Y1(B):BT} is already a sigma-algebra. By [F3], they agree as measures outside one λ-null set. Fix the countable determining algebra A supplied by [F1] and set D=AA{y:K(y,A)J(y,A)}. This set is measurable. Its preimage under Y lies in the exceptional set from [F3], so β(D)=λ(Y1D)=0. Off D the probabilities agree on A, hence on every event by its locally proved determining property. If the joint law comes from actual X,Y, the rectangle calculation gives the same conditional-law assertion.

step 1.1F1F3F8

Depends on

Used by

Dependency tree · two levels

43 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