Relative to a filtration , a supermartingale is an adapted process with for every and
By the tower property this also gives for every .
For a stopping time , is adapted: split according to for and , all events belonging to . It is integrable because . Moreover,
The indicator is -measurable, so conditioning and the supermartingale property give
Thus . This proves stopping preserves supermartingales in discrete time without assuming itself bounded or integrable.
Use the tree's natural filtration. The stopping times take values in the process horizon . Construct a dominating supermartingale by backward comparison, the finite-horizon Snell envelope. At time two put . At time one the continuation values are
Compare these with immediate rewards and to obtain on the upper branch and on the lower branch. Finally set
These definitions explicitly give , , and . Thus is a supermartingale. By part (ii), its stopped process is a supermartingale, so for every allowed ,
The reward process itself need not be a supermartingale; the constructed majorant is what proves the bound.
Continue at time zero. At time one stop on the lower branch and continue on the upper branch:
This is a stopping time since the branch decision is measurable at time one. Its expected reward is
It therefore attains the upper bound in part (iii).

Articles by others on the same topic (0)

There are currently no matching articles.