Alphabeta Math
Pipeline-generated
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 Distributions and Regular Conditional Probability

1 · Prerequisites

2 · Summary

A conditional probability for a single event is an almost-sure class. A regular conditional distribution packages all target events into one kernel whose sections are probability measures at every sample point. The opening items establish integration and composition for probability and finite kernels, and for kernels with a specified common finite-mass exhaustion.

The existence proof chooses rational conditional distribution values, removes one measurable null union of all consistency failures, and builds real probability sections by CDF correspondence. Real coding then gives standard-Borel targets, with an explicit support repair. A countable determining algebra turns eventwise uniqueness into simultaneous equality of measures. AC is declared for rational version selection, coding and the inherited conditional-expectation and CDF constructions.

Conditioning on a random element requires a kernel on its value space. The factorization proof supplies its scalar measurable construction locally, and disintegration extends the rectangle identity to every nonnegative joint test. The final formulas compute conditional expectations and dominated posteriors. Density normalization is restricted to finite positive marginal density; both zero and infinite normalizers receive a specified probability filler. The explicit density identities and kernel operations remain choice-free when their inputs are supplied.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Measure kernel and probability kernel

Definition

A measure kernel from (S,Σ) to (T,T) is a map K:S×T[0,] such that, for every sS, AK(s,A) is a measure on (T,T), and for every AT, sK(s,A) is Σ-measurable. Measures and measurability have the meanings in Measures on sigma-algebras and A measurable function between measurable spaces; the evaluation functions use the Borel sigma-algebra on [0,].

A probability kernel satisfies K(s,T)=1 for every s. A finite kernel satisfies K(s,T)< for every s; there need not be a common bound on these masses. A uniformly sigma-finite kernel, in the convention of this page, comes with a specified sequence TnT increasing to T such that K(s,Tn)< for every s and n. This is a common measurable exhaustion, not a bound uniform in s. A finite kernel has the constant exhaustion Tn=T. An arbitrary measure kernel is not assumed to have such an exhaustion.

All these requirements are pointwise in s, not merely almost everywhere for an unspecified measure on S. If T is empty, its only measure is zero, so a probability kernel into T can exist only when S is empty. If S is empty, the kernel requirements are vacuous. The zero kernel is finite. This definition selects no versions and uses no choice axiom.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Measurability of integration against a kernel

Statement

Let K be a finite kernel from (S,Σ) to (T,T), in particular a probability kernel, or a uniformly sigma-finite kernel with the specified exhaustion of the kernel definition. For every nonnegative ΣT-measurable function f:S×T[0,], the function If(s)=Tf(s,t)K(s,dt) is Σ-measurable, with infinity allowed. For a real product-measurable f, the set D={s:If(s)<} is measurable, and its signed integral on D, extended by zero on SD, is a measurable real function. No assertion here is made for a general kernel lacking a common measurable finite-mass exhaustion.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

Kernel evaluations are measurable and every section is a measure. Measure kernel and probability kernel.

[F2]

A lambda-system containing a pi-system contains its generated sigma-algebra. Dynkin's pi-lambda theorem.

[F3]

Nonnegative measurable functions have explicit increasing simple approximations. Every nonnegative measurable function is the increasing limit of simple measurable functions.

[F4]

Monotone convergence applies to each section measure. Monotone convergence for the integral.

[F5]

Measurable functions are closed under defined sums, real scalars, nonnegative restriction and increasing limits. Closure properties of measurable functions used by the integral.

[F6]

Every section of a product-measurable function is measurable. Every section of a product-measurable function is measurable.

[F7]

Measurable rectangles generate the product sigma-algebra. The product sigma-algebra and its finite iterates.

Proof

technique · direct
1.1

First suppose K finite and write m(s)=K(s,T)<. For a product-measurable set E, its section Es is measurable, by applying the section theorem to its indicator. Let D consist of those E for which sK(s,Es) is measurable. It contains every rectangle A×B, whose evaluation is 1A(s)K(s,B), and it contains S×T. If E belongs to this class, then (Ec)s=TEs and K(s,(Ec)s)=m(s)K(s,Es); both terms are finite measurable real functions, so the difference is measurable. If E_j are disjoint class members, their sections are disjoint and K(s,(jEj)s)=jK(s,(Ej)s) is an increasing limit of measurable finite sums. Thus this class is a lambda-system. Rectangles form a pi-system, so Dynkin's theorem gives every product-measurable E in the class. The measurable-closure proposition can be used on S equipped with its zero measure; its conclusions concern only Sigma and do not require a preexisting source probability.

F1F2F5F6F7
2.1

For a nonnegative simple product-measurable function g=j=1raj1Ej with disjoint E_j and finite nonnegative coefficients, its section integral is jajK(s,(Ej)s) and is measurable by step 1.1. Choose the prescribed increasing simple approximation gnf on the product. For every s the section theorem and monotone convergence give If(s)=limnIgn(s), so the increasing-limit closure proves measurability. No uniform bound in s was used; only the individual finite masses entered the complement calculation.

