|
|
|
|
Kolmogorov's martingale inequality
|
(Theorem)
|
|
|
(The notation $X(T)^+$ means $\max(X(T),0)$ , the positive part of $X(T)$ .)
Notice the analogy with Markov's inequality. Of course, the conclusion is much stronger than Markov's inequality, as the probabilistic bound applies to an uncountable number of random
variables. The continuity and submartingale hypotheses are used to establish the stronger bound.
Proof. Let $\{ t_i \}_{i=1}^n$ be a partition of the interval $[0,T]$ . Let $$ B = \Bigl\{ \max_{1 \leq i \leq n} X(t_i) \geq \alpha \Bigr\}$$ and split $B$ into disjoint parts $B_i$ , defined by $$ B_i = \Bigl\{ X(t_j) < \alpha \text{ for all } j < i \text{ but } X(t_i) \geq \alpha \Bigr\}\,.$$ Also let $\{ \sF_t \}$ be the filtration under which $X(t)$ is a submartingale.
Then
 |
![% latex2html id marker 415 $\displaystyle = \sum_{i=1}^n \mathbb{E}\bigl[1(B_i)\bigr]$ % latex2html id marker 415 $\displaystyle = \sum_{i=1}^n \mathbb{E}\bigl[1(B_i)\bigr]$](http://images.planetmath.org:8080/cache/objects/9694/js/img3.png) |
|
| |
![% latex2html id marker 416 $\displaystyle \leq \sum_{i=1}^n \mathbb{E}\left[ \frac{X(t_i)}{\alpha} \, \mathbf{1}(B_i) \right]$ % latex2html id marker 416 $\displaystyle \leq \sum_{i=1}^n \mathbb{E}\left[ \frac{X(t_i)}{\alpha} \, \mathbf{1}(B_i) \right]$](http://images.planetmath.org:8080/cache/objects/9694/js/img4.png) |
definition of  |
|
| |
![% latex2html id marker 419 $\displaystyle \leq \frac{1}{\alpha} \sum_{i=1}^n \m... ...l[ \mathbb{E}\bigl[X(T) \mid \mathcal{F}_{t_i} \bigr] \, \mathbf{1}(B_i) \Bigr]$ % latex2html id marker 419 $\displaystyle \leq \frac{1}{\alpha} \sum_{i=1}^n \m... ...l[ \mathbb{E}\bigl[X(T) \mid \mathcal{F}_{t_i} \bigr] \, \mathbf{1}(B_i) \Bigr]$](http://images.planetmath.org:8080/cache/objects/9694/js/img6.png) |
is submartingale |
|
| |
![% latex2html id marker 422 $\displaystyle = \frac{1}{\alpha} \sum_{i=1}^n \math... ...l[ \mathbb{E}\bigl[X(T) \, \mathbf{1}(B_i) \mid \mathcal{F}_{t_i} \bigr] \Bigr]$ % latex2html id marker 422 $\displaystyle = \frac{1}{\alpha} \sum_{i=1}^n \math... ...l[ \mathbb{E}\bigl[X(T) \, \mathbf{1}(B_i) \mid \mathcal{F}_{t_i} \bigr] \Bigr]$](http://images.planetmath.org:8080/cache/objects/9694/js/img8.png) |
is
-measurable |
|
| |
![% latex2html id marker 427 $\displaystyle = \frac{1}{\alpha} \sum_{i=1}^n \mathbb{E}\bigl[ X(T) \, \mathbf{1}(B_i) \bigr]$ % latex2html id marker 427 $\displaystyle = \frac{1}{\alpha} \sum_{i=1}^n \mathbb{E}\bigl[ X(T) \, \mathbf{1}(B_i) \bigr]$](http://images.planetmath.org:8080/cache/objects/9694/js/img11.png) |
iterated expectation |
|
| |
![% latex2html id marker 428 $\displaystyle = \frac{1}{\alpha} \mathbb{E}\bigl[ X(T) \, \mathbf{1}(B) \bigr]$ % latex2html id marker 428 $\displaystyle = \frac{1}{\alpha} \mathbb{E}\bigl[ X(T) \, \mathbf{1}(B) \bigr]$](http://images.planetmath.org:8080/cache/objects/9694/js/img12.png) |
|
| |
![% latex2html id marker 429 $\displaystyle \leq \frac{1}{\alpha} \mathbb{E}\bigl[ X(T)^+ \, \mathbf{1}(B) \bigr]$ % latex2html id marker 429 $\displaystyle \leq \frac{1}{\alpha} \mathbb{E}\bigl[ X(T)^+ \, \mathbf{1}(B) \bigr]$](http://images.planetmath.org:8080/cache/objects/9694/js/img13.png) |
|
| |
![% latex2html id marker 430 $\displaystyle \leq \frac{1}{\alpha} \mathbb{E}\bigl[ X(T)^+ \bigr]$ % latex2html id marker 430 $\displaystyle \leq \frac{1}{\alpha} \mathbb{E}\bigl[ X(T)^+ \bigr]$](http://images.planetmath.org:8080/cache/objects/9694/js/img14.png) |
monotonicity. |
|
Since the sample paths are continuous by hypothesis, the event$$ A = \Bigl\{ \max_{0 \leq t \leq T} X(t) \geq \alpha \Bigr\}$$ can be expressed as an countably infinite intersection of events of the form $B$ with finer and finer partitions $\{ t_i \}$ of the time interval $[0,T]$ . By taking limits, it follows
$\PP(A)$ has the same bound as the probabilities $\PP(B)$ . 
Corollary Let $X(t)$ , for $0 \leq t \leq T$ , be a square-integrable martingale possessing continuous sample paths, whose unconditional mean is $m = \E[X(0)]$ . For any constant $\alpha > 0$ ,$$ \PP \Bigl( \max_{0 \leq t \leq T} \abs{X(t)-m} \geq \alpha \Bigr) \leq \frac{\Var[X(T)]}{\alpha^2}\,.$$
Proof. Apply Kolmogorov's martingale inequality to $(X(t)-m)^2$ , which is a submartingale by Jensen's inequality. 
|
"Kolmogorov's martingale inequality" is owned by stevecheng.
|
|
(view preamble | get metadata)
Cross-references: Jensen's inequality, mean, limits, finer, intersection, countably infinite, event, hypothesis, filtration, disjoint, interval, partition, random variables, number, uncountable, bound, stronger, conclusion, Markov's inequality, analogy, positive, sample paths, continuous, submartingale, inequality, martingale
There is 1 reference to this entry.
This is version 5 of Kolmogorov's martingale inequality, born on 2007-06-29, modified 2009-01-01.
Object id is 9694, canonical name is KolmogorovsMartingaleInequality.
Accessed 1455 times total.
Classification:
| AMS MSC: | 60G07 (Probability theory and stochastic processes :: Stochastic processes :: General theory of processes) | | | 60G44 (Probability theory and stochastic processes :: Stochastic processes :: Martingales with continuous parameter) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|