Assume , so the ratio defining is meaningful. Extend the random walk by , the filtration by a trivial , and the process by . Write . Each is -measurable and integrable, since . The next increment is independent of , so
Therefore . This is the exponential martingale of a biased simple random walk, with exponent . At , it is the constant process one. The endpoint cases or require separate definitions and are not covered by the printed ratio.
The Doob maximal inequality for a nonnegative submartingale states that, for a nonnegative submartingale and ,
For completeness, partition the crossing event according to its first crossing time . On that event , while . Summing the corresponding expectations over proves .
If , the exponential , with , is increasing as a function of . Apply the inequality to the martingale from part (a), with :
Letting and using continuity of probability measures on increasing events gives
The same event is obtained if the supremum excludes time zero, since . If , the right side is at least one and the bound is automatic; the nontrivial Doob maximal inequality argument is for .
For , let , including . It is a nonnegative integer-valued random variable, possibly infinite before the following estimate. The tail-sum formula for expectation and part (i) give
Thus , and the supremum is finite almost surely. The sum identity follows by writing and applying monotone convergence theorem. If the printed supremum is read literally over , its positive part has exactly the same positive-level tails and its negative part is bounded by one. The same upper bound on its expected value remains valid.
The increments have expected value . The strong law of large numbers for independent and identically distributed random variables with finite absolute mean gives
Hence . Since ,
Its expected value nevertheless stays equal to one. Thus this martingale is not uniformly integrable, and it does not converge to zero in . This distinction will be avoided in part (ii) by stopping at an upper level, which makes the stopped process bounded.
Let and be the first hitting time of level . Nearest-neighbour steps imply whenever : the walk cannot overshoot its first upward crossing. On this event the stopped martingale eventually has the constant value . On , it is and tends to zero by part (i). Therefore
For every , . Before the hit the walk is below , and at the hit it equals . The optional stopping theorem for the bounded stopping time gives . The dominated convergence theorem now yields . Consequently
The uniform bound on the stopped variables justifies the limit; applying optional stopping directly at the possibly infinite without this argument would not be valid.
Put and . For , , so part (ii) gives . Since , taking differences gives
This is the geometric distribution of parameter on the failures-before-first-success convention, with support . Its expected value is , so the bound in part (b)(ii) is attained. This proves the maximum of a downward-biased random walk formula.
The time-zero convention is necessary here. If , then the first step can be and the walk may never return to zero. Using the same hitting probability calculation after that step gives . Also , while its tails at positive remain . Its masses are therefore
Thus the printed geometric conclusion is correct for the standard maximum that includes , and false for a supremum restricted to the positive times.

Articles by others on the same topic (0)

There are currently no matching articles.