step 1.1F3F4F5F6
3.1

Now let (Tn) be the specified common exhaustion. Define Kn(s,A)=K(s,ATn). For each s this is the restriction of a measure, its evaluations are measurable by the kernel hypothesis, and Kn(s,T)=K(s,Tn)<. Apply step 2.1 to K_n. Sectionwise integration against the restriction equals integration of f(s,)1Tn against K(s,·): this holds for indicators by definition, for simple functions by finite sums, and for nonnegative functions by monotone convergence. Since TnT, If(s)=limnf(s,t)Kn(s,dt); another increasing-limit argument proves the result. If T is empty all these integrals are zero; if S is empty the assertion is vacuous.

step 2.1F1F3F4F5
4.1

For real f its positive and negative parts and absolute value are product-measurable. The proved result makes If+,If,If measurable. Therefore D=n1{If<n} is measurable. On D both part integrals are finite since each is at most If. Define J+(s)=If+(s) on D and zero otherwise, and define J_- similarly. Nonnegative measurable restriction makes both J_± measurable; they are finite everywhere. Their real difference is the requested signed integral on D and zero elsewhere. This never subtracts two infinities. For a zero kernel all integrals vanish and D=S, even if f is unbounded; for f=0 the same holds for every permitted kernel. All approximations and the exhaustion are specified; no AC is used.

step 2.1step 3.1F5
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Composition of probability kernels

Definition

For probability kernels K:(S,Σ)(T,T) and L:(T,T)(U,Υ), their composition, in the order K then L, is (KL)(s,A)=TL(t,A)K(s,dt),sS,AΥ.

The kernel convention is Measure kernel and probability kernel. The integrand is measurable in t and lies in [0,1], so the displayed number exists in [0,1]. As a function of s it is measurable by Measurability of integration against a kernel, applied to the product-measurable function (s,t)L(t,A): its threshold preimages are rectangles S×{t:L(t,A)>a}. The probability-kernel assertion and associativity are justified by Kernel composition is well defined and associative .

Composition refers to specified pointwise kernels. Almost-everywhere classes alone do not define this formula until representatives and the relevant measures are specified. For an empty source the candidate is the empty map. No choice of versions or assumption of AC enters this definition.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Kernel composition is well defined and associative

Statement

The composition KL of probability kernels K:ST and L:TU is a probability kernel SU. If M:UV is another probability kernel, then (KL)M=K(LM) at every source point and every measurable subset of V. Equality concerns the specified kernels, not unspecified almost-everywhere classes.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

The composition candidate is the integral of the second kernel evaluation. Composition of probability kernels.

[F2]

Integrating a nonnegative jointly measurable function against a probability kernel is measurable. Measurability of integration against a kernel.

[F3]

An increasing sequence of nonnegative measurable functions passes through each integral. Monotone convergence for the integral.

[F4]

Nonnegative measurable functions admit increasing simple approximations. Every nonnegative measurable function is the increasing limit of simple measurable functions.

Proof

technique · direct
1.1

For each measurable AU, the function L(,A) is measurable and between zero and one. Its lift to S×T is product-measurable because inverse images are rectangles with first factor S. The integration theorem therefore gives measurable source evaluations of KL. For a fixed s, (KL)(s,)=0 and (KL)(s,U)=1dK(s,)=1. If (Aj)jN are disjoint measurable subsets of U, then L(t,jNAj)=limNj=0NL(t,Aj), an increasing limit. Monotone convergence and finite additivity of the integral yield (KL)(s,jAj)=j(KL)(s,Aj). Hence each source section is a probability measure.

F1F2F3
2.1

Fix s. For every nonnegative measurable h:U[0,], Uh(u)(KL)(s,du)=T(Uh(u)L(t,du))K(s,dt). For h=1_A this is exactly the definition. Finite nonnegative linear combinations establish it for simple h. For increasing simple h_n converging to h, monotone convergence first under each L(t,·), then under K(s,·), and also under (KL)(s,·), proves the identity. The inner integrals are measurable by the integration theorem, so every displayed integral is defined. This is an iterated-kernel identity proved locally; it is not an application of product-measure Fubini to a varying measure.

step 1.1F1F2F3F4
3.1

For AV measurable take the bounded measurable function h(u)=M(u,A) in step 2.1. Its left side is ((KL)M)(s,A), while its right side is T(LM)(t,A)K(s,dt)=(K(LM))(s,A). Step 1.1 also ensures LM is a probability kernel, so both compositions are defined. This proves the asserted pointwise equality for every s and A. When A is empty both sides are zero; when A=V both are one. For an empty source equality is vacuous. If an intermediate target is empty while its source is nonempty, the hypothesized probability kernel cannot exist; no measure of mass one on the empty set is used. The proof requires no AC.

