Optimal L$^1$-bounds for submartingales

Details Optimal L$^1$-bounds for submartingales Optimal L$^1$-bounds for submartingales

2008-09-20

arxiv.org/abs/0809.3522v2

Mathematics

Probability

14 pages. Minor corrections and notational changes. Address of first-named author updated

Scientific paper

The optimal function $f$ satisfying $$ \mathbb{E} |\sum_{1}^n X_i | \ge f(\mathrbb{E}|X_1|,...,\mathbb{E}|X_n|) $$ for every martingale $(X_1,X_1+X_2, ...,\sum_{i=1}^n X_i)$ is shown to be given by $$ f(a) = \max \Big\{a_k-\sum_{i=1}^{k-1} a_i\Big\}_{k=1}^n \cup \Big\{\frac {a_k}2\Big\}_{k=3}^n $$ for $a\in{[0,\infty[}^n_{}$. A similar result is obtained for submartingales $(0,X_1,X_1+X_2,..., \sum_{i=1}^n X_i)$. The optimality proofs use a convex-analytic comparison lemma of independent interest.

Affiliated with

Also associated with

No associations

Rating

Optimal L$^1$-bounds for submartingales does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal L$^1$-bounds for submartingales, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal L$^1$-bounds for submartingales will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-311542