Throughout, formulas are written with the abbreviations ∨, ⇒, ⇔ and ∀ of Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (ii); the given x0,…,xN−1 are the first of distinct set variables x0,x1,… as in Renaming and Substituting Variables in Predicative Formulas, so that x0,…,x6 are distinct also when N<7; and the parameters are at their fixed values as in Conditions Expressed by a Predicative Formula, and Guards (i). The letters A, B, H, a, b, c, e, s, s′, w, y, z and z′ denote further set variables, pairwise distinct and other than x0,x1,… and the parameters; formulas taken from other items are used at the variables named, their bound variables chosen other than all of these. Set bookkeeping is used without comment, as carried by Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (i) and Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (iii): elements of classes are sets, subclasses of sets (preimages under maps between sets, subsets of Rn) and the segments [n] are sets, and two classes with the same elements are equal. Where a cited item is stated for the earlier version of σ-algebras or of the Borel σ-algebras, the two versions agree (The Earlier and the New Versions of the Definitions of σ-Algebras, Measures, Measurable Functions and Integrals Agree (i), The Earlier and the New Versions of the Definitions of σ-Algebras, Measures, Measurable Functions and Integrals Agree (ii)). Finally, for n,p,q∈N, the pairs (R,B(R)), (Rn,B(Rn)), (Rp×q,B(Rp×q)) and ([0,∞],B([0,∞])) are measurable spaces, as recorded in Measurable Map, and the Set of Measurable Maps.
Three formulas from other items. For any two distinct set variables, here written Y′ and G′, Kit for def:sigma-algebra-measurable-space (i), with its n, x0, x1, i and j equal to 2, Y′, G′, 0 and 1 and its parameter the class variable N, gives a predicative formula sa(Y′,G′), with free variables among Y′, G′ and N, that holds, for sets assigned to Y′ and G′, exactly when the set assigned to G′ is a σ-algebra on the set assigned to Y′. By Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (vii), for distinct variables F′, A′ and B′ of either kind, the formula mp(F′,A′,B′) is predicative, with free variables F′, A′ and B′, and holds for classes exactly when F′ is a map F′:A′→B′. By Induction over Finite Sets, and Predicative Formulas for the Segments [n] and for Finiteness (i), with the class variables N and R as its Y and R, for any two distinct set variables, here written z′′ and n′, there is a predicative formula seg(z′′,n′), with free variables among z′′, n′, N and R, that holds for a set assigned to z′′ and an element n′ of N0 exactly when that set is the segment [n′] of Intervals of Natural Numbers (ii). Finally, the formulas e=(s,s′), (a,y)∈f and ((s,s′),y)∈a used below, for set variables, are predicative and mean what they say when sets are assigned, by Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (ii), Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iii) and Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iv).
The formula for measurable maps. Write X, F, Y, G and f for x0,…,x4, and let
φ=sa(X,F)∧sa(Y,G)∧mp(f,X,Y)∧∀B(B∈G⇒∃w(∀a(a∈w⇔(a∈X∧∃y(y∈B∧(a,y)∈f)))∧w∈F)).
It is built from predicative formulas and atomic formulas by connectives and quantifiers over set variables only, so it is predicative (Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (v)), with free variables among x0,…,x4 and N.
Let sets X, F, Y, G and f be assigned to x0,…,x4. By σ-Algebra and Measurable Space (ii), the first two conjuncts of φ hold exactly when (X,F) and (Y,G) are measurable spaces, and the third exactly when f is a map f:X→Y; if one of them fails, so do φ and the condition of (i). Assume all three hold, and let B be a set. The elements of the preimage f−1[B] are the sets a with (a,y)∈f for some y∈B, as carried by Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (iii), and each of them lies in X, as f:X→Y. So f−1[B]⊆X is a set, and a set w satisfies the formula ∀a(…) exactly when w and f−1[B] have the same elements, that is, exactly when w=f−1[B]. Hence the part ∃w(…) holds exactly when f−1[B]∈F, and the last conjunct of φ holds if and only if
f−1[B]∈Ffor every B∈G,
that is, by Measurable Map, and the Set of Measurable Maps (i), if and only if f is F/G-measurable. So φ is a predicative formula in x0,…,x4, in the sense of Renaming and Substituting Variables in Predicative Formulas, expressing "(x0,x1) and (x2,x3) are measurable spaces and x4 is an x1/x3-measurable map x0→x2".
Measurable maps. By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to 5 and its renaming map given by 0,1,2,3,4↦i,j,k,l,m, the formula φ(xi,xj,xk,xl,xm) is a predicative formula in x0,…,xN−1 that holds, under every assignment of sets, exactly when (xi,xj) and (xk,xl) are measurable spaces and xm is an xj/xl-measurable map xi→xk. This proves (i).
Maps into R and into [0,∞]. The values of the parameters R and B(R) are sets (The Real Numbers (i), Borel Sigma-Algebra of a Metric Space (ii)). By Renaming and Substituting Variables in Predicative Formulas (iii), with its number of variables equal to 5, its n equal to N, and τ0,…,τ4 equal to xi, xj, R, B(R) and xk, the formula φ(xi,xj,R,B(R),xk) is a predicative formula in x0,…,xN−1 that holds exactly when (xi,xj) and (R,B(R)) are measurable spaces and xk is an xj/B(R)-measurable map xi→R. Here (R,B(R)) is always a measurable space, as noted at the start; and by Measurable Map, and the Set of Measurable Maps (iii) the rest is the condition of (ii). Likewise the values of [0,∞] and B([0,∞]) are sets (The Extended Real Line, Its Order, and [0,∞] (ii), The Borel σ-Algebra of [0,∞] (ii)), ([0,∞],B([0,∞])) is a measurable space, and the same substitution, with [0,∞] and B([0,∞]) for τ2 and τ3, gives a predicative formula φ(xi,xj,[0,∞],B([0,∞]),xk) in x0,…,xN−1 expressing, by Measurable Map, and the Set of Measurable Maps (vi), the condition of (v). This proves (ii) and (v).
The formula for Rn and its Borel sets. Write n, Y and G for x0, x1 and x2, and let
κ=∀s∀B((s∈z∧B∈B(R))⇒∃w(∀a(a∈w⇔(a∈Y∧∃y(y∈B∧(s,y)∈a)))∧w∈H)),
ε=n∈N∧∃z(seg(z,n)∧∀e(e∈Y⇔mp(e,z,R))∧∀A(A∈G⇔(∀b(b∈A⇒b∈Y)∧∀H((sa(Y,H)∧κ)⇒A∈H)))).
As for φ, ε is predicative, with free variables among x0, x1, x2 and the parameters N, R, R and B(R).
Let sets n, Y and G be assigned to x0, x1 and x2. If n∈/N, then ε fails, and so does the condition "n∈N, Y=Rn and G=B(Rn)". The same holds for ε′, ψE and ψM below: their conditions require n∈N, or p,q∈N, and so do the formulas, ε′ by its first conjuncts and ψE and ψM because their first conjunct, ε or ε′, then fails for all sets assigned to the bound variables. So there we treat only the case n∈N, or p,q∈N. Let n∈N, so n∈N0 and the only set z with seg(z,n) is [n]; so ε holds exactly when the bracket holds with z=[n]. Its second conjunct says that the sets e∈Y are exactly the maps e:[n]→R, that is, the elements of Rn (Euclidean Space Rn: n-Tuples of Real Numbers with Their Componentwise Operations (ii)); so it holds exactly when Y=Rn. Assume Y=Rn, and let s∈[n] and B∈B(R). For a∈Rn there is y∈B with (s,y)∈a exactly when πs(a)∈B (as a(s)=as=πs(a), with πs:Rn→R the s-th component map of idRn). So the sets a with a∈Y∧∃y(y∈B∧(s,y)∈a) are the elements of πs−1(B), and as for φ the part ∃w(…) of κ holds exactly when πs−1(B)∈H. Hence κ holds exactly when πs−1(B)∈H for all s∈[n] and B∈B(R), that is, by The Set of Coordinate Preimages of Borel Sets in ℝⁿ and of Entry Preimages in the Real Matrices (i), when
{πs−1(B):s∈[n], B∈B(R)}⊆H
(Subclasses and Subsets (i)); write Cn for this set, a set of subsets of Rn. Every σ-algebra on Rn is a set, so the quantifier ∀H ranges over all of them, and for a set A the right side of the last conjunct says that A⊆Rn and A∈H for every σ-algebra H on Rn with Cn⊆H. By The σ-Algebra Generated by a Set of Subsets (ii) this holds exactly when A∈σ(Cn), and
σ(Cn)=B(Rn)
by The Borel Sets of ℝⁿ and of the Real Matrices Are Generated by the Coordinates (iii). So the last conjunct says that every set A satisfies A∈G⇔A∈B(Rn), which holds exactly when G=B(Rn). Hence ε is a predicative formula in x0,x1,x2 expressing "x0∈N, x1=Rx0 and x2=B(Rx0)".
Maps into Rn. Write X, F, n and f for x0,…,x3. By Renaming and Substituting Variables in Predicative Formulas (i), with its n equal to 6, the formula ε(x2,x4,x5), given by 0,1,2↦2,4,5, is a predicative formula in x0,…,x5 expressing "x2∈N, x4=Rx2 and x5=B(Rx2)", and φ(x0,x1,x4,x5,x3), given by 0,1,2,3,4↦0,1,4,5,3, is one expressing "(x0,x1) and (x4,x5) are measurable spaces and x3 is an x1/x5-measurable map x0→x4". Let
ψE=∃x4∃x5(ε(x2,x4,x5)∧φ(x0,x1,x4,x5,x3)).
It is predicative, with free variables among x0,…,x3 and the parameters. Let sets X, F, n and f be assigned to x0,…,x3. As noted with ε, we may take n∈N. Then the only sets assigned to x4 and x5 that satisfy the first conjunct are Rn and B(Rn), which are sets (Euclidean Space Rn: n-Tuples of Real Numbers with Their Componentwise Operations (i), Borel Sigma-Algebra of a Metric Space (iii)); so ψE holds exactly when (X,F) and (Rn,B(Rn)) are measurable spaces and f is an F/B(Rn)-measurable map f:X→Rn. As (Rn,B(Rn)) is a measurable space, as noted at the start, by Measurable Map, and the Set of Measurable Maps (iv) ψE holds exactly when the condition of (iii) holds with X=x0, F=x1, n=x2 and f=x3. By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to 4 and its renaming map given by 0,1,2,3↦i,j,k,l, the formula ψE(xi,xj,xk,xl) is a predicative formula in x0,…,xN−1 expressing that condition with X=xi, F=xj, n=xk and f=xl. This proves (iii).
The formula for Rp×q and its Borel sets. Write p, q, Y and G for x0,…,x3, and let
κ′=∀s∀s′∀B((s∈z∧s′∈z′∧B∈B(R))⇒∃w(∀a(a∈w⇔(a∈Y∧∃y(y∈B∧((s,s′),y)∈a)))∧w∈H)),
ε′=p∈N∧q∈N∧∃z∃z′∃c(seg(z,p)∧seg(z′,q)∧∀e(e∈c⇔∃s∃s′(s∈z∧s′∈z′∧e=(s,s′)))∧∀e(e∈Y⇔mp(e,c,R))∧∀A(A∈G⇔(∀b(b∈A⇒b∈Y)∧∀H((sa(Y,H)∧κ′)⇒A∈H)))).
As for φ, ε′ is predicative, with free variables among x0,…,x3 and the parameters N, R, R and B(R).
Let sets p, q, Y and G be assigned to x0,…,x3. As noted with ε, we may take p,q∈N, the condition being "p,q∈N, Y=Rp×q and G=B(Rp×q)". Then the only sets z and z′ satisfying the first two conjuncts of the bracket are [p] and [q]. The elements of the Cartesian product [p]×[q] are exactly the ordered pairs (s,s′) with s∈[p] and s′∈[q], and [p]×[q] is a set (Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii)); so, given z=[p] and z′=[q], the third conjunct holds exactly when c=[p]×[q]. The fourth then says that the sets e∈Y are exactly the maps e:[p]×[q]→R, that is, the elements of the set Mp×q(R)=Rp×q of real p×q matrices (Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (i), The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i)); so it holds exactly when Y=Rp×q. Assume this, and let s∈[p], s′∈[q] and B∈B(R). For a∈Rp×q there is y∈B with ((s,s′),y)∈a exactly when Ess′(a)∈B (as a(s,s′)=ass′=Ess′(a) by Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (ii), with Ess′:Rp×q→R the entry map of idRp×q in row s and column s′). As for ε, κ′ therefore holds exactly when Ess′−1(B)∈H for all s∈[p], s′∈[q] and B∈B(R), that is, by The Set of Coordinate Preimages of Borel Sets in ℝⁿ and of Entry Preimages in the Real Matrices (ii), when Cp,q′⊆H for the set
Cp,q′={Ess′−1(B):s∈[p], s′∈[q], B∈B(R)}
of subsets of Rp×q. As for ε, by The σ-Algebra Generated by a Set of Subsets (ii) the last conjunct says that every set A satisfies A∈G⇔A∈σ(Cp,q′), and
σ(Cp,q′)=B(Rp×q)
by The Borel Sets of ℝⁿ and of the Real Matrices Are Generated by the Coordinates (iv); so it holds exactly when G=B(Rp×q). Hence ε′ is a predicative formula in x0,…,x3 expressing "x0,x1∈N, x2=Rx0×x1 and x3=B(Rx0×x1)".
Maps into Rp×q. Write X, F, p, q and f for x0,…,x4. By Renaming and Substituting Variables in Predicative Formulas (i), with its n equal to 7, the formula ε′(x2,x3,x5,x6), given by 0,1,2,3↦2,3,5,6, is a predicative formula in x0,…,x6 expressing "x2,x3∈N, x5=Rx2×x3 and x6=B(Rx2×x3)", and φ(x0,x1,x5,x6,x4), given by 0,1,2,3,4↦0,1,5,6,4, is one expressing "(x0,x1) and (x5,x6) are measurable spaces and x4 is an x1/x6-measurable map x0→x5". Let
ψM=∃x5∃x6(ε′(x2,x3,x5,x6)∧φ(x0,x1,x5,x6,x4)).
It is predicative, with free variables among x0,…,x4 and the parameters. Exactly as for ψE, using that Rp×q is a set (Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (i)), that B(Rp×q) of Borel Sigma-Algebra of a Metric Space (iv) is a set and (Rp×q,B(Rp×q)) a measurable space, as noted at the start, and Measurable Map, and the Set of Measurable Maps (v), ψM holds, under every assignment of sets, exactly when (x0,x1) is a measurable space, x2,x3∈N, and x4 is a map x0→Rx2×x3 that is measurable as a map into Rx2×x3. By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to 5 and its renaming map given by 0,1,2,3,4↦i,j,k,l,m, the formula ψM(xi,xj,xk,xl,xm) is a predicative formula in x0,…,xN−1 expressing the condition of (iv). This proves (iv).