step 1.1step 2.1F1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Conditional probability given a sigma algebra

Definition

Assume AC for conditional-expectation existence. On a probability space (Ω,F,P), for a sub-sigma-algebra GF and AF, define P(AG)=E[1AG] as the almost-everywhere class in Conditional expectation as an ae class. The indicator is integrable since E1A=P(A)1, so Conditional expectation exists by radon nikodym applies. A version is a real integrable G-measurable function whose integral over each HG is P(AH).

The The Axiom of Choice hypothesis is inherited from the RN existence proof's maximizing-sequence and Hahn-decomposition selections. It does not select a canonical representative. In particular, choosing a version separately for each event A has not constructed a probability measure on the event space at any fixed sample point. The constant zero and one functions satisfy the testing identities for the empty and whole events respectively. No completion of G is part of this definition.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Regular conditional distribution

Definition

Let X:(Ω,F,P)(T,T) be a measurable random element and GF a sub-sigma-algebra. A regular conditional distribution of X given G is a probability kernel K:(Ω,G)(T,T) satisfying HK(ω,A)P(dω)=P(H{XA})(HG, AT).

“Probability kernel” has the pointwise meaning of Measure kernel and probability kernel: every K(ω,) is a probability measure, and every evaluation is G-measurable. Its evaluations lie in [0,1] and are integrable. Thus the testing identity says exactly that K(,A) is a conditional-expectation version of 1{XA} in Conditional expectation given a sigma algebra. Conversely, a probability kernel with these version identities satisfies the displayed definition.

The kernel requirement holds at every sample point. Separate eventwise choices of conditional-expectation versions do not imply it and do not by themselves provide one exceptional set valid for all A. When A is empty the testing identity is zero on both sides, and when A=T it is P(H) on both sides. This defines a property of a supplied kernel and makes no existence or AC assertion.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Regular conditional probability

Definition

Let (Ω,F,P) be a probability space whose sample measurable space (Ω,F) is standard Borel in Standard Borel spaces, and let GF be a sub-sigma-algebra. A regular conditional probability given G is a regular conditional distribution, in Regular conditional distribution, of the identity random element idΩ:(Ω,F)(Ω,F).

The identity is measurable because its inverse image of A is A. Written explicitly, this is a probability kernel K:(Ω,G)(Ω,F) with HK(ω,A)P(dω)=P(HA)(HG, AF).

Its target sigma-algebra is the full sample sigma-algebra F, while its source sigma-algebra is G. Empty and whole target events give zero and one evaluations, respectively. The term here is used under the displayed standard-Borel hypothesis. This definition makes no existence claim on an arbitrary sample measurable space and uses no choice axiom merely to specify the property.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Simultaneous rational conditional distribution function versions

Statement

Assume AC. Let X:ΩR be measurable on a probability space (Ω,F,P) and GF a sub-sigma-algebra. There are real G-measurable versions Gq of P(XqG) for every qQ and one NG, P(N)=0, such that outside N, simultaneously,

0Gq1,q<rGqGr,Gn1,Gn0,Gq+1/nGq.

Here n=1,2, and the final assertion holds for every rational q. The versions may moreover be filled on N by Gq=1{q0}, so all these properties hold everywhere.

The proof also establishes the restricted integral interface used here and below: arbitrary nonnegative simple displays give the same integral after zero-complement refinement; the resulting nonnegative integral is monotone, additive, positively homogeneous, has 0=0 as a separate zero-scalar clause, and satisfies monotone convergence. On a finite measure space, bounded decreasing convergence follows. Under AC, every event has a bounded conditional-density version, unique almost surely, and these versions preserve inclusion, constants, and monotone event limits.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

The simple and nonnegative integrals are respectively the finite coefficient sum with 0(+)=0 and the supremum over nonnegative simple minorants. The integral of a nonnegative simple function, The nonnegative Lebesgue integral, Integral over a measurable subset.

[F2]

Every nonnegative measurable function has prescribed increasing simple approximants. Every nonnegative measurable function is the increasing limit of simple measurable functions.

[F3]

Hahn decomposition applies to the finite signed measures used in the density construction. Hahn decomposition for signed measures, unique up to total-variation-null sets.

[F4]

Measures are countably additive and continuous from below. Measures on sigma-algebras, Continuity from below for measures.

[F5]

AC selects maximizing sequences, Hahn decompositions and the rational family of densities. The Axiom of Choice.

[F6]

The rationals and their finite products are countable. Q is countably infinite, A product of two at most countable sets is at most countable.

[F7]

A specified countable union of measurable null sets is null. Finite and countable subadditivity of measures.

[F8]

Limsup, liminf and convergence sets of measurable functions are measurable. Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable.

Proof

technique · direct
1.1

