Alphabeta Math
LemmaStatement: 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.

Regular conditional kernels factor through a standard borel conditioning variable

Statement

Assume AC. Let X and Y take values in nonempty standard-Borel spaces (E,S) and (T,T) on a probability space (Ω,F,P). Let L be a specified regular conditional distribution of X given σ(Y), everywhere a probability kernel. There is a probability kernel K:TE such that L(ω,)=K(Y(ω),) simultaneously outside a single null set. In fact, with the stated everywhere-kernel convention, the construction below gives this equality for every ω. Consequently K is a conditional law of X given Y.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

A kernel K is a conditional law when its composition with Y satisfies the regular conditional identities. Conditional law given a random element.

[F2]

The repaired in-batch standard-Borel construction codes E bimeasurably onto a Borel B in [0,1]. Existence of regular conditional distributions for standard borel targets.

[F3]

CDFs of Borel probabilities are right-continuous with tails zero and one, and under countable choice every such function has a Borel probability. Uniqueness is proved locally below. Probability laws correspond to distribution functions.

[F4]

Measurable evaluations extend from a generating pi-system by a lambda-system argument. Dynkin's pi-lambda theorem.

[F5]

Rational closed-left cuts generate the real Borel sets by complementation of rational open-right rays. Seven generating families for the Borel sigma-algebra on the real line.

[F6]

Limsup, infima and limit tests of measurable functions are measurable. Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable.

[F7]

Rational indices can be enumerated. Q is countably infinite.

[F8]

Finite products of countable index sets are countable by iteration. A product of two at most countable sets is at most countable.

[F9]

AC selects countably many measurable preimage lifts and supplies coding and countable-choice CDF existence. The Axiom of Choice.

Proof

technique · direct
1.1

Fix e0E and the coding c:EB[0,1] supplied by [F2]. Write Aq=c1[B(,q]] and uq(ω)=L(ω,Aq). The family {Y1(D):DT} is already a sigma-algebra and equals σ(Y). For each rational q, integer n1 and 0k<2n, lift the event {k2nuq<(k+1)2n} to Dq,n,kT, and lift {uq=1} to Dq,n,2n. Choose this countable family using [F7]–[F9]. Set hq,n(y)=min ⁣(1,k=02nk2n1Dq,n,k(y)),hq(y)=lim supnhq,n(y). By [F6] these functions are measurable. On the image of Y the lifted bins are disjoint, so hq,n(Y(ω)) is the dyadic lower approximation to uq(ω), exact at one. Hence hqY=uq everywhere.

F2F6F7F8F9
2.1

Let T0 consist of y for which all rational comparisons hqhr for q<r, tails hn1, hn0, and right limits hq+1/nhq hold. By [F6]–[F8], this is measurable. For every ω, the pushforward ηω(C)=L(ω,c1[BC]) is a Borel probability whose rational CDF values are uq(ω). The forward CDF clause of [F3] gives all the tests, so Y(ω)T0. Replace hq off T0 by 1{q0} and call the result h^q.

step 1.1F3F6F7F8
3.1

For yT, define Fy(x)=infqQ,q>xh^q(y). As in the real-kernel construction, it is nondecreasing, has tails zero and one, agrees with h^r at every rational r, and is right-continuous. The existence clause of [F3], under [F9], gives a Borel probability νy with this CDF. It is unique locally: the equality class of two candidates is a lambda-system containing the closed-half-line pi-system, so [F4] and [F5] give equality on all Borel sets. Hence no family choice is needed. Fixed half-line evaluations are measurable by [F6]. The class of Borel C with measurable yνy(C) contains those half-lines and the whole line, is closed under complements, and is closed under disjoint unions because sectionwise countable additivity expresses the evaluation as a measurable pointwise limit of partial sums. Thus [F4]–[F6] give all Borel C, producing an everywhere real probability kernel without a measure on T.

step 2.1F3F4F5F6F9
4.1

At y=Y(ω), the probabilities νy and ηω agree at every rational closed cut. Their equality class is a lambda-system, and those cuts form a pi-system generating the Borel sets by F5, so F4 gives νY(ω)=ηω directly. Thus the measurable set T1={y:νy(B)=1} contains the full image of Y. Put K(y,A)={νy(c[A]),yT1,1A(e0),yT1. Bimeasurability makes each evaluation measurable; support on B and the Dirac filler make every section a probability. For every ω,A, K(Y(ω),A)=L(ω,A), so the exceptional set is empty and substitution in L's identities proves [F1].

step 1.1step 2.1step 3.1F1F2F4F5

Depends on

Used by

Dependency tree · two levels

61 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