Use the natural filtration . The first exit time is a stopping time. If , it is zero, so its expectation is already finite. Now assume .
The positive-increment hypothesis gives a number with . Choose an integer so large that , and put . A block of increments all exceeding has probability . From any point still in , that block forces an upper exit before the block ends.
By independence, conditional on and survival to time , the next block has this same probability. Thus the geometric tail bound from a uniform escape probability gives
Using the tail-sum formula for the expected value of a nonnegative integer-valued random variable,
This is the random-walk exit bound from a positive-increment block. In particular, the exit occurs with probability one. The mean-zero assumption is not needed for this first bound.
For , the exit time is at least one. Since , this event is independent of . The Tonelli theorem gives
Therefore the integrability of a stopped random-walk increment bound is
It is the survival event, not the exit-at- event, that is independent of the next increment. The selected exit increment need not have the same distribution or mean as .
For , the printed variable is undefined because the increment sequence starts at one. Either restrict this part to , or make the harmless additional convention . With that convention the conclusion also holds in the immediate-exit case. The integrability assertion needs this indexing qualification.
The random walk is a martingale, since its integrable increments are independent of the past and have mean zero. For the bounded stopping time , the bounded optional stopping theorem, proved in the next question, gives .
If , the value immediately before exit lies in , so
Before exit the stopped value has absolute value less than , and after exit it equals . Consequently for every . This is an integrable dominating random variable by the preceding part. Since with probability one, the dominated convergence theorem gives
For , directly, without any convention about . Thus the expected stopped position is well-defined and has the stated value for every .
The conditional expectation is a -measurable integrable random variable such that
It is defined up to almost sure equality. Measurability with respect to the sub-sigma-algebra and equality of these integrals are both essential: the first expresses that only the information in is retained, and the second preserves all averages visible through that information. Existence follows from the Radon-Nikodym theorem; uniqueness is up to sets of probability zero.
Let for a deterministic integer . The stopped martingale has the finite-sum representation
Each summand is integrable, and by the stopping time property. Therefore the conditional expectation identity for a martingale gives
Taking expectations in the finite sum proves the bounded optional stopping theorem:
No limiting argument or uniform-integrability assumption is needed for a bounded stopping time.
For the real-valued variables here, take a -measurable version of . Since the variables are bounded, the conditional expectation defining identity extends to the bounded -measurable multiplier , giving
The equality case for conditional second moments now gives
A nonnegative random variable with zero expectation vanishes with probability one. Thus as an almost sure equality. The same proof works for square-integrable variables; boundedness is more than is needed.
The bounded optional stopping theorem gives . Decompose the difference from the terminal value:
Consequently
The first term tends to zero by hypothesis. The second tends to zero by the dominated convergence theorem, because is integrable and is finite with probability one. Thus the stopped martingale converges to with convergence in L1, which permits passage of expectations to the limit:
The explicit tail condition supplies exactly the missing control for an unbounded stopping time.
First prove the strong law for Brownian motion, with probability one. For each , the Gaussian tail bound gives
By stationary increments and the Brownian reflection principle, followed by the same tail bound,
Both bounds are summable in . The First Borel-Cantelli lemma therefore implies that, eventually, both quantities inside these probability events are at most . For this gives . Intersect over a sequence of positive rational tending to zero to obtain the asserted continuous-time limit.
On this one almost sure event,
so for and to for . For each real , the path is eventually strictly on the corresponding side of . Hence
The same event works simultaneously for all levels , giving the requested transience of Brownian motion with drift.
For , write for the standard normal distribution function. Since the Brownian running maximum is nonnegative, gives simply .
For and , reflect the Brownian motion after its first hit of . This is a stopping time, and the Strong Markov property together with symmetry of Brownian increments shows that reflection preserves its law. On paths that hit , it sends the endpoint to . Thus the event with endpoint at most maps to endpoints at least , all of which necessarily hit . This proves
The same reflection gives . If , every path with has hit , so subtracting that endpoint tail gives the complete answer:
The expressions agree at . This is the joint distribution of Brownian motion and its running maximum. In particular has the distribution of and has no atoms for . If , the pair is deterministically, so the requested probability is .
Continuity ensures that the maximum on is attained, so its first attainment time lies in . To exclude the endpoint, use Brownian time reversal on a finite interval:
This is a standard Brownian motion on this interval. Indeed, its increments are increments of on disjoint intervals taken in reverse order, hence are independent centered normal variables with the required variances, and its paths are continuous.
If is the maximum, then for every . But by the Brownian reflection principle and symmetry,
the running maximum of has the distribution of , whose probability of being zero is zero. In particular the event has probability zero. Thus with probability one. Uniqueness of the maximizing time is not needed for this proof.
Put . Because is the maximum on ,
The preceding part makes this a strictly positive random interval with probability one. A standard Brownian motion cannot have this path property. For each deterministic , the Brownian reflection principle gives . Taking the countable union over shows that the probability of staying nonpositive on any initial interval of positive length is zero.
Therefore is not a Brownian motion. This is the obstruction for Brownian motion shifted at its finite-horizon maximum. It concerns its path law, irrespective of any proposed filtration for the shifted process.
Fix . The event means that the future path through time one never exceeds the maximum already attained by time . Given , future increments form an independent Brownian motion , so
Here the Brownian running maximum distribution is the one derived above. On , an event of probability , the finite quantity is strictly positive, so this conditional probability lies strictly between zero and one.
If were a stopping time, would be -measurable, and the displayed conditional expectation of its indicator would equal that indicator, taking only zero and one. The contradiction proves is not an -stopping time. Thus the Strong Markov property cannot be invoked at to assert a Brownian shifted process; the direct argument here does not assume that property at this random time.
Use the Kolmogorov continuity theorem in its one-parameter form: if on a compact interval a process satisfies for some , it has a modification whose paths are Hölder continuous of every order on that interval.
For Brownian motion, normal increments give, for every ,
Every such normal moment is finite. Taking yields , hence any order below . For a prescribed , choose with .
The continuous modification and the given continuous Brownian motion agree at all rational times on one almost sure event; continuity makes them agree everywhere on the interval. To obtain all exponents and all compact intervals simultaneously, apply the theorem to integer intervals and a countable sequence of positive exponents increasing to , then intersect these almost sure events. A bound at exponent implies a bound at on a compact interval. Consequently the Brownian Hölder regularity conclusion is
with finite random constants on one common event of probability one. This uses the usual positive-exponent meaning of Hölder continuity.
A finite right derivative at zero would make the difference quotients eventually bounded. Therefore that event is contained in
For fixed , its probability is at most for each . By the normal distribution of the Brownian increment,
Thus every event in this countable union has probability zero. With probability one, Brownian motion has no finite right derivative at zero, which is the appropriate derivative for its time domain. No independence of the quotients is assumed or needed. This proves the required endpoint case of nowhere differentiability of Brownian motion.
Fix rational . Divide into equal intervals. Its Brownian increments are independent centered normal variables, so the probability that all are nonnegative is . A nondecreasing path would force this event for every , hence its probability is zero. The same argument with nonpositive increments excludes a nonincreasing path.
There are countably many rational pairs , so with probability one none of these intervals supports a monotone path. Every real interval contains such a rational subinterval. Monotonicity on the larger interval would imply monotonicity on that subinterval, a contradiction. Thus the nowhere monotonicity of Brownian motion assertion holds simultaneously:
Both nondecreasing and nonincreasing behavior, including a constant path segment, are excluded.
Use the Donsker invariance principle: for independent and identically distributed random variables of mean zero and variance one, the linearly interpolated processes with converge in distribution to standard Brownian motion in with the uniform topology. No moment beyond the finite second moment is required.
The maximum functional is continuous, since . A linear function on each interpolation interval has its maximum at an endpoint, so . The continuous mapping theorem therefore gives
By the Brownian reflection principle, the limiting random variable has the distribution of , . Its distribution function is continuous and has no atom at any , so convergence in distribution permits passage to these tail probabilities. Hence
At the left side is exactly one for every , because is included in the maximum, and the right side is also one.
A real Lévy process starts at zero with probability one, has stationary increments and independent increments, is stochastically continuous, and is taken in its càdlàg version. Stationarity means has the law of ; independence means increments over disjoint ordered time intervals are independent. Stochastic continuity means in probability as . One can equivalently impose starting at zero, stationary independent increments and stochastic continuity first, and then take a càdlàg modification.
A Poisson random measure with sigma-finite intensity on a measurable space is a countably additive integer-valued random measure such that has Poisson distribution with parameter whenever , and counts on disjoint measurable sets are independent. A set of infinite intensity has infinite count with probability one. For jump processes the space is often time times a mark space, with intensity . These conditions specify both the marginal count laws and their joint independence.
Let , where the two Lévy processes are independent as processes. For any disjoint ordered time intervals, the increment vectors of and are independent of one another, and each vector has independent coordinates. Thus the pairs of corresponding increments are independent across intervals, and so are their sums. The law of each summed increment is the convolution of the two increment laws, depending only on the interval length. This proves independent increments and stationary increments for .
Also , and for every ,
Thus is stochastically continuous. The sum of two càdlàg functions is càdlàg. All defining properties hold, so is a Lévy process. Independence of the entire two processes, not merely equality of some one-time laws, is what supplies independent summed increments.
For , use the continuous logarithm of the characteristic function, normalized to zero at , to write
Thus the deterministic drift is . In particular the last contribution is not the negative drift of a compensated unit-jump process.
Take a Poisson random measure on with intensity
Define the jump marks , , and . A realization with the required process law is the Poisson stochastic integral with finite intensity
where the three counts are independent Poisson processes of rates . Their characteristic functions multiply to
which is exactly the given expression. The constructed process is a Lévy process, and stationary independent increments make its entire finite-dimensional law determined by these one-time characteristic functions. This gives a representation in law of the specified process.
Equivalently, using its nonzero-jump measure, the Lévy measure is
and the unmarked representation is with intensity . The finite-jump case of the Lévy–Itô decomposition realizes this pathwise using the jump measure of a version of ; the integral is an uncompensated finite sum.
The atomic compound Poisson process with drift has càdlàg paths with finitely many nonzero jumps on every bounded time interval, linear slope between jumps, and no Brownian component. When , jumps of sizes occur at the stated rates; when , positive unit-jump rates combine to . When , the two symmetric marks have zero effect and are omitted from the Lévy measure; the process reduces to , so has no effect. If the paths are piecewise constant, and if also they are identically zero. All paths have finite variation on bounded intervals. As a check on the drift sign,

Articles by others on the same topic (0)

There are currently no matching articles.