Math 2.0

Probability theory and stochastic processes Proof

Proof of the law of total variance

Builds on Conditional expectationConditional varianceVarianceLaw of total expectationCauchy–Schwarz inequality for expectationsMonotone convergence theoremDominated convergence theoremLinearity of expectation

Proof

We split X−E[X]X - E[X] into a part inside the groups and a part between the groups. Then we show that the cross term has mean 00.

  1. Let 𝒢=σ(Y)\mathcal{G} = \sigma(Y), let M=E[X∣Y]=E[X∣𝒢]M = E[X \mid Y] = E[X \mid \mathcal{G}] be the conditional expectation, and let μ=E[X]\mu = E[X]. Since E[X2]<∞E[X^2] < \infty, XX is integrable, so MM exists.
  2. Claim: E[MW]=E[XW]E[M W] = E[X W] for each bounded 𝒢\mathcal{G}-measurable random variable WW. For W=1GW = 1_G with G∈𝒢G \in \mathcal{G}, this is the defining property of MM.
  3. By linearity of expectation, the claim holds for each simple 𝒢\mathcal{G}-measurable WW. Such a WW is a finite linear combination of indicators of sets in 𝒢\mathcal{G}.
  4. Let WW be 𝒢\mathcal{G}-measurable with ∣W∣≤c\abs{W} \le c for a constant cc. Let Wj=2−j⌊2jW⌋W_j = 2^{-j} \floor{2^j W} for j≥1j \ge 1. Each WjW_j is 𝒢\mathcal{G}-measurable and takes finitely many values, so it is simple.
  5. We have ∣Wj−W∣≤2−j\abs{W_j - W} \le 2^{-j} and ∣Wj∣≤c+1\abs{W_j} \le c + 1. So MWj→MWM W_j \to M W and XWj→XWX W_j \to X W pointwise, with bounds (c+1)∣M∣(c + 1) \abs{M} and (c+1)∣X∣(c + 1) \abs{X}, which are integrable.
  6. By dominated convergence, E[MWj]→E[MW]E[M W_j] \to E[M W] and E[XWj]→E[XW]E[X W_j] \to E[X W]. With step 3, this proves the claim of step 2.
  7. Claim: E[M2]≤E[X2]E[M^2] \le E[X^2]. For k≥1k \ge 1, let Wk=M 1{∣M∣≤k}W_k = M \, 1_{\{\abs{M} \le k\}}. It is 𝒢\mathcal{G}-measurable and bounded by kk.
  8. Step 2 gives E[MWk]=E[XWk]E[M W_k] = E[X W_k]. The left side is E[M21{∣M∣≤k}]=E[Wk2]E[M^2 1_{\{\abs{M} \le k\}}] = E[W_k^2].
  9. By the Cauchy–Schwarz inequality, E[XWk]≤(E[X2])1/2(E[Wk2])1/2E[X W_k] \le \left(E[X^2]\right)^{1/2} \left(E[W_k^2]\right)^{1/2}.
  10. Steps 8 and 9 give E[Wk2]≤(E[X2])1/2(E[Wk2])1/2E[W_k^2] \le \left(E[X^2]\right)^{1/2} \left(E[W_k^2]\right)^{1/2}. Since E[Wk2]≤k2E[W_k^2] \le k^2 is finite, this gives E[Wk2]≤E[X2]E[W_k^2] \le E[X^2].
  11. The functions Wk2W_k^2 increase in kk to M2M^2. By the monotone convergence theorem, E[M2]=lim⁡kE[Wk2]≤E[X2]E[M^2] = \lim_k E[W_k^2] \le E[X^2].
  12. So X−MX - M and M−μM - \mu have finite second moments. Then (X−M)2(X - M)^2 is integrable, and the conditional variance Var⁡(X∣Y)=E[(X−M)2∣𝒢]\operatorname{Var}(X \mid Y) = E[(X - M)^2 \mid \mathcal{G}] is defined.
  13. Claim: E[(X−M)(M−μ)]=0E[(X - M)(M - \mu)] = 0. Let V=M−μV = M - \mu, which is 𝒢\mathcal{G}-measurable, and let Vk=V 1{∣V∣≤k}V_k = V \, 1_{\{\abs{V} \le k\}} for k≥1k \ge 1.
  14. Each VkV_k is bounded and 𝒢\mathcal{G}-measurable. By step 2, E[(X−M)Vk]=E[XVk]−E[MVk]=0E[(X - M) V_k] = E[X V_k] - E[M V_k] = 0.
  15. The product (X−M)Vk(X - M) V_k tends to (X−M)V(X - M) V pointwise. It is bounded by ∣X−M∣∣V∣\abs{X - M} \abs{V}, which is integrable by the Cauchy–Schwarz inequality and step 12.
  16. By dominated convergence and step 14, E[(X−M)V]=lim⁡kE[(X−M)Vk]=0E[(X - M) V] = \lim_k E[(X - M) V_k] = 0.
  17. Write X−μ=(X−M)+VX - \mu = (X - M) + V. Expand the square and use linearity: E[(X−μ)2]=E[(X−M)2]+2E[(X−M)V]+E[V2]E[(X - \mu)^2] = E[(X - M)^2] + 2 E[(X - M) V] + E[V^2].
  18. By the definition of the variance, the left side is Var⁡(X)\operatorname{Var}(X). By step 16, the middle term is 00.
  19. By the law of total expectation for the integrable variable (X−M)2(X - M)^2, E[(X−M)2]=E[E[(X−M)2∣𝒢]]=E[Var⁡(X∣Y)]E[(X - M)^2] = E\left[E[(X - M)^2 \mid \mathcal{G}]\right] = E[\operatorname{Var}(X \mid Y)].
  20. By the law of total expectation, E[M]=E[X]=μE[M] = E[X] = \mu. So E[V2]=E[(M−E[M])2]=Var⁡(E[X∣Y])E[V^2] = E[(M - E[M])^2] = \operatorname{Var}(E[X \mid Y]).
  21. Steps 17 to 20 give Var⁡(X)=E[Var⁡(X∣Y)]+Var⁡(E[X∣Y])\operatorname{Var}(X) = E[\operatorname{Var}(X \mid Y)] + \operatorname{Var}(E[X \mid Y]).

