TheoremBase

Formulas from the probability-space and independence kits are combined with explicit formulas for standard normal laws, the affine identity x = m + Az with variable dimensions, and almost-sure equality; each formula is checked to hold exactly when its condition does, and is then moved to the required 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. Routine facts about maps (including maps given by functional predicative relations), natural numbers and predicative formulas (including renaming and substitution of variables) are used without comment, values of maps being read off pairs (for a map FF and an element aa of its domain, F(a)F(a) is the only set bb with (a,b)∈F(a,b)\in F) (Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (iii), Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (iv), 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 natural numbers, probability spaces, random variables, random vectors, laws, independence, metric spaces, Οƒ\sigma-algebras, Borel Οƒ\sigma-algebras, measures, Euclidean space, real matrices and finite sums that some cited items use (The Earlier and the New Versions of the Definitions of the Natural Numbers, the Complex Numbers, the Conjugate and the Modulus Agree, and the Two Versions of Real Correspond (i), The Earlier and the New Versions of the Definitions of Probability Spaces, Laws, Expectation, Independence and Modes of Convergence Agree (i), The Earlier and the New Versions of the Definitions of Probability Spaces, Laws, Expectation, Independence and Modes of Convergence Agree (ii), The Earlier and the New Versions of the Definitions of Probability Spaces, Laws, Expectation, Independence and Modes of Convergence Agree (iv), 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 (i), The Earlier and the New Versions of the Definitions of Οƒ-Algebras, Measures, Measurable Functions and Integrals Agree (ii), The Earlier and the New Versions of the Definitions of Οƒ-Algebras, Measures, Measurable Functions and Integrals Agree (iii), The Earlier and the New Versions of the Definitions of Euclidean Space, Real Matrices and Normed Spaces Agree (i), The Earlier and the New Versions of the Definitions of Euclidean Space, Real Matrices and Normed Spaces Agree (ii), The Earlier and the New Versions of the Definitions of Sequences, Limits, Cauchy Sequences, Series and Iterated Operations Agree (vi)). Formulas are first written in distinct set variables x0,x1,…x_{0},x_{1},\dots extending the given ones: Ξ©\Omega, F\mathcal{F}, PP, dd, XX, kk, ZZ, mm and AA denote x0,…,x8x_{0},\dots,x_{8}, every other letter used as a set variable denotes one of x9,x10,…x_{9},x_{10},\dots, distinct letters denoting distinct variables, the variables beyond xnβˆ’1x_{n-1} being chosen other than the parameters, and bound variables of formulas taken from other items are renamed so that none is captured; the last paragraph moves the formulas to the positions i0,…,i8i_{0},\dots,i_{8}. The parameters are the twenty-one of the statement, the class variable ZZ of Kit for def:independence-events-rvs (ii), with value [0,∞][0,\infty], being written Z[0,∞]Z_{[0,\infty]} as in the statement. Seventeen of the eighteen parameters of that kit are those of Kit for def:probability-space-random-variable (vi) with the same values, and the eighteenth is β‹…R\cdot_{\mathbb{R}}; among the eighteen are the class variables N\mathbb{N}, RR, QQ, R\mathbb{R}, +R+_{\mathbb{R}} and β‹…R\cdot_{\mathbb{R}}, for 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), the order and the addition of N0\mathbb{N}_{0}, the set of real numbers and its addition and multiplication, and the set variable 00, for the element 00 of [0,∞][0,\infty].