We first repair the integral interface. Given two finite disjoint simple displays s=ici1Ei=jdj1Fj, adjoin E0=ΩiEi and F0=ΩjFj, both with coefficient zero. The intersections EiFj, now including indices zero, form a finite measurable partition of all of Ω. On every nonempty cell the two coefficients agree, so finite additivity gives equal coefficient sums. This includes infinite-measure zero cells because both corresponding products are the stipulated 0(+)=0. Thus the simple integral in [F1] is representation-independent. A common zero-complement refinement now proves monotonicity and additivity for simple functions. For a scalar a>0, termwise multiplication proves positive homogeneity; for a=0, the zero display gives 0=0 directly, without forming 0(+).

F1F4construct
2.1

The supremum definition in [F1] therefore gives monotonicity of the nonnegative integral and agreement with the simple integral. Multiplication by a>0 bijects the simple minorants of f and af, giving positive homogeneity; again 0=0 is separate. If 0fnf, let L=supnfn. For a simple sf and 0<a<1, put An={fnas}. Then AnΩ. The formula AAs is a measure by the finite partition formula from step 1.1, so [F4] gives Anss. Since as1Anfn, positive homogeneity gives aAnsL; let first n and then a1 to obtain sL. Taking the supremum over s proves monotone convergence. Using the approximants in [F2], simple additivity and monotone convergence give (f+g)=f+g. Consequently AAf is a measure: apply monotone convergence to finite unions of a disjoint sequence. If the ambient measure is finite and 0fnfM, then MfnMf; additivity in the finite identity fn+(Mfn)=M proves bounded decreasing convergence.

step 1.1F1F2F4
3.1

We next construct conditional densities without importing a conditional-expectation theorem. For an event CF, set νC(A)=P(AC) on G. Let H be the nonnegative measurable h satisfying AhdPνC(A) for every AG, and let M=suphHhdP1. The maximum of two members remains in H: split each test event over {hk} and its complement and use step 2.1. By [F5] choose hjH with integrals tending to M, and put fj=maxijhif. By F8 the supremum f is measurable. Step 2.1 gives fH and f=M. The set function ρ(A)=νC(A)AfdP is a finite positive measure. If it were not singular to PG, choose by [F3] a positive set Qm for ρP/m for every m1. If every P(Qm)=0, their union is null by [F7], and on its complement ρ(A)P(A)/m for every m, so ρ is concentrated on a P-null set, a contradiction. Hence some Qm has positive P-measure, and f+m11QmH has integral greater than M, again a contradiction. Thus ρP. Since 0ρνCP, it is also absolutely continuous, so its singular carrier immediately gives ρ=0. We have proved νC(A)=AfdP for all AG.

step 2.1F3F5F7F8assume-contracontradiction: maximalitydischarge-contradiction
4.1

Since f1, the sets {fn} show that f< almost surely. Comparing νCP on {f1+1/m} shows that f1 almost surely. Changing f on the measurable union of these null sets gives a real [0,1]-valued density. If f,g represent νC,νD and CD, then on Am={fg+1/m}, step 2.1 gives AmfAmg+P(Am)/m, whereas the representation identities give AmfAmg. Hence P(Am)=0 for every m, so fg almost surely. Taking C=D in both directions proves uniqueness; C=,Ω proves the constant-zero and constant-one assertions. For CjC, set all selected densities to zero on the countable union of their order failures and put u=limjfj. Step 2.1 and [F4] give Au=limjP(ACj)=P(AC), so uniqueness identifies u with the density of C. Decreasing event limits follow by applying this to complements and using A(1f)=P(A)Af, an instance of the finite additivity from step 2.1. This proves every restricted conditional-density assertion in the statement.

step 2.1step 3.1F4F7
5.1

Apply step 3.1 to Cq={Xq} and use [F5] to select one real G-measurable density Gq for each rational q. The selection is countable by [F6]. Step 4.1 gives 0Gq1 almost surely and GqGr almost surely whenever q<r. Since CnΩ, Cn, and Cq+1/nCq, the event-limit clause of step 4.1 gives the two tail limits and every rational right-limit almost surely.

step 3.1step 4.1F5F6
6.1

Form the union N of the failure sets for the bounds, rational order comparisons, two tail limits, and the right-limit assertion for each rational q. They belong to G by rational-cut descriptions and [F8], and they are null by step 5.1. There are countably many by [F6], so [F7] gives P(N)=0. Replace each Gq on N by 1{q0}. Pasting preserves measurability. A bounded difference supported on N has absolute value at most a constant times 1N, whose integral is zero by step 2.1, so all event integrals are unchanged and the functions remain versions. The filler is increasing, has the required tails, and satisfies the right-limit property also at q=0.

step 2.1step 5.1F6F7F8
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Rational conditional distribution functions produce real regular kernels

Statement

Assume AC. Let X be a real random variable on (Ω,F,P), and GF. Rational versions Gq and NG as in Simultaneous rational conditional distribution function versions determine a probability kernel K:(Ω,G)(R,B(R)) with