Idea

Write X−E[X]X - E[X] as the deviation of XX from its group mean E[X∣Y]E[X \mid Y], plus the deviation of the group mean from E[X]E[X]. The first part is orthogonal to every function of YY, so the cross term vanishes and the two squares add up. Most of the work checks that every term is finite.

Reading path

To understand this page from the ground up, read these 100 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof of the probability of the complement, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the monotonicity of probability, Proof of the law of total probability, Proof of the law of total expectation, Proof that the reals are Archimedean from the completeness axiom, Proof of Markov's inequality, Proof of the Cauchy–Schwarz inequality for expectations.

  1. Almost everywhere concept
  2. Construction of the reals from Cauchy sequences concept
  3. Element definition
  4. Integers object
  5. Integrable function concept
  6. Integral of a non-negative function concept
  7. Lebesgue integral concept
  8. Measurable function concept
  9. Ordered field definition
  10. Proposition concept
  11. Random experiment concept
  12. Rational numbers object
  13. Real numbers object
  14. Sequence definition
  15. Set bounded above definition
  16. Set definition
  17. Ring of integers statement
  18. Monotone convergence theorem statement
  19. Archimedean ordered field definition
  20. Conjunction definition
  21. Disjunction definition
  22. Implication definition
  23. Predicate definition
  24. The reals form a field statement
  25. Real sequence definition
  26. Supremum definition
  27. Empty set object
  28. Family of sets definition
  29. Ordered pair definition
  30. Intersection definition
  31. Union definition
  32. Sample space definition
  33. The rationals form a field statement
  34. Existential quantifier definition
  35. Universal quantifier definition
  36. Bounded sequence definition
  37. Completeness axiom statement
  38. Disjoint sets definition
  39. Cartesian product definition
  40. Subset definition
  41. Union of a family of sets definition
  42. The rationals form an ordered field statement
  43. Uniqueness quantifier definition
  44. Limit inferior definition
  45. Universal set definition
  46. Binary relation definition
  47. Partition of a set definition
  48. Power set definition
  49. Order on the reals definition
  50. Fatou's lemma statement
  51. Antisymmetric relation definition
  52. Reflexive relation definition
  53. Transitive relation definition
  54. Complement definition
  55. Function definition
  56. Dominated convergence theorem statement
  57. Interval definition
  58. Preorder definition
  59. Sigma-algebra definition
  60. Indicator function definition
  61. Preimage of a set definition
  62. Injective function definition
  63. Partial order definition
  64. Event definition
  65. Countable set definition
  66. Borel sigma-algebra definition
  67. Total order definition
  68. Probability axioms concept
  69. Probability measure definition
  70. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  71. Probability space definition
  72. The reals form an ordered field statement
  73. Almost surely definition
  74. Conditional probability definition
  75. Random variable definition
  76. Proof of the approximation property of the supremum proof
  77. Discrete random variable definition
  78. Random variable with a density definition
  79. Approximation property of the supremum statement
  80. Expected value definition
  81. Proof that the reals are Archimedean from the completeness axiom proof
  82. Linearity of expectation statement
  83. Conditional expectation definition
  84. Variance definition
  85. The reals are Archimedean statement
  86. Proof of Markov's inequality proof
  87. Proof of the law of total expectation proof
  88. Covariance definition
  89. Proof of the probability of the complement proof
  90. Conditional variance definition
  91. Probability of the complement statement
  92. Proof of the law of total probability proof
  93. Proof of the monotonicity of probability proof
  94. Law of total probability statement
  95. Monotonicity of probability statement
  96. Markov's inequality statement
  97. Law of total expectation statement
  98. Proof of the Cauchy–Schwarz inequality for expectations proof
  99. Cauchy–Schwarz inequality for expectations statement
  100. Proof of the law of total variance proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Law_of_total_variance, Proof
About this page
Tag5DRPDDWY6R
URIm2://5DRPDDWY6R
Kindproof
WritingW0 stub
MSC60A10
ProvesLaw of total variance
UsesConditional expectation, Conditional variance, Variance, Law of total expectation, Cauchy–Schwarz inequality for expectations, Monotone convergence theorem, Dominated convergence theorem, 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)

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.