Skip to content

Wald's Identity

Wald’s identity is the quintessential application of the tower property. It computes the mean of a random sum where both the summand and the number of summands are random, by conditioning first on the count.

Wald’s identity is the workhorse for computing means in settings where the number of summands is determined by the same source of randomness as the values being summed:

  • Random walks with random stopping. SN=X1++XNS_N = X_1 + \cdots + X_N where NN is a stopping time independent of the increments. Wald gives E[SN]=E[N]E[X1]\E[S_N] = \E[N] \, \E[X_1] immediately.
  • Compound Poisson sums. Y=i=1NXiY = \sum_{i=1}^N X_i where NPoisson(λ)N \sim \text{Poisson}(\lambda) and XiX_i are i.i.d. claim sizes (the collective risk model in insurance). Wald gives E[Y]=λE[X1]\E[Y] = \lambda \, \E[X_1].
  • Renewal theory. The expected total reward over NtN_t renewal epochs is E[Nt]E[X1]\E[N_t] \, \E[X_1], the discrete analog of the elementary renewal theorem.
  • Independence of NN from {Xi}\{X_i\} is essential. Without it, the simplification in the inner conditional expectation fails: the event {N=k}\{N = k\} may give information about X1,,XkX_1, \ldots, X_k, and the conditional sum is not just kE[X1]k \, \E[X_1]. The classical counterexample is when NN is a stopping time that depends on the XiX_i‘s (e.g. “first kk such that Sk>cS_k > c”); the Wald identity still holds in that case, but the proof is harder and uses optional stopping rather than independence.
  • E[N]<\E[N] < \infty is needed to make E[NE[X1]]<\E[N \cdot \E[X_1]] < \infty and to justify the application of the tower property at finite expected value.

The next example, decomposing variance, gives a second-moment analog: the law of total variance.