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.

Existence of regular conditional distributions for standard borel targets

Statement

Assume AC. Let X:(Ω,F,P)(E,S) be a measurable random element with standard-Borel target, and let GF be any sub-sigma-algebra. There exists a regular conditional distribution of X given G. Every section is a probability measure, including at exceptional sample points, and no countable-generation or completeness assumption on G is required.

For this necessarily nonempty target, the construction also supplies a bimeasurable bijection c:EB onto a Borel set B[0,1], and a countable algebra A which generates S, separates points, and determines finite measures.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

An everywhere probability kernel is a regular conditional distribution precisely when all conditioning-event identities hold. Regular conditional distribution.

[F2]

A real random variable has an everywhere probability kernel with every Borel conditional identity, using the locally repaired integral interface. Rational conditional distribution functions produce real regular kernels, Simultaneous rational conditional distribution function versions.

[F3]

A standard-Borel presentation is a measurable isomorphism with a Polish space; bounded remetrisation preserves its topology. Standard Borel spaces, min(d,1) and d/(1+d) are metrics uniformly equivalent to d, so every metric space carries a bounded metric with the same topology.

[F5]

Under DC, a completely metrizable subspace of a metric space is Gδ. Under Dependent Choice, every completely metrizable subspace of a metric space is Gδ.

[F6]

The Hilbert cube has an explicit bimeasurable coding onto a Borel subset of [0,1]. Hilbert cube has a bimeasurable real coding.

[F7]

Rational cuts generate the real Borel sigma-algebra, rationals are countable and separate reals, and pi-lambda proves finite-measure determination. Seven generating families for the Borel sigma-algebra on the real line, Q is countably infinite, The rationals embed densely in the reals, Dynkin's pi-lambda theorem.

[F8]

Under countable choice, a countable union of finite sets is countable. Countable unions of at most countable sets, assuming ACω, The Axiom of Countable Choice (ACω).

[F9]

AC supplies the metric and dense-set witnesses, their enumeration, DC, countable choice, and the choices in the real-kernel construction. The Axiom of Choice.

Proof

technique · direct
1.1

The probability space is nonempty, so the existence of X makes E nonempty. By [F3] fix a Borel isomorphism h:EP, where P has a complete compatible metric ρ and a countable dense set. Use [F9] to enumerate that set as (pn) and put d=min(1,ρ). A d-Cauchy sequence is eventually at d-distance below one, hence is ρ-Cauchy; its ρ-limit is also its d-limit. Thus d is complete and compatible. Define e(x)=(d(x,pn))n0Q=[0,1]N. Each coordinate is one-Lipschitz. If xy, choose pn with d(x,pn)<d(x,y)/3; the reverse triangle inequality makes the nth distances different, so e is injective. It is continuous by the initial description of the product topology. Its inverse on e[P] is continuous: for ε<1, choose pn with d(x,pn)<ε/4; if z=e(y) and zne(x)n<ε/2, then d(x,y)<ε. Hence e is a homeomorphism onto its image, with the inverse-continuity estimate explicit.

F3F4F7F9
2.1

On Q set D(u,v)=n02(n+1)unvn. The geometric tail bound makes this finite; termwise separation and the triangle inequality make it a metric. A D-ball controls every prescribed finite set of coordinates because unvn2n+1D(u,v). Conversely, after choosing N with nN2(n+1)<ε/2, sufficiently small restrictions on the first N coordinates force D<ε. Thus D induces the product topology. A D-Cauchy sequence is Cauchy in every coordinate, whose limit lies in [0,1] by completeness of the reals; a finite-head plus geometric-tail estimate proves convergence in D. Therefore D is complete. The image Y=e[P] is completely metrizable by transport of d. AC supplies DC by choosing a successor for every admissible finite history and iterating, so [F5] makes Y a Gδ, hence Borel, subset of (Q,D).

step 1.1F4F5F9
3.1

Let a:QC[0,1] be [F6]. Since a1 is measurable and Y is Borel, B=a[Y]=(a1)1[Y] is Borel in C and hence in [0,1]. Restricting a and its inverse shows that c=aeh:EB is bimeasurable. For qQ, set Hq=c1[B(,q]]. Let An be the finite Boolean algebra generated by the first n rational cuts in a fixed enumeration and A=nAn. By [F8] and [F9], A is countable; it is an algebra and generates S by [F7] and bimeasurability. Rational separation and injectivity of c show that it separates points. If finite measures μ,ν agree on A, their equality class is a lambda-system: complements subtract from their common finite total and disjoint unions use countable additivity. It contains the pi-system A, so [F7] gives equality on S. This proves the two auxiliary conclusions without using either affected published standard-Borel interface.

step 1.1step 2.1F6F7F8F9
4.1

Fix e0E and put Z=cX. By [F2] it has an everywhere real conditional probability kernel ν. The evaluation b(ω)=ν(ω,B) is G-measurable and 0b1. Since ZB, its conditional identity gives bdP=1. The repaired finite-additivity interface in [F2] gives (1b)=0; for each integer k1, on Nk={1b1/k} monotonicity gives P(Nk)/k0. Thus N={b1}=k1Nk is measurable and null. Define K(ω,A)={ν(ω,c[A]),ωN,1A(e0),ωN. Bimeasurability makes c[A] Borel in the real line, so every evaluation is measurable. Off N, injectivity and ν(ω,B)=1 give a probability on E; on N the filler is Dirac. The two evaluations differ only on a measurable null set, and the local null-integral clause in [F2] gives HK(ω,A)dP=P(H{c(X)c[A]})=P(H{XA}). By [F1], K is the required everywhere regular conditional distribution.

step 3.1F1F2F9

Depends on

Used by

Dependency tree · two levels

106 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