Formulas from the kits. By Kit for def:probability-space-random-variable (i), Kit for def:probability-space-random-variable (v) and Kit for def:probability-space-random-variable (vi), each applied with its NN equal to the number of its displayed letters and its indices 0,1,…0,1,\dots, and renaming, there are predicative formulas Ξ (o,f,p)\Pi(o,f,p), ρ(o,f,p,y)\rho(o,f,p,y) and V(o,f,p,r,x)V(o,f,p,r,x), with parameters among the seventeen, such that for sets o,f,p,y,r,xo,f,p,y,r,x: Ξ (o,f,p)\Pi(o,f,p) holds if and only if (o,f,p)(o,f,p) is a probability space; ρ(o,f,p,y)\rho(o,f,p,y) if and only if moreover yy is a random variable on it; and V(o,f,p,r,x)V(o,f,p,r,x) if and only if (o,f,p)(o,f,p) is a probability space, r∈Nr\in\mathbb{N} and xx is a random vector in Rr\mathbb{R}^{r} on it. (The kits' further conjuncts, that (o,f)(o,f) is a measurable space and pp a measure on it, follow from (o,f,p)(o,f,p) being a probability space, by Probability Spaces, Events and Random Elements (i) and Measure, Measure Space, and Probability Measure (ii).) By Kit for def:independence-events-rvs (ii), applied in the same way, there is a predicative formula I(o,f,p,j,s,e,y)I(o,f,p,j,s,e,y), with parameters among the eighteen, that holds if and only if (o,f,p)(o,f,p) is a probability space, ss, ee and yy are families indexed by jj, for every t∈jt\in j the value ete_{t} is a map et:stΓ—stβ†’Re_{t}:s_{t}\times s_{t}\to\mathbb{R}, (st,et)(s_{t},e_{t}) is a metric space and yty_{t} is a random element of sts_{t}, and (yt)t∈j(y_{t})_{t\in j} is independent.

Notation for formulas. Ξ¦(F)\Phi(F) and ΞΌ(F,a,b)\mu(F,a,b), saying that FF is a function and a map F:aβ†’bF:a\to b, are the formulas 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 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 Ξ¦j(F)\Phi_{j}(F) is Ξ¦(F)βˆ§βˆ€t (t∈jβ‡”βˆƒa ((t,a)∈F))\Phi(F)\wedge\forall t\,(t\in j\Leftrightarrow\exists a\,((t,a)\in F)), saying that FF is a function with domain jj, that is, a family indexed by jj. c=[q]c=[q] denotes the predicative formula seg(c,q)\mathrm{seg}(c,q) of Induction over Finite Sets, and Predicative Formulas for the Segments [n] and for Finiteness (i), its class variables YY and RR being taken as N\mathbb{N} and RR, which for q∈N0q\in\mathbb{N}_{0} holds if and only if c=[q]c=[q]; u∈[q]u\in[q], "u:[q]β†’Ru:[q]\to\mathbb{R}" and "M∈RqΓ—rM\in\mathbb{R}^{q\times r}" abbreviate βˆƒc (c=[q]∧u∈c)\exists c\,(c=[q]\wedge u\in c), βˆƒc (c=[q]∧μ(u,c,R))\exists c\,(c=[q]\wedge\mu(u,c,\mathbb{R})) and the formula saying that MM is a map into R\mathbb{R} from the set of the pairs (i,j)(i,j) with i∈[q]i\in[q] and j∈[r]j\in[r]; for q,r∈Nq,r\in\mathbb{N} the last two say u∈Rqu\in\mathbb{R}^{q} and that MM is a real qΓ—rq\times r matrix (Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (ii), Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (i)). Ξ£(s,q,u)\Sigma(s,q,u) is the predicative formula q∈N∧u:[q]β†’R∧it(s,q,u)q\in\mathbb{N}\wedge u:[q]\to\mathbb{R}\wedge\mathrm{it}(s,q,u), where it\mathrm{it} is the formula of Iterated Operations Are Given by a Predicative Formula (i) with its class variables XX, FF, YY, RR and PP taken as R\mathbb{R}, +R+_{\mathbb{R}}, N\mathbb{N}, RR and QQ; so Ξ£(s,q,u)\Sigma(s,q,u) holds if and only if q∈Nq\in\mathbb{N}, u:[q]β†’Ru:[q]\to\mathbb{R} and s=βˆ‘l=1quls=\sum_{l=1}^{q}u_{l}, the finite sum being the iterated operation of +R+_{\mathbb{R}}. The parameters of seg\mathrm{seg} and Ξ£\Sigma are among those named above, hence among the parameters of the statement. All formulas displayed below 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 (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), 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)), every quantifier added being over a set variable.

Standard normal random variables. Let

