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+⋯+XN where N is a stopping time independent of the increments. Wald gives E[SN]=E[N]E[X1] immediately.
Compound Poisson sums.Y=∑i=1NXi where N∼Poisson(λ) and Xi are i.i.d. claim sizes (the collective risk model in insurance). Wald gives E[Y]=λE[X1].
Renewal theory. The expected total reward over Nt renewal epochs is E[Nt]E[X1], the discrete analog of the elementary renewal theorem.
Independence of N from {Xi} is essential. Without it, the simplification in the inner conditional expectation fails: the event {N=k} may give information about X1,…,Xk, and the conditional sum is not just kE[X1]. The classical counterexample is when N is a stopping time that depends on the Xi‘s (e.g. “first k such that Sk>c”); the Wald identity still holds in that case, but the proof is harder and uses optional stopping rather than independence.
E[N]<∞ is needed to make E[N⋅E[X1]]<∞ 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.