Οƒ-algebra at a stopping time


Let (β„±t)tβˆˆπ•‹ be a filtrationPlanetmathPlanetmath (http://planetmath.org/FiltrationOfSigmaAlgebras) on a measurable spaceMathworldPlanetmathPlanetmath (Ξ©,β„±). For every tβˆˆπ•‹, the Οƒ-algebra β„±t represents the collectionMathworldPlanetmath 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 variableMathworldPlanetmath 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=XsΟ„βˆ§s is β„±βˆž-measurable and 1{τ≀t}⁒V=1{τ≀t}⁒XtΟ„βˆ§s 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 infinityMathworldPlanetmathPlanetmath, 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. 1.

    Any stopping time Ο„ is β„±Ο„-measurable.

  2. 2.

    If τ⁒(Ο‰)=tβˆˆπ•‹βˆͺ{∞} for all Ο‰βˆˆΞ© then β„±Ο„=β„±t.

  3. 3.

    If Οƒ,Ο„ are stopping times and Aβˆˆβ„±Οƒ then A∩{σ≀τ}βˆˆβ„±Ο„. In particular, if σ≀τ then β„±ΟƒβŠ†β„±Ο„.

  4. 4.

    If Οƒ,Ο„ are stopping times and Aβˆˆβ„±Οƒ then A∩{Οƒ=Ο„}βˆˆβ„±Ο„.

  5. 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. 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 setMathworldPlanetmathPlanetmath π•‹βŠ†β„ 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