TheoremBase

Viewing X and Y as random vectors in R1R^1, the product formula is the iterated-integral formula for independent random vectors, with monotone convergence for an infinite factor; uncorrelatedness follows from the covariance formula, and the variance and covariance identities from bilinearity, by induction for the sum.

Proof

Throughout, the projections of RΓ—R\mathbb{R}\times\mathbb{R} onto its factors are B(R)βŠ—B(R)\mathcal{B}(\mathbb{R})\otimes\mathcal{B}(\mathbb{R})-measurable (The Product Οƒ-Algebra: Rectangles, Generators, Sections, Projections, Pairings and the Swap (vi)), so the functions h(x,y)=xyh(x,y)=xy and ∣h∣(x,y)=∣xy∣=∣xβˆ£β€‰βˆ£y∣|h|(x,y)=|xy|=|x|\,|y| on RΓ—R\mathbb{R}\times\mathbb{R} are measurable (Arithmetic of Measurable Real- and [0,∞]-Valued Maps (i)), and ∣h∣|h|, having nonnegative values, lies in M+(RΓ—R,B(R)βŠ—B(R))\mathcal{M}^{+}(\mathbb{R}\times\mathbb{R},\mathcal{B}(\mathbb{R})\otimes\mathcal{B}(\mathbb{R})) (Linearity and Monotonicity of the Lebesgue Integral, and the Integrability Criterion (vi)); likewise the identity v(t)=tv(t)=t of R\mathbb{R} (Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (iii)) and u(t)=∣t∣u(t)=|t| are measurable, with u∈M+(R,B(R))u\in\mathcal{M}^{+}(\mathbb{R},\mathcal{B}(\mathbb{R})). Laws are taken on (R,B(R))(\mathbb{R},\mathcal{B}(\mathbb{R})), and Independent Random Elements: Product Laws and Iterated Expectations is applied with S=T=RS=T=\mathbb{R}.

Step 1: (i) for X,Yβ‰₯0X,Y\ge0. As X,Yβ‰₯0X,Y\ge0, we have XY=∣h∣(X,Y)XY=|h|(X,Y), X=u(X)X=u(X) and Y=u(Y)Y=u(Y), so EX=∫u dPX\mathbb{E}X=\int u\,dP_{X} and EY=∫u dPY\mathbb{E}Y=\int u\,dP_{Y} (Expectations Computed from the Law (i)). For x∈Rx\in\mathbb{R} the section ∣h∣x|h|_{x} is yβ†¦βˆ£xβˆ£β€‰u(y)y\mapsto|x|\,u(y), so ∫∣h∣x dPY=∣xβˆ£β€‰EY\int|h|_{x}\,dP_{Y}=|x|\,\mathbb{E}Y (Basic Properties of the Integral of Nonnegative Measurable Maps (iv)). By Independent Random Elements: Product Laws and Iterated Expectations (ii),

E[XY]=∫R(∫R∣h∣x dPY)dPX(x)=∫Rc u dPX,c=EY∈[0,∞].\mathbb{E}[XY]=\int_{\mathbb{R}}\Bigl(\int_{\mathbb{R}}|h|_{x}\,dP_{Y}\Bigr)dP_{X}(x)=\int_{\mathbb{R}}c\,u\,dP_{X},\qquad c=\mathbb{E}Y\in[0,\infty].

If cc is real, the right side is c EXc\,\mathbb{E}X by Basic Properties of the Integral of Nonnegative Measurable Maps (iv). If c=∞c=\infty, then sup⁑kk=∞\sup_{k}k=\infty in [0,∞][0,\infty] (The Integers in the Real Numbers: Greatest Elements, the Integer Part, and Archimedean Consequences (vii)), so the functions k uk\,u, k∈Nk\in\mathbb{N}, increase pointwise to βˆžβ‹…u\infty\cdot u (Suprema and Finite Sums in [0,∞] (ii)), and monotone convergence (Monotone Convergence Theorem (ii)) gives βˆ«βˆžβ‹…u dPX=sup⁑kk EX=βˆžβ‹…EX\int\infty\cdot u\,dP_{X}=\sup_{k}k\,\mathbb{E}X=\infty\cdot\mathbb{E}X. In both cases E[XY]=EXβ‹…EY\mathbb{E}[XY]=\mathbb{E}X\cdot\mathbb{E}Y.

