The printed assertion is false as a supremum bound uniform over shrinking bandwidths. The supplied hint proves a pointwise stochastic order with constants uniform in . Taking the supremum inside the probability changes the problem: a growing number of spatial windows produces a logarithmic cost. We first establish the valid consequence of the hint, then give a counterexample satisfying the printed assumptions.
For , let , and . The Invariant distribution of an Itô diffusion has a probability density function bounded above and bounded away from zero on the required compact interval. Choosing therefore gives constants such that , uniformly for and .
For the centered function , . Outside , . The given second-moment estimate and the Chebyshev inequality yield
On the event , the drift coefficient contributes an average whose error is at most , by Hölder continuity. The Itô isometry and stationarity give . Another use of the Chebyshev inequality proves
This also accounts for the zero-denominator convention through the first exceptional event. The bound proves pointwise , uniformly in the location's tail probabilities. It supplies no bound for the probability of a supremum over all locations.
For an explicit counterexample, take and the bounded globally Lipschitz function
It has Lipschitz constant , exponent , and satisfies the inward-drift conditions with , . The stochastic differential equation has a unique strong solution of a stochastic differential equation. Its Invariant distribution of an Itô diffusion has density
The exponent is zero on , equals when , and equals outside . This verifies integrability, positivity and a constant density on the central interval. Start the Itô diffusion in this Invariant distribution of an Itô diffusion to obtain the required stationary process.
Set and choose windows with centers , . Their intervals are disjoint and lie in , where the drift is zero. Write
Then whenever . The same occupation bound as above gives for . With , a union bound and the Chebyshev inequality imply
The quadratic variations are , and the cross quadratic covariations vanish since the windows are disjoint. Each clock tends to infinity almost surely: for any fixed window, the occupation estimate at times , followed by the Borel-Cantelli lemmas, gives . The Knight theorem for orthogonal martingales therefore represents using independent standard Brownian motions . This theorem is applied to the finite collection for each ; no growing-dimensional central limit theorem is being assumed.
On the preceding clock event, compare each time-changed Brownian motion with its value at deterministic time . The Brownian reflection principle and a union bound show that, for every fixed ,
This bound does not require the Brownian motions to be independent of their clocks. In particular, in probability. The variables are independent random variables. Their Gaussian maximum exceeds with probability tending to one: for , integration of the normal density over gives , and hence
Since on the clock event, it follows that, for some ,
But for this bandwidth. Thus the error after subtraction of and multiplication by is not bounded in probability, contradicting the printed stochastic order. The valid pointwise bound above is provable; the uniform shrinking-bandwidth assertion is not. This counterexample shows why a uniform rate needs at least a enlargement of the noise scale. If is instead held fixed and constants may depend on , this counterexample does not contradict that different interpretation.
For the simple random walk on the integer line, a return to the origin is possible only at an even time. At time , exactly of the increments must be , so the return probability is
The supplied factorial bounds, equivalently the order estimate in the Stirling formula, give
Consequently diverges. By the recurrence criterion by return probabilities, the origin is a recurrent state; translation invariance then makes the whole walk recurrent.
For three independent walks, the probability that all three are at the origin at time is
This P-series is convergent, so the first of the Borel-Cantelli lemmas says that simultaneous returns occur only finitely often with probability one. Therefore the requested probability is
The union bound gives . Taking the decreasing intersection proves the first Borel-Cantelli lemma.
If almost surely, then almost surely; dominated convergence theorem gives convergence of its expectation, hence convergence in probability.
If convergence in probability holds, any subsequence has a further one with . Borel-Cantelli then gives almost-sure convergence. Conversely, failure in probability supplies a subsequence with probabilities bounded below by some positive constant, and no further subsequence can converge almost surely because that would imply convergence in probability.
By Tonelli theorem for the nonnegative indicators,
If this is finite, then is finite almost surely: alternatively, Markov inequality gives
Since for every ,
This is the first Borel-Cantelli lemma.
If , part (b) gives
Thus almost surely. By the convention in the question, this occurs exactly when . Therefore
This is the second Borel-Cantelli lemma for independent events.
The strong law of large numbers states that for independent identically distributed integrable random variables,
To prove it, set . The tail-sum formula gives , so the Borel-Cantelli lemmas make the two sequences eventually equal. Also
The Kolmogorov convergence theorem implies that converges almost surely, and Kronecker lemma yields
Finally , so the Cesaro mean of these expectations tends to .
Write for the partial sum. Fix an integer . The tail-sum formula for expectation, applied to the nonnegative random variable , gives
because . The events are independent, so the second Borel--Cantelli lemma shows that infinitely often with probability one. Taking the countable intersection over yields
almost surely.
Now , and the triangle inequality gives
If the limit superior of were finite, the right-hand side would have finite limit superior, contradicting the preceding conclusion. Therefore
almost surely.
For with and , the given Reverse SLE derivative martingale starts from
It is a nonnegative local martingale and therefore a supermartingale. Since its second factor is at least one,
Choose
which is possible exactly because . At height , take a horizontal grid of spacing comparable to in . The Markov inequality gives, at each grid point,
There are grid points, so the probability that the bound fails anywhere on level is at most . These probabilities are summable. The Borel-Cantelli lemmas therefore give an almost surely finite random constant controlling every sufficiently fine grid, and enlarging it handles the finitely many remaining levels.
Every point of the half-rectangle lies within a fixed hyperbolic distance of one of these grid points at comparable height. The Koebe distortion theorem compares the two derivatives by a universal factor. Hence an almost surely finite random satisfies
for all and . This proves the Reverse SLE derivative bound above the space-filling threshold.
The Russo-Seymour-Welsh theorem and self-duality give a scale-independent such that every annulus
contains a closed circuit surrounding the origin with probability at least . Choose every second annulus so that the corresponding site sets are disjoint. Their circuit events are then independent, and the Borel-Cantelli lemmas say that infinitely many of them occur almost surely.
Every such closed circuit separates the origin from infinity, so the origin cannot belong to an infinite open cluster. By translation invariance, the same holds for every site. Since the triangular lattice is countable, a countable union shows that almost surely no infinite open cluster exists at .
  • If , then
    .
  • If the are independent and
    , then
    .