Ξ½(p,y)=βˆ€Bβ€‰βˆ€v ((B,v)βˆˆΞ³β‡’βˆƒw (βˆ€u (u∈wβ‡”βˆƒq (q∈B∧(u,q)∈y))∧(w,v)∈p)).\nu(p,y)=\forall B\,\forall v\,\Bigl((B,v)\in\gamma\Rightarrow\exists w\,\bigl(\forall u\,(u\in w\Leftrightarrow\exists q\,(q\in B\wedge(u,q)\in y))\wedge(w,v)\in p\bigr)\Bigr).

Claim 1: for a probability space (o,f,p)(o,f,p) and a random variable yy on it, Ξ½(p,y)\nu(p,y) holds if and only if yy is standard normal. The measure Ξ³\gamma on (R,B(R))(\mathbb{R},\mathcal{B}(\mathbb{R})) (Standard Normal Distribution (ii)) is a map Ξ³:B(R)β†’[0,∞]\gamma:\mathcal{B}(\mathbb{R})\to[0,\infty] (Measure, Measure Space, and Probability Measure (i)). Let B∈B(R)B\in\mathcal{B}(\mathbb{R}). As B(R)\mathcal{B}(\mathbb{R}) is the Borel Οƒ\sigma-algebra of (R,dR)(\mathbb{R},d_{\mathbb{R}}) (Borel Sigma-Algebra of a Metric Space (ii)), yy is a random element of R\mathbb{R} (Probability Spaces, Events and Random Elements (iv)), so yβˆ’1(B)∈fy^{-1}(B)\in f (Probability Spaces, Events and Random Elements (iii), Measurable Map, and the Set of Measurable Maps (i)). For a set uu, βˆƒq (q∈B∧(u,q)∈y)\exists q\,(q\in B\wedge(u,q)\in y) holds if and only if u∈ou\in o and y(u)∈By(u)\in B, that is, u∈yβˆ’1(B)u\in y^{-1}(B); so by the axiom of extensionality the only set ww satisfying the first conjunct after βˆƒw\exists w is yβˆ’1(B)y^{-1}(B). Hence, Ξ³\gamma and p:fβ†’[0,∞]p:f\to[0,\infty] being maps, Ξ½(p,y)\nu(p,y) holds if and only if

Ξ³(B)=p(yβˆ’1(B))=py(B)(B∈B(R)),\gamma(B)=p\bigl(y^{-1}(B)\bigr)=p_{y}(B)\qquad(B\in\mathcal{B}(\mathbb{R})),

the second equality being The Law of a Random Element (i). As Ξ³\gamma and the law pyp_{y}, a probability measure on (R,B(R))(\mathbb{R},\mathcal{B}(\mathbb{R})) by the same definition, are maps B(R)β†’[0,∞]\mathcal{B}(\mathbb{R})\to[0,\infty], this holds if and only if py=Ξ³p_{y}=\gamma, that is, if and only if yy is standard normal (Standard Normal Distribution (iii)).

Standard normal vectors. Let Οƒ(o,f,p,r,z)\sigma(o,f,p,r,z) be the formula V(o,f,p,r,z)∧βV(o,f,p,r,z)\wedge\beta, where

Ξ²=βˆƒjβ€‰βˆƒsβ€‰βˆƒeβ€‰βˆƒy (j=[r]∧Φj(s)∧Φj(e)∧Φj(y)∧I(o,f,p,j,s,e,y)βˆ§βˆ€tβ€‰βˆ€aβ€‰βˆ€bβ€‰βˆ€c ((t∈j∧(t,a)∈s∧(t,b)∈e∧(t,c)∈y)β‡’(a=R∧b=dR∧ρ(o,f,p,c)∧ν(p,c)∧κ(t,c)))),ΞΊ(t,c)=βˆ€Ο‰β€‰βˆ€hβ€‰βˆ€g (((Ο‰,h)∈z∧(t,g)∈h)β‡’(Ο‰,g)∈c).\begin{aligned} \beta={}&\exists j\,\exists s\,\exists e\,\exists y\,\Bigl(j=[r]\wedge\Phi_{j}(s)\wedge\Phi_{j}(e)\wedge\Phi_{j}(y)\wedge I(o,f,p,j,s,e,y)\\ &\quad\wedge\forall t\,\forall a\,\forall b\,\forall c\,\bigl((t\in j\wedge(t,a)\in s\wedge(t,b)\in e\wedge(t,c)\in y)\Rightarrow(a=\mathbb{R}\wedge b=d_{\mathbb{R}}\wedge\rho(o,f,p,c)\wedge\nu(p,c)\wedge\kappa(t,c))\bigr)\Bigr),\\ \kappa(t,c)={}&\forall\omega\,\forall h\,\forall g\,\bigl(((\omega,h)\in z\wedge(t,g)\in h)\Rightarrow(\omega,g)\in c\bigr). \end{aligned}