K(ω,(,x])=infqQ, q>xGq(ω)(ωN),K(ω,)=δ0(ωN).

For every Borel A and HG,

HK(ω,A)dP=P(H{XA}).

Thus K is a regular conditional distribution of X, everywhere a probability measure.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

There are rational conditional versions with simultaneous bounds, monotonicity, tails and rational right limits; the same lemma locally establishes monotone convergence and bounded decreasing convergence from the repaired simple-integral foundation. Simultaneous rational conditional distribution function versions.

[F2]

Under countable choice, a nondecreasing right-continuous function with tails zero and one has a Borel probability with the prescribed closed-half-line values. Only this existence clause is used; uniqueness is proved locally below. Probability laws correspond to distribution functions.

[F3]

A lambda-system containing a pi-system contains its generated sigma-algebra. Dynkin's pi-lambda theorem.

[F4]

Rational right rays, and therefore their closed-left-ray complements, generate the Borel sets. Seven generating families for the Borel sigma-algebra on the real line.

[F6]

AC supplies the preceding version selection and countable choice for CDF existence; unique specification needs no further choice. The Axiom of Choice.

[F7]

Between any two distinct reals lies a rational. The rationals embed densely in the reals.

[F8]

The rationals admit a fixed enumeration. Q is countably infinite.

Proof

technique · direct
1.1

Use the everywhere good filled data of [F1], writing them again Gq. For fixed ω, put Fω(x)=infqQ,q>xGq(ω). The index set is nonempty by F7 and countable by F8. Its values lie in [0,1], and shrinking it as x increases shows monotonicity. For rational r, monotonicity of the data gives GrFω(r)Gr+1/n for every positive integer n, so the rational right-limit condition gives Fω(r)=Gr. In particular Fω(n)1 and Fω(n)0, and monotonicity gives both real tail limits.

F1F7F8
2.1

If xjx, monotonicity gives a limit LFω(x). For every rational q>x, eventually xj<q, so Fω(xj)Gq(ω) and LGq(ω). Taking the infimum gives LFω(x). In particular the sequence x+1/j proves right continuity. By the existence clause of [F2] there is a Borel probability with CDF Fω. If μ,ν are two such probabilities, the equality class C={A:μ(A)=ν(A)} contains R and every closed half-line, is closed under complements by subtraction from the common finite total one, and is closed under countable disjoint unions by countable additivity. It is a lambda-system containing the closed-half-line pi-system, whose generated sigma-algebra is Borel by [F4]; [F3] gives μ=ν. Thus the probability is locally proved unique and defines K(ω,) without a family choice. On N its CDF is 1{x0}, so the same uniqueness identifies it with δ0.

step 1.1F2F3F4F6
3.1

For fixed real x, [F5] makes Fω(x) a G-measurable countable infimum. Using F7 and the fixed enumeration in F8, choose recursively the first enumerated rational q1(x,x+1) and then the first qj+1(x,min(qj,x+1/(j+1))); thus qjx. Step 2.1 and rational agreement give GqjFω(x). The bounded decreasing-convergence clause locally proved in [F1], applied on H, gives HFω(x)dP=limjHGqjdP=limjP(H{Xqj})=P(H{Xx}). The last indicator limit includes the point X=x.

step 1.1step 2.1F1F5F7F8
4.1

Let D be the Borel sets A for which ωK(ω,A) is G-measurable and the stated identity holds for every HG. It contains R. Complements use 1K(ω,A) and subtraction from the finite total P(H). For pairwise disjoint AjD, countable additivity of each section gives the union evaluation as the increasing limit of finite partial sums. This is measurable by [F5], and the locally proved monotone convergence in [F1] gives the event identity. Hence D is a lambda-system containing the closed-half-line pi-system from step 3.1. By [F3] and [F4] it contains every Borel set. The measurable evaluations and probability sections prove both kernel axioms and the full conditional identity.

step 2.1step 3.1F1F3F4F5
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

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
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Simultaneous ae uniqueness of regular conditional distributions

Statement

Assume AC for the countable determining-algebra supplier. If K,L are regular conditional distributions of the same standard-Borel-valued random element X given G, there is one NG with P(N)=0 such that K(ω,)=L(ω,) as measures for every ωN.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

Each event evaluation is a real bounded conditional-expectation version. Regular conditional distribution.

[F2]

The repaired in-batch standard-Borel construction supplies a countable algebra which generates the target sigma-algebra and determines finite measures. Existence of regular conditional distributions for standard borel targets.

[F3]

The repaired local integral interface is monotone and additive for nonnegative functions and positively homogeneous without a zero-times-infinity product. Simultaneous rational conditional distribution function versions.

[F4]

AC supplies real coding and the countable-choice algebra enumeration in the determining-algebra theorem. The Axiom of Choice.

[F5]

A countable union of measurable null sets is null. Finite and countable subadditivity of measures.

