PDF of Solutions
Problem 1.2.2 (not mine)
Let be the collection of subsets
of
such that
. Note that
is a
-algebra (simple to show). Assume
for some
. Then
for all
so
. Since
for all
have
. So
for all
in
. Note that
in
and
. So
which implies
. Thus
as well.
Problem 1.2.6
We wish to show that for all
. For
,
so is in
. Let
. Consider the set
.
Let . By the definition of infimum, there is some
such that
. Since
is open there is some open ball
such that
. Since
is right continuous there is some rational number
such that
and
.
In fact, we can see that if and only if there is some rational number
such that
. (We have shown one direction, other direction is trivial). Thus:
If for each r, we are done (because
is closed under countable unions). Note
is adapted so
.
Problem 1.2.7
We wish to show that for all
. Begin with
.
Since is adapted,
. (Does not rely on fact that
is closed).
Now assume . Let us instead show that
. We argue that for closed set
that
If then it is certainly true that
for all
, so
Now assume . It is clear that
. But is it possible that
and
? No. If
there are two possibilities. Either
(but have already seen assumed that
so contradiction). OR, there is a sequence
such that
,
and
for each
. Then by continuity of sample paths
. Thus
is a limit point of
. Since
is closed,
. Thus,
, again a contradiction. Hence
.
Now we just need to show is in fact a countable union of measurable sets. This follows directly from continuity of sample paths.
And for each
by the fact that
is adapted.
Problem 1.2.10
i). We wish to show that . This is equivalent to showing that
. Note that :
The first two sets on the right hand side are in by our preliminary assumptions. Consider the last set.
Assume that and let
be the set of all rational numbers in
. Note that
where can be chosen to be sufficiently large so that
. Then
for each
and so
.
Finally note that
ii).
Recall if is a stopping time it is also an optional time, so we can use the same work in previous part to show last set on right hand side is in
.
Problem 1.2.13
Assume , i.e
for all
. Note
The right hand side is in be definition of
. So
. Now let
for each
. Note that
Since is closed under countable unions,
. So
is closed under complements and countable unions, so it is a
-algebra.
Now assume that for some fixed
and all
. Let
. Then
as well. Note that for
for
and
for
. Then, for
we have:
On the other hand, for , (noting that
) we have
Thus, if we see that
. Trivial to show that
.
Problem 1.2.14
Wish to show that for all
. One equivalent definition of
is that
for all
. Note
by definition means
for all
. So
for all
. In particular, let
. Then for all
we have:
But since ,
. Thus,
for all
. Thus,
is a stopping time.
Problem 1.2.17 (not mine)
i). Recall definition of restriction to . For all
, we take
. Note that since
we have
for all
. Similarly,
. Thus
.
Want to show that so pick a set
in larger
-algebra,
. Then for such an
(and on
) we have:
ii). Similar to previous, we can show that on
. Why ? In previous, didn’t use specific form of inequality (
versus
), just used fact that these sets are in
.
Now to show (ii), will show it on the two disjoint sets and $\{ S<T\}$. By (i) we see that
And on have something similar, by justification above.
Follow My Blog
Get new content delivered directly to your inbox.