Claim 2: for a probability space (o,f,p)(o,f,p), r∈Nr\in\mathbb{N} and a random vector zz in Rr\mathbb{R}^{r} on it, Ξ²\beta holds if and only if zz is a standard normal vector. For t∈[r]t\in[r] let zt:oβ†’Rz_{t}:o\to\mathbb{R}, ω↦z(Ο‰)t\omega\mapsto z(\omega)_{t}, be the tt-th coordinate of zz, a random variable by Random Vectors: Coordinates, Functions, Pairs and Almost-Sure Equality (i). For t∈[r]t\in[r] and a map c:oβ†’Rc:o\to\mathbb{R}, ΞΊ(t,c)\kappa(t,c) holds if and only if c(Ο‰)=z(Ο‰)tc(\omega)=z(\omega)_{t} for every Ο‰βˆˆo\omega\in o, that is, if and only if c=ztc=z_{t}.

Suppose Ξ²\beta holds with sets j,s,e,yj,s,e,y. Then j=[r]j=[r], and ss, ee and yy are families indexed by [r][r]; let t∈[r]t\in[r]. Then st=Rs_{t}=\mathbb{R} and et=dRe_{t}=d_{\mathbb{R}}; yty_{t} is a random variable, in particular a map yt:oβ†’Ry_{t}:o\to\mathbb{R}, so yt=zty_{t}=z_{t}; and ztz_{t} is standard normal, by Claim 1. By I(o,f,p,j,s,e,y)I(o,f,p,j,s,e,y), the family (zt)t∈[r](z_{t})_{t\in[r]} of the coordinates of zz is independent as a family of random elements of (R,dR)(\mathbb{R},d_{\mathbb{R}}) (Independence of Events and of Random Elements (ii)). So zz is a standard normal vector (Standard Normal Vectors and the Standard Normal Distribution on ℝᡏ (iii)).

Conversely, let zz be a standard normal vector. Let j=[r]j=[r], let ss and ee be the constant maps on [r][r] with values the sets R\mathbb{R} and dRd_{\mathbb{R}}, and let yy be the map t↦ztt\mapsto z_{t} on [r][r], into the power set of oΓ—Ro\times\mathbb{R}, given by the predicative relation ΞΌ(c,o,R)∧κ(t,c)\mu(c,o,\mathbb{R})\wedge\kappa(t,c), which for t∈[r]t\in[r] holds for c=ztc=z_{t} only. These are families indexed by [r][r]. For t∈[r]t\in[r], dRd_{\mathbb{R}} is a metric on R\mathbb{R} (The Absolute Value Metric on the Real Numbers (i)), so it is a map dR:RΓ—Rβ†’Rd_{\mathbb{R}}:\mathbb{R}\times\mathbb{R}\to\mathbb{R} and (R,dR)(\mathbb{R},d_{\mathbb{R}}) is a metric space (Metric Space (vi)); ztz_{t} is a random variable, hence a random element of R\mathbb{R}, and standard normal, so ρ(o,f,p,zt)\rho(o,f,p,z_{t}), Ξ½(p,zt)\nu(p,z_{t}) (Claim 1) and ΞΊ(t,zt)\kappa(t,z_{t}) hold; and the coordinates being independent, I(o,f,p,j,s,e,y)I(o,f,p,j,s,e,y) holds. So Ξ²\beta holds. This proves Claim 2; hence Οƒ(o,f,p,r,z)\sigma(o,f,p,r,z) holds if and only if (o,f,p)(o,f,p) is a probability space, r∈Nr\in\mathbb{N}, and zz is a standard normal vector in Rr\mathbb{R}^{r} on it.