Proof

technique · direct
1.1

Fix the countable determining algebra A from [F2], whose AC hypothesis is [F4]. For AA, put u=K(,A) and v=L(,A). By [F1], both are [0,1]-valued and have equal integrals on every HG. For m1, the set Hm+={uv+1/m} belongs to G. Monotonicity, additivity and positive homogeneity from [F3] give Hm+udPHm+vdP+P(Hm+)/m. Equality of the two event integrals forces P(Hm+)=0. The same argument with u,v interchanged shows that {vu+1/m} is null. Their countable union is the measurable discrepancy set NA={uv}, so NA is null. This proves the needed scalar uniqueness locally, without importing conditional-expectation uniqueness.

F1F2F3F4F5
2.1

The set N=AANA is in G and null by countability and [F5]. For any ωN the two probability measures agree on every member of A. Their total masses are finite, so the locally supplied determination assertion [F2] yields equality on the entire target sigma-algebra. This gives a single exceptional set independent of the target event.

step 1.1F2F5
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Conditional integration through a regular conditional law

Statement

Let K be a specified regular conditional distribution of X:(Ω,F,P)(E,S) given G. For measurable f:E[0,], the measurable function If(ω)=f(x)K(ω,dx) satisfies

HIfdP=Hf(X)dP(HG).

This assertion is choice-free. Under AC, it says If=E[f(X)G] as nonnegative almost-sure classes. If f:ER is measurable and Ef(X)<, put D={If<}. Then DG, P(D)=1, and the signed integral on D, extended by zero off D, is a real integrable conditional-expectation version of f(X). Its identification with the AC-based conditional-expectation class uses AC only for that class convention.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

Kernel event evaluations satisfy every conditioning-event identity. Regular conditional distribution.

[F2]

A probability kernel integrates nonnegative measurable functions measurably and gives measurable zero-filled signed integrals on the absolute-integrability set. Measurability of integration against a kernel.

[F3]

Increasing nonnegative limits pass through every section integral and every event integral. Monotone convergence for the integral.

[F4]

Nonnegative measurable functions have an explicit increasing simple approximation. Every nonnegative measurable function is the increasing limit of simple measurable functions.

[F5]

Under AC nonnegative conditional classes are characterized by all conditional event identities. Conditional monotone convergence.

[F6]

The real integrable version is unique up to almost-sure equality. Conditional expectation is unique almost surely.

[F7]

AC is used only for the inherited conditional-class existence convention (RN selections and nonnegative truncations). The Axiom of Choice.

[F8]

For real |f|, the absolute expectation also equals its integral against the law of X. Change of variables for expectation.

Proof

technique · direct
1.1

For f=1A, the assertion is [F1]. If f=j=1maj1Aj is nonnegative simple with disjoint measurable Aj and finite coefficients, then If=jajK(,Aj), so finite additivity of integrals proves the identity by summing the indicator identities. It includes the empty sum, giving I0=0, and f=1, giving I1=1.

F1
2.1

For general nonnegative f, choose the prescribed simple approximants snf of [F4]. For every ω, [F3] for the probability K(ω,) gives Isn(ω)If(ω). The function (ω,x)f(x) is product-measurable since inverse images are Ω×f1(B); thus [F2] ensures G-measurability of If. Applying [F3] on each H on both sides of step 1.1 proves the displayed identity, allowing infinity. No representative selection or AC occurred. If using conditional-class notation, [F5] identifies this characterized nonnegative function with the class, under [F7].

step 1.1F2F3F4F5F7
3.1

For real f with C=Ef(X)<, step 2.1 at f and H=Ω gives IfdP=C. Also C=fdPX by [F8], checking the equivalent law integrability condition. The set D={If<} is measurable. For every positive integer n, nP(Dc)If=C, hence P(Dc)=0. On D, both If+,If are finite and their difference J is the signed integral. Fill J by zero off D; it is real measurable by [F2], and JIf on D, so J is integrable. The two nonnegative identities from step 2.1 have finite integrals, at most C, so subtraction gives HJdP=Hf(X)dP. Removing Dc changes neither integral, since it is measurable null. Thus J is a conditional version; [F6] gives its almost-sure uniqueness, and [F7] supplies only the inherited class notation. No infinity is subtracted from infinity.

step 2.1F2F6F7F8
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Conditional law given a random element

Definition

Let X:(Ω,F,P)(E,S) and Y:(Ω,F,P)(T,T) be measurable random elements. A conditional law of X given Y is a probability kernel K:(T,T)(E,S) such that ωK(Y(ω),) is a regular conditional distribution of X given σ(Y) in Regular conditional distribution. Thus for every AS and Hσ(Y), HK(Y(ω),A)dP=P(H{XA}).

Composition with Y makes each evaluation σ(Y)-measurable, and every section remains a probability by Measure kernel and probability kernel. The notation P(XAY=y)=K(y,A) refers to a chosen kernel; it is not a ratio involving the possibly zero probability P(Y=y).

