Math 2.0

Probability theory and stochastic processes Definition

Stopped process

Builds on Stochastic processFiltrationStopping timeAdapted process

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). Let X=(Xt)t∈TX = (X_t)_{t \in T} be a stochastic process with values in a measurable space SS, and let τ\tau be a stopping time. The stopped process Xτ=(Xtτ)t∈TX^\tau = (X^\tau_t)_{t \in T} is defined by Xtτ(ω)=Xmin⁡(t,τ(ω))(ω)for t∈T and ω∈Ω.X^\tau_t(\omega) = X_{\min(t, \tau(\omega))}(\omega) \quad \text{for } t \in T \text{ and } \omega \in \Omega.

Remarks

The notation t∧τ=min⁡(t,τ)t \wedge \tau = \min(t, \tau) is standard, so Xtτ=Xt∧τX^\tau_t = X_{t \wedge \tau}. On the event {τ=∞}\set{\tau = \infty}, the stopped process equals XX.

In discrete time, if XX is adapted, then so is XτX^\tau, because Xnτ=X0+∑k=1n𝟏{τ≥k}(Xk−Xk−1)X^\tau_n = X_0 + \sum_{k=1}^{n} \mathbf{1}_{\set{\tau \ge k}} (X_k - X_{k-1}) for real-valued XX, and {τ≥k}=Ω∖{τ≤k−1}∈ℱk−1\set{\tau \ge k} = \Omega \setminus \set{\tau \le k - 1} \in \mathcal{F}_{k-1}. The same formula shows that a stopped martingale is a martingale. In continuous time, the stopped process of a progressively measurable process is progressively measurable.

Example: let SS be a simple symmetric random walk started at 00 and let τ\tau be the first time with ∣Sn∣=5\abs{S_n} = 5. Then ∣Snτ∣≤5\abs{S^\tau_n} \le 5 for all nn, so SτS^\tau is a bounded martingale.

Non-example: if τ\tau is not a stopping time, the formula still defines a process, but it need not be adapted. Take the walk above and let σ\sigma be the last visit to 00 before time 1010. The value S1σS^\sigma_1 equals S1S_1 if the walk returns to 00 between times 11 and 1010, and 00 otherwise. This is not determined by ℱ1\mathcal{F}_1, so SσS^\sigma is not adapted.

Reading path

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

  1. Adapted process concept
  2. Construction of the reals from Cauchy sequences concept
  3. Element definition
  4. Filtration concept
  5. Integers object
  6. Ordered field definition
  7. Proposition concept
  8. Random experiment concept
  9. Rational numbers object
  10. Real numbers object
  11. Stopping time concept
  12. Set definition
  13. Ring of integers statement
  14. Disjunction definition
  15. Implication definition
  16. Predicate definition
  17. Ordered pair definition
  18. Union definition
  19. Sample space definition
  20. Existential quantifier definition
  21. Universal quantifier definition
  22. The rationals form a field statement
  23. Cartesian product definition
  24. Subset definition
  25. Uniqueness quantifier definition
  26. The rationals form an ordered field statement
  27. Binary relation definition
  28. Universal set definition
  29. Power set definition
  30. Order on the reals definition
  31. Function definition
  32. Complement definition
  33. Interval definition
  34. Preimage of a set definition
  35. Sigma-algebra definition
  36. Event definition
  37. Borel sigma-algebra definition
  38. Probability axioms concept
  39. Probability measure definition
  40. Probability space definition
  41. Random variable definition
  42. Stochastic process concept
  43. Stopped process definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Stopped_process
About this page
TagNTFND9FRDN
URIm2://NTFND9FRDN
Kinddefinition
WritingW0 stub
MSC60G40, 60G05
DefinesStopped process
UsesStochastic process, Filtration, Stopping time, Adapted process
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • 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.