Following Billingsley's Theorem 20.1: with countable choice the preimages of Borel sets under Z form a σ-algebra, so every set of σ(Z) is such a preimage; hence indicators and then simple σ(Z)-measurable functions are Borel functions of Z, and Y, a pointwise limit of simple functions, is a Borel function of Z, the limit being taken on the Borel set where the factors converge. A version of the conditional expectation given Z is σ(Z)-measurable and so factors.
Write , so that is a -algebra on contained in (σ-Algebras Generated by Random Elements (i)), and let be the set of functions of the form with Borel.
Step 1: sets of (countable choice). We show that is a -algebra on . It contains , and for the complement lies in , as is a -algebra on (Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iii)). Let be a sequence in . For each the set of with is nonempty; under the axiom of dependent choice, countable choice (Countable Choice Follows from Dependent Choice (i)) gives a sequence in with for every , and then
(Preimages of Unions, Intersections and Complements). So is a -algebra (σ-Algebra and Measurable Space (i)), and (Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iv)): every is for some . For such and , , and is Borel (Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (v): its strict upper level sets are , or ). Hence for every .
Step 2: simple functions. If and , then and lie in , as and are Borel (Arithmetic of Measurable Real- and [0,∞]-Valued Maps (i)). Let be a simple function on . Its image is finite, each level set , , lies in because is -measurable and is a Borel set (Borel Sets of a Metric Space: Open and Closed Sets, Points, Open Sets of Subspaces, and Subspaces (iii)), and
since each lies in exactly one of these level sets, that of . For subsets of the finite set , induction on the number of elements of shows that : for the sum is the zero function , which lies in by Step 1, and adding one term keeps the sum in by Step 1 and the closure under sums and multiples. Taking gives .
Step 3: limits (countable choice). Let be as in (i). By Approximation of Measurable Functions by Dyadic Simple Functions (iii), applied on the measurable space , there are simple functions on with for every . By Step 2 the set of Borel with is nonempty for each ; countable choice (Countable Choice Follows from Dependent Choice (i)) gives a sequence of Borel functions with for every . Let
a Borel set (Suprema, Pointwise Limits and the Convergence Set of Measurable Real-Valued Maps (iii)). The functions are Borel (Arithmetic of Measurable Real- and [0,∞]-Valued Maps (i), and Step 1 for ), and converges for every , to on and to off . So
defines a Borel function (Suprema, Pointwise Limits and the Convergence Set of Measurable Real-Valued Maps (ii)). For the sequence converges to , so and . Thus , which proves (i).
Factoring a version. Let . Under the axiom of dependent choice, Existence and Uniqueness of Conditional Expectations (i) with gives a -measurable with for every , that is, (Conditional Expectation (ii)). By (i) there is a Borel with . This proves (ii).
Now let and . By Existence and Uniqueness of Conditional Expectations (iv) there is a -measurable with for every and ; its components are -measurable and lie in (Vector- and Matrix-Valued Measurable Maps: Components, Entries and Continuous Images (i), Integrable Vector- and Matrix-Valued Functions and Their Integrals (i)), so (Conditional Expectation (ii)) and (Conditional Expectation (iii)). For the set of Borel with is nonempty by (i). By induction on there is a family with for every : for the empty family, and for a family for extended by one element of the nonempty set . This finite choice needs no axiom. Taking , let be the function with components (Component Maps of a Map into , Entry Maps of a Map into Matrices, and Maps Assembled from Them (iii)); it is Borel (Vector- and Matrix-Valued Measurable Maps: Components, Entries and Continuous Images (i), on ), and . This proves (iii).
Uses of dependent choice. Countable choice is used in Steps 1 and 3, and dependent choice once more through Existence and Uniqueness of Conditional Expectations (i) and Existence and Uniqueness of Conditional Expectations (iv); the vector case adds only finite choice.
Loading…