Write PY(B)=P(Y1(B)) for the law in Law or distribution of a random element. If a specified countable family CS determines probability measures, two conditional laws K,L agree as measures outside a single T-measurable PY-null set. Indeed for each AC the measurable discrepancy DA={y:K(y,A)L(y,A)} has null inverse image under Y by Conditional expectation is unique almost surely. Hence PY(DA)=0 by the law definition; the countable union D is null by Finite and countable subadditivity of measures, and off D the determining property gives equality of measures. This uses a supplied determining family and makes no AC assertion about obtaining one.

Values on a measurable PY-null subset may be replaced by a specified fixed probability on E without changing these identities. The inverse image of that subset is measurable null, and all event evaluations are bounded, so the modified event integrals agree. Empty-event evaluations remain zero and whole-target evaluations remain one. Existence on standard-Borel spaces is proved separately; the definition alone does not assert a conditional kernel exists.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

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
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

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
CorollaryStatement: AI-adaptedProof: AI-adaptedOpen item page →

Conditional expectation as a measurable function of the conditioning variable

Statement

Assume AC. Let X,Y take values in standard-Borel E,T, and let K be a disintegration kernel giving the conditional law of X given Y. For measurable f:E[0,], put h(y)=Ef(x)K(y,dx). Then h is measurable and E[f(X)σ(Y)]=h(Y)almost surely.

For measurable real f with Ef(X)<, define D={y:f(x)K(y,dx)<} and use the signed integral for h on D, zero off D. Then PY(D)=1, h is real measurable, and the same identity holds.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

Under AC a disintegration kernel has the rectangle and all nonnegative joint-test identities. Disintegration of a joint law on standard borel spaces.

[F2]

A specified RCD integrates nonnegative or integrable tests to conditional-expectation versions. Conditional integration through a regular conditional law.

[F3]

Probability-kernel integration is measurable, including signed integration with zero filling. Measurability of integration against a kernel.

[F4]

AC covers disintegration existence and the inherited conditional-expectation class convention. The Axiom of Choice.

Proof

technique · direct
1.1

The product function (y,x)f(x) is measurable by the rectangle inverse-image test. Thus [F3] makes h measurable. The rectangle identities of [F1] make L(ω,A)=K(Y(ω),A) an RCD of X given σ(Y), since the events of that sigma-algebra are exactly inverse images of measurable Y-events. Applying [F2] to this L gives f(x)L(ω,dx)=E[f(X)σ(Y)] as classes, under [F4]. The integral on the left is h(Y) by its definition, which proves the nonnegative clause, allowing infinity.

F1F2F3F4
2.1

For real f, [F3] makes a(y)=f(x)K(y,dx) and D={a<} measurable and makes the zero-filled signed h real measurable. The nonnegative test identity of [F1] gives adPY=Ef(X)=C<. For every integer n1, nPY(Dc)C, hence PY(Dc)=0. Its inverse image under Y is null by the marginal definition. On that inverse-image complement the signed integral through L is h(Y), and on it both zero-fill conventions agree. The signed clause of [F2] therefore proves the stated real integrable conditional identity. Values at any fixed marginal-null fibre are not prescribed by this almost-sure identity.

step 1.1F1F2F3F4
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Conditional density formula

Statement