The affine identity. Let

Ξ±(x,z)=βˆ€iβ€‰βˆ€aβ€‰βˆ€c ((i∈[d]∧(i,a)∈x∧(i,c)∈m)β‡’βˆƒuβ€‰βˆƒs (u:[k]β†’Rβˆ§βˆ€jβ€‰βˆ€gβ€‰βˆ€h ((j∈[k]∧((i,j),g)∈A∧(j,h)∈z)β‡’βˆƒl (((g,h),l)βˆˆβ‹…R∧(j,l)∈u))∧Σ(s,k,u)∧((c,s),a)∈+R)).\begin{aligned} \alpha(x,z)={}&\forall i\,\forall a\,\forall c\,\Bigl((i\in[d]\wedge(i,a)\in x\wedge(i,c)\in m)\Rightarrow\exists u\,\exists s\,\bigl(u:[k]\to\mathbb{R}\\ &\quad\wedge\forall j\,\forall g\,\forall h\,((j\in[k]\wedge((i,j),g)\in A\wedge(j,h)\in z)\Rightarrow\exists l\,(((g,h),l)\in\cdot_{\mathbb{R}}\wedge(j,l)\in u))\\ &\quad\wedge\Sigma(s,k,u)\wedge((c,s),a)\in+_{\mathbb{R}}\bigr)\Bigr). \end{aligned}

Claim 3: let d,k∈Nd,k\in\mathbb{N}, m∈Rdm\in\mathbb{R}^{d}, A∈RdΓ—kA\in\mathbb{R}^{d\times k}, x∈Rdx\in\mathbb{R}^{d} and z∈Rkz\in\mathbb{R}^{k}. Then Ξ±(x,z)\alpha(x,z) holds if and only if x=m+Azx=m+Az. Let i∈[d]i\in[d], so that a=xia=x_{i} and c=mic=m_{i}. The second conjunct after βˆƒuβ€‰βˆƒs\exists u\,\exists s says that u(j)=Aijzju(j)=A_{ij}z_{j} for every j∈[k]j\in[k]; the map u(i):[k]β†’Ru^{(i)}:[k]\to\mathbb{R}, j↦Aijzjj\mapsto A_{ij}z_{j}, exists, and it is the only map [k]β†’R[k]\to\mathbb{R} satisfying this conjunct. The only ss with Ξ£(s,k,u(i))\Sigma(s,k,u^{(i)}) is

βˆ‘j=1kAijzj=(Az)i\sum_{j=1}^{k}A_{ij}z_{j}=(Az)_{i}

(Matrix-Vector Product (i)), and the last conjunct then says xi=mi+(Az)i=(m+Az)ix_{i}=m_{i}+(Az)_{i}=(m+Az)_{i} (Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (iv)). So α(x,z)\alpha(x,z) holds if and only if xi=(m+Az)ix_{i}=(m+Az)_{i} for every i∈[d]i\in[d], that is (Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (iii)), if and only if x=m+Azx=m+Az.

Almost-sure equalities. Let

Ξ΅0(w)=βˆƒB (B∈F∧(B,0)∈Pβˆ§βˆ€Ο‰β€‰βˆ€x ((Ο‰βˆˆΞ©βˆ§(Ο‰,x)∈Xβˆ§Β¬β€‰x=w)β‡’Ο‰βˆˆB)),Ξ΅=βˆƒB (B∈F∧(B,0)∈Pβˆ§βˆ€Ο‰β€‰βˆ€xβ€‰βˆ€z ((Ο‰βˆˆΞ©βˆ§(Ο‰,x)∈X∧(Ο‰,z)∈Zβˆ§Β¬β€‰Ξ±(x,z))β‡’Ο‰βˆˆB)).\begin{aligned} \varepsilon_{0}(w)={}&\exists B\,\bigl(B\in\mathcal{F}\wedge(B,0)\in P\wedge\forall\omega\,\forall x\,((\omega\in\Omega\wedge(\omega,x)\in X\wedge\neg\,x=w)\Rightarrow\omega\in B)\bigr),\\ \varepsilon={}&\exists B\,\bigl(B\in\mathcal{F}\wedge(B,0)\in P\wedge\forall\omega\,\forall x\,\forall z\,((\omega\in\Omega\wedge(\omega,x)\in X\wedge(\omega,z)\in Z\wedge\neg\,\alpha(x,z))\Rightarrow\omega\in B)\bigr). \end{aligned}

