TheoremBase

Events defined by the lifted variables and the coordinates are measurable rectangles, whose product measure factors by the independence of the YkY_k and because the identity of RnR^n is a standard normal vector; taking sets equal to R gives the laws and the product formula for every subfamily.

Proof

For k∈[n]k\in[n] let ck:Rn→Rc_{k}:\mathbb{R}^{n}\to\mathbb{R}, ck(z)=zkc_{k}(z)=z_{k}, be the kk-th coordinate function. The identity of (Rn,B(Rn),γn)(\mathbb{R}^{n},\mathcal{B}(\mathbb{R}^{n}),\gamma_{n}) is a standard normal vector (Standard Normal Vectors: Density, Moments, Orthogonal Invariance and Concatenation (ii)), so its coordinates c1,…,cnc_{1},\dots,c_{n} are independent standard normal random variables on that space (Standard Normal Vectors and the Standard Normal Distribution on ℝᵏ (iii), Standard Normal Distribution (iii)); in particular ck−1(B)∈B(Rn)c_{k}^{-1}(B)\in\mathcal{B}(\mathbb{R}^{n}) and γn(ck−1(B))=γ(B)\gamma_{n}(c_{k}^{-1}(B))=\gamma(B) for every Borel set B⊆RB\subseteq\mathbb{R}.

The product space. PP and γn\gamma_{n} are probability measures (Standard Normal Vectors: Density, Moments, Orthogonal Invariance and Concatenation (i)), in particular σ\sigma-finite, so the product measure P~=P⊗γn\tilde P=P\otimes\gamma_{n} is defined (Product Measure (i)) and

P~(Ω~)=P(Ω) γn(Rn)=1.\tilde P(\tilde\Omega)=P(\Omega)\,\gamma_{n}(\mathbb{R}^{n})=1 .

Let k∈[n]k\in[n] and let B⊆RB\subseteq\mathbb{R} be a Borel set. Then

Y~k−1(B)=Yk−1(B)×Rn,Z~k−1(B)=Ω×ck−1(B),\tilde Y_{k}^{-1}(B)=Y_{k}^{-1}(B)\times\mathbb{R}^{n},\qquad\tilde Z_{k}^{-1}(B)=\Omega\times c_{k}^{-1}(B),

and both are measurable rectangles, since Yk−1(B)∈FY_{k}^{-1}(B)\in\mathcal{F} and ck−1(B)∈B(Rn)c_{k}^{-1}(B)\in\mathcal{B}(\mathbb{R}^{n}); so they lie in F~\tilde{\mathcal{F}} (Measurable Rectangles and the Product σ-Algebra (ii)), and Y~k\tilde Y_{k} and Z~k\tilde Z_{k} are random variables (Probability Spaces, Events and Random Elements (iv)). This proves (i).

Laws. By Product Measure (i), the same two rectangles give

P~(Y~k∈B)=P(Yk∈B) γn(Rn)=P(Yk∈B),P~(Z~k∈B)=P(Ω) γn(ck−1(B))=γ(B).\tilde P(\tilde Y_{k}\in B)=P(Y_{k}\in B)\,\gamma_{n}(\mathbb{R}^{n})=P(Y_{k}\in B),\qquad\tilde P(\tilde Z_{k}\in B)=P(\Omega)\,\gamma_{n}\bigl(c_{k}^{-1}(B)\bigr)=\gamma(B).

So Y~k\tilde Y_{k} has the law of YkY_{k} (The Law of a Random Element (ii)) and Z~k\tilde Z_{k} has the law γ\gamma, that is, it is standard normal (Standard Normal Distribution (iii)). This proves (iii).

Rectangles. Let C1,…,C2n⊆RC_{1},\dots,C_{2n}\subseteq\mathbb{R} be Borel sets. The event {Wi∈Ci (i∈[2n])}\{W_{i}\in C_{i}\ (i\in[2n])\} is the rectangle E×FE\times F with

E=⋂k∈[n]Yk−1(Ck),F=⋂k∈[n]ck−1(Cn+k).E=\bigcap_{k\in[n]}Y_{k}^{-1}(C_{k}),\qquad F=\bigcap_{k\in[n]}c_{k}^{-1}(C_{n+k}).

