Note that there is no conditionning by N here, hence this is not really a generalization of

.

A stopping time is what the name says: it is a time when you can decide to stop. In other words, suppose you discover the values X0,X1,... one after each other; then in order to stop at time n (i.e. to decide whether N=n), you can only look at the values X0,...Xn, not at the "future".

For instance,

is a stopping time: you can stop at time

by waiting until a value exceeds 5.

On the other hand,

is not a stopping time because you have to look at X0,...,X10 before you know where you should have stopped.

If you think about it, you'll see that the condition of "being able to stop at time N" is equivalent to "for all n, the event

can be expressed in terms of X0,...,Xn".

The usual formal definition of a stopping time uses sigma-algebras (filtrations): for all

,

where

is the

-algebra generated by

.