Math 2.0

Probability theory and stochastic processes Definition

Stopping time

Builds on FiltrationRandom variable

Definition

Let (Ω,ℱ,(ℱt)t∈T,P)(\Omega, \mathcal{F}, (\mathcal{F}_t)_{t \in T}, P) be a probability space with a filtration, where T⊆[0,∞)T \subseteq [0, \infty), for example T=ℕT = \N or T=[0,∞)T = [0, \infty). A stopping time with respect to (ℱt)(\mathcal{F}_t) is a map τ ⁣:Ω→T∪{∞}\tau \colon \Omega \to T \cup \set{\infty} such that {ω∈Ω:τ(ω)≤t}∈ℱtfor every t∈T.\set{\omega \in \Omega : \tau(\omega) \le t} \in \mathcal{F}_t \quad \text{for every } t \in T.

Remarks

In discrete time, T=ℕT = \N, the condition is equivalent to {τ=n}∈ℱn\set{\tau = n} \in \mathcal{F}_n for every n∈ℕn \in \N, since {τ=n}={τ≤n}∖{τ≤n−1}\set{\tau = n} = \set{\tau \le n} \setminus \set{\tau \le n - 1} and {τ≤n}=⋃k≤n{τ=k}\set{\tau \le n} = \bigcup_{k \le n} \set{\tau = k}. The value ∞\infty means that the event never happens.

Example: let (Sn)n∈ℕ(S_n)_{n \in \N} be a random walk with natural filtration ℱn=σ(S0,…,Sn)\mathcal{F}_n = \sigma(S_0, \dots, S_n), let a∈ℝa \in \R, and let τ=min⁡{n:Sn≥a}\tau = \min\set{n : S_n \ge a}, with min⁡∅=∞\min \emptyset = \infty. Then {τ≤n}=⋃k≤n{Sk≥a}∈ℱn\set{\tau \le n} = \bigcup_{k \le n} \set{S_k \ge a} \in \mathcal{F}_n, so τ\tau is a stopping time.

Non-example: with the same walk started at S0=0S_0 = 0 and with steps ±1\pm 1, let N≥2N \ge 2 and σ=max⁡{n≤N:Sn=0}\sigma = \max\set{n \le N : S_n = 0}, the last visit to 00 before time NN. The event {σ≤0}\set{\sigma \le 0} is the event that Sn≠0S_n \ne 0 for 1≤n≤N1 \le n \le N, which depends on steps after time 00 and is not in ℱ0={∅,Ω}\mathcal{F}_0 = \set{\emptyset, \Omega}. So σ\sigma is not a stopping time.

Constant times are stopping times, and the minimum and the maximum of two stopping times are stopping times. The σ\sigma-algebra of the past at τ\tau is ℱτ={A∈ℱ:A∩{τ≤t}∈ℱt for all t∈T}\mathcal{F}_\tau = \set{A \in \mathcal{F} : A \cap \set{\tau \le t} \in \mathcal{F}_t \text{ for all } t \in T}.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Filtration concept
  2. Random variable concept
  3. Stopping time definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Stopping_time
About this page
TagW96WPDEA6A
URIm2://W96WPDEA6A
Kinddefinition
WritingW0 stub
MSC60G40, 60G05
DefinesStopping time
UsesFiltration, Random variable
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.