σ-algebra at a stopping time
Let (ℱt)t∈𝕋 be a filtration (http://planetmath.org/FiltrationOfSigmaAlgebras) on a measurable space
(Ω,ℱ). For every t∈𝕋, the σ-algebra ℱt represents the collection
of events which are observable up until time t. This concept can be generalized to any stopping time τ:Ω→𝕋∪{∞}.
For a stopping time τ, the collection of events observable up until time τ is denoted by ℱτ and is generated by sampling progressively measurable processes
ℱτ=σ({Xτ∧t:X is progressive, t∈𝕋}). |
The reason for sampling X at time τ∧t rather than at τ is to include the possibility that τ=∞, in which case Xτ is not defined.
A random variable V is ℱτ-measurable if and only if it is ℱ∞-measurable and the process Xt≡1{τ≤t}V is adapted.
This can be shown as follows. If X is a progressively measurable process, then the stopped process Xτ∧s is also progressive. In particular, V≡Xτ∧s=Xτ∧ss is ℱ∞-measurable and 1{τ≤t}V=1{τ≤t}Xτ∧st is ℱt-measurable.
Conversely, if V is ℱt-measurable then Xs≡1{s>t}V is a progressive process and 1{τ>t}V=Xτ∧t is ℱτ-measurable. By letting t increase to infinity, it follows that 1{τ=∞}V is ℱτ-measurable for every ℱ∞-measurable random variable V.
Now suppose also that Xt≡1{τ≤t}V is adapted, and hence progressive. Then, 1{τ≤t}V=Xτ∧t is ℱτ-measurable. Letting t increase to infinity shows that V=1{τ<∞}V+1{τ=∞}V is ℱτ-measurable.
As a set A is ℱτ-measurable if and only if 1A is an ℱτ-measurable random variable, this gives the following alternative definition,
ℱτ={A∈ℱ∞:A∩{τ≤t}∈ℱt for all t∈𝕋}. |
From this, it is not difficult to show that the following properties are satisfied
-
1.
Any stopping time τ is ℱτ-measurable.
-
2.
If τ(ω)=t∈𝕋∪{∞} for all ω∈Ω then ℱτ=ℱt.
-
3.
If σ,τ are stopping times and A∈ℱσ then A∩{σ≤τ}∈ℱτ. In particular, if σ≤τ then ℱσ⊆ℱτ.
-
4.
If σ,τ are stopping times and A∈ℱσ then A∩{σ=τ}∈ℱτ.
-
5.
if the filtration (ℱt) is right-continuous and τn≥τ are stopping times with τn→τ then ℱτ=⋂nℱτn. More generally, if τn=τ eventually then this is true irrespective of whether the filtration is right-continuous.
-
6.
If τn are stopping times with τn=τ eventually then ℱτn→ℱτ. That is,
ℱτ=⋂nσ(⋃m≥nℱτm).
In continuous-time, for any stopping time τ the σ-algebra ℱτ+ is the set of events observable up until time t with respect to the right-continuous filtration (ℱt+). That is,
ℱτ+={A∈ℱ∞:A∩{τ≤t}∈ℱt+ for every t∈𝕋}={A∈ℱ∞:A∩{τ<t}∈ℱt for every t∈𝕋}. |
If τn≥τ are stopping times with τn>τ whenever τ<∞ is not a maximal element of 𝕋, and τn→τ then,
ℱτ+=⋂nℱτn=⋂nℱτn+. |
The σ-algebra of events observable up until just before time τ is denoted by ℱτ- and is generated by sampling predictable processes
ℱτ-=σ({Xτ∧t:X is predictable, t∈𝕋}). |
Suppose that the index set 𝕋⊆ℝ has minimal element t0.
As the predictable σ-algebra is generated by sets of the form (s,∞)×A for s∈𝕋 and A∈ℱs, and {t0}×A for A∈ℱt0, the definition above can be rewritten as,
ℱτ-=σ({A∩{τ>s}:s∈𝕋,A∈ℱs}∪ℱt0). |
Clearly, ℱτ-⊆ℱτ⊆ℱτ+. Furthermore, for any stopping times σ,τ then ℱσ+⊆ℱτ- when restricted to the set {σ<τ}.
If τn is a sequence of stopping times announcing (http://planetmath.org/PredictableStoppingTime) τ, so that τ is predictable, then
ℱτ-=σ(⋃nℱτn). |
Title | σ-algebra at a stopping time |
---|---|
Canonical name | sigmaalgebraAtAStoppingTime |
Date of creation | 2013-03-22 18:38:56 |
Last modified on | 2013-03-22 18:38:56 |
Owner | gel (22282) |
Last modified by | gel (22282) |
Numerical id | 6 |
Author | gel (22282) |
Entry type | Definition |
Classification | msc 60G40 |
Related topic | DoobsOptionalSamplingTheorem |