Math 2.0

Probability theory and stochastic processes Proof

Proof of the product formula for the characteristic function of a sum of independent random variables

Builds on Characteristic functionIndependence of random variablesIndependence of two random variablesExpectation of a product of independent random variablesLinearity of expectationEuler's formulaProduct of exponentialsPi-systemDynkin systemDynkin's π-λ theoremContinuity of probability measuresMeasurable function

Proof

We write eitSe^{itS} as a product and argue by induction on the number of factors. We split each complex factor into its real and imaginary parts.

  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 Uj=eitXjU_j = e^{itX_j}. By Euler's formula, Uj=cos⁡(tXj)+isin⁡(tXj)U_j = \cos(tX_j) + i \sin(tX_j), so its real and imaginary parts are bounded by 11.
  3. For a complex variable Z=A+iBZ = A + iB with bounded real variables AA and BB, write E[Z]=E[A]+iE[B]E[Z] = E[A] + i E[B]. By the definition of the characteristic function, φXj(t)=E[Uj]\varphi_{X_j}(t) = E[U_j] and φS(t)=E[eitS]\varphi_S(t) = E[e^{itS}].
  4. By the product of exponentials, eitS=U1U2⋯Une^{itS} = U_1 U_2 \cdots U_n.
  5. 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.
  6. 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.
  7. 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).
  8. 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.
  9. 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.
  10. 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}.
  11. 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).
  12. By steps 9 to 11, 𝒟\mathcal{D} is a Dynkin system that contains 𝒫m\mathcal{P}_m. By Dynkin's π-λ theorem, 𝒢m⊆𝒟\mathcal{G}_m \subseteq \mathcal{D}.
  13. Claim: if YY is a bounded real 𝒢m\mathcal{G}_m-measurable variable and gg is a bounded continuous real function, then E[Yg(Xm)]=E[Y] E[g(Xm)]E[Y g(X_m)] = E[Y] \, E[g(X_m)].
  14. Proof of the claim. Each event {Y∈D}\set{Y \in D} with DD Borel lies in 𝒢m\mathcal{G}_m. Each event {g(Xm)∈D′}\set{g(X_m) \in D'} equals {Xm∈g−1(D′)}\set{X_m \in g^{-1}(D')}, and g−1(D′)g^{-1}(D') is Borel.
  15. By step 12, YY and g(Xm)g(X_m) are independent. Both are bounded, hence integrable. The product rule for independent variables gives the claim.
  16. Let Vm=U1⋯Um−1V_m = U_1 \cdots U_{m-1}, and write Vm=Am+iBmV_m = A_m + i B_m with AmA_m, BmB_m real. Since ∣Uj∣=1\abs{U_j} = 1, we have ∣Vm∣=1\abs{V_m} = 1, so AmA_m and BmB_m are bounded by 11.
  17. Expanding the product, AmA_m and BmB_m are sums of products of the variables cos⁡(tXj)\cos(tX_j) and sin⁡(tXj)\sin(tX_j) with j<mj < m. Fix j<mj < m and a Borel set DD. The set Bj={x∈ℝ:cos⁡(tx)∈D}B_j = \set{x \in \R : \cos(tx) \in D} is Borel, since x↦cos⁡(tx)x \mapsto \cos(tx) is continuous.
  18. So the event {cos⁡(tXj)∈D}={Xj∈Bj}\set{\cos(tX_j) \in D} = \set{X_j \in B_j} lies in 𝒫m\mathcal{P}_m, with all other sets equal to ℝ\R. The same holds for sin⁡\sin, so these variables are 𝒢m\mathcal{G}_m-measurable.
  19. Sums and products of measurable functions are measurable. So AmA_m and BmB_m are 𝒢m\mathcal{G}_m-measurable.
  20. Let c=cos⁡(tXm)c = \cos(tX_m) and s=sin⁡(tXm)s = \sin(tX_m). Then VmUm=(Amc−Bms)+i(Ams+Bmc)V_m U_m = (A_m c - B_m s) + i (A_m s + B_m c).
  21. By linearity of expectation and the claim of step 13, E[VmUm]=(E[Am]E[c]−E[Bm]E[s])+i(E[Am]E[s]+E[Bm]E[c])E[V_m U_m] = (E[A_m] E[c] - E[B_m] E[s]) + i (E[A_m] E[s] + E[B_m] E[c]).
  22. The right side equals (E[Am]+iE[Bm])(E[c]+iE[s])=E[Vm] E[Um](E[A_m] + i E[B_m]) (E[c] + i E[s]) = E[V_m] \, E[U_m].
  23. Since VmUm=Vm+1V_m U_m = V_{m+1}, with Vn+1=U1⋯UnV_{n+1} = U_1 \cdots U_n, step 22 gives E[Vm+1]=E[Vm] E[Um]E[V_{m+1}] = E[V_m] \, E[U_m] for 2≤m≤n2 \le m \le n.
  24. By induction on mm, starting from V2=U1V_2 = U_1, we get E[Vm+1]=E[U1]⋯E[Um]E[V_{m+1}] = E[U_1] \cdots E[U_m] for 1≤m≤n1 \le m \le n.
  25. For m=nm = n, steps 3, 4 and 24 give φS(t)=φX1(t) φX2(t)⋯φXn(t)\varphi_S(t) = \varphi_{X_1}(t) \, \varphi_{X_2}(t) \cdots \varphi_{X_n}(t).

Idea

The exponential turns the sum SS into the product of the factors eitXje^{itX_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 the real and imaginary parts are handled separately.

Reading path

To understand this page from the ground up, read these 184 pages in order. The foundations come first. The path takes the proofs Proof of the limit of a sum of sequences, Proof of the approximation property of the supremum, Proof of the continuity of probability measures, Proof that a complex number times its conjugate is the square of its modulus, Proof of the probability of the complement, Proof of the equality of complex numbers, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof that subsequences of a convergent sequence converge to the same limit, 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 the existence of square roots of nonnegative reals, Proof of Pascal's rule from the recursive definition, Proof that i squared is minus one, Proof of the expectation of a product of independent random variables by simple functions, Proof of the monotonicity of probability, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, Proof that the modulus is multiplicative, Proof of the factorial formula for binomial coefficients by induction, Proof of the product of exponentials by the Cauchy product, Proof that the complex numbers form a field, Proof of the binomial theorem by induction, Proof that the reals are Archimedean from the completeness axiom, Proof that convergent sequences are bounded, Proof of the monotone convergence theorem for sequences, Proof of Euler's formula by power series, 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. Complex numbers object
  4. Complex numbers as pairs of reals concept
  5. Construction of the reals from Cauchy sequences concept
  6. Dynkin system concept
  7. Element definition
  8. Extended real number line object
  9. Factorial definition
  10. Group concept
  11. Imaginary unit object
  12. Integers object
  13. Integral of a non-negative function concept
  14. Mathematical induction concept
  15. Measurable function concept
  16. Measurable space concept
  17. Measure concept
  18. Measure space concept
  19. Ordered field definition
  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. Complex exponential definition
  34. Power series in the complex plane definition
  35. Real and imaginary parts definition
  36. Proof that i squared is minus one proof
  37. Set definition
  38. Ring definition
  39. Ring of integers statement
  40. Monotone convergence theorem statement
  41. Product sigma-algebra definition
  42. Archimedean ordered field definition
  43. Dynkin's π-λ theorem statement
  44. Disjunction definition
  45. Implication definition
  46. Predicate definition
  47. Product measure definition
  48. The reals form a field statement
  49. Real sequence definition
  50. Subsequence definition
  51. Supremum definition
  52. Pascal's rule statement
  53. Complex conjugate definition
  54. Ordered pair definition
  55. i squared is minus one statement
  56. Commutative ring definition
  57. Unit of a ring definition
  58. Union definition
  59. Existential quantifier definition
  60. Sample space definition
  61. Universal quantifier definition
  62. The rationals form a field statement
  63. Bounded sequence definition
  64. Limit of a sequence definition
  65. Monotone sequence definition
  66. Series definition
  67. Integral of a non-negative function definition
  68. Completeness axiom statement
  69. Cartesian product definition
  70. Proof of the factorial formula for binomial coefficients by induction proof
  71. Proof of the equality of complex numbers proof
  72. Field definition
  73. Uniqueness quantifier definition
  74. Subset definition
  75. Convergent sequence definition
  76. Cauchy product definition
  77. Partial sum definition
  78. The rationals form an ordered field statement
  79. Binary relation definition
  80. Equality of complex numbers statement
  81. Factorial formula for binomial coefficients statement
  82. Power set definition
  83. Universal set definition
  84. Order on the reals definition
  85. Convergent series definition
  86. Antisymmetric relation definition
  87. Reflexive relation definition
  88. Transitive relation definition
  89. Proof of the binomial theorem by induction proof
  90. Function definition
  91. Complement definition
  92. Interval definition
  93. Proof that the complex numbers form a field proof
  94. Sum of a series definition
  95. Absolute convergence definition
  96. Binomial theorem statement
  97. Preorder definition
  98. Injective function definition
  99. Indicator function definition
  100. Preimage of a set definition
  101. Sigma-algebra definition
  102. The complex numbers form a field statement
  103. Partial order definition
  104. Countable set definition
  105. Event definition
  106. Dynkin system definition
  107. Borel sigma-algebra definition
  108. Total order definition
  109. Probability axioms concept
  110. Probability measure definition
  111. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  112. Probability distribution definition
  113. Probability space definition
  114. The reals form an ordered field statement
  115. Conditional probability definition
  116. Absolute value definition
  117. Random variable definition
  118. Proof of the approximation property of the supremum proof
  119. Proof of the existence of square roots of nonnegative reals proof
  120. Cumulative distribution function definition
  121. Independence of two events definition
  122. Law of a random variable definition
  123. Discrete random variable definition
  124. Proof of the triangle inequality for real numbers proof
  125. Proof that the absolute value is multiplicative proof
  126. Random variable with a density definition
  127. Proof of the epsilon-N definition of the limit of a sequence proof
  128. Existence of square roots of nonnegative reals statement
  129. Approximation property of the supremum statement
  130. Joint probability distribution definition
  131. Mutual independence of events definition
  132. Independence of two random variables definition
  133. Probability mass function definition
  134. Triangle inequality statement
  135. Absolute value is multiplicative statement
  136. Expected value definition
  137. Probability density function definition
  138. Square root definition
  139. Epsilon-N definition of the limit of a sequence statement
  140. Proof that the reals are Archimedean from the completeness axiom proof
  141. Marginal distribution definition
  142. Independent sigma-algebras definition
  143. Modulus of a complex number definition
  144. Law of the unconscious statistician statement
  145. Proof of the squeeze theorem for sequences proof
  146. Linearity of expectation statement
  147. Proof of the limit of a sum of sequences proof
  148. Proof that convergent sequences are bounded proof
  149. The reals are Archimedean statement
  150. Proof of the monotone convergence theorem for sequences proof
  151. Proof that subsequences of a convergent sequence converge to the same limit proof
  152. Independence of random variables definition
  153. Proof that a complex number times its conjugate is the square of its modulus proof
  154. Proof of the probability of the complement proof
  155. Proof that independence means the joint law is the product of the marginals proof
  156. Squeeze theorem statement
  157. Convergent sequences are bounded statement
  158. Limit of a sum of sequences statement
  159. Floor function definition
  160. Monotone convergence theorem for sequences statement
  161. Subsequences of a convergent sequence converge to the same limit statement
  162. A complex number times its conjugate statement
  163. Independence means the joint law is the product of the marginals statement
  164. Probability of the complement statement
  165. Proof of the limit of a product of sequences proof
  166. Proof that a series of nonnegative terms converges iff its partial sums are bounded proof
  167. Proof of the monotonicity of probability proof
  168. Proof that the modulus is multiplicative proof
  169. A series of nonnegative terms converges iff its partial sums are bounded statement
  170. Limit of a product of sequences statement
  171. Modulus is multiplicative statement
  172. Monotonicity of probability statement
  173. Proof of Euler's formula by power series proof
  174. Proof that the Cauchy product of absolutely convergent series converges absolutely to the product proof
  175. Proof of the expectation of a product of independent random variables by simple functions proof
  176. Proof of the continuity of probability measures proof
  177. Euler's formula statement
  178. Expectation of a product of independent random variables statement
  179. Cauchy product of absolutely convergent series statement
  180. Continuity of probability measures statement
  181. Characteristic function definition
  182. Proof of the product of exponentials by the Cauchy product proof
  183. Product of exponentials statement
  184. Proof of the product formula for the characteristic function of a sum of independent random variables proof

Where this leads

35 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Characteristic_function_(probability_theory), Basic manipulations of distributions
About this page
TagY1TKWM24AH
URIm2://Y1TKWM24AH
Kindproof
WritingW0 stub
MSC60E10
ProvesCharacteristic function of a sum of independent random variables
UsesCharacteristic function, Independence of random variables, Independence of two random variables, Expectation of a product of independent random variables, Linearity of expectation, Euler's formula, Product of exponentials, Pi-system, Dynkin system, Dynkin's π-λ theorem, Continuity of probability measures, Measurable function
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.