TheoremBase

Writes a predicative formula saying that a finite measure is the law of a random element, and combines it with the random-element and weak-convergence kits, quantifying over the sequence of laws and the limit law.

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, and 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 version of sequences read by published results cited below with its current version (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,…,x9x_{0},\dots,x_{9} are distinct also when q<10q<10. The letters SS, dd, Ξ©βˆ™\Omega_{\bullet}, Fβˆ™\mathcal{F}_{\bullet}, Pβˆ™P_{\bullet}, Xβˆ™X_{\bullet}, Ξ©\Omega, F\mathcal{F}, PP and XX denote x0,…,x9x_{0},\dots,x_{9}, where Ξ©βˆ™\Omega_{\bullet}, Fβˆ™\mathcal{F}_{\bullet}, Pβˆ™P_{\bullet} and Xβˆ™X_{\bullet} stand for (Ξ©n)(\Omega_{n}), (Fn)(\mathcal{F}_{n}), (Pn)(P_{n}) and (Xn)(X_{n}); every other letter used below as a variable denotes one of x10,x11,…x_{10},x_{11},\dots, distinct letters denoting distinct variables, and a formula taken from another item is used at the variables named by Renaming and Substituting Variables in Predicative Formulas (i), its bound variables, like those of every formula taken from another result, renamed where necessary so that none is captured and none is a parameter. The value of the parameter N\mathbb{N} is the set N\mathbb{N} of Sums of Sequences in [0,∞] as Typed Terms and as a Map (i), the set of natural numbers, from which sequences are maps (Sequences (i)).

Random elements. By Kit for def:probability-space-random-variable (iv), with its NN equal to 66, its indices i,j,k,l,m,pi,j,k,l,m,p equal to 0,…,50,\dots,5 and its seventeen parameters those of the statement, which have the values and kinds that kit prescribes, and by renaming, there is a predicative formula ρ(o,f,p,S,d,e)\rho(o,f,p,S,d,e) that holds if and only if (o,f)(o,f) is a measurable space, pp is a measure on it, (o,f,p)(o,f,p) is a probability space, d:SΓ—Sβ†’Rd:S\times S\to\mathbb{R} is a map, (S,d)(S,d) is a metric space and ee is a random element of SS on (o,f,p)(o,f,p). The first two parts follow from the third (Probability Spaces, Events and Random Elements (i), Measure, Measure Space, and Probability Measure (ii)) and the fourth from the fifth (Metric Space (vi)); so ρ(o,f,p,S,d,e)\rho(o,f,p,S,d,e) holds if and only if (o,f,p)(o,f,p) is a probability space, (S,d)(S,d) is a metric space and ee is a random element of SS on (o,f,p)(o,f,p).

Weak convergence. By Kit for def:weak-convergence-measures-metric (i), with its qq equal to 44 and its i,j,k,li,j,k,l equal to 0,1,2,30,1,2,3, and by renaming, there is a predicative formula W(S,d,s,μ)W(S,d,s,\mu), with parameters among those of the statement, that holds if and only if (S,d)(S,d) is a metric space, ss is a sequence of finite measures on (S,B(S))(S,\mathcal{B}(S)), μ\mu is a finite measure on (S,B(S))(S,\mathcal{B}(S)) and s⇒μs\Rightarrow\mu, where B(S)\mathcal{B}(S) is the Borel σ\sigma-algebra of (S,d)(S,d).

Laws. Let

β„“(p,e,m)=βˆ€Bβ€‰βˆ€v ((B,v)∈mβ‡’βˆƒw (βˆ€u (u∈wβ‡”βˆƒy (y∈B∧(u,y)∈e))∧(w,v)∈p)).\ell(p,e,m)=\forall B\,\forall v\,\Bigl((B,v)\in m\Rightarrow\exists w\,\bigl(\forall u\,(u\in w\Leftrightarrow\exists y\,(y\in B\wedge(u,y)\in e))\wedge(w,v)\in p\bigr)\Bigr).

It is predicative (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)). Claim: let (o,f,p)(o,f,p) be a probability space, (S,d)(S,d) a metric space, ee a random element of SS on (o,f,p)(o,f,p) with law pep_{e}, and mm a finite measure on (S,B(S))(S,\mathcal{B}(S)). Then pep_{e} is a finite measure on (S,B(S))(S,\mathcal{B}(S)), and β„“(p,e,m)\ell(p,e,m) holds if and only if m=pem=p_{e}. Indeed, pep_{e} is a probability measure on (S,B(S))(S,\mathcal{B}(S)) (The Law of a Random Element (i)), so pe(S)=1<∞p_{e}(S)=1<\infty, as 11 is real (Small Facts about [0,∞]: Zero, Finiteness and Sums of Zeros (ii)), and pep_{e} is finite (Measure, Measure Space, and Probability Measure (v), Measure, Measure Space, and Probability Measure (iii)). As mm is a map m:B(S)β†’[0,∞]m:\mathcal{B}(S)\to[0,\infty] (Measure, Measure Space, and Probability Measure (i)), the sets BB and vv with (B,v)∈m(B,v)\in m are the B∈B(S)B\in\mathcal{B}(S) with v=m(B)v=m(B). Let B∈B(S)B\in\mathcal{B}(S). As e:oβ†’Se:o\to S is f/B(S)f/\mathcal{B}(S)-measurable (Probability Spaces, Events and Random Elements (iii)), its preimage eβˆ’1(B)e^{-1}(B) belongs to ff (Measurable Map, and the Set of Measurable Maps (i); in particular it is a set). For a set uu, βˆƒy (y∈B∧(u,y)∈e)\exists y\,(y\in B\wedge(u,y)\in e) holds if and only if u∈ou\in o and e(u)∈Be(u)\in B, that is, if and only if u∈eβˆ’1(B)u\in e^{-1}(B) (Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (ix)); so, by the axiom of extensionality, the only set ww satisfying the first conjunct after βˆƒw\exists w is eβˆ’1(B)e^{-1}(B), and as p:fβ†’[0,∞]p:f\to[0,\infty] is a map, (eβˆ’1(B),v)∈p(e^{-1}(B),v)\in p holds if and only if v=p(eβˆ’1(B))v=p(e^{-1}(B)). Hence β„“(p,e,m)\ell(p,e,m) holds if and only if

