Let be an integrable real submartingale, and put . The refined Doob maximal inequality is
In particular, for a nonnegative submartingale the right-hand side is at most , giving the usual weak maximal bound.
For the proof, partition by its first crossing time: . The submartingale property gives , so
Summing over the disjoint crossing events proves the refined inequality, including a possible crossing at time zero. No independence assumption is needed.
The strong form is the Doob Lp maximal inequality. For and a nonnegative submartingale with ,
Indeed, integrate the refined inequality against up to . The tail integral formula for moments and the Tonelli theorem give
Apply the Holder inequality, divide by when it is nonzero, and let by the monotone convergence theorem. For a martingale , the process is a submartingale by the conditional Jensen inequality, giving the corresponding bound for . On a bounded continuous-time interval the nonnegative, right-continuous version follows by applying these inequalities on refining finite time grids and taking limits.
Use and . Independence and zero means imply , so the partial sums form a square-integrable martingale. More explicitly,
Thus is a nonnegative submartingale. The Doob maximal inequality at threshold now proves the Kolmogorov maximal inequality:
Finally, expanding the terminal square and using independence and the zero means gives . Identical distributions are not required.
Put . For , the process is a nonnegative submartingale, by the conditional Jensen inequality. A crossing of by implies a crossing of by this squared process. Since , the Doob maximal inequality gives
For , differentiation of the last expression gives , so its minimum over occurs at . Substitution proves the one-sided martingale maximal inequality
If , then almost surely and for every , so the same conclusion holds. The constant is sharp: at one step take with probability and otherwise. This has mean zero, variance , and achieves equality.
Finite second moment implies . For near any positive , the derivative of is bounded in absolute value by , provided the neighbourhood stays in . The dominated convergence theorem therefore permits differentiation under the expectation:
For the expansion, put . Taylor expansion gives as . Also, for ,
The inequalities follow by integrating from zero to . Consequently pointwise and its absolute value is bounded by . Another application of the dominated convergence theorem gives the second-moment expansion of a Laplace transform:
No third moment is needed for the remainder estimate.
First the exit time has sufficiently many finite moments. Over any interval of length , a Brownian motion increment has probability of absolute size larger than . If the process is still inside , such an increment forces it to exit before the next interval endpoint. Independence of increments at deterministic times therefore gives
Thus almost surely and all its positive moments are finite. This justifies extracting moments from its transform rather than presupposing them.
For , put . The process
is a martingale, being the average of two exponential martingales for Brownian motion. Apply the optional stopping theorem at the bounded time . Since , the stopped values are bounded by . Continuity gives . Letting by the dominated convergence theorem yields
Hence the Laplace transform of symmetric Brownian interval-exit time is
The value at zero follows from almost-sure finiteness. Expanding the reciprocal gives
Compare with part (a), now applicable because of the geometric tail bound. The Brownian symmetric interval-exit moments are
Use the natural filtration . Define the deterministic tail and put . This is nonnegative and integrable. Since ,
Thus the deterministic summable drift correction produces a nonnegative supermartingale. The almost sure supermartingale convergence theorem gives a finite limit almost surely. Its finiteness is also reflected in the bound and Fatou's lemma, which gives . The convergence theorem follows from the upcrossing argument: bounded expected negative parts of rule out infinitely many crossings of rational intervals, and the expectation bound excludes an infinite limit.
Since , the required conclusion is . The original sequence need not itself be a supermartingale; subtracting the vanishing deterministic tail recovers it from one that is.
Set . Since each is -measurable, the event
is in , so is a stopping time. The stopped predictable budget for adapted increments is , for .
If , the sum before the overshooting increment is . If , the sum through time is at most , and in particular . Thus
The process is adapted, and boundedness gives integrability even when the increments have no finite expectations. Directly from the one-step-lagged sum,
This decrement is -measurable, and . Therefore
Hence is a nonnegative supermartingale; in fact its paths are nonincreasing. At time zero one may set and ; then too. Stopping the sum including would lose nonnegativity, which is why the shifted definition of matters.
Work from time one; a finite initial prefix does not affect convergence. Fix a positive integer , and use the stopping time and budget from part (b). Define
It is nonnegative. For each finite , the stopped variable is integrable: it is bounded by the finite sum , and the budget is bounded by .
The stopped increment of is
Taking conditional expectations, the assumed drift bound gives
The last term is bounded by ; no integrability assumption on the unlocalized has been used. Its contribution is exactly cancelled by the budget decrement from part (b), giving
Thus is an integrable nonnegative supermartingale. By the almost sure supermartingale convergence theorem it has a finite almost-sure limit. The bounded decreasing budget has a finite pathwise limit as well, so converges to a finite limit almost surely.
Take the intersection of these probability-one convergence events over all positive integers . On the further probability-one event , choose an integer strictly larger than that total. Then , so the stopped sequence is the original one. Consequently
This proves supermartingale convergence with summable adapted drift under almost-sure summability alone; it does not require .
Here is the one-parameter Kolmogorov continuity theorem. Suppose a real-valued stochastic process on satisfies, for some , and finite ,
Then it has a continuous modification of a stochastic process whose paths are Hölder continuous of every positive exponent . A modification means equality almost surely at each fixed time, not an a priori simultaneous equality at all times. Other compact time intervals follow by rescaling; the vector-valued version uses a norm in place of absolute value.
For the proof fix and use the dyadic grids . Let be the largest adjacent increment on this grid. The union bound and Markov inequality give
The right-hand side is summable. The Borel-Cantelli first lemma shows that, outside a null set, an almost-surely finite random constant can absorb the finitely many early grids so that
We now use dyadic increment chaining. For two distinct dyadic points , choose with . Approximate them from below by , for . Each refinement moves by zero or one grid step, while are at most two grid steps apart. The sequences eventually equal the original dyadic points. Telescoping gives
where a deterministic finite absorbs the geometric series and . Thus the sample function on the dense union of dyadic grids has a unique Hölder-continuous extension to . Define this extension to be on the probability-one event, and set it to zero on the exceptional null set.
For a fixed , take dyadic . The moment condition gives in probability, while the constructed extension gives almost surely. Uniqueness of a probability limit yields almost surely. This proves the required modification property. Performing the argument for a countable increasing sequence of exponents tending to gives one version with all smaller positive Hölder exponents, since its extensions agree on the dyadic points.
For Brownian motion, Gaussian increments give, for any integer ,
Use and . The theorem gives every exponent . For any , choose large enough. Intersect probability-one events over integer and compact intervals to obtain
The usual continuous Brownian version has the same property: its continuous paths agree with the constructed version on a countable dense set and hence everywhere, outside one null set. The Hölder constant depends on the compact interval. This is the precise local meaning of Brownian Hölder regularity; it is not a uniform Hölder bound on the entire unbounded time axis.
The force from one location is defined almost surely, since the uniform distribution assigns probability zero to the origin. Symmetry of that uniform distribution makes its characteristic function real:
Near zero the integrand is bounded by . For large it is at most . The monotone convergence theorem therefore gives the finite integral
Independence of the locations gives the characteristic function of the total force as . For fixed , is bounded, so Taylor expansion of the logarithm gives
The logarithm is legitimate for all sufficiently large .
For , substitute . The cosine integral for a symmetric stable exponent, evaluated directly in part (b), gives
At both sides vanish. The limiting characteristic function is continuous at zero, so the Lévy continuity theorem proves weak convergence of random variables to the symmetric stable distribution of index with
The coefficient reflects the spatial density . Symmetry was used in the characteristic function, without assuming that the singular force has a finite mean.
Interpret the signed inverse-power force as , so noninteger is meaningful on either side of the origin. Write . Exactly as in part (a), the one-star characteristic function is , where
The integrand is bounded near zero and is at most at infinity. The condition thus makes its integral finite. Independence and the logarithm calculation in part (a) give the limiting characteristic function , with
Here we substituted . The integral for is finite because its integrand is at zero and at infinity.
To determine the constant rather than leave it as an unevaluated integral, use the Gamma function representation
The integrand multiplied by is nonnegative, so the Tonelli theorem permits exchanging the integrals. For the inner integral is
Consequently, substituting and using the Euler beta function and Gamma reflection formula,
Since , this gives
Every factor in is positive in the stated range. The Lévy continuity theorem gives weak convergence of random variables because this characteristic function is continuous at zero. The limit is strictly stable: if are independent copies of it, the characteristic function of is
which is the characteristic function of . This proves the asserted index, as well as identifying the symmetric stable distribution. In particular gives , while gives , the centered Cauchy distribution with that scale.
Condition on the number of stars. The independence assumptions give , with the inverse-square one-star characteristic function from part (a). Averaging over the Poisson distribution therefore gives the compound Poisson distribution formula directly:
Since , the Lévy continuity theorem gives exactly the same weak convergence of random variables as in part (a):
The random number of stars introduces no additional limiting term: its effect is already contained in the exact exponential formula. This is the symmetric inverse-power Poisson field on a line at spatial intensity and exponent .
For , the triangle inequality and the union bound give
Thus . This proves closure of convergence in probability under addition. No independence is needed; the random variables are compared on their given common probability space.
Take a random variable with the Rademacher distribution, and set
Both marginal distributions equal the law of for every . Hence and each have weak convergence of random variables to ; one may take on this probability space. But their sums alternate:
Indeed, at their characteristic functions are for even and for odd , so the sums have no weak limit at all. Separate marginal weak convergence does not imply convergence of the sum. The marginal weak convergence does not control sums counterexample changes the dependence while leaving the marginals fixed. Unlike convergence in probability, separate marginal weak convergence of random variables contains no information about the joint coupling.
Write the constant limit as . First, convergence in distribution to a constant implies convergence in probability: the Portmanteau theorem applied to the closed set gives
Now compare characteristic functions without imposing independence. For fixed ,
The second bound uses . By convergence in probability, the limiting upper bound is ; then let . Meanwhile has weak convergence of random variables to , so . Thus the characteristic function of the sum tends to , the characteristic function of , which is continuous at zero. The Lévy continuity theorem proves
This is the additive case of the Slutsky theorem, with its proof supplied. The constant limiting marginal removes the dependence obstruction in part (b).

Articles by others on the same topic (0)

There are currently no matching articles.