Claim 4: let (Ξ©,F,P)(\Omega,\mathcal{F},P) be a probability space, d∈Nd\in\mathbb{N} and XX a random vector in Rd\mathbb{R}^{d} on it. For w∈Rdw\in\mathbb{R}^{d}, Ξ΅0(w)\varepsilon_{0}(w) holds if and only if X=wX=w almost surely. If moreover k∈Nk\in\mathbb{N}, ZZ is a random vector in Rk\mathbb{R}^{k}, m∈Rdm\in\mathbb{R}^{d} and A∈RdΓ—kA\in\mathbb{R}^{d\times k}, then Ξ΅\varepsilon holds if and only if X=m+AZX=m+AZ almost surely. For Ο‰βˆˆΞ©\omega\in\Omega, X(Ο‰)∈RdX(\omega)\in\mathbb{R}^{d} and Z(Ο‰)∈RkZ(\omega)\in\mathbb{R}^{k}, and by Claim 3, Ξ±(X(Ο‰),Z(Ο‰))\alpha(X(\omega),Z(\omega)) holds if and only if X(Ο‰)=m+AZ(Ο‰)X(\omega)=m+AZ(\omega), the value at Ο‰\omega of the function m+AZm+AZ (Probability Spaces: Notation (iv)). Let Nβ‰ N_{\neq} be the class of the Ο‰βˆˆΞ©\omega\in\Omega with X(Ο‰)β‰ (m+AZ)(Ο‰)X(\omega)\neq(m+AZ)(\omega). Then Ξ΅\varepsilon holds if and only if there is B∈FB\in\mathcal{F} with P(B)=0P(B)=0 and Nβ‰ βŠ†BN_{\neq}\subseteq B, that is, if and only if Nβ‰ N_{\neq} is PP-null (Null Set of a Measure (i)), which means that X=m+AZX=m+AZ holds PP-almost everywhere (A Property Holding Almost Everywhere (i)), that is, almost surely. The same argument, with the constant function ww in place of m+AZm+AZ and without ZZ, gives the assertion on Ξ΅0(w)\varepsilon_{0}(w).

Gaussian representations. Let

Ξ=V(Ξ©,F,P,d,X)βˆ§Οƒ(Ξ©,F,P,k,Z)∧m:[d]β†’R∧A∈RdΓ—k∧Ρ,\Xi=V(\Omega,\mathcal{F},P,d,X)\wedge\sigma(\Omega,\mathcal{F},P,k,Z)\wedge m:[d]\to\mathbb{R}\wedge A\in\mathbb{R}^{d\times k}\wedge\varepsilon,

a predicative formula whose free variables are among x0,…,x8x_{0},\dots,x_{8} and the parameters. Let sets be assigned to x0,…,x8x_{0},\dots,x_{8}. If V(Ξ©,F,P,d,X)V(\Omega,\mathcal{F},P,d,X) fails, then Ξ\Xi fails together with the condition of (i). Let it hold. By Claim 2, Οƒ(Ξ©,F,P,k,Z)\sigma(\Omega,\mathcal{F},P,k,Z) holds if and only if k∈Nk\in\mathbb{N} and ZZ is a standard normal vector in Rk\mathbb{R}^{k} (a random vector, by Standard Normal Vectors and the Standard Normal Distribution on ℝᡏ (iii)); the next two conjuncts say m∈Rdm\in\mathbb{R}^{d} and A∈RdΓ—kA\in\mathbb{R}^{d\times k}; and when all these hold, Ξ΅\varepsilon holds if and only if X=m+AZX=m+AZ almost surely, by Claim 4. So Ξ\Xi holds if and only if kk, ZZ, mm and AA are as in the second case of Gaussian Random Vectors and Jointly Gaussian Random Variables (i), that is, if and only if (k,Z,m,A)(k,Z,m,A) is a Gaussian representation of XX (Gaussian Random Vectors and Jointly Gaussian Random Variables (ii)). So Ξ\Xi expresses the condition of (i) with Ξ©,…,A\Omega,\dots,A at x0,…,x8x_{0},\dots,x_{8}.

