请输入您要查询的字词:

 

单词 sigmaalgebraAtAStoppingTime
释义

σ-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 Xt1{τ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, VXτs=Xsτs is -measurable and 1{τt}V=1{τt}Xtτs is t-measurable.Conversely, if V is t-measurable then Xs1{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 Xt1{τ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σ(mnτ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 As, and {t0}×A for At0, the definition above can be rewritten as,

τ-=σ({A{τ>s}:s𝕋,As}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).
随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 3:55:16