m(B)=p(eβˆ’1(B))=pe(B)(B∈B(S)),m(B)=p\bigl(e^{-1}(B)\bigr)=p_{e}(B)\qquad(B\in\mathcal{B}(S)),

the second equality being The Law of a Random Element (i). As mm and pep_{e} are maps B(S)β†’[0,∞]\mathcal{B}(S)\to[0,\infty], this holds if and only if m=pem=p_{e} (Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (iii)). This proves the claim.

The formula for convergence in distribution. 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 for a variable GG let

ψ(G)=Ξ¦(G)βˆ§βˆ€n (n∈Nβ‡”βˆƒz ((n,z)∈G)),\psi(G)=\Phi(G)\wedge\forall n\,\bigl(n\in\mathbb{N}\Leftrightarrow\exists z\,((n,z)\in G)\bigr),

which holds if and only if GG is a function with domain N\mathbb{N} (Relations, Domain, Range, Inverse and Composition (ii)). Let

Ο„=βˆ€nβ€‰βˆ€oβ€‰βˆ€fβ€‰βˆ€pβ€‰βˆ€e ((n∈N∧(n,o)βˆˆΞ©βˆ™βˆ§(n,f)∈Fβˆ™βˆ§(n,p)∈Pβˆ™βˆ§(n,e)∈Xβˆ™)⇒ρ(o,f,p,S,d,e)),Ξ³=βˆƒsβ€‰βˆƒΞΌβ€‰(W(S,d,s,ΞΌ)βˆ§β„“(P,X,ΞΌ)βˆ§βˆ€nβ€‰βˆ€mβ€‰βˆ€pβ€‰βˆ€e ((n∈N∧(n,m)∈s∧(n,p)∈Pβˆ™βˆ§(n,e)∈Xβˆ™)β‡’β„“(p,e,m))),Ξ±=ψ(Ξ©βˆ™)∧ψ(Fβˆ™)∧ψ(Pβˆ™)∧ψ(Xβˆ™)βˆ§Ο„βˆ§Ο(Ξ©,F,P,S,d,X)∧γ.\begin{aligned} \tau={}&\forall n\,\forall o\,\forall f\,\forall p\,\forall e\,\bigl((n\in\mathbb{N}\wedge(n,o)\in\Omega_{\bullet}\wedge(n,f)\in\mathcal{F}_{\bullet}\wedge(n,p)\in P_{\bullet}\wedge(n,e)\in X_{\bullet})\Rightarrow\rho(o,f,p,S,d,e)\bigr),\\ \gamma={}&\exists s\,\exists\mu\,\Bigl(W(S,d,s,\mu)\wedge\ell(P,X,\mu)\wedge\forall n\,\forall m\,\forall p\,\forall e\,\bigl((n\in\mathbb{N}\wedge(n,m)\in s\wedge(n,p)\in P_{\bullet}\wedge(n,e)\in X_{\bullet})\Rightarrow\ell(p,e,m)\bigr)\Bigr),\\ \alpha={}&\psi(\Omega_{\bullet})\wedge\psi(\mathcal{F}_{\bullet})\wedge\psi(P_{\bullet})\wedge\psi(X_{\bullet})\wedge\tau\wedge\rho(\Omega,\mathcal{F},P,S,d,X)\wedge\gamma. \end{aligned}