Gaussian random vectors. Let

G(Ξ©,F,P,d,X)=V(Ξ©,F,P,d,X)∧(βˆƒw (w:[d]β†’R∧Ρ0(w))βˆ¨βˆƒkβ€‰βˆƒZβ€‰βˆƒmβ€‰βˆƒAβ€‰Ξž),G(\Omega,\mathcal{F},P,d,X)=V(\Omega,\mathcal{F},P,d,X)\wedge\Bigl(\exists w\,\bigl(w:[d]\to\mathbb{R}\wedge\varepsilon_{0}(w)\bigr)\vee\exists k\,\exists Z\,\exists m\,\exists A\,\Xi\Bigr),

whose free variables are among x0,…,x4x_{0},\dots,x_{4} and the parameters. When V(Ξ©,F,P,d,X)V(\Omega,\mathcal{F},P,d,X) holds, the first disjunct holds, by Claim 4, if and only if X=wX=w almost surely for some w∈Rdw\in\mathbb{R}^{d}, and the second, by the previous paragraph, if and only if XX has a Gaussian representation. By Gaussian Random Vectors and Jointly Gaussian Random Variables (i), GG therefore expresses the condition of (ii) with Ξ©,F,P,d,X\Omega,\mathcal{F},P,d,X at x0,…,x4x_{0},\dots,x_{4}.

Jointly Gaussian random variables. Let J(Ξ©,F,P,d,X)J(\Omega,\mathcal{F},P,d,X) be the formula

Ξ (Ξ©,F,P)∧d∈Nβˆ§βˆƒc (c=[d]∧Φc(X))βˆ§βˆ€tβ€‰βˆ€y ((t∈[d]∧(t,y)∈X)⇒ρ(Ξ©,F,P,y))βˆ§βˆƒv (βˆ€Ο‰β€‰βˆ€hβ€‰βˆ€tβ€‰βˆ€yβ€‰βˆ€g (((Ο‰,h)∈v∧t∈[d]∧(t,y)∈X∧(Ο‰,g)∈y)β‡’(t,g)∈h)∧G(Ξ©,F,P,d,v)).\begin{aligned} &\Pi(\Omega,\mathcal{F},P)\wedge d\in\mathbb{N}\wedge\exists c\,\bigl(c=[d]\wedge\Phi_{c}(X)\bigr)\wedge\forall t\,\forall y\,\bigl((t\in[d]\wedge(t,y)\in X)\Rightarrow\rho(\Omega,\mathcal{F},P,y)\bigr)\\ &\quad\wedge\exists v\,\Bigl(\forall\omega\,\forall h\,\forall t\,\forall y\,\forall g\,\bigl(((\omega,h)\in v\wedge t\in[d]\wedge(t,y)\in X\wedge(\omega,g)\in y)\Rightarrow(t,g)\in h\bigr)\wedge G(\Omega,\mathcal{F},P,d,v)\Bigr). \end{aligned}

