TheoremBase

Builds a formula from predicative formulas for probability spaces, metric spaces, Borel sets, maps and convergence, checks that it holds exactly when the condition does, and renames its variables.

Proof

Throughout, formulas are written with abbreviations as in Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (vi), a formula being predicative when it is so with its abbreviations eliminated. Routine facts about maps and predicative formulas are used without comment (Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (iii), Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (v), Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (v)), and so is the agreement of the earlier versions of definitions read by published results cited below with their current versions (The Earlier and the New Versions of the Definitions of Metric Spaces, Convergence, Continuity and Compactness Agree (i), The Earlier and the New Versions of the Definitions of Metric Spaces, Convergence, Continuity and Compactness Agree (iii), The Earlier and the New Versions of the Definitions of Sequences, Limits, Cauchy Sequences, Series and Iterated Operations Agree (i)). The given x0,…,xqβˆ’1x_{0},\dots,x_{q-1} are the first of distinct set variables x0,x1,…x_{0},x_{1},\dots as in Renaming and Substituting Variables in Predicative Formulas, so that x0,…,x6x_{0},\dots,x_{6} are distinct also when q<7q<7; the letters Ξ©\Omega, F\mathcal{F}, PP, SS, dd, ss and XX denote x0,…,x6x_{0},\dots,x_{6}, every other letter used below as a variable denotes a further set variable, distinct letters denoting distinct variables, none of them a parameter, and bound variables of formulas taken from other results are renamed where necessary so that none is captured. The value of the parameter N\mathbb{N} is the set of natural numbers (Sums of Sequences in [0,∞] as Typed Terms and as a Map (i)), from which sequences are maps (Sequences (i)).

Random elements and sequences of random elements. By Kit for def:probability-space-random-variable (iv), with its NN equal to 66 and its indices i,j,k,l,m,pi,j,k,l,m,p equal to 0,…,50,\dots,5, and by renaming, there is a predicative formula ρ(Ξ©,F,P,S,d,e)\rho(\Omega,\mathcal{F},P,S,d,e) that holds if and only if (Ξ©,F)(\Omega,\mathcal{F}) is a measurable space, PP is a measure on it, (Ξ©,F,P)(\Omega,\mathcal{F},P) is a probability space, dd is a map SΓ—Sβ†’RS\times S\to\mathbb{R}, (S,d)(S,d) is a metric space and ee is a random element of SS. The first two parts are the standing hypotheses of Probability Spaces, Events and Random Elements (i) and the fourth is that of Metric Space (vi); so ρ(Ξ©,F,P,S,d,e)\rho(\Omega,\mathcal{F},P,S,d,e) holds if and only if (Ξ©,F,P)(\Omega,\mathcal{F},P) is a probability space, (S,d)(S,d) is a metric space and ee is a random element of SS, that is, e∈Me\in M for the set M=Meas(Ξ©,F;S,B(S))M=\mathrm{Meas}(\Omega,\mathcal{F};S,\mathcal{B}(S)) (Probability Spaces, Events and Random Elements (iii)). Let Ξ¦\Phi be the formula of Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (vi) and

Ξ·(s)=Ξ¦(s)βˆ§βˆ€p (p∈Nβ‡”βˆƒe ((p,e)∈s))βˆ§βˆ€pβ€‰βˆ€e ((p,e)∈s⇒ρ(Ξ©,F,P,S,d,e)).\eta(s)=\Phi(s)\wedge\forall p\,\bigl(p\in\mathbb{N}\Leftrightarrow\exists e\,((p,e)\in s)\bigr)\wedge\forall p\,\forall e\,\bigl((p,e)\in s\Rightarrow\rho(\Omega,\mathcal{F},P,S,d,e)\bigr).

When (Ω,F,P)(\Omega,\mathcal{F},P) is a probability space and (S,d)(S,d) a metric space, η(s)\eta(s) holds exactly when ss is a function with domain N\mathbb{N} and values in MM, that is, a map s:N→Ms:\mathbb{N}\to M, a sequence of random elements of SS (Sequences (i)).

The sequence of values at Ο‰\omega. Let

Ξ½(Ο‰,u)=Ξ¦(u)βˆ§βˆ€p (p∈Nβ‡”βˆƒt ((p,t)∈u))βˆ§βˆ€pβ€‰βˆ€eβ€‰βˆ€t (((p,e)∈s∧(Ο‰,t)∈e)β‡’(p,t)∈u).\nu(\omega,u)=\Phi(u)\wedge\forall p\,\bigl(p\in\mathbb{N}\Leftrightarrow\exists t\,((p,t)\in u)\bigr)\wedge\forall p\,\forall e\,\forall t\,\bigl(((p,e)\in s\wedge(\omega,t)\in e)\Rightarrow(p,t)\in u\bigr).

