# From the Martingale Zoo by fdh56iuoui

VIEWS: 3 PAGES: 2

• pg 1
```									                              From the Martingale Zoo
If you play a succession of fair games, your fortune is a martingale. If the number of games
played has a ﬁxed upper bound, the intuition that “a martingale is fair” works just ﬁne. However, if
it is merely the case that play eventually stops, the expected value of your ﬁnal fortune may not be
your initial fortune, even though the expected value of your fortune after game n is the same for all
n (Indeed, your ﬁnal fortune may not even have an expected value.) Thus, to reﬁne one’s intuition,
it is helpful to look at some examples of how martingales can misbehave.
Let X0 be your initial fortune, which in our examples will be a constant. You are allowed to
place bets (of possibly varying amounts) on independent fair games of chance at times 1, 2, 3, ...;
your fortune after game n is Xn . The amount that you bet on game n + 1 is allowed to depend on
the outcomes of the previous games. The martingale property is that, after the game at time n ≥ 1
has taken place (and at time n = 0, when there is no game), the expected value of your fortune after
game n + 1 is your fortune’s current value.
Most of our examples involve coin ﬂipping. For convenience, we allow negative bets: a bet of -1
on heads is the same as a bet of 1 on tails. The amount that we can bet is not restricted by our
fortune: borrowing the amount staked is allowed, and our fortune may be negative.
Our ﬁrst example is simple yet striking. Start with an initial fortune of 1, and bet your entire
fortune on successive ﬂips of a coin. With probability 1, your ﬁnal fortune is 0. Note that this
apparent pathology occurs even though your fortune is always nonnegative and there is no borrowing.
Closely related to the above is the so-called “doubling strategy”. Start with 0, bet 2n−1 on heads
until heads come up, and then stop. With probability 1, your ﬁnal fortune is 1. Thus, this strategy
seems to be a sure-ﬁre way to make money.
We can get more dramatic examples using “lottery tickets”. We consider the old-fashioned kind
of lottery, where one ticket always wins the entire pot. We buy one ticket at price 1 for each lottery,
and assume that the lottery at time n has a pot of 2n . Using the ﬁrst Borel-Cantelli lemma, we see
that, with probability 1, every ticket from some point on will be a loser. Thus, in this martingale
our losses will undoubtedly go to inﬁnity. If we sell a “lottery ticket” at each n (that is, play a game
which pays 1 with probability 1 − 21 and 1 − 2n with probability 21 ), then our earnings (winnings)
n                               n

will undoubtedly grow without bound.
We now consider a general setup, which we shall then specialize to illustrate various types of
martingale behavior, most of which are rather technical. Let a0 , a1 , a2 , ... be any sequence of real
numbers. Our initial fortune is X0 = a0 . Our plan is to bet on heads until heads comes up and
then stop, with the amounts of the bets selected so that if heads comes up for the ﬁrst time in game
n then our fortune upon winning that game is an . Thus, we bet a1 − a0 (which may be negative)
on heads in game 1; if tails comes up, our fortune is x1 = 2a0 − a1 . If tails come up on games
1, ..., n, leaving us with a fortune of xn , then we bet an+1 − xn on heads in game n + 1, and have
n
xn+1 = 2xn − an+1 if we get tails. We see that xn = 2n a0 − k=1 2n−k ak for n ≥ 1; for later use,
we extend the notation by setting x0 = a0 . For n ≥ 1, our fortune Xn is ak with probability 21 for k

k = 1, ..., n, and xn with probability 21 . This martingale converges with probability 1 to our ﬁnal
n

fortune X∞ , which is an with probability 21 for each n ≥ 1.
n

1. Our ﬁrst example was the case a0 = 1, an = 0 for n ≥ 1. The “doubling strategy” is the case
a0 = 0, an = 1 for n ≥ 1.
2. According to the Submartingale Convergence Theorem (SCT), a martingale X will converge
if {E[|Xn |]} is bounded ( X is “bounded in L1 ”). Taking, for example, an = 3n , we see that
this boundedness condition is by no means necessary for convergence. However, in this case
X∞ is not integrable, and when the SCT hypotheses apply the limit is integrable. In our
setup, we can show that E[|Xn |] ≤ 2 E [|X∞ |] + |a0 |, so if X∞ is integrable then {E[|Xn |]} is
bounded. (After our discussion of this class of examples, we give an example to show that this
implication is not always true.)
3. Our martingale X = {Xn } is uniformly integrable (equivalently, {Xn } converges to X∞ in L1 )
if and only if X∞ is integrable and E[X∞ ] = E[X0 ] = a0 . The conditions are necessary by,
for example, Billingsley, Probability and Measure, Theorem 16.14(i). If the conditions hold,
∞
one can compute that xn = k=1 an+k and from this that the expected value of X∞ , given
2k
the results of games 1, ..., n, is Xn . This shows uniform integrability. More concretely, one
∞
can show E[|Xn − X∞ |] ≤ 2 k=n+1 |ak | . (In our later example, E[X∞ ] = E[X0 ] but {Xn }
2
k

is not uniformly integrable: we emphasize that the equivalence of uniform integrability with
E[X∞ ] = E[X0 ] holds for this class of examples but not in general. The equivalence of uniform
integrability with convergence in L1 holds for any martingale, via SCT and general convergence
results.)
4. Let an = 2αn for n ≥ 1, where α is a ﬁxed real number. If α ≥ 1 then X∞ is not integrable.
We suppose α < 1. We set a0 = E[X∞ ], so that the martingale X is uniformly integrable. We
2αn
calculate xn = 21−α −1 for all n ≥ 0. If α ≤ 0 then 2α is a uniform bound for X, and so X
is perfectly well behaved. Let us consider the case 0 < α < 1. For p > 0, we ﬁnd by explicit
calculation that X is bounded in Lp if and only if p < 1/α.
5. Let X ∗ = supn |Xn |. Let Y have value |xn | if heads occurs for the ﬁrst time in game n + 1
(in which case Y = |Xn |), and Y = 0 if heads never occurs; here we are using our extended
notation x0 = a0 . Then 0 ≤ Y ≤ X ∗ , so if X ∗ is integrable then so is Y . Suppose an ≥ 0
∞ an
for n ≥ 1 and that the martingale X is uniformly integrable, so that a0 =            n=1 2n and
∞ an+k                       ∞    xn      1    ∞ nan                     2n
xn = k=1 2k . Then E[Y ] = n=0 2n+1 = 2 n=1 2n . If we set an = n2 for n ≥ 1,
we thus have an example in which X is uniformly integrable but X ∗ is not integrable. This
shows that the uniform integrability is not the result of {Xn } being dominated by an integrable
random variable; more technically, the martingale Mn = Xn − X0 is uniformly integrable but
1
not in the Hardy space H0 .

We can easily give an example (outside our general setup) of a martingale which is not bounded
in L1 but converges to an integrable limit. Starting with 0, bet 3n on heads until heads comes up,
and then bet your entire fortune on heads until you lose. This martingale converges to 0, its initial
value, but it is not bounded in L1 , and thus the convergence does not take place in L1 . Note that
E[X∞ ] = E[X0 ]; for nonnegative martingales, this condition implies convergence in L1 .
Let us now brieﬂy move on to the next level: we use a martingale to deﬁne a game sequence. If
Z is a martingale (say, one of the ones we have constructed), then we consider Zn − Zn−1 to be the
payoﬀ per unit stake in game n, n ≥ 1; there is no game at n = 0. The amount that we decide to
stake on game n must be “previsible”: that is, dependent only on the information accumulated up
until time n − 1. We note that our games may no longer be independent: in our examples, it was
usually the case that if Zn − Zn−1 = 0 for some n, then the same was true for all subsequent n. We
shall consider a single example, using the martingale M deﬁned above to deﬁne our game sequence.
We start with a fortune of X0 = 0. We introduce a second (independent) coin, and ﬂip it at time
n − 1 to decide whether to stake 1 or −1 on game n. Our resulting fortune Xn is a martingale. Since
Mn − Mn−1 is almost surely eventually zero, X converges with probability 1. We claim that X∞ is
not integrable. Consider the event in which (for the coin deﬁning M ) heads occurs for the ﬁrst time
n−1
at time n, so that X∞ = Xn . Then Mn − Mn−1 = an − xn−1 is approximately −2 , and we can
n+1
2n−2
show |Mn − Mn−1 | >    n+1 if n ≥ 3.   Half of the time Xn − Xn−1 will have the same sign as Xn−1 ,
2n−2                                  ∞      n−2
in which case |X∞ | >  n+1 . We thus   see that E[|X∞ |] ≥ n=3 1 2        1
2 n+1 2n = ∞. On a technical level,
we have illustrated the fact that the discrete stochastic integral of a bounded previsible process with
respect to a uniformly integrable martingale need not be uniformly integrable (or even bounded in
L1 ); see the discussion in Williams, Probability with Martingales, pages 151 - 152, which tells where
some of these creatures may be found.

```
To top
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://www.docstoc.com/docs/80133423/From-the-Martingale-Zoo", "fetch_time": 1438379867000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2015-32/segments/1438042988312.76/warc/CC-MAIN-20150728002308-00073-ip-10-236-191-2.ec2.internal.warc.gz", "warc_record_offset": 406119032, "warc_record_length": 41235, "token_count": 2637, "char_count": 8892, "score": 3.78125, "int_score": 4, "crawl": "CC-MAIN-2015-32", "snapshot_type": "longest", "language": "en", "language_score": 0.9399409890174866, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00040-of-00064.parquet"}