The optional sigma-algebra, , was defined earlier in these notes as the sigma-algebra generated by the adapted and right-continuous processes. Then, a stochastic process is optional if it is -measurable. However, beyond the definition, very little use was made of this concept. While right-continuous adapted processes are optional by construction, and were used throughout the development of stochastic calculus, there was no need to make use of the general definition. On the other hand, optional processes are central to the theory of optional section and projection. So, I will now look at such processes in more detail, starting with the following alternative, but equivalent, ways of defining the optional sigma-algebra. Throughout this post we work with respect to a complete filtered probability space , and all stochastic processes will be assumed to be either real-valued or to take values in the extended reals .

Theorem 1The following collections of sets and processes each generate the same sigma-algebra on .

{:is a stopping time}.as ranges over the stopping times andZover the -measurable random variables.The cadlag adapted processes.The right-continuous adapted processes.

The optional-sigma algebra was previously defined to be generated by the right-continuous adapted processes. However, any of the four collections of sets and processes stated in Theorem 1 can equivalently be used, and the definitions given in the literature do vary. So, I will restate the definition making use of this equivalence.

Definition 2The optional sigma-algebra, , is the sigma-algebra on generated by any of the collections of sets/processes in Theorem 1.

A stochastic process is optional iff it is -measurable.

Before giving the proof of Theorem 1 below, I will first show that certain basic constructions automatically lead to optional processes. We know that optional processes are always progressively measurable. In the previous post, it was shown that the running maximum of a progressive process is itself progressive. In fact, it is optional.

Lemma 3IfXis a progressively measurable process then is optional.

*Proof:* First, as in the proof of Lemma 5 in the previous post, is left-continuous and adapted. In particular, it is predictable and hence is optional. As the intervals for real *K* generate the Borel sigma-algebra on , it is enough to show that is optional.

As is optional, we know that . Next, suppose that is in *B* for some and . Then,

for and

for . In either case, . So, we see that there can be at most a single time lying in *B* for each and, hence, *B* is the graph of a map . As and are progressive, *B* is also progressive. By Lemma 7 from the previous post, this means that is a stopping time. In particular, using the first statement of Theorem 1,

(1) |

So, as required. ⬜

It was also shown that the limit supremum and left/right limit supremums of progressive processes are again progressive. Actually, the stronger property of optionality holds for most of these.

Lemma 4IfXis a progressively measurable process thenare optional. If, furthermore, the filtration is right-continuous then,

is optional.

*Proof:* For each positive integer *n*, choose a sequence of times increasing to infinity, and such that goes to zero as *n* goes to infinity. For example, . Define processes by and

for . This is left-continuous and, by Lemma 4 of the previous post, is adapted. So, and, hence, the limit

Next, define and

for . Applying Lemma 3 over each of the intervals shows that this optional. So, the limit

is also optional.

Finally, define and

for . By Lemma 4 of the previous post, is -measurable for each . So, is -measurable and, if the filtration is right-continuous, *W* is adapted. As is right-continuous over each of the intervals , this implies that it is optional. So,

is optional. ⬜

Notable by their absence in the statement of Lemma 4 are the right-limits and . In fact, these need not be optional even when the filtration is right-continuous and *X* is itself optional.

