Optional Stopping Theorem(OST)


Pasted image 20250307012709.png

OST for bounded stopping times


test

Theorem

Suppose and , then

Proof. Define , then

is also a submartingale, and thus . This implies

To prove the second inequality, we define

is predictable and

This implies

Theorem

Suppose and , then

Proof. It's enough to show . We can define a predictable process by

In addition, we have

Then implies

OST

Suppose are bounded stopping times, then we have

or equivalently, we have

Proof. We can define a bounded stopping time by

since .

Since is a bounded stopping time, we have

This implise

OST


Suppose is a submartingale such that , Then for any stopping times, is well defined.

Next, we suppose is u.i.

Theorem

For any stopping time

Proof. is still a submartingle with

Now the MCT(a.s) implies . For a fixed and we have

Since is u.i, we have . Let , we have

On the other hand, we have

This implise

Let , and using the fact that is u.i, we have

Then let , we have thus

Theorem

For all stopping times , we have

Proof. Since are bounded stopping times, we have

Since is u.i., pass to , we have

and

OST for all stopping times

Suppose are stopping times, then we have

or equivalently, we have

Proof. For fixed , we have

In addition, we have

Since

Now pass to , we have