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 and take values in nonempty standard-Borel spaces and on a probability space . Let be a specified regular conditional distribution of given , everywhere a probability kernel. There is a probability kernel such that 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.
A kernel K is a conditional law when its composition with Y satisfies the regular conditional identities. Conditional law given a random element.
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.
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.
Measurable evaluations extend from a generating pi-system by a lambda-system argument. Dynkin's pi-lambda theorem.
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.
Limsup, infima and limit tests of measurable functions are measurable. Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable.
Rational indices can be enumerated. is countably infinite.
Finite products of countable index sets are countable by iteration. A product of two at most countable sets is at most countable.
AC selects countably many measurable preimage lifts and supplies coding and countable-choice CDF existence. The Axiom of Choice.
Proof
Fix and the coding supplied by [F2]. Write and . The family is already a sigma-algebra and equals . For each rational q, integer and , lift the event to , and lift to . Choose this countable family using [F7]–[F9]. Set By [F6] these functions are measurable. On the image of Y the lifted bins are disjoint, so is the dyadic lower approximation to , exact at one. Hence everywhere.
Let consist of y for which all rational comparisons for , tails , , and right limits hold. By [F6]–[F8], this is measurable. For every , the pushforward is a Borel probability whose rational CDF values are . The forward CDF clause of [F3] gives all the tests, so . Replace off by and call the result .
For , define . As in the real-kernel construction, it is nondecreasing, has tails zero and one, agrees with at every rational r, and is right-continuous. The existence clause of [F3], under [F9], gives a Borel probability 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 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.
At , the probabilities 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 directly. Thus the measurable set contains the full image of Y. Put Bimeasurability makes each evaluation measurable; support on B and the Dirac filler make every section a probability. For every , , so the exceptional set is empty and substitution in L's identities proves [F1].
Depends on
- Conditional law given a random element
- Existence of regular conditional distributions for standard borel targets
- Probability laws correspond to distribution functions
- Dynkin's pi-lambda theorem
- Seven generating families for the Borel sigma-algebra on the real line
- Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable
- $\mathbb{Q}$ is countably infinite
- A product of two at most countable sets is at most countable
- The Axiom of Choice
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
- Durrett, Probability: Theory and Examples, fifth edition (standard reference, not scraped)
- Varadhan, Probability Theory, Chapter 4 (standard reference, not scraped)