Claim: let (Ξ©,F,P)(\Omega,\mathcal{F},P) be a probability space, (S,d)(S,d) a metric space, s=(Xn)s=(X_{n}) a sequence of random elements of SS and Ο‰βˆˆΞ©\omega\in\Omega; then there is a sequence vv in SS with vp=Xp(Ο‰)v_{p}=X_{p}(\omega) for every p∈Np\in\mathbb{N}, the sequence (Xn(Ο‰))n∈N(X_{n}(\omega))_{n\in\mathbb{N}}, and vv is the only set uu with Ξ½(Ο‰,u)\nu(\omega,u). Indeed, Xp(Ο‰)∈SX_{p}(\omega)\in S for every p∈Np\in\mathbb{N}, as Xp:Ξ©β†’SX_{p}:\Omega\to S, so Maps and Relations Given by Formulas (i), with N\mathbb{N}, SS and p↦Xp(Ο‰)p\mapsto X_{p}(\omega) as its aa, bb and tt, gives the map v:Nβ†’Sv:\mathbb{N}\to S. The sets pp and ee with (p,e)∈s(p,e)\in s are the p∈Np\in\mathbb{N} with e=Xpe=X_{p}, and then the only set tt with (Ο‰,t)∈Xp(\omega,t)\in X_{p} is Xp(Ο‰)X_{p}(\omega); so the last conjunct of Ξ½(Ο‰,u)\nu(\omega,u) says that (p,Xp(Ο‰))∈u(p,X_{p}(\omega))\in u for every p∈Np\in\mathbb{N}. The map vv satisfies Ξ½(Ο‰,v)\nu(\omega,v): it is a function with domain N\mathbb{N} (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)), and (p,vp)∈v(p,v_{p})\in v for p∈Np\in\mathbb{N}. Conversely, if Ξ½(Ο‰,u)\nu(\omega,u) holds, then uu is a function with domain N\mathbb{N} containing (p,Xp(Ο‰))(p,X_{p}(\omega)) for every p∈Np\in\mathbb{N}, so uu is a map u:Nβ†’Su:\mathbb{N}\to S with u(p)=Xp(Ο‰)=vpu(p)=X_{p}(\omega)=v_{p} for every p∈Np\in\mathbb{N}, and so u=vu=v, two maps on N\mathbb{N} with the same values being equal. This proves the claim.

The formula for almost sure convergence. Apply Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (i) with the set variables SS and dd as its parameters XX and dd, its other parameters being those of the statement, uu and zz as its variables ss and zz, and its other variables, and the auxiliary variables of ΞΌ\mu in its formula, chosen as further set variables; let ΞΊ(u,z)\kappa(u,z) be the resulting formula. It is predicative, with free variables among uu, zz, SS, dd and the parameters N\mathbb{N}, R\mathbb{R}, ≀R\le_{\mathbb{R}}, <R<_{\mathbb{R}} and 00. Let

Ξ»=βˆƒA (A∈F∧(A,1)∈Pβˆ§βˆ€Ο‰β€‰(Ο‰βˆˆAβ‡’βˆƒuβ€‰βˆƒz (Ξ½(Ο‰,u)∧(Ο‰,z)∈X∧κ(u,z))))\lambda=\exists A\,\Bigl(A\in\mathcal{F}\wedge(A,1)\in P\wedge\forall\omega\,\bigl(\omega\in A\Rightarrow\exists u\,\exists z\,(\nu(\omega,u)\wedge(\omega,z)\in X\wedge\kappa(u,z))\bigr)\Bigr)

and

α(Ω,F,P,S,d,s,X)=ρ(Ω,F,P,S,d,X)∧η(s)∧λ.\alpha(\Omega,\mathcal{F},P,S,d,s,X)=\rho(\Omega,\mathcal{F},P,S,d,X)\wedge\eta(s)\wedge\lambda.

