For an ff and a probability-preserving transformation TT, its time average over N≥1N\geq1 steps is

ANf(x)=1N∑n=0N−1f(Tnx).A_Nf(x)=\frac1N\sum_{n=0}^{N-1}f(T^nx).

Compare this orbit sample with the under μ\mu.

Visits to events

For f=1Ef=1_E, the time average is the fraction of the first NN iterates lying in EE. The identifies its almost-everywhere limit. In a nonergodic system, that limit can depend on the starting point.