Let independent increments equal with probability and with probability . Then , so is a martingale. Since , the Borel-Cantelli lemmas say that only finitely many positive jumps occur almost surely. Thereafter every increment is , and hence almost surely.
Take and . Then , so is uniformly integrable and almost surely by the Borel-Cantelli lemmas. Independence and give
But the independent events have divergent probability sum, so the second Borel-Cantelli lemma makes them occur infinitely often. Thus these conditional expectations do not converge almost surely to zero.
Put . If in probability, then for ,
Taking the upper limit and then letting proves that the expectations tend to zero. Conversely,
so expectation convergence implies convergence in probability. This proves the bounded-metric characterization of convergence in probability.
For the subsequence assertion, choose so that
The first Borel-Cantelli lemmas then says that only finitely many of these events occur almost surely. Hence
eventually almost surely, and almost surely. This is the almost-sure subsequence from convergence in probability.
Here
for every , so in probability. On the other hand, the events are independent and
The second Borel-Cantelli lemmas gives
Thus cannot converge almost surely to zero. This independent rare-event counterexample to almost-sure convergence proves that convergence in probability need not imply almost-sure convergence of the full sequence.
Because is measurable for the cylinder sigma-algebra, membership in depends on only countably many coordinates . Its image in is a measurable linear subspace , and
By successively applying the finite-dimensional Gaussian regression formula, realize this Gaussian sequence as a lower-triangular linear transform of independent standard normal variables:
where every coordinate of the sum contains only finitely many terms. If some deterministic column does not belong to , then, after conditioning on every except , at most one value of can put the sum in . The continuous normal distribution gives probability zero. If every belongs to , changing finitely many does not change the membership event. It is then a tail event, and the Kolmogorov zero-one law gives probability zero or one. This proves the Gaussian zero-one law for measurable linear subspaces.
Now let for independent standard normal variables . Define
Both are cylinder-measurable infinite-dimensional linear subspaces. For every ,
so the Borel-Cantelli lemmas imply almost surely and hence . On the other hand, infinitely often almost surely, again by Borel-Cantelli, so
almost surely. Therefore .
For simple random walk on , , the Green-function decay for simple random walk on the integer lattice and the Strong Markov property give
The series over converges, so the first of the Borel-Cantelli lemmas says that almost surely only finitely many of the points are ever hit. Moreover, is a transient graph for , so each of those finitely many points is visited only finitely often. Therefore the simple random walk visits only finitely often almost surely:
The statements and proof are in Borel-Cantelli lemmas. For the first,
. For independent events in the divergent case,
and then let .