Next, we saw in the previous post that stopping times can be characterised by the progressive measurability of their graphs. Optional measurability can equivalently be used. The term `optional time’ is sometimes used as a synonym for stopping time.

Lemma 5A map is a stopping time if and only if its graph is optional.

*Proof:* If is a stopping time then (1) shows that . Conversely, if is optional then, in particular, it is progressive. So, Lemma 7 of the previous post shows that is a stopping time. ⬜

#### Proof of Theorem 1

Let , , be the sigma-algebra generated by each of the respective collections of sets/processes of the Theorem 1. The inclusions are immediate. The first inclusion follows by taking in the second statement. The second inclusion holds because the processes in statement 2 are cadlag and adapted, and the third inclusion holds since cadlag processes are, by definition, right-continuous. It only remains to show that . I will break this down into the inclusions and .

*Proof of :* We need to show that is -measurable for stopping times and -measurable *Z*. By the monotone class theorem, it is enough to consider for . Then,

where equals when and otherwise. As this is a stopping time, is -measurable. ⬜

To complete the proof of Theorem 1, it only remains to show that right-continuous adapted processes are -measurable. Although it is not strictly necessary, I will first prove the result for *cadlag* adapted processes. There are a few reasons for doing this. Firstly, the proof is more straightforward and, in any case, we are often interested in processes which are known to be cadlag rather than merely right-continuous. Secondly, we have not made use of completeness of the filtration yet, and completeness is not actually required for the equivalence of the first three sigma-algebras of the theorem. It is required, though, for the proof that right-continuous adapted processes are -measurable. For this reason, in some situations, it may be more appropriate to use either of the first three definitions of the optional sigma-algebra given by Theorem 1 rather than defining it as generated by the right-continuous adapted processes.

*Proof of :* We show that any cadlag adapted process *X* is -measurable. Fixing , it is enough to construct an -measurable process *Y* such that . By letting tend to zero, this will show that *X* is -measurable.

Define an increasing sequence of random times by and, for each ,

(2) |

Then, define the process *Y* as,

By the debut theorem for right-continuous processes, are stopping times. Then, as is -measurable, writing

expresses *Y* as a sum of processes in the form of the second statement of the theorem. So, *Y* is -measurable.

Next, the times increase to a limit and, by construction, on the interval . So, the result follows so long as . On the event , the condition that *X* has left limits implies that converges to a limit as *n* goes to infinity. This contradicts the inequality and, hence, as required. ⬜

The proof above only made use of completeness of the filtration at one point, when the debut theorem was invoked to show that are stopping times. However, this was just for convenience and, if we replace (2) by

then it can be seen directly that if and only if

for any countable containing *t*. As this is -measurable, this alternative definition also gives a sequence of stopping times, and the proof does not require completeness of the filtered probability space.

I now complete the proof of Theorem 1 by showing that right-continuous adapted processes are -measurable.

*Proof of :* We show that any right-continuous adapted process *X* is -measurable. As above, it is enough to find an -measurable process *Y* satisfying , for any given .

Define to be the set of all stopping times such that there exists an -measurable process *Y* with . For any , there are -measurable *Y* and *Z* satisfying

Then

is -measurable and satisfies

Hence, the maximum is again in . Similarly, for an increasing sequence in , there is a sequence of -measurable processes satisfying

Then, with ,

is an -measurable process with

and the limit of as *n* goes to infinity is again in .

This all shows that the supremum of any countable subset of is in and, in particular, its essential supremum, say , is again in . That is, there is an -measurable process *Y* with

(3) |

Now, defining the stopping time

which, by right-continuity, is strictly greater than whenever is finite. Then

is -measurable and satisfies

This shows that is in . By the definition of the essential supremum, almost surely and, hence, is almost surely infinite. So, (3) shows that *X* is -measurable up to evanescence and, by completeness of the filtration, is then -measurable. ⬜

#### Processes With Right Limits

Occasionally, we may want to consider processes which have right limits but are not necessarily right-continuous everywhere. For example, when the underlying filtered probability space is not right-continuous, then not all martingales will have a cadlag version. However, we were able to show that there is always a version with left and right limits, and which has right limits everywhere outside of a fixed countable set of times. Although they are not cadlag, such processes are still optional. I start by proving the following result relating optional processes with respect to the right-continuous filtration to optional processes under the original filtration.

Lemma 6LetXbe an optional process with respect to the right-continuous filtration . Then, there exists a countable set such that

(4)

is optional.

*Proof:* Let us first consider processes of the form for an -stopping time . Set,

As is strictly positive on *S* and sums to a finite value, *S* is countable. We can also show that (4) is optional. As is left-continuous and adapted, it is optional. Also, the random time

is an -stopping time satisfying for all times *t*. This means that is equal to up to a zero probability set and, by completeness of the filtered probability space, is a stopping time. Hence,

is optional.

Let denote the set of all -optional processes for which there exists a countable making (4) optional. From what we have just shown, for all -stopping times . It is also clear that is closed under taking finite linear combinations, and under taking limits of sequences. Consider a sequence , so that there are countable sets for which are optional. Taking then is optional for *Y* a finite linear combination or limit of the sequence . So, by the functional monotone class theorem, includes all -optional processes. ⬜

Finally, I show that the existence of right limits together with right-continuity outside of a countable set of times is sufficient to conclude that a process is optional. In particular, this includes the modifications of martingales which we previously constructed without requiring right-continuity of the filtration.

Lemma 7LetXbe an adapted process with right-limits everywhere, and which is right-continuous everywhere outside of a countable set . Then,Xis optional.

*Proof:* The process is right-continuous and is adapted with respect to the right-continuous filtration . Hence, it is -optional and, by Lemma 6, there exists a countable such that is optional. By enlarging *A*, if necessary, to include the set of times at which *X* is not right-continuous, we see that

is optional. Therefore, as is -measurable for each ,

is optional. ⬜

Hi George, just wondering if you can recommend any books which discuss optional processes in length. I find your post extremely useful and would like to learn more about the subject. Thanks!

Comment by Xi — 8 August 18 @ 2:56 PM |

I’m not George, but I can recommend a book called ‘Semimartingale Theory and Stochastic Calculus’. If you are looking something more advanced, then I recommend this article: https://www.fm.mathematik.uni-muenchen.de/download/publications/perkkio_pennanen_regularity.pdf

Comment by Matti Kiiski — 10 August 18 @ 8:39 AM |

[…] general theory of stochastic processes. It starts with the concept of stopping times and with the optional sigma-algebra on . Then, it says that if S is optional its section can be chosen to be a stopping time. However, […]

Pingback by Proof of Optional and Predictable Section | Almost Sure — 7 January 19 @ 12:03 PM |