Elementary renewal theorem Created 2026-10-03 Updated 2026-11-05
For strictly positive independent and identically distributed interarrival times with finite mean , the elementary renewal theorem states
This is a limit of expected counts. The renewal counting law of large numbers gives the almost-sure version, but almost-sure convergence alone does not justify moving the limit through an expectation.
An elementary proof uses Wald's equation. The first index for which the renewal sum exceeds is a stopping time; itself generally is not. The exponential moment of a renewal count ensures that its expectation is finite. Since , Wald's equation gives , proving the lower asymptotic bound.
For the upper bound, truncate each interarrival to , with mean . The truncated process has at least as many renewals, , and its first sum exceeding is at most . Hence
For fixed , this gives . Finally by monotone convergence. The two bounds prove the theorem without an unjustified interchange of expectation and limit.