Let sets be assigned to x0,…,x4x_{0},\dots,x_{4}. The first four conjuncts hold if and only if (Ξ©,F,P)(\Omega,\mathcal{F},P) is a probability space, d∈Nd\in\mathbb{N} and X=(Xt)t∈[d]X=(X_{t})_{t\in[d]} is a family indexed by [d][d] in which each XtX_{t} is a random variable; if they fail, JJ fails together with the condition of (iii). Let them hold. For each Ο‰βˆˆΞ©\omega\in\Omega the point t↦Xt(Ο‰)t\mapsto X_{t}(\omega) of Rd\mathbb{R}^{d} exists, and then so does the map Y:Ξ©β†’RdY:\Omega\to\mathbb{R}^{d}, Y(Ο‰)=(X1(Ο‰),…,Xd(Ο‰))Y(\omega)=(X_{1}(\omega),\dots,X_{d}(\omega)); YY is the random vector (X1,…,Xd)(X_{1},\dots,X_{d}) in Rd\mathbb{R}^{d} of Gaussian Random Vectors and Jointly Gaussian Random Variables (iii), a random vector by Random Vectors: Coordinates, Functions, Pairs and Almost-Sure Equality (i). For a map v:Ξ©β†’Rdv:\Omega\to\mathbb{R}^{d}, the first conjunct after βˆƒv\exists v says v(Ο‰)t=Xt(Ο‰)v(\omega)_{t}=X_{t}(\omega) for all Ο‰βˆˆΞ©\omega\in\Omega and t∈[d]t\in[d], that is, v=Yv=Y (Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (iii)). If the last conjunct of JJ holds with a set vv, then G(Ξ©,F,P,d,v)G(\Omega,\mathcal{F},P,d,v) makes vv a random vector in Rd\mathbb{R}^{d}, in particular a map v:Ξ©β†’Rdv:\Omega\to\mathbb{R}^{d}, so v=Yv=Y and YY is Gaussian; conversely, if YY is Gaussian, v=Yv=Y satisfies it. So JJ holds if and only if YY is Gaussian, that is, if and only if X1,…,XdX_{1},\dots,X_{d} are jointly Gaussian; JJ expresses the condition of (iii) with Ξ©,F,P,d,X\Omega,\mathcal{F},P,d,X at x0,…,x4x_{0},\dots,x_{4}.

Gaussian random variables. Let yβ€²y' be a set variable not occurring in JJ, let J(Ξ©,F,P,1N,yβ€²)J(\Omega,\mathcal{F},P,1_{\mathbb{N}},y') be obtained from JJ by renaming dd to the set variable 1N1_{\mathbb{N}} and XX to yβ€²y', and let

H(Ξ©,F,P,X)=βˆƒy′ (βˆ€w (w∈y′⇔w=(1N,X))∧J(Ξ©,F,P,1N,yβ€²)).H(\Omega,\mathcal{F},P,X)=\exists y'\,\bigl(\forall w\,(w\in y'\Leftrightarrow w=(1_{\mathbb{N}},X))\wedge J(\Omega,\mathcal{F},P,1_{\mathbb{N}},y')\bigr).

Let sets be assigned to Ξ©,F,P,X\Omega,\mathcal{F},P,X. The only set yβ€²y' satisfying the first conjunct after βˆƒyβ€²\exists y' is {(1N,X)}\{(1_{\mathbb{N}},X)\}, the function with domain {1N}=[1]\{1_{\mathbb{N}}\}=[1] and value XX at 1N1_{\mathbb{N}}, that is, XX as a family of one set. By the previous paragraph, with dd equal to the natural number 1N1_{\mathbb{N}}, J(Ξ©,F,P,1N,yβ€²)J(\Omega,\mathcal{F},P,1_{\mathbb{N}},y') holds for this yβ€²y' if and only if (Ξ©,F,P)(\Omega,\mathcal{F},P) is a probability space, XX is a random variable, and XX, as a family of one random variable, is jointly Gaussian, which by Gaussian Random Vectors and Jointly Gaussian Random Variables (iii) means that XX is Gaussian. So HH expresses the condition of (iv) with Ξ©,F,P,X\Omega,\mathcal{F},P,X at x0,x1,x2,x4x_{0},x_{1},x_{2},x_{4}.

Positions. Rename xrx_{r} to xirx_{i_{r}}, simultaneously, for r≀8r\le8 in Ξ\Xi and for r≀4r\le4 in GG and JJ, and x0,x1,x2,x4x_{0},x_{1},x_{2},x_{4} to xi0,xi1,xi2,xi3x_{i_{0}},x_{i_{1}},x_{i_{2}},x_{i_{3}} in HH, the bound variables being first renamed away from x0,…,xnβˆ’1x_{0},\dots,x_{n-1}. The resulting formulas are predicative and express the conditions of (i), (ii), (iii) and (iv) with the sets at the positions named there, 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 (i), applied to the formula with its abbreviations eliminated, which allows the formula renamed to contain class variables, here parameters, in pair and atomic positions; their free variables are among x0,…,xnβˆ’1x_{0},\dots,x_{n-1} and the parameters of the statement. Hence each of the four conditions is predicative.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…