Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

If we want to check whether $\tau$ is a stopping time with respect to some filtration $\lbrace \mathcal{F}_{n}\rbrace$, where $n\in\mathbb{N}$, we can verify that $\lbrace\tau= n\rbrace\in\mathcal{F}_{n}$ for all $n$ rather than $\lbrace\tau\leq n\rbrace\in\mathcal{F}_{n}$. Is it true because $\lbrace\tau\leq n\rbrace=\bigcup_{k=0}^{n}\lbrace\tau=k\rbrace\in\mathcal{F}_{n}$? (if we assume the above, the $k$-th set in the sum of the right-hand side of the equation lies in $\mathcal{F}_{k}$, so in $\mathcal{F}_{n}$ as well, since $k\leq n$, and the sum is also there as the sum of elements of a $\sigma$-algebra). Did I get it right?

share|cite|improve this question
Yes looks right to me, we can say that $\{\tau\le n\}$ is in $\mathcal{F}_n$ since $\{\tau = k\}\in\mathcal{F}_n$ for $k=0,\ldots,n$ and by using the properties of $\mathcal{F}_n$ (closure under countable unions). – Erik M Feb 1 '13 at 20:35
Also use: $\mathcal F_k \subseteq \mathcal F_n$ if $k \le n$. – GEdgar Feb 1 '13 at 21:02

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.