PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] predictable stopping time (Definition)

A predictable, or previsible stopping time is a random time which is possible to predict just before the event. Letting $(\mathcal{F}_t)_{t\in\mathbb{R}_+}$ be a filtration on a measurable space $(\Omega,\mathcal{F})$ then, a stopping time $\tau$ is predictable if there exists an increasing sequence of stopping times $\tau_n$ satisfying the following.

  • $\tau_n<\tau$ whenever $\tau>0$
  • $\tau_n\rightarrow\tau$ as $n\rightarrow\infty$
The sequence $\tau_n$ is said to announce or foretell $\tau$

For example, if $X$ is a continuous adapted process with $X_0=0$ such as Brownian motion, then the first time $\tau$ at which it hits a given level $K\not=0$ is a predictable stopping time. In this case, if $\tau_n$ is the first time at which $X$ hits the level $K(1-1/n)$ then the sequence $\tau_n$ announces $\tau$

On the other hand, if $X$ is a Poisson process then the first time $\tau$ at which it is nonzero is not predictable. To show this, suppose that $\tau_n<\tau$ are stopping times. The fact that $X_t-\lambda t$ is a martingale means that Doob's optional sampling theorem can be applied, giving $\mathbb{E}[X_{\tau_n}-\lambda\tau_n]=0$ Then, $X_t=0$ for $t<\tau$ gives $\mathbb{E}[\tau_n]=0$ So, $\tau_n=0$ with probability one, and the sequence $\tau_n$ cannot announce $\tau$

In discrete time, where the filtration $(\mathcal{F}_t)$ has time $t$ running over the index set $\mathbb{Z}_+$ then a stopping time is said to be predictable if $\{\tau\le t\}$ is $\mathcal{F}_{t-1}$ measurable for every time $t=1,2,\ldots$

This can be generalized to an arbitrary index set $\mathbb{T}$ where a stopping time $\tau\colon\Omega\rightarrow\mathbb{T}\cup\{\infty\}$ is predictable if there exists an increasing sequence of stopping times $\tau_n\le\tau$ such that $\tau_n<\tau$ whenever $\tau$ is not equal to a minimal element of $\mathbb{T}$ and $\bigcap_n(\tau_n,\tau)$ contains no elements of $\mathbb{T}$




"predictable stopping time" is owned by gel.
(view preamble | get metadata)

View style:

See Also: stopping time, predictable process

Other names:  predictable time, previsible time, previsible stopping time
Keywords:  filtration, stopping time

This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: contains, minimal element, running, discrete, Doob's optional sampling theorem, martingale, Poisson process, Brownian motion, adapted process, continuous, sequence, increasing, measurable space, event, stopping time
There are 2 references to this entry.

This is version 3 of predictable stopping time, born on 2008-12-17, modified 2008-12-20.
Object id is 11357, canonical name is PredictableStoppingTime.
Accessed 954 times total.

Classification:
AMS MSC60G05 (Probability theory and stochastic processes :: Stochastic processes :: Foundations of stochastic processes)
 60G40 (Probability theory and stochastic processes :: Stochastic processes :: Stopping times; optimal stopping problems; gambling theory)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)