Math 2.0

Probability theory and stochastic processes Proof

Proof of the expectation of a product of independent random variables by simple functions

Builds on Expected valueIndependence of two random variablesRandom variableFloor functionIntervalBorel sigma-algebraSimple functionIndicator functionIntegral of a non-negative functionMonotone convergence theoremLimit of a product of sequencesLinearity of expectation

Proof

We prove the formula for nonnegative parts by approximation with simple functions and monotone convergence, then combine the parts.

  1. Let XX and YY be independent integrable real random variables on a probability space (Ω,ℱ,P)(\Omega, \mathcal{F}, P).
  2. For a real number uu put u+=max⁡(u,0)u^+ = \max(u, 0) and u−=max⁡(−u,0)u^- = \max(-u, 0). Then u=u+−u−u = u^+ - u^- and ∣u∣=u++u−\abs{u} = u^+ + u^-.
  3. For n≥1n \ge 1 and u≥0u \ge 0 let φn(u)=min⁡(n,2−n⌊2nu⌋)\varphi_n(u) = \min\left(n, 2^{-n} \floor{2^n u}\right), where ⌊⋅⌋\floor{\cdot} is the floor function.
  4. The function φn\varphi_n takes only the finitely many values k2−nk 2^{-n} with 0≤k≤n2n0 \le k \le n 2^n. It is nondecreasing, and 0≤φn(u)≤u0 \le \varphi_n(u) \le u.
  5. We have φn(u)≤φn+1(u)\varphi_n(u) \le \varphi_{n+1}(u). Indeed 2⌊2nu⌋2 \floor{2^n u} is an integer at most 2n+1u2^{n+1} u, so it is at most ⌊2n+1u⌋\floor{2^{n+1} u}.
  6. Dividing by 2n+12^{n+1} gives 2−n⌊2nu⌋≤2−n−1⌊2n+1u⌋2^{-n} \floor{2^n u} \le 2^{-n-1} \floor{2^{n+1} u}. Since also n≤n+1n \le n + 1, the minimum in step 3 does not decrease.
  7. We have φn(u)→u\varphi_n(u) \to u. For n≥un \ge u we get φn(u)=2−n⌊2nu⌋\varphi_n(u) = 2^{-n} \floor{2^n u}, and this lies in (u−2−n,u](u - 2^{-n}, u].
  8. Let gg be one of the maps x↦x+x \mapsto x^+ and x↦x−x \mapsto x^- from ℝ\R to [0,∞)[0, \infty). Each is monotone, so φn∘g\varphi_n \circ g is monotone on ℝ\R.
  9. Hence for each cc the set {x∈ℝ:φn(g(x))=c}\set{x \in \R : \varphi_n(g(x)) = c} is an interval or empty. If x<z<yx < z < y and the values at xx and yy equal cc, monotonicity forces the value cc at zz.
  10. Every interval is a Borel set. It is open or closed, or it is an open interval together with one closed endpoint.
  11. Let gg and hh be maps as in step 8, let U=g(X)U = g(X) and V=h(Y)V = h(Y), and assume E[U]<∞E[U] < \infty and E[V]<∞E[V] < \infty. We show E[UV]=E[U] E[V]E[UV] = E[U] \, E[V] in steps 12 to 17.
  12. Let Un=φn(U)U_n = \varphi_n(U), with distinct values c1,…,crc_1, \dots, c_r. By steps 9 and 10, Ai={Un=ci}={X∈Ji}A_i = \set{U_n = c_i} = \set{X \in J_i} with Borel sets JiJ_i. The AiA_i are disjoint events covering Ω\Omega.
  13. In the same way, Vn=φn(V)V_n = \varphi_n(V) has distinct values d1,…,dsd_1, \dots, d_s, taken on the disjoint events Bj={Y∈Kj}B_j = \set{Y \in K_j} with Borel sets KjK_j.
  14. So UnVn=∑i,jcidj𝟏Ai∩BjU_n V_n = \sum_{i, j} c_i d_j \mathbf{1}_{A_i \cap B_j} is a nonnegative simple function, written with pairwise disjoint sets Ai∩BjA_i \cap B_j and indicator functions.
  15. By the integral of a non-negative function for simple functions, E[UnVn]=∑i,jcidj P(Ai∩Bj)E[U_n V_n] = \sum_{i, j} c_i d_j \, P(A_i \cap B_j). By independence, P(Ai∩Bj)=P(X∈Ji) P(Y∈Kj)=P(Ai) P(Bj)P(A_i \cap B_j) = P(X \in J_i) \, P(Y \in K_j) = P(A_i) \, P(B_j).
  16. So E[UnVn]=(∑iciP(Ai))(∑jdjP(Bj))=E[Un] E[Vn]E[U_n V_n] = \left(\sum_i c_i P(A_i)\right) \left(\sum_j d_j P(B_j)\right) = E[U_n] \, E[V_n], again by the formula for simple functions.
  17. By steps 5 and 7, UnU_n increases to UU and VnV_n increases to VV. Products of nondecreasing nonnegative sequences are nondecreasing, so UnVnU_n V_n increases to UVUV.
  18. By the monotone convergence theorem, UVUV is measurable, and E[Un]→E[U]E[U_n] \to E[U], E[Vn]→E[V]E[V_n] \to E[V] and E[UnVn]→E[UV]E[U_n V_n] \to E[UV].
  19. The limits E[U]E[U] and E[V]E[V] are finite. By the limit of a product of sequences and step 16, E[UV]=E[U] E[V]E[UV] = E[U] \, E[V]. This proves the claim of step 11.
  20. Now X+≤∣X∣X^+ \le \abs{X}, so every simple ss with 0≤s≤X+0 \le s \le X^+ also satisfies s≤∣X∣s \le \abs{X}. By the supremum definition, E[X+]≤E[∣X∣]<∞E[X^+] \le E[\abs{X}] < \infty.
  21. In the same way E[X−]E[X^-], E[Y+]E[Y^+] and E[Y−]E[Y^-] are finite, because XX and YY are integrable.
  22. For signs σ,τ∈{+,−}\sigma, \tau \in \set{+, -} let Wστ=XσYτW_{\sigma\tau} = X^\sigma Y^\tau. By steps 11 to 21, each WστW_{\sigma\tau} is a nonnegative random variable with E[Wστ]=E[Xσ] E[Yτ]<∞E[W_{\sigma\tau}] = E[X^\sigma] \, E[Y^\tau] < \infty. So each is integrable.
  23. Expanding (X+−X−)(Y+−Y−)(X^+ - X^-)(Y^+ - Y^-) gives XY=W++−W+−−W−++W−−XY = W_{++} - W_{+-} - W_{-+} + W_{--} at every point of Ω\Omega.
  24. By linearity of expectation, applied three times, XYXY is integrable and E[XY]=E[W++]−E[W+−]−E[W−+]+E[W−−]E[XY] = E[W_{++}] - E[W_{+-}] - E[W_{-+}] + E[W_{--}].
  25. By step 22, the right side is E[X+]E[Y+]−E[X+]E[Y−]−E[X−]E[Y+]+E[X−]E[Y−]E[X^+] E[Y^+] - E[X^+] E[Y^-] - E[X^-] E[Y^+] + E[X^-] E[Y^-].
  26. This factors as (E[X+]−E[X−])(E[Y+]−E[Y−])\left(E[X^+] - E[X^-]\right)\left(E[Y^+] - E[Y^-]\right). By the definition of expected value, it equals E[X] E[Y]E[X] \, E[Y].

Idea

For simple random variables built from events of the form {X∈J}\set{X \in J} and {Y∈K}\set{Y \in K}, independence turns the expectation of the product into a double sum that factors. Every nonnegative random variable is an increasing limit of such simple ones, and monotone convergence carries the identity to the limit. Splitting XX and YY into positive and negative parts handles the general integrable case.

Reading path

To understand this page from the ground up, read these 90 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the limit of a product of sequences, Proof that the absolute value is multiplicative, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, Proof that the reals are Archimedean from the completeness axiom, Proof that convergent sequences are bounded.

  1. Construction of the reals from Cauchy sequences concept
  2. Element definition
  3. Extended real number line object
  4. Integers object
  5. Integral of a non-negative function concept
  6. Measurable function concept
  7. Measure space concept
  8. Ordered field definition
  9. Proposition concept
  10. Random experiment concept
  11. Rational numbers object
  12. Real numbers object
  13. Sequence definition
  14. Set bounded above definition
  15. Simple function concept
  16. Set definition
  17. Ring of integers statement
  18. Monotone convergence theorem statement
  19. Archimedean ordered field definition
  20. Disjunction definition
  21. Implication definition
  22. Predicate definition
  23. The reals form a field statement
  24. Real sequence definition
  25. Supremum definition
  26. Ordered pair definition
  27. Union definition
  28. Sample space definition
  29. The rationals form a field statement
  30. Existential quantifier definition
  31. Universal quantifier definition
  32. Integral of a non-negative function definition
  33. Bounded sequence definition
  34. Limit of a sequence definition
  35. Completeness axiom statement
  36. Cartesian product definition
  37. Subset definition
  38. Uniqueness quantifier definition
  39. The rationals form an ordered field statement
  40. Convergent sequence definition
  41. Binary relation definition
  42. Universal set definition
  43. Power set definition
  44. Order on the reals definition
  45. Antisymmetric relation definition
  46. Reflexive relation definition
  47. Transitive relation definition
  48. Complement definition
  49. Function definition
  50. Interval definition
  51. Preorder definition
  52. Sigma-algebra definition
  53. Indicator function definition
  54. Preimage of a set definition
  55. Injective function definition
  56. Partial order definition
  57. Event definition
  58. Countable set definition
  59. Borel sigma-algebra definition
  60. Total order definition
  61. Probability axioms concept
  62. Probability measure definition
  63. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  64. Probability space definition
  65. The reals form an ordered field statement
  66. Conditional probability definition
  67. Absolute value definition
  68. Random variable definition
  69. Proof of the approximation property of the supremum proof
  70. Independence of two events definition
  71. Proof of the triangle inequality for real numbers proof
  72. Proof that the absolute value is multiplicative proof
  73. Discrete random variable definition
  74. Random variable with a density definition
  75. Proof of the epsilon-N definition of the limit of a sequence proof
  76. Approximation property of the supremum statement
  77. Independence of two random variables definition
  78. Triangle inequality statement
  79. Absolute value is multiplicative statement
  80. Expected value definition
  81. Epsilon-N definition of the limit of a sequence statement
  82. Proof that the reals are Archimedean from the completeness axiom proof
  83. Linearity of expectation statement
  84. Proof that convergent sequences are bounded proof
  85. The reals are Archimedean statement
  86. Floor function definition
  87. Convergent sequences are bounded statement
  88. Proof of the limit of a product of sequences proof
  89. Limit of a product of sequences statement
  90. Proof of the expectation of a product of independent random variables by simple functions proof

Where this leads

95 pages build on this one.

Further reading

  1. Web https://proofwiki.org/wiki/Expectation_of_Product_of_Independent_Random_Variables_is_Product_of_Expectations
About this page
TagEWGC40KS75
URIm2://EWGC40KS75
Kindproof
WritingW0 stub
MSC60A05
ProvesExpectation of a product of independent random variables
UsesExpected value, Independence of two random variables, Random variable, Floor function, Interval, Borel sigma-algebra, Simple function, Indicator function, Integral of a non-negative function, Monotone convergence theorem, Limit of a product of sequences, Linearity of expectation
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.