Measure Theory Q's wrt Stochastic Processes

Click For Summary

Discussion Overview

The discussion revolves around the concepts of measure theory as applied to stochastic processes, specifically focusing on the meaning of "\mathscr{F}-measurable" random variables and the definition and examples of filtrations in stochastic calculus.

Discussion Character

  • Technical explanation
  • Conceptual clarification
  • Exploratory

Main Points Raised

  • One participant seeks clarification on the term "\mathscr{F}-measurable" random variable and its implications in measure theory.
  • Another participant explains that a measurable function means that the preimage of any measurable set is also measurable, providing a definition involving sigma algebras.
  • A third participant offers an example of a probability space with a stochastic process (coin tossing) and illustrates how the filtration changes with each toss, detailing the sigma algebras at different stages.
  • Participants express a desire for practical examples to ground the theoretical constructs discussed.

Areas of Agreement / Disagreement

Participants generally agree on the definitions and concepts presented, but there is no explicit consensus on the practical applications or examples of filtrations beyond those provided.

Contextual Notes

The discussion includes assumptions about the definitions of sigma algebras and measurable functions, but these assumptions are not fully explored or universally accepted among all participants.

X89codered89X
Messages
149
Reaction score
2
Hello there.

The stochastic calc book I'm going through ( and others I've seen ) uses the phrase "\mathscr{F}-measurable" random variable Y in the section on measure theory. What does this mean? I'm aware that \mathscr{F} is a \sigma-field over all possible values for the possible values of Y, but the language throws me.

A tougher thing that confuses is me is in the stochastic context it defines a filtration as the increasing family of sigma algebras indexed by t, like this \mathscr{F}_t = \sigma{\lbrace X_s; s \leq t \rbrace } for a stochastic process X_t. I take it \sigma is an operator here? I realize this is a theoretical construct, but is it possible to see an example (not given in the book). From what I understand \mathscr{F}_s \subset \mathscr{F}_t \forall s < t, but again what do either of these look like. Or a simpler, yet nontrivial example of a filtration? Maybe it would be easier in discrete stochastic process case. I can understand how most of this works simply by the fact that no definitions seem conflict with each other and everything is logically consistent but I'm just wondering if there is some more practical ground here ...
 
Last edited:
Physics news on Phys.org
X89codered89X said:
Hello there.

The stochastic calc book I'm going through ( and others I've seen ) uses the phrase "\mathscr{F}-measurable" random variable Y in the section on measure theory. What does this mean? I'm aware that \mathscr{F} is a \sigma-field over all possible values for the possible values of Y, but the language throws me.
I'm very surprised if they use that terminology without defining it. A measurable function ("random variable" in probability theory) is simply a function ##f## for which ##f^{-1}(A)## is measurable whenever ##A## is measurable.

Your random variable ##Y## is defined on some space, let's call it ##S##, and it is equipped with a sigma algebra ##\mathcal{F}##. You didn't specify the target space, so let's call it ##T## and assume it is also a measure space with some sigma algebra ##\mathcal{G}##. Then ##Y : S \rightarrow T##, and "##Y## is measurable" means that for any set ##A \in \mathcal{G}##, we have ##f^{-1}(A) \in \mathcal{F}##.
 
  • Like
Likes   Reactions: 1 person
For an example, let's have a probability space (\Omega, \mathcal{F}, \mathbb{P}) and a stochastic process (coin tossing) X adapted to a filtration (\mathcal{F}_t)_{t=1,2}, \mathcal{F}_t\subset \mathcal{F}.

Then, in the beginning, one knows nothing but possible results,
\mathcal{F}_0 = \{\emptyset, \Omega\} where \Omega=\{[HH], [HT], [TH], [TT]\}.

After the first toss, the division becomes finer, one can say more about the history,
\mathcal{F}_1 = \{\emptyset, \Omega, [HH, HT], [TH, TT]\} \supset \mathcal{F}_0,

After the second toss,
\mathcal{F}_2 = \{\emptyset, \Omega, [HH, HT], [TH, TT], [HH], [HT], [TH], [TT]\} \supset{F}_1.

You can exchange 2 tosses of a coin by m tosses of a dice, \Omega=\{1,...,6\}^m, or even to move to continuous cases.
 
  • Like
Likes   Reactions: 1 person
Both of your answers were incredibly helpful. Thank you.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 5 ·
Replies
5
Views
11K
  • · Replies 7 ·
Replies
7
Views
8K
Replies
2
Views
1K