It is predicative, with free variables among x0,…,x6x_{0},\dots,x_{6} and the parameters. Let sets Ξ©\Omega, F\mathcal{F}, PP, SS, dd, ss and XX be assigned to x0,…,x6x_{0},\dots,x_{6}. If (Ξ©,F,P)(\Omega,\mathcal{F},P) is not a probability space, or (S,d)(S,d) is not a metric space, or XX is not a random element of SS, then ρ(Ξ©,F,P,S,d,X)\rho(\Omega,\mathcal{F},P,S,d,X) fails, and Ξ±\alpha fails together with the condition of (i). Let (Ξ©,F,P)(\Omega,\mathcal{F},P) be a probability space, (S,d)(S,d) a metric space and XX a random element of SS. If ss is not a sequence of random elements of SS, then Ξ·(s)\eta(s) fails, and again both Ξ±\alpha and the condition fail. Let now s=(Xn)s=(X_{n}) be a sequence of random elements of SS. For a set AA, A∈FA\in\mathcal{F} says that AA is an event (Probability Spaces, Events and Random Elements (ii)), and then, PP being a map P:Fβ†’[0,∞]P:\mathcal{F}\to[0,\infty] (Measure, Measure Space, and Probability Measure (i)) and the value of the parameter 11 being the element 11 of [0,∞][0,\infty], (A,1)∈P(A,1)\in P says that P(A)=1P(A)=1. Every element Ο‰\omega of such an AA lies in Ξ©\Omega, as F\mathcal{F} is a Οƒ\sigma-algebra on Ξ©\Omega and so a subset of the power set of Ξ©\Omega (Οƒ-Algebra and Measurable Space (i)). For such Ο‰\omega, the only set zz with (Ο‰,z)∈X(\omega,z)\in X is X(Ο‰)∈SX(\omega)\in S, and by the claim the only set uu with Ξ½(Ο‰,u)\nu(\omega,u) is the sequence (Xn(Ο‰))(X_{n}(\omega)) in SS; so the part after Ο‰βˆˆAβ‡’\omega\in A\Rightarrow holds if and only if ΞΊ\kappa holds with u=(Xn(Ο‰))u=(X_{n}(\omega)) and z=X(Ο‰)z=X(\omega). By Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (i), applied to the metric space (S,d)(S,d) as the values of its parameters XX and dd (a statement holds for all values of its parameters satisfying its hypotheses, Conditions Expressed by a Predicative Formula, and Guards (i)), this is the case exactly when

Xn(Ο‰)β†’X(Ο‰)inΒ (S,d),X_{n}(\omega)\to X(\omega)\quad\text{in }(S,d),

as (Xn(Ο‰))(X_{n}(\omega)) is a sequence in SS and X(Ο‰)∈SX(\omega)\in S. Hence Ξ»\lambda holds if and only if there is an event AA with P(A)=1P(A)=1 such that (Xn(Ο‰))(X_{n}(\omega)) converges to X(Ο‰)X(\omega) in (S,d)(S,d) for every Ο‰βˆˆA\omega\in A, that is, by Almost Sure Convergence of Random Elements of a Metric Space (i), if and only if (Xn)(X_{n}) converges to XX almost surely. In every case Ξ±\alpha holds if and only if the condition of (i) holds with Ξ©,F,P,S,d,(Xn),X\Omega,\mathcal{F},P,S,d,(X_{n}),X the sets assigned to x0,…,x6x_{0},\dots,x_{6}. So Ξ±\alpha is a predicative formula in x0,…,x6x_{0},\dots,x_{6}, in the sense of Renaming and Substituting Variables in Predicative Formulas, expressing this condition.

Almost sure convergence. By Renaming and Substituting Variables in Predicative Formulas (i), with its Ο†\varphi equal to Ξ±\alpha, its kk equal to 77, its nn equal to qq and Οƒ(m)=im\sigma(m)=i_{m} for m<7m<7, the formula Ξ±(xi0,…,xi6)\alpha(x_{i_{0}},\dots,x_{i_{6}}) is a predicative formula in x0,…,xqβˆ’1x_{0},\dots,x_{q-1} that holds, under every assignment of sets to x0,…,xqβˆ’1x_{0},\dots,x_{q-1}, exactly when (xi0,xi1,xi2)(x_{i_{0}},x_{i_{1}},x_{i_{2}}) is a probability space, (xi3,xi4)(x_{i_{3}},x_{i_{4}}) is a metric space, xi5x_{i_{5}} is a sequence of random elements of xi3x_{i_{3}}, xi6x_{i_{6}} is a random element of xi3x_{i_{3}} and xi5x_{i_{5}} converges to xi6x_{i_{6}} almost surely. This proves (i).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…