Step 2: (i) for integrable X,YX,Y. The random variables ∣X∣=u(X)|X|=u(X) and ∣Y∣=u(Y)|Y|=u(Y) are independent by Independent Random Elements: Preimages, Functions and Blocks (iv), and ∣XY∣=∣Xβˆ£β€‰βˆ£Y∣|XY|=|X|\,|Y|, so Step 1 gives E∣XY∣=E∣Xβˆ£β€‰E∣Y∣<∞\mathbb{E}|XY|=\mathbb{E}|X|\,\mathbb{E}|Y|<\infty; hence the random variable XY=h(X,Y)XY=h(X,Y) is integrable (Linearity and Monotonicity of the Lebesgue Integral, and the Integrability Criterion (iv)), and h∈L1(PXβŠ—PY)h\in\mathcal{L}^{1}(P_{X}\otimes P_{Y}) by Independent Random Elements: Product Laws and Iterated Expectations (iii). As v(X)=Xv(X)=X and v(Y)=Yv(Y)=Y, we have v∈L1(PX)∩L1(PY)v\in\mathcal{L}^{1}(P_{X})\cap\mathcal{L}^{1}(P_{Y}) with ∫v dPX=EX\int v\,dP_{X}=\mathbb{E}X and ∫v dPY=EY\int v\,dP_{Y}=\mathbb{E}Y (Expectations Computed from the Law (ii)). For every x∈Rx\in\mathbb{R} the section hx=x vh_{x}=x\,v therefore lies in L1(PY)\mathcal{L}^{1}(P_{Y}) with integral x EYx\,\mathbb{E}Y (Linearity and Monotonicity of the Lebesgue Integral, and the Integrability Criterion (vii)), so the function II of Independent Random Elements: Product Laws and Iterated Expectations (iii) is I=(EY) vI=(\mathbb{E}Y)\,v, and, by the same lemma and linearity (Linearity and Monotonicity of the Lebesgue Integral, and the Integrability Criterion (vii)),

E[XY]=∫R(EY) v dPX=EY∫Rv dPX=EX EY.\mathbb{E}[XY]=\int_{\mathbb{R}}(\mathbb{E}Y)\,v\,dP_{X}=\mathbb{E}Y\int_{\mathbb{R}}v\,dP_{X}=\mathbb{E}X\,\mathbb{E}Y.

Proof of (ii). As X,Y∈L1(P)X,Y\in\mathcal{L}^{1}(P) (Lα΅– Inclusions and Constants on a Finite Measure Space (i)), the covariance formula (Rules for Expectations, Variances and Covariances (vii)) and (i) give

Cov⁑(X,Y)=E[XY]βˆ’EX EY=0.\operatorname{Cov}(X,Y)=\mathbb{E}[XY]-\mathbb{E}X\,\mathbb{E}Y=0.

Proof of (iii). For r∈[n]r\in[n] let Tr=βˆ‘k=1rXkT_{r}=\sum_{k=1}^{r}X_{k}. We show by induction on rr (Induction for Predicative Formulas, and the Order of β„• below 1 and below n+1 (i)) that for r∈[n]r\in[n]: Tr∈L2(P)T_{r}\in\mathcal{L}^{2}(P), Var⁑Tr=βˆ‘k=1rVar⁑Xk\operatorname{Var}T_{r}=\sum_{k=1}^{r}\operatorname{Var}X_{k}, and Cov⁑(Tr,Xj)=0\operatorname{Cov}(T_{r},X_{j})=0 for every j∈[n]j\in[n] with j>rj>r. For r=1r=1 we have T1=X1T_{1}=X_{1} (Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (i)), so the first two assertions are clear, and for j>1j>1 the hypothesis gives Cov⁑(T1,Xj)=Cov⁑(X1,Xj)=0\operatorname{Cov}(T_{1},X_{j})=\operatorname{Cov}(X_{1},X_{j})=0, as jβ‰ 1j\neq1. Let r+1∈[n]r+1\in[n], so that r∈[n]r\in[n], and assume the claim for rr. Then Tr+1=Tr+Xr+1T_{r+1}=T_{r}+X_{r+1} (Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (i)), which lies in L2(P)\mathcal{L}^{2}(P) (Minkowski's Inequality (i)). By symmetry and bilinearity of the covariance (Rules for Expectations, Variances and Covariances (x)) and the claim for rr with j=r+1j=r+1,

Var⁑Tr+1=Var⁑Tr+2Cov⁑(Tr,Xr+1)+Var⁑Xr+1=βˆ‘k=1r+1Var⁑Xk,\operatorname{Var}T_{r+1}=\operatorname{Var}T_{r}+2\operatorname{Cov}(T_{r},X_{r+1})+\operatorname{Var}X_{r+1}=\sum_{k=1}^{r+1}\operatorname{Var}X_{k},

and for j∈[n]j\in[n] with j>r+1j>r+1, so that j>rj>r and jβ‰ r+1j\neq r+1 (Induction for Predicative Formulas, and the Order of β„• below 1 and below n+1 (iii)), the claim for rr and the hypothesis give

Cov⁑(Tr+1,Xj)=Cov⁑(Tr,Xj)+Cov⁑(Xr+1,Xj)=0.\operatorname{Cov}(T_{r+1},X_{j})=\operatorname{Cov}(T_{r},X_{j})+\operatorname{Cov}(X_{r+1},X_{j})=0.

The case r=nr=n is the assertion.

Proof of (iv). X+Y∈L2(P;Rn)X+Y\in\mathcal{L}^{2}(P;\mathbb{R}^{n}) (Square-Integrable Vector-Valued Functions: Components, Dot Products and Almost-Everywhere Equality (iii)), its components are Xi+YiX_{i}+Y_{i}, and Xi,Yi∈L2(P)X_{i},Y_{i}\in\mathcal{L}^{2}(P) for i∈[n]i\in[n] (Square-Integrable Vector-Valued Functions: Components, Dot Products and Almost-Everywhere Equality (i)). Let i,j∈[n]i,j\in[n]. The coordinate functions x↦xix\mapsto x_{i} and x↦xjx\mapsto x_{j} on Rn\mathbb{R}^{n} being measurable (Vector- and Matrix-Valued Measurable Maps: Components, Entries and Continuous Images (i)), Independent Random Elements: Preimages, Functions and Blocks (iv) shows that XiX_{i} and YjY_{j} are independent, and also XjX_{j} and YiY_{i}; so Cov⁑(Xi,Yj)=0\operatorname{Cov}(X_{i},Y_{j})=0 and Cov⁑(Yi,Xj)=Cov⁑(Xj,Yi)=0\operatorname{Cov}(Y_{i},X_{j})=\operatorname{Cov}(X_{j},Y_{i})=0 by (ii) and the symmetry of the covariance (Rules for Expectations, Variances and Covariances (x)). By Variance and Covariance (iv) and Rules for Expectations, Variances and Covariances (x),

Cov⁑(X+Y)ij=Cov⁑(Xi,Xj)+Cov⁑(Xi,Yj)+Cov⁑(Yi,Xj)+Cov⁑(Yi,Yj)=Cov⁑(X)ij+Cov⁑(Y)ij.\operatorname{Cov}(X+Y)_{ij}=\operatorname{Cov}(X_{i},X_{j})+\operatorname{Cov}(X_{i},Y_{j})+\operatorname{Cov}(Y_{i},X_{j})+\operatorname{Cov}(Y_{i},Y_{j})=\operatorname{Cov}(X)_{ij}+\operatorname{Cov}(Y)_{ij}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…