The Lévy continuity theorem states that if characteristic functions of probability distributions converge pointwise on to , and is continuous at zero, then is the characteristic function of a unique probability distribution and
Here the arrow denotes weak convergence of probability measures, equivalently convergence in distribution of associated random variables. Conversely, weak convergence of probability measures implies pointwise convergence of their characteristic functions to the characteristic function of the limit. The continuity-at-zero condition is essential to ensure that the pointwise limit is a characteristic function.
Taking in (c) and using that has no atom at gives
This is the distribution function of the Brownian first-passage time; (b) ensures that it is a proper probability distribution. Comparing these distribution functions gives the Brownian scaling identity for .
For an integer , set and successively hit the levels . The Strong Markov property at these finite stopping times and spatial translation imply that
are independent random variables, each with the probability distribution of . Thus, for independent copies ,
Therefore
The paper's definition is the strictly stable distribution convention, with no centering term, a special case of a stable distribution.
Let . Reflect at this stopping time, using the Brownian reflection principle from (a). Path continuity gives , and on this event the reflected endpoint is . Consequently
Since , an endpoint forces the reflected path to have hit by time . Reflection preserves the first hit of , so the condition is redundant on the right. As has the same probability distribution as , the joint distribution of Brownian motion and its running maximum satisfies
This argument includes ; at positive the boundary endpoint has zero probability under the normal distribution. At both sides vanish because .
For , the Brownian reflection principle at the first-passage time of gives the Brownian running maximum identity
where is the distribution function of the standard normal distribution. Indeed, reflection pairs paths that have reached and end below with paths ending above ; has no atom at .
As , this probability tends to one. The events increase with integer , so with probability one the path reaches in finite time. Taking a countable intersection over positive integer gives
Here . This also proves that every positive-level Brownian first-passage time is finite almost surely.
For a stopping time of a Brownian filtration, define the reflected stochastic process
The Brownian reflection at a stopping time form of the Brownian reflection principle states that is again standard Brownian motion. If , leave the path unchanged; the second branch is used only when .
For an almost surely finite , the Strong Markov property says that is a fresh Brownian motion independent of . Its negative has the same probability distribution, so reflecting the future preserves the full path probability distribution. Allowing follows by applying this argument to and restricting to each fixed finite time interval.
Fix an integer and consider the independent increments
For fixed these are independent and identically distributed random variables with the normal distribution , so . The second Borel-Cantelli lemma gives for infinitely many , almost surely. Intersecting these probability-one events over the countably many preserves probability one.
On any path in this intersection, uniform continuity on would give some such that whenever . Choosing with contradicts the existence of an increment . Therefore Brownian paths are not uniformly continuous on the half-line:
The event is measurable: for continuous paths, uniform continuity can be tested by countably many pairs of nonnegative rational numbers and tolerances . Brownian motion has uniform continuity on every compact time interval, but almost surely fails it on the whole half-line.
Put . By independence of the two Brownian motions, is a standard Brownian motion: its independent increments have the normal distribution with variance equal to elapsed time. The stopping time is the first time hits or .
To justify finiteness without presupposing the desired hitting probability, each unit-time increment of has the normal distribution . An increment of absolute value greater than forces exit from if the path was inside at its start. These independent increments give , where . Hence almost surely.
The stopped martingale lies in . The optional stopping theorem at gives , and the bounded convergence theorem gives . Writing , path continuity gives . Therefore, as in Brownian exit from an interval,
For any finite list , the random vector has a multivariate normal distribution, since it is a linear image of a vector of Brownian motion coordinates. The Brownian covariance kernel and linearity of covariance give
The independence of uncorrelated jointly normal variables implies that is independent of . Extending from finite-coordinate cylinder events by independence extended from generating pi-systems proves
Thus the Brownian bridge is independent of its endpoint. Its covariance kernel is , confirming that is the standard Brownian bridge. This is the Brownian bridge independence from its endpoint property.
A standard one-dimensional Brownian motion is a real-valued stochastic process satisfying almost surely, having continuous paths almost surely, and having independent increments with
Here is the normal distribution with zero expected value and variance . Thus the increments are also stationary increments.
If Brownian motion is defined relative to a specified filtration , additionally require that it is an adapted process and that is independent of . For its natural filtration, this follows from independent increments. These are the defining properties of standard Brownian motion.
Split the adjacent products into two subsequences:
Within each subsequence the pairs use disjoint coordinates, so each subsequence consists of independent and identically distributed random variables. The two subsequences need not be independent of each other. By independence within a pair,
Apply the strong law of large numbers from (c) separately to obtain and simultaneously almost surely. Since
and both prefactors tend to , the strong law for adjacent products gives
The sigma-algebras decrease with , and (b) gives . The permitted reverse martingale convergence theorem therefore gives an integrable random variable such that almost surely and with convergence in L1. In particular,
It remains to prove that is constant. We must not assume that is the tail sigma-algebra of the ; instead use tail measurability of limits of sample averages directly. Define the random variable valued in the extended real numbers . For every fixed ,
because pointwise. Thus is measurable with respect to for every , and hence to the tail sigma-algebra. Also almost surely.
By the Kolmogorov zero-one law, each tail event , for a rational number , has probability zero or one. Since is finite almost surely, its distribution function can only be that of a constant : taking and using the density of the rational numbers gives almost surely. Its expected value identifies . This proves the strong law of large numbers:
Let . Since ,
Permuting preserves their joint probability distribution and leaves every generator of unchanged. Therefore, for each bounded -measurable ,
This is the symmetry of exchangeable random variables. By the defining identity of conditional expectation, all are equal almost surely. Summing these conditional expectations and using that is -measurable gives
Hence the conditional expectation of a summand given future partial sums is
The integrability of each justifies every conditional expectation above.
The tail sigma-algebra is
Its events depend only on arbitrarily late coordinates. The Kolmogorov zero-one law states that for a sequence of independent random variables, every tail event has probability zero or one:
Identical probability distributions and integrability are not required for the Kolmogorov zero-one law.
Write and . Since is a stopping time, . The Tonelli theorem, conditional expectation, and (c)'s tail-sum formula for expectation yield
Thus is an integrable random variable. Since , telescoping gives and . The dominated convergence theorem gives , so (b) gives uniform integrability of the stopped martingale.
The optional stopping theorem at the bounded stopping time gives . Passing to the limit using the convergence in L1 proved in (b),
One can also pass directly by the dominated convergence theorem, since .
Pointwise, an integer-valued nonnegative random variable has the representation
when , exactly the terms equal one. Applying the Tonelli theorem, or the monotone convergence theorem to the finite sums of indicator random variables, gives the tail-sum formula for expectation
Both sides may be infinite; no integrability assumption is necessary.
The original PDF has and . The TeX transcription drops the expected value and absolute value in the first condition, and the absolute value in the second. The proof uses the PDF's conditions.
Because the stopping time is finite almost surely, almost surely. More strongly,
The first term tends to zero by hypothesis; the second does so by the dominated convergence theorem. Thus there is convergence in L1.
Here is the needed L1 convergence implies uniform integrability argument. For any integrable random variables and , splitting according to gives
Take and . For large , the first term is uniformly small by convergence in L1, and the second is small for large by integrability. The finitely many remaining are handled individually by integrability. Hence the stopped process is uniformly integrable. This proves the stopped-martingale uniform integrability criterion; the martingale assumption is not needed for this particular implication.
A sequence of integrable random variables has uniform integrability exactly when
The uniformly integrable martingale convergence theorem states that a uniformly integrable discrete-time martingale has an integrable random variable with
Indeed, uniform integrability implies , so the martingale convergence theorem gives almost sure convergence. The combination of uniform integrability and almost sure convergence gives convergence in L1. For , the martingale identity passes to the limit by the L1 contraction of conditional expectation.
Let be independent and identically distributed random variables with the fair Bernoulli distribution, and put
Relative to , this fair-coin doubling martingale satisfies : while alive it doubles with probability and becomes zero otherwise. Its expected value is .
The probability of an infinite run of ones is , so is eventually zero almost surely. However,
Thus the martingale lacks convergence in L1 to its limit from almost sure convergence. Nor can it have convergence in L1 to any other limit: convergence in L1 implies convergence in probability, whose limit is unique up to almost sure equality.
Set and . The independence and zero expected values give , so is a martingale. The variance additivity for independent random variables gives
The Cauchy-Schwarz inequality implies . Applying the martingale convergence theorem from (b),
In fact the L2 martingale convergence theorem also gives convergence in L2. Independently, for the same variance additivity for independent random variables yields , confirming that the partial sums form a Cauchy sequence in .
The martingale convergence theorem says that if a discrete-time martingale satisfies , then there is an integrable random variable such that
The hypothesis does not by itself ensure convergence in L1.
For each pair of rational numbers , the Doob upcrossing inequality gives . The monotone convergence theorem therefore gives a finite expected value for , so this upcrossing count is finite almost surely. There are only countably many such pairs, hence all their upcrossing counts are simultaneously finite outside one event of probability zero.
If , the density of the rational numbers supplies strictly between them, forcing infinitely many upcrossings. Consequently has a limit in the extended real numbers almost surely. By the Fatou lemma,
A limit of either or would make this lower limit infinite, so the limit is finite almost surely, and the same inequality proves its integrability.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact