Optional sampling theorem

from Wikipedia, the free encyclopedia

The Optional Sampling Theorem is a probabilistic statement going back to Joseph L. Doob . A popular version of this theorem is that in fair, repetitive play, there is no abandonment strategy that can improve your overall profit.

initial situation

One considers a set of possible points in time and a basic set of possible results. At every point in time there is a σ-algebra on which stands for the level of information at this point in time. Since the available information increases over time, apply to , that is , a filtration is on . In applications there is a probability space and it is .

At any point in time there is a measurable random variable , that is, there is an adapted stochastic process that can, for example, represent the payment of a game at the point in time . It is further assumed that there is a martingale ; the defining condition for expresses the fairness of the game: the forecast of the payout at the time under the information available is exactly the observation made at . In particular, the expected value at the point in time agrees with the initial expected value .

A stop time is a figure with . The idea behind this is to terminate the process at the point in time , which then leads to the result , which must be defined appropriately. Whether you stop at the point in time may only depend on the information available up to now , which explains the measurability condition set.

The question now arises as to whether a better result than can be obtained by choosing a suitable stopping time . The Optional Sampling Theorem states that this is not the case under suitable conditions.

Discreet version

If you consider a discrete sequence of points in time, you can model this through . The discrete version of the Optional Sampling Theorem states:

  • If a filtration and an adapted martingale are on and if a stop time is with , and , then applies
.

The technical requirements are met, especially for the realistic case of limited stopping times (you cannot wait forever!).

The stop strategy of always betting on red in roulette , starting with one euro, doubling the stake each time and canceling the first appearance of red does not meet these technical requirements. Here, however, you have the unrealistic situation of an unlimited stopping time with exponentially growing stakes (at the "end" you win a total of one euro).

The following tightening for limited stopping times is also referred to as Optional Sampling Theorem:

  • If a filtration and an adapted submartingale are on and if there are limited stop times, then the following applies
.

It is the so-called σ-algebra of σ-past . If one sets special , then it is safe and it follows and after the application of the expected value . In the case of martingales this argument can also be applied to, and one obtains the statement of the first mentioned theorem for limited stop times.

  • If a filtration and an adapted martingale are on and if there are limited stop times, then the following applies
.

This follows immediately from the above inequality, because if a martingale is, then and are submartingales.

Continuous version

In the continuous-time case, which is modeled by, further technical prerequisites must be set that allow the proof to be traced back to the discrete case. Analogous to the discrete case, the following two sentences apply, which are also referred to as Optional Sampling Theorem.

  • If a filtration and an adapted martingale with right-hand continuous paths are on and if a stop time with , and , then applies
.
  • If a filtration and an adapted submartingale with continuous paths on the right side are on and limited stop times are also , then the following applies
    .
  • If a filtration and an adapted martingale with continuous paths on the right are on and limited stop times are also , then the following applies
    .

See also

swell