These are predicative (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)), every quantifier added being over a set variable, and the free variables of Ξ±\alpha are among x0,…,x9x_{0},\dots,x_{9} and the parameters.

Let sets SS, dd, Ξ©βˆ™\Omega_{\bullet}, Fβˆ™\mathcal{F}_{\bullet}, Pβˆ™P_{\bullet}, Xβˆ™X_{\bullet}, Ξ©\Omega, F\mathcal{F}, PP and XX be assigned to x0,…,x9x_{0},\dots,x_{9}. The first four conjuncts of Ξ±\alpha hold exactly when Ξ©βˆ™\Omega_{\bullet}, Fβˆ™\mathcal{F}_{\bullet}, Pβˆ™P_{\bullet} and Xβˆ™X_{\bullet} are functions with domain N\mathbb{N}; then, for n∈Nn\in\mathbb{N}, the only sets oo, ff, pp and ee with (n,o)βˆˆΞ©βˆ™(n,o)\in\Omega_{\bullet}, (n,f)∈Fβˆ™(n,f)\in\mathcal{F}_{\bullet}, (n,p)∈Pβˆ™(n,p)\in P_{\bullet} and (n,e)∈Xβˆ™(n,e)\in X_{\bullet} are the values Ξ©n\Omega_{n}, Fn\mathcal{F}_{n}, PnP_{n} and XnX_{n}. So, by the paragraph on random elements, the first six conjuncts of Ξ±\alpha together hold exactly when every part of the condition of (i) other than convergence in distribution holds. If they fail, then Ξ±\alpha fails together with that condition. Let them hold, and write PXnP_{X_{n}} for the law of XnX_{n} on (Ξ©n,Fn,Pn)(\Omega_{n},\mathcal{F}_{n},P_{n}) and PXP_{X} for that of XX on (Ξ©,F,P)(\Omega,\mathcal{F},P) (The Law of a Random Element (i), with the notation of Probability Spaces: Notation (ii)).

As PXP_{X} is a probability measure on (S,B(S))(S,\mathcal{B}(S)) (The Law of a Random Element (i)), (S,B(S))(S,\mathcal{B}(S)) is a measurable space, and by Kit for def:measure-measure-space (x) the finite measures on it form a set Mfin\mathcal{M}_{\mathrm{fin}}. By the claim, PXP_{X} and each PXnP_{X_{n}} belong to Mfin\mathcal{M}_{\mathrm{fin}}, and Maps and Relations Given by Formulas (i), with N\mathbb{N} and Mfin\mathcal{M}_{\mathrm{fin}} as its aa and bb (the expression tt there being t(n)=PXnt(n)=P_{X_{n}}, the law of the value XnX_{n}, which lies in Mfin\mathcal{M}_{\mathrm{fin}} for every n∈Nn\in\mathbb{N}), gives the sequence of laws (PXn)n∈N(P_{X_{n}})_{n\in\mathbb{N}}, a map Nβ†’Mfin\mathbb{N}\to\mathcal{M}_{\mathrm{fin}} (a set, as an element of MfinN\mathcal{M}_{\mathrm{fin}}^{\mathbb{N}} by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i)) and so a sequence of finite measures on (S,B(S))(S,\mathcal{B}(S)). We show that Ξ³\gamma holds if and only if