Let (E,S,μ) and (T,T,ν) be sigma-finite measure spaces. Let a joint probability λ on E×T have nonnegative product-measurable density p:E×T[0,] relative to μ×ν. A fixed probability ρ on (E,S) is supplied. Put m(y)=Ep(x,y)μ(dx),D={y:0<m(y)<}, K(y,A)={Ap(x,y)μ(dx)m(y),yD,ρ(A),yD.

Then K is an everywhere probability kernel from T to E. If β is the second marginal of λ, then β(D)=1 and λ(A×B)=BK(y,A)β(dy).

For any random elements X,Y with joint law λ, K(Y,) is a regular conditional distribution of X given σ(Y). These event identities require no AC. If interpreted with the library's conditional-expectation class existence convention, assume AC. Neither zero nor infinite marginal-density fibres are normalized by the displayed quotient.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

Probability-kernel sections must have mass one at every source point and measurable evaluations. Measure kernel and probability kernel.

[F2]

Nonnegative product-measurable functions on the stated sigma-finite spaces have measurable section integrals and equal iterated integrals. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product.

[F3]

Each nonnegative measurable section density defines a measure. The indefinite integral of a nonnegative measurable function is a measure.

[F4]

All conditioning-event identities characterize a supplied RCD. Regular conditional distribution.

[F5]

Bounded measurable functions of Y integrate against its marginal. Change of variables for expectation.

[F6]

AC is only for the inherited conditional-class existence notation, not for the density construction with supplied rho. The Axiom of Choice.

[F7]

Integrating against a density measure equals integrating the product. Integrating against a density agrees with integrating the product.

Proof

technique · direct
1.1

By [F2], m is measurable and Tmdν=pd(μ×ν)=λ(E×T)=1. For each measurable B, apply [F2] to p1E×B to obtain β(B)=Bmdν. Put Z={m=0} and I={m=}. Then β(Z)=0. Also nν(I)mdν=1 for all n1, so ν(I)=0; the nonnegative integral over this measurable null set is zero, even though m is infinite there, giving β(I)=0. Therefore D=T(ZI) is measurable and has full marginal mass. No finite value of m at each point follows from total integrability.

F2
2.1

For AS, let aA(y)=Ap(x,y)μ(dx). Tonelli applied to p1A×T makes aA measurable. It satisfies 0aAm everywhere. On D both are finite and the denominator is positive, so aA/m is a measurable real function there; reciprocal and multiplication are continuous on this finite positive domain. Pasting the constant ρ(A) off D proves measurable evaluations of K. For each yD, [F2] ensures that p(,y) is measurable and [F3] makes AaA(y) a measure of mass m(y); dividing by this finite positive number gives a probability. Off D, K is the supplied probability ρ. This proves [F1], including the empty-event and whole-target evaluations.

step 1.1F1F2F3
3.1

For measurable A,B, the contribution of BD to the K-integral under β is zero because 0K1 and β(Dc)=0. On D the density conversion [F7] and β=mdν give BK(y,A)β(dy)=BDaA(y)m(y)m(y)ν(dy)=BDaA(y)ν(dy). On Z, aA=0 since aAm; on I its integral is zero because I is ν-null. Thus the last integral is BaAdν, which equals A×Bpd(μ×ν)=λ(A×B) by [F2]. All cancellation was restricted to finite positive m.

step 1.1step 2.1F2F7
4.1

If X,Y have joint law λ, [F5] applied to the bounded measurable function 1B(y)K(y,A) converts step 3.1 into {YB}K(Y,A)dP=P(XA,YB). The collection of inverse images Y1(B) is already a sigma-algebra and is exactly σ(Y). These are therefore all required conditioning events. Measurability and probability sections follow from step 2.1 under composition with Y, so [F4] proves the RCD assertion. The proof selected no points, versions or exhaustion: the sigma-finite measures, product density and filler probability are supplied. [F6] is required only when using the library conditional-class existence convention.

step 2.1step 3.1F4F5F6
TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

Bayes formula for dominated kernels

Statement

Let π be a prior probability on (E,S) and let Q:ET be a probability kernel dominated by a sigma-finite measure ν on (T,T), with specified nonnegative jointly measurable density :E×T[0,]: Q(θ,B)=B(θ,y)ν(dy)for every θE, BT.

Define m(y)=E(θ,y)π(dθ). Under the joint law with density relative to π×ν, a conditional law of the parameter given the observation is K(y,A)={A(θ,y)π(dθ)m(y),0<m(y)<,π(A),m(y)=0 or m(y)=.

The observation marginal is mdν, and the filled fibres have marginal mass zero. This is a choice-free assertion about the explicit kernel and event identities.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

A jointly measurable joint density gives a conditional kernel with fixed probability filling on both zero and infinite normalizers. Conditional density formula.

[F2]

Tonelli evaluates the total joint mass and its rectangles on the sigma-finite product. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product.

[F3]

Every likelihood section has probability mass one. Measure kernel and probability kernel.

[F4]

The nonnegative joint density defines a measure. The indefinite integral of a nonnegative measurable function is a measure.

Proof

technique · direct
1.1

The measure π is finite and therefore sigma-finite; ν is sigma-finite by hypothesis. For each θ, [F3] and the specified density identity give T(θ,y)ν(dy)=Q(θ,T)=1. By [F4] the formula λ(C)=Cd(π×ν) defines a measure. Tonelli [F2] gives λ(E×T)=E(T(θ,y)ν(dy))π(dθ)=E1dπ=1. Thus it is a joint probability. For a rectangle A×B, the same theorem gives λ(A×B)=AQ(θ,B)π(dθ), so its first marginal is exactly the prior.

F2F3F4
2.1

Apply [F1] with μ=π, density p=, and supplied filler ρ=π. All hypotheses were checked in step 1.1: the product is sigma-finite, the density is jointly measurable and nonnegative, and its total mass is one. The resulting normalizer is exactly m and the resulting kernel is the displayed K. The theorem gives its measurable evaluations, pointwise probability sections, marginal β=mdν, and β({m=0}{m=})=0. It also gives λ(A×B)=BK(y,A)β(dy) and hence the conditional law on the coordinate probability space. In particular K(y,)=0 and K(y,E)=1 both on good fibres and on filled fibres. No quotient at either excluded endpoint is used.

step 1.1F1

5 · Examples, counterexamples and false statements

None yet.

Sources