These are intersections over the nonempty finite, hence countable (Countable Sets: a Bijection from ℕ onto ℕ×ℕ, Finite Sets, Subsets, Surjective Images, Images, Products, and the Integers and Rationals (iii)), index set [n][n] of sets in F\mathcal{F} and in B(Rn)\mathcal{B}(\mathbb{R}^{n}) respectively, so E∈FE\in\mathcal{F} and F∈B(Rn)F\in\mathcal{B}(\mathbb{R}^{n}) (Unions and Intersections over a Countable Index Set in a σ-Algebra (ii)). By Product Measure (i),

P~(Wi∈Ci (i∈[2n]))=P(E) γn(F)=∏k=1nP(Yk∈Ck)∏k=1nγ(Cn+k)=∏i=12nP~(Wi∈Ci).(∗)\tilde P\bigl(W_{i}\in C_{i}\ (i\in[2n])\bigr)=P(E)\,\gamma_{n}(F)=\prod_{k=1}^{n}P(Y_{k}\in C_{k})\prod_{k=1}^{n}\gamma(C_{n+k})=\prod_{i=1}^{2n}\tilde P(W_{i}\in C_{i}).\qquad(*)

Here P(E)P(E) factors because the family (Yk)k∈[n](Y_{k})_{k\in[n]} is independent, and γn(F)\gamma_{n}(F) factors because the family (ck)k∈[n](c_{k})_{k\in[n]} is independent, both by Independent Random Elements: Preimages, Functions and Blocks (i), with γn(ck−1(Cn+k))=γ(Cn+k)\gamma_{n}(c_{k}^{-1}(C_{n+k}))=\gamma(C_{n+k}); the last equality uses the laws just found and splits [2n][2n] into the disjoint sets [n][n] and {n+1,…,2n}\{n+1,\dots,2n\} (Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (ii)).

Independence. Let m∈Nm\in\mathbb{N}, let i1,…,im∈[2n]i_{1},\dots,i_{m}\in[2n] be distinct, let I={i1,…,im}I=\{i_{1},\dots,i_{m}\} and let B1,…,Bm⊆RB_{1},\dots,B_{m}\subseteq\mathbb{R} be Borel sets. Let (Ci)i∈[2n](C_{i})_{i\in[2n]} be the union of the function ir↦Bri_{r}\mapsto B_{r} on II (well defined, the iri_{r} being distinct) and the constant function R\mathbb{R} on [2n]∖I[2n]\setminus I, whose domains are disjoint; so Cir=BrC_{i_{r}}=B_{r} for r∈[m]r\in[m] and Ci=RC_{i}=\mathbb{R} for i∈[2n]∖Ii\in[2n]\setminus I. Then {Wi1∈B1,…,Wim∈Bm}={Wi∈Ci (i∈[2n])}\{W_{i_{1}}\in B_{1},\dots,W_{i_{m}}\in B_{m}\}=\{W_{i}\in C_{i}\ (i\in[2n])\}, and by (∗)(*) its probability is

∏i=12nP~(Wi∈Ci)=∏i∈IP~(Wi∈Ci)∏i∈[2n]∖IP~(Wi∈R)=∏r=1mP~(Wir∈Br),\prod_{i=1}^{2n}\tilde P(W_{i}\in C_{i})=\prod_{i\in I}\tilde P(W_{i}\in C_{i})\prod_{i\in[2n]\setminus I}\tilde P(W_{i}\in\mathbb{R})=\prod_{r=1}^{m}\tilde P(W_{i_{r}}\in B_{r}),

by splitting [2n][2n] into II and its complement, finite as a subset of the finite set [2n][2n] (Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (iv), Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (ii)), the factors off II being P~(Ω~)=1\tilde P(\tilde\Omega)=1, and reindexing along the bijection r↦irr\mapsto i_{r} of [m][m] onto II (Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (iii)). By Independent Random Elements: Preimages, Functions and Blocks (i), the family (Wi)i∈[2n](W_{i})_{i\in[2n]} is independent, which is (ii).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…