PXn⇒PX.P_{X_{n}}\Rightarrow P_{X}.

Suppose Ξ³\gamma holds with sets ss and ΞΌ\mu. By W(S,d,s,ΞΌ)W(S,d,s,\mu), ss is a sequence of finite measures on (S,B(S))(S,\mathcal{B}(S)), ΞΌ\mu is a finite measure on it, and sβ‡’ΞΌs\Rightarrow\mu. By the claim, applied to (Ξ©,F,P)(\Omega,\mathcal{F},P) and XX, β„“(P,X,ΞΌ)\ell(P,X,\mu) gives ΞΌ=PX\mu=P_{X}. For n∈Nn\in\mathbb{N}, the only set mm with (n,m)∈s(n,m)\in s is the term sns_{n}, and the only sets pp and ee with (n,p)∈Pβˆ™(n,p)\in P_{\bullet} and (n,e)∈Xβˆ™(n,e)\in X_{\bullet} are PnP_{n} and XnX_{n}; so β„“(Pn,Xn,sn)\ell(P_{n},X_{n},s_{n}) holds, and by the claim sn=PXns_{n}=P_{X_{n}}. The maps ss and (PXn)(P_{X_{n}}) from N\mathbb{N} to Mfin\mathcal{M}_{\mathrm{fin}} (ss maps into Mfin\mathcal{M}_{\mathrm{fin}} because each sns_{n} is a finite measure on (S,B(S))(S,\mathcal{B}(S)), by W(S,d,s,ΞΌ)W(S,d,s,\mu)) thus have the same terms, so they are equal (Sequences: Enlarging the Codomain, Extensionality and the Range (ii)), and PXnβ‡’PXP_{X_{n}}\Rightarrow P_{X}. Conversely, if PXnβ‡’PXP_{X_{n}}\Rightarrow P_{X}, then s=(PXn)s=(P_{X_{n}}) and ΞΌ=PX\mu=P_{X} satisfy W(S,d,s,ΞΌ)W(S,d,s,\mu), and by the claim β„“(P,X,PX)\ell(P,X,P_{X}) and β„“(Pn,Xn,PXn)\ell(P_{n},X_{n},P_{X_{n}}) for every n∈Nn\in\mathbb{N}; with the description of the sets mm, pp and ee above, this is the bracket after βˆƒsβ€‰βˆƒΞΌ\exists s\,\exists\mu, so Ξ³\gamma holds. By Convergence in Distribution of Random Elements of a Metric Space (i), Ξ³\gamma therefore holds if and only if (Xn)(X_{n}) converges to XX in distribution. In every case Ξ±\alpha holds if and only if the condition of (i) holds with S,d,(Ξ©n),(Fn),(Pn),(Xn),Ξ©,F,P,XS,d,(\Omega_{n}),(\mathcal{F}_{n}),(P_{n}),(X_{n}),\Omega,\mathcal{F},P,X the sets assigned to x0,…,x9x_{0},\dots,x_{9}. So Ξ±\alpha is a predicative formula in x0,…,x9x_{0},\dots,x_{9}, in the sense of Renaming and Substituting Variables in Predicative Formulas, expressing this condition.

Convergence in distribution. By Renaming and Substituting Variables in Predicative Formulas (i), with its Ο†\varphi equal to Ξ±\alpha, its kk equal to 1010, its nn equal to qq and Οƒ(r)=ir\sigma(r)=i_{r} for r<10r<10, the formula Ξ±(xi0,…,xi9)\alpha(x_{i_{0}},\dots,x_{i_{9}}) 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 the condition of (i) holds for the sets assigned to xi0,…,xi9x_{i_{0}},\dots,x_{i_{9}}. This proves (i).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…