Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Consider a random walk $S_n = a_1+\dots+a_n$ where $a_n$ are iid random variables with $Ea_1 = a$ and $E|a_1|<\infty$.

I am interested in the case when $\sup\limits_n S_n>M$ for all $M$ a.s. Can you refer me to a rigorous proof that it not hold for $a<0$?

For $a>0$ it holds by Law of Large Numbers since if $P(\sup\limits_n S_n\leq M) = p$ then either $\lim\limits_n\frac1n S_n$ does not exists, or $\lim\limits_n\frac1n S_n\leq 0$ with probability $p$.

For $a=0$ it holds if $0<Var(a_1)<\infty$ due to the Law of Iterated Logarithm. For $Var(a_1) = 0$ it certainly does not hold.

share|cite|improve this question
As far as I know, the Law of Iterated Logarithm only applies if ${\rm Var}(a_1) < \infty$. – George Lowther Jul 5 '11 at 21:09
Yes, sure - I fixed it. – Ilya Jul 6 '11 at 6:13
up vote 2 down vote accepted

When $a<0$, $S_n/n\to a$ almost surely, in particular $S_n\to-\infty$ almost surely, in particular $(S_n)$ is almost surely upper bounded. This implies that $P(\sup_nS_n\ge M)\to0$ when $M\to+\infty$, in particular $P(\sup_nS_n\ge M)<1$ for every $M$ large enough. (Actually, $P(\sup_nS_n\ge M)<1$ for every positive $M$.)

I see no other question in your post.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.