Measure Theory Q's wrt Stochastic Processes

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 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 1 person
Both of your answers were incredibly helpful. Thank you.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top