TheoremBase

The formula is the conjunction of the kit formula for a random element, used once for each of X and Y, with a formula saying that P and P' give the same value to the preimages of every Borel set; it is built in x0x_0,...,x9x_9 and then renamed to the given positions.

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 sets, maps and predicative formulas are used without comment (Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (i), Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (iii), Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (v)), and so is the agreement with the current versions of the earlier versions of the definitions of metric spaces and Borel Οƒ\sigma-algebras that a cited item uses (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 Οƒ-Algebras, Measures, Measurable Functions and Integrals Agree (ii)). We choose further set variables xN,xN+1,…x_{N},x_{N+1},\dots, so that x0,…,x9x_{0},\dots,x_{9} are distinct also when N<10N<10, then set variables BB, ww, wβ€²w', vv, uu, yy and the bound variables below, all of these distinct and other than the seventeen parameters, which are at their fixed values (Conditions Expressed by a Predicative Formula, and Guards (i)). A formula taken from another item is used, by renaming, at the variables named, its bound variables chosen other than all of these and its parameters being the parameters of the statement with the same values.

The two random elements. Apply Kit for def:probability-space-random-variable (iv) with its NN equal to 1010, its variables x0,…,x9x_{0},\dots,x_{9} being ours and its seventeen parameters being those of the statement, which have the values and kinds that kit prescribes: once with its indices i,j,k,l,m,pi,j,k,l,m,p equal to 0,1,2,6,7,80,1,2,6,7,8, and once with them equal to 3,4,5,6,7,93,4,5,6,7,9. This gives predicative formulas ρ1\rho_{1} and ρ2\rho_{2} in x0,…,x9x_{0},\dots,x_{9}, taken at our variables, x6x_{6}, x7x_{7} among them, by renaming, such that, for sets Ξ©,F,P,Ξ©β€²,Fβ€²,Pβ€²,S,d,X,Y\Omega,\mathcal{F},P,\Omega',\mathcal{F}',P',S,d,X,Y assigned to x0,…,x9x_{0},\dots,x_{9}, ρ1\rho_{1} 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, d:SΓ—Sβ†’Rd:S\times S\to\mathbb{R} is a map, (S,d)(S,d) is a metric space and XX is a random element of SS on (Ξ©,F,P)(\Omega,\mathcal{F},P); and ρ2\rho_{2} holds if and only if the same is true of (Ξ©β€²,Fβ€²,Pβ€²)(\Omega',\mathcal{F}',P'), SS, dd and YY. So ρ1∧ρ2\rho_{1}\wedge\rho_{2} expresses every part of the condition of (i), at the positions 0,…,90,\dots,9, except that XX and YY are identically distributed.

Borel sets. By Borel Sets of a Variable Metric Space as a Predicative Condition, and the Families of Οƒ-Algebras Generated by Random Elements and of Their Composites (v), with its set variables BB, SS and dd taken to be BB, x6x_{6} and x7x_{7} by renaming, there is a predicative formula bo(B,x6,x7)\mathrm{bo}(B,x_{6},x_{7}) expressing "(x6,x7)(x_{6},x_{7}) is a metric space and B∈B(x6,x7)B\in\mathcal{B}(x_{6},x_{7})", with the Borel Οƒ\sigma-algebra B(x6,x7)\mathcal{B}(x_{6},x_{7}). The parameters R\mathbb{R}, ≀\le, <<, ++, 00 and N\mathbb{N} of that clause have, in this order, the values of the parameters R\mathbb{R}, ≀R\le_{\mathbb{R}}, <R<_{\mathbb{R}}, +R+_{\mathbb{R}}, 0R0_{\mathbb{R}} and N\mathbb{N} of the statement: for the first five both statements say so, and the value of our 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, which is the set N\mathbb{N} of The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion (ii) that the clause uses. So, for sets SS and dd such that d:SΓ—Sβ†’Rd:S\times S\to\mathbb{R} is a map and (S,d)(S,d) is a metric space, and for every set BB, bo(B,S,d)\mathrm{bo}(B,S,d) holds if and only if B∈B(S)B\in\mathcal{B}(S).

Equality of the laws. Let

Ξ»=βˆ€Bβ€‰βˆ€wβ€‰βˆ€wβ€²β€‰βˆ€v ((bo(B,x6,x7)βˆ§βˆ€u (u∈wβ‡”βˆƒy (y∈B∧(u,y)∈x8))βˆ§βˆ€u (u∈wβ€²β‡”βˆƒy (y∈B∧(u,y)∈x9))∧(w,v)∈x2)β‡’(wβ€²,v)∈x5).\lambda=\forall B\,\forall w\,\forall w'\,\forall v\,\Bigl(\bigl(\mathrm{bo}(B,x_{6},x_{7})\wedge\forall u\,(u\in w\Leftrightarrow\exists y\,(y\in B\wedge(u,y)\in x_{8}))\wedge\forall u\,(u\in w'\Leftrightarrow\exists y\,(y\in B\wedge(u,y)\in x_{9}))\wedge(w,v)\in x_{2}\bigr)\Rightarrow(w',v)\in x_{5}\Bigr).

The formulas (u,y)∈x8(u,y)\in x_{8}, (u,y)∈x9(u,y)\in x_{9}, (w,v)∈x2(w,v)\in x_{2} and (wβ€²,v)∈x5(w',v)\in x_{5} 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)), and so is bo\mathrm{bo}; as every quantifier added is over a set variable, Ξ»\lambda is predicative (Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (v)), with free variables among x2,x5,x6,x7,x8,x9x_{2},x_{5},x_{6},x_{7},x_{8},x_{9} and the parameters. Let

δ=ρ1∧ρ2∧λ,\delta=\rho_{1}\wedge\rho_{2}\wedge\lambda,

a predicative formula in x0,…,x9x_{0},\dots,x_{9}.

Let sets Ξ©,F,P,Ξ©β€²,Fβ€²,Pβ€²,S,d,X,Y\Omega,\mathcal{F},P,\Omega',\mathcal{F}',P',S,d,X,Y be assigned to x0,…,x9x_{0},\dots,x_{9}. If ρ1\rho_{1} or ρ2\rho_{2} fails, then Ξ΄\delta fails, and so does the condition of (i) at the positions 0,…,90,\dots,9. Let ρ1\rho_{1} and ρ2\rho_{2} hold. We show that Ξ»\lambda holds if and only if

P(Xβˆ’1(B))=Pβ€²(Yβˆ’1(B))forΒ everyΒ B∈B(S).P\bigl(X^{-1}(B)\bigr)=P'\bigl(Y^{-1}(B)\bigr)\qquad\text{for every }B\in\mathcal{B}(S).

Fix a set BB. If Bβˆ‰B(S)B\notin\mathcal{B}(S), then bo(B,S,d)\mathrm{bo}(B,S,d) fails, as shown above, and the implication in Ξ»\lambda holds for this BB whatever ww, wβ€²w' and vv are. Let B∈B(S)B\in\mathcal{B}(S). As X:Ξ©β†’SX:\Omega\to S is F/B(S)\mathcal{F}/\mathcal{B}(S)-measurable (Probability Spaces, Events and Random Elements (iii)), its preimage Xβˆ’1(B)X^{-1}(B) belongs to F\mathcal{F} (Measurable Map, and the Set of Measurable Maps (i)). For a set uu, βˆƒy (y∈B∧(u,y)∈X)\exists y\,(y\in B\wedge(u,y)\in X) holds if and only if u∈Ωu\in\Omega and X(u)∈BX(u)\in B, by the value form of a map, that is, if and only if u∈Xβˆ’1(B)u\in X^{-1}(B), by the description of preimages; so the only set ww satisfying the second conjunct of the antecedent is Xβˆ’1(B)X^{-1}(B). Likewise the only set wβ€²w' satisfying the third is Yβˆ’1(B)Y^{-1}(B), an element of Fβ€²\mathcal{F}'. As P:Fβ†’[0,∞]P:\mathcal{F}\to[0,\infty] and Pβ€²:Fβ€²β†’[0,∞]P':\mathcal{F}'\to[0,\infty] are maps (Measure, Measure Space, and Probability Measure (i)), (Xβˆ’1(B),v)∈P(X^{-1}(B),v)\in P holds if and only if v=P(Xβˆ’1(B))v=P(X^{-1}(B)), and (Yβˆ’1(B),v)∈Pβ€²(Y^{-1}(B),v)\in P' if and only if v=Pβ€²(Yβˆ’1(B))v=P'(Y^{-1}(B)), by the value form of a map. So, for this BB, the part of Ξ»\lambda after βˆ€B\forall B says that the set v=P(Xβˆ’1(B))v=P(X^{-1}(B)) satisfies v=Pβ€²(Yβˆ’1(B))v=P'(Y^{-1}(B)), that is, P(Xβˆ’1(B))=Pβ€²(Yβˆ’1(B))P(X^{-1}(B))=P'(Y^{-1}(B)). This proves the equivalence.

By The Law of a Random Element (i), the law PXP_{X} is the image measure P∘Xβˆ’1P\circ X^{-1}, the map PX:B(S)β†’[0,∞]P_{X}:\mathcal{B}(S)\to[0,\infty] with

PX(B)=P(Xβˆ’1(B))(B∈B(S)),P_{X}(B)=P\bigl(X^{-1}(B)\bigr)\qquad(B\in\mathcal{B}(S)),

and likewise PYβ€²:B(S)β†’[0,∞]P'_{Y}:\mathcal{B}(S)\to[0,\infty] is the map with PYβ€²(B)=Pβ€²(Yβˆ’1(B))P'_{Y}(B)=P'(Y^{-1}(B)). By extensionality of maps, two maps on B(S)\mathcal{B}(S) with the same value at every B∈B(S)B\in\mathcal{B}(S) are equal, and equal maps have the same values. So Ξ»\lambda holds if and only if PX=PYβ€²P_{X}=P'_{Y}, that is, by The Law of a Random Element (ii), if and only if XX and YY are identically distributed. Hence Ξ΄\delta expresses the condition of (i) with Ξ©,F,P,Ξ©β€²,Fβ€²,Pβ€²,S,d,X,Y=x0,…,x9\Omega,\mathcal{F},P,\Omega',\mathcal{F}',P',S,d,X,Y=x_{0},\dots,x_{9}.

Identically distributed random elements. By renaming, with ten variables renamed and Οƒ(0),…,Οƒ(9)\sigma(0),\dots,\sigma(9) equal to i,j,k,l,m,p,q,r,s,ti,j,k,l,m,p,q,r,s,t, the formula Ξ΄(xi,xj,xk,xl,xm,xp,xq,xr,xs,xt)\delta(x_{i},x_{j},x_{k},x_{l},x_{m},x_{p},x_{q},x_{r},x_{s},x_{t}) is a predicative formula in x0,…,xNβˆ’1x_{0},\dots,x_{N-1} that holds, under every assignment of sets to x0,…,xNβˆ’1x_{0},\dots,x_{N-1}, if and only if Ξ΄\delta holds with x0,…,x9x_{0},\dots,x_{9} assigned the sets assigned to xi,xj,xk,xl,xm,xp,xq,xr,xs,xtx_{i},x_{j},x_{k},x_{l},x_{m},x_{p},x_{q},x_{r},x_{s},x_{t}, that is, if and only if the condition of (i) holds. This proves (i).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…