Math 2.0

Probability theory and stochastic processes Proof

Proof of the product formula for the moment-generating function of a sum of independent random variables

Builds on Moment-generating functionIndependence of random variablesIndependence of two random variablesExpectation of a product of independent random variablesExpected valueExponential of a sumPi-systemDynkin systemDynkin's π-λ theoremContinuity of probability measuresMeasurable functionMonotone convergence theorem

Proof

We write etSe^{tS} as a product and argue by induction on the number of factors. Truncation and monotone convergence handle infinite values.

  1. Let X1,…,XnX_1, \dots, X_n be independent real random variables on (Ω,ℱ,P)(\Omega, \mathcal{F}, P), and let S=X1+⋯+XnS = X_1 + \dots + X_n. Fix t∈ℝt \in \R.
  2. For each jj, let Wj=etXjW_j = e^{tX_j}, a random variable with values in (0,∞)(0, \infty). By the exponential of a sum, etS=W1W2⋯Wne^{tS} = W_1 W_2 \cdots W_n.
  3. By the definition of the expected value of a nonnegative variable, MXj(t)=E[Wj]∈(0,∞]M_{X_j}(t) = E[W_j] \in (0, \infty] and MS(t)=E[W1⋯Wn]M_S(t) = E[W_1 \cdots W_n].
  4. For 2≤m≤n2 \le m \le n, let 𝒫m\mathcal{P}_m be the family of events ⋂j<m{Xj∈Bj}\bigcap_{j < m} \set{X_j \in B_j} with Borel sets Bj⊆ℝB_j \subseteq \R. Let 𝒢m\mathcal{G}_m be the σ-algebra generated by 𝒫m\mathcal{P}_m.
  5. The intersection of two such events is ⋂j<m{Xj∈Bj∩Bj′}\bigcap_{j < m} \set{X_j \in B_j \cap B_j'}, again in 𝒫m\mathcal{P}_m. So 𝒫m\mathcal{P}_m is a π-system.
  6. Fix a Borel set BB and let C={Xm∈B}C = \set{X_m \in B}. For A=⋂j<m{Xj∈Bj}A = \bigcap_{j < m} \set{X_j \in B_j} in 𝒫m\mathcal{P}_m, the definition of independence with J={1,…,m}J = \set{1, \dots, m} gives P(A∩C)=P(Xm∈B)∏j<mP(Xj∈Bj)P(A \cap C) = P(X_m \in B) \prod_{j < m} P(X_j \in B_j).
  7. The same definition with J={1,…,m−1}J = \set{1, \dots, m - 1} gives ∏j<mP(Xj∈Bj)=P(A)\prod_{j < m} P(X_j \in B_j) = P(A). So P(A∩C)=P(A)P(C)P(A \cap C) = P(A) P(C) for each A∈𝒫mA \in \mathcal{P}_m.
  8. Let 𝒟\mathcal{D} be the family of events AA with P(A∩C)=P(A)P(C)P(A \cap C) = P(A) P(C). It contains Ω\Omega.
  9. If A⊆A′A \subseteq A' are in 𝒟\mathcal{D}, then P((A′∖A)∩C)=P(A′∩C)−P(A∩C)=(P(A′)−P(A))P(C)P((A' \setminus A) \cap C) = P(A' \cap C) - P(A \cap C) = (P(A') - P(A)) P(C). This is P(A′∖A)P(C)P(A' \setminus A) P(C), so A′∖A∈𝒟A' \setminus A \in \mathcal{D}.
  10. If A1⊆A2⊆⋯A_1 \subseteq A_2 \subseteq \cdots are in 𝒟\mathcal{D} with union AA, then Ak∩CA_k \cap C increases to A∩CA \cap C. By continuity of probability, P(A∩C)=lim⁡kP(Ak)P(C)=P(A)P(C)P(A \cap C) = \lim_k P(A_k) P(C) = P(A) P(C).
  11. By steps 8 to 10, 𝒟\mathcal{D} is a Dynkin system that contains 𝒫m\mathcal{P}_m. By Dynkin's π-λ theorem, 𝒢m⊆𝒟\mathcal{G}_m \subseteq \mathcal{D}.
  12. Let Vm=W1⋯Wm−1V_m = W_1 \cdots W_{m-1}. For j<mj < m, the function x↦etxx \mapsto e^{tx} is continuous, so the preimage of a Borel set under it is Borel. Each event {Wj∈D}\set{W_j \in D} with DD Borel has the form {Xj∈Bj}\set{X_j \in B_j} and lies in 𝒢m\mathcal{G}_m.
  13. So each WjW_j with j<mj < m is measurable with respect to 𝒢m\mathcal{G}_m. A product of measurable functions is measurable, so VmV_m is 𝒢m\mathcal{G}_m-measurable.
  14. For an integer N≥1N \ge 1, let Vm,N=min⁡(Vm,N)V_{m,N} = \min(V_m, N) and Wm,N=min⁡(Wm,N)W_{m,N} = \min(W_m, N). Each event {Vm,N∈D}\set{V_{m,N} \in D} with DD Borel lies in 𝒢m\mathcal{G}_m.
  15. Each event {Wm,N∈D′}\set{W_{m,N} \in D'} with D′D' Borel has the form {Xm∈B}\set{X_m \in B} for a Borel set BB. By step 11, Vm,NV_{m,N} and Wm,NW_{m,N} are independent.
  16. Both are bounded, so they are integrable. By the product rule for independent variables, E[Vm,NWm,N]=E[Vm,N] E[Wm,N]E[V_{m,N} W_{m,N}] = E[V_{m,N}] \, E[W_{m,N}].
  17. As N→∞N \to \infty, Vm,NV_{m,N} increases to VmV_m, Wm,NW_{m,N} increases to WmW_m, and Vm,NWm,NV_{m,N} W_{m,N} increases to VmWmV_m W_m. All are nonnegative.
  18. By the monotone convergence theorem, the three expectations in step 16 converge in [0,∞][0, \infty] to E[VmWm]E[V_m W_m], E[Vm]E[V_m] and E[Wm]E[W_m].
  19. The sequences E[Vm,N]E[V_{m,N}] and E[Wm,N]E[W_{m,N}] are nondecreasing and positive. So their product tends to E[Vm] E[Wm]E[V_m] \, E[W_m] in (0,∞](0, \infty]. Hence E[VmWm]=E[Vm] E[Wm]E[V_m W_m] = E[V_m] \, E[W_m].
  20. Since VmWm=Vm+1V_m W_m = V_{m+1} with Vn+1=W1⋯WnV_{n+1} = W_1 \cdots W_n, step 19 gives E[Vm+1]=E[Vm] E[Wm]E[V_{m+1}] = E[V_m] \, E[W_m] for 2≤m≤n2 \le m \le n.
  21. By induction on mm, starting from V2=W1V_2 = W_1, we get E[Vm+1]=E[W1]⋯E[Wm]E[V_{m+1}] = E[W_1] \cdots E[W_m] for 1≤m≤n1 \le m \le n.
  22. For m=nm = n, steps 2, 3 and 21 give MS(t)=MX1(t) MX2(t)⋯MXn(t)M_S(t) = M_{X_1}(t) \, M_{X_2}(t) \cdots M_{X_n}(t) in (0,∞](0, \infty].

Idea

The exponential turns the sum SS into the product of the factors etXje^{tX_j}. Independence lets the expectation of a product split into the product of the expectations. The π-λ theorem makes the first m−1m - 1 factors, taken together, independent of the next one, and truncation reduces infinite values to bounded variables.

Reading path

To understand this page from the ground up, read these 231 pages in order. The foundations come first. The path takes the proofs Proof of the Weierstrass M-test, Proof of the limit of a sum of sequences, Proof of the approximation property of the supremum, Proof that every sequence has a monotone subsequence, by peaks, Proof of the commutativity of addition by induction, Proof of the continuity of probability measures, Proof that absolutely convergent series converge, Proof of the sum of a finite geometric series, Proof that convergent sequences are Cauchy, Proof of the probability of the complement, Proof of the Cauchy criterion for series, Proof of the Cauchy criterion for sequences by the Bolzano–Weierstrass theorem, Proof that the exponential series has infinite radius of convergence, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the double negation law by a truth table, Proof that power series converge uniformly on smaller intervals inside the radius of convergence, Proof of strong induction from ordinary induction, Proof of the limit of a product of sequences, Proof that the absolute value is multiplicative, Proof of the squeeze theorem for sequences, Proof of Pascal's rule from the recursive definition, Proof of the expectation of a product of independent random variables by simple functions, Proof of the monotonicity of probability, Proof that Cauchy sequences are bounded, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, Proof of the comparison test, Proof that limits preserve non-strict inequalities, Proof of the factorial formula for binomial coefficients by induction, Proof of the binomial theorem by induction, Proof of the well-ordering principle from strong induction, Proof of the Bolzano–Weierstrass theorem by a monotone subsequence, Proof of the Archimedean property in an Archimedean ordered field, Proof of the exponential of a sum by the Cauchy product, Proof that a decreasing sequence bounded below converges, Proof that the reals are Archimedean from the completeness axiom, Proof of the ratio test, Proof that convergent sequences are bounded, Proof of the monotone convergence theorem for sequences, Proof of the ratio formula for the radius of convergence, Proof that a series of nonnegative terms converges iff its partial sums are bounded, Proof that the Cauchy product of absolutely convergent series converges absolutely to the product, Proof that independence means the joint law is the product of the marginals.

  1. Binomial coefficient definition
  2. Cartesian product concept
  3. Construction of the reals from Cauchy sequences concept
  4. Definition by recursion concept
  5. Dynkin system concept
  6. Element definition
  7. Extended real number line object
  8. Factorial definition
  9. Group concept
  10. Integers object
  11. Integral of a non-negative function concept
  12. Mathematical induction concept
  13. Measurable function concept
  14. Measurable space concept
  15. Measure concept
  16. Measure space concept
  17. Natural numbers object
  18. Ordered field definition
  19. Peano axioms concept
  20. Pi-system concept
  21. Probability measure concept
  22. Product sigma-algebra concept
  23. Proposition concept
  24. Random experiment concept
  25. Rational numbers object
  26. Real numbers object
  27. Sequence definition
  28. Set bounded above definition
  29. Sigma-algebra concept
  30. Sigma-finite measure concept
  31. Simple function concept
  32. Proof of Pascal's rule from the recursive definition proof
  33. Set definition
  34. Ring definition
  35. Ring of integers statement
  36. Monotone convergence theorem statement
  37. Product sigma-algebra definition
  38. Archimedean ordered field definition
  39. Successor function definition
  40. Dynkin's π-λ theorem statement
  41. Product measure definition
  42. Conjunction definition
  43. Disjunction definition
  44. Implication definition
  45. Negation definition
  46. Predicate definition
  47. The reals form a field statement
  48. Real sequence definition
  49. Subsequence definition
  50. Infimum definition
  51. Supremum definition
  52. Pascal's rule statement
  53. Ordered pair definition
  54. Commutative ring definition
  55. Union definition
  56. Addition of natural numbers definition
  57. Biconditional definition
  58. Proof of the Archimedean property in an Archimedean ordered field proof
  59. Truth table concept
  60. Modus ponens concept
  61. Sample space definition
  62. The successor function is injective statement
  63. Zero is not a successor statement
  64. The rationals form a field statement
  65. Existential quantifier definition
  66. Universal quantifier definition
  67. Bounded sequence definition
  68. Cauchy sequence definition
  69. Geometric sequence definition
  70. Limit of a sequence definition
  71. Monotone sequence definition
  72. Series definition
  73. Integral of a non-negative function definition
  74. Completeness axiom statement
  75. Cartesian product definition
  76. Proof of the factorial formula for binomial coefficients by induction proof
  77. Archimedean property statement
  78. Proof of the commutativity of addition by induction proof
  79. Mathematical proof concept
  80. Subset definition
  81. Order on the natural numbers definition
  82. Propositional logic concept
  83. Uniqueness quantifier definition
  84. The rationals form an ordered field statement
  85. Proof of the sum of a finite geometric series proof
  86. Convergent sequence definition
  87. Pointwise convergence definition
  88. Cauchy product definition
  89. Partial sum definition
  90. Power series definition
  91. Binary relation definition
  92. Factorial formula for binomial coefficients statement
  93. Universal set definition
  94. Power set definition
  95. Order on the reals definition
  96. Commutativity of addition statement
  97. Tautology definition
  98. Proof of strong induction from ordinary induction proof
  99. Uniform convergence definition
  100. Sum of a finite geometric series statement
  101. Convergent series definition
  102. Radius of convergence definition
  103. Antisymmetric relation definition
  104. Reflexive relation definition
  105. Transitive relation definition
  106. Proof of the binomial theorem by induction proof
  107. Complement definition
  108. Function definition
  109. Interval definition
  110. Logical equivalence definition
  111. Strong induction statement
  112. Uniform convergence on a set definition
  113. Sum of a series definition
  114. Series of functions definition
  115. Absolute convergence definition
  116. Binomial theorem statement
  117. Preorder definition
  118. Sigma-algebra definition
  119. Indicator function definition
  120. Injective function definition
  121. Preimage of a set definition
  122. Proof of the well-ordering principle from strong induction proof
  123. Proof of the double negation law by a truth table proof
  124. Partial order definition
  125. Countable set definition
  126. Event definition
  127. Dynkin system definition
  128. Well-ordering principle statement
  129. Double negation law statement
  130. Borel sigma-algebra definition
  131. Total order definition
  132. Probability axioms concept
  133. Proof by contradiction concept
  134. Proof that every sequence has a monotone subsequence, by peaks proof
  135. Probability measure definition
  136. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  137. Every sequence has a monotone subsequence statement
  138. Probability distribution definition
  139. Probability space definition
  140. The reals form an ordered field statement
  141. Conditional probability definition
  142. Absolute value definition
  143. Random variable definition
  144. Proof of the approximation property of the supremum proof
  145. Cumulative distribution function definition
  146. Independence of two events definition
  147. Law of a random variable definition
  148. Discrete random variable definition
  149. Proof of the triangle inequality for real numbers proof
  150. Proof that the absolute value is multiplicative proof
  151. Random variable with a density definition
  152. Proof of the epsilon-N definition of the limit of a sequence proof
  153. Approximation property of the supremum statement
  154. Joint probability distribution definition
  155. Mutual independence of events definition
  156. Independence of two random variables definition
  157. Probability mass function definition
  158. Triangle inequality statement
  159. Absolute value is multiplicative statement
  160. Expected value definition
  161. Probability density function definition
  162. Epsilon-N definition of the limit of a sequence statement
  163. Proof that the reals are Archimedean from the completeness axiom proof
  164. Marginal distribution definition
  165. Independent sigma-algebras definition
  166. Proof that limits preserve non-strict inequalities proof
  167. Law of the unconscious statistician statement
  168. Proof of the squeeze theorem for sequences proof
  169. Linearity of expectation statement
  170. Proof of the limit of a sum of sequences proof
  171. Proof that convergent sequences are bounded proof
  172. Proof that convergent sequences are Cauchy proof
  173. The reals are Archimedean statement
  174. Proof that Cauchy sequences are bounded proof
  175. Proof of the monotone convergence theorem for sequences proof
  176. Independence of random variables definition
  177. Proof of the probability of the complement proof
  178. Moment definition
  179. Proof that independence means the joint law is the product of the marginals proof
  180. Floor function definition
  181. Limits preserve non-strict inequalities statement
  182. Convergent sequences are bounded statement
  183. Proof of the ratio formula for the radius of convergence proof
  184. Limit of a sum of sequences statement
  185. Squeeze theorem statement
  186. Convergent sequences are Cauchy statement
  187. Cauchy sequences are bounded statement
  188. Monotone convergence theorem for sequences statement
  189. Independence means the joint law is the product of the marginals statement
  190. Probability of the complement statement
  191. Moment-generating function definition
  192. Proof of the limit of a product of sequences proof
  193. Proof that a series of nonnegative terms converges iff its partial sums are bounded proof
  194. The sequence r^n tends to zero for |r| < 1 example
  195. Proof that a decreasing sequence bounded below converges proof
  196. Proof of the monotonicity of probability proof
  197. Decreasing sequence bounded below converges statement
  198. Limit of a product of sequences statement
  199. A series of nonnegative terms converges iff its partial sums are bounded statement
  200. Geometric series example
  201. Monotonicity of probability statement
  202. Proof of the expectation of a product of independent random variables by simple functions proof
  203. Proof that the Cauchy product of absolutely convergent series converges absolutely to the product proof
  204. Proof of the comparison test proof
  205. Proof of the ratio test proof
  206. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  207. Proof of the continuity of probability measures proof
  208. Expectation of a product of independent random variables statement
  209. Comparison test statement
  210. Cauchy product of absolutely convergent series statement
  211. Bolzano–Weierstrass theorem statement
  212. Continuity of probability measures statement
  213. Ratio test statement
  214. Proof of the Cauchy criterion for sequences by the Bolzano–Weierstrass theorem proof
  215. Ratio formula for the radius of convergence statement
  216. Cauchy criterion for sequences statement
  217. Uniformly Cauchy sequence of functions definition
  218. Proof of the Cauchy criterion for series proof
  219. Cauchy criterion for series statement
  220. Proof that absolutely convergent series converge proof
  221. Absolutely convergent series converge statement
  222. Proof of the Weierstrass M-test proof
  223. Weierstrass M-test statement
  224. Proof that power series converge uniformly on smaller intervals inside the radius of convergence proof
  225. Power series converge uniformly on smaller discs inside the radius of convergence statement
  226. Proof that the exponential series has infinite radius of convergence proof
  227. The exponential series has infinite radius of convergence statement
  228. Exponential function definition
  229. Proof of the exponential of a sum by the Cauchy product proof
  230. Exponential of a sum statement
  231. Proof of the product formula for the moment-generating function of a sum of independent random variables proof

Where this leads

6 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Moment-generating_function, Linear combination of independent random variables
About this page
TagARBPKABJP2
URIm2://ARBPKABJP2
Kindproof
WritingW0 stub
MSC60E10
ProvesMoment-generating function of a sum of independent random variables
UsesMoment-generating function, Independence of random variables, Independence of two random variables, Expectation of a product of independent random variables, Expected value, Exponential of a sum, Pi-system, Dynkin system, Dynkin's π-λ theorem, Continuity of probability measures, Measurable function, Monotone convergence theorem
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)

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.