A real-valued random variable is a measurable function : equivalently, for every real .
For the asserted inequality is equality. For , let . If , the inequality is automatic. Otherwise Hölder's inequality on the probability space gives
Thus , using that the total measure is one.
Let have the uniform distribution on , set , and take . The variable is finite almost surely, so almost surely. For any and all sufficiently large ,
The harmonic series diverges, so
This dependent sequence fails complete convergence. All its members are scalar multiples of the same nonconstant random variable, which explains why the independence hypothesis cannot be dropped.
Suppose first that complete convergence holds. For each positive integer , apply the First Borel-Cantelli lemma to . Outside a countable union of null events, only finitely many of these exceedances occur for every . This is almost sure convergence, with no independence assumption.
For the converse, an important point is that independence of does not immediately imply independence of . Instead use the fact that an almost-sure limit of independent random variables is constant. Indeed, is measurable for the tail sigma-algebra. The Kolmogorov zero-one law makes each event , , have probability zero or one. Since almost surely and is finite, these probabilities form the distribution function of a point mass: there is a finite constant with almost surely.
Now are independent events. Almost sure convergence says that their infinitely-often event has probability zero. The contrapositive of the Second Borel-Cantelli lemma gives
Replacing by the almost surely equal leaves each probability unchanged. Thus complete convergence and almost sure convergence are equivalent for independent sequences.
By convergence in probability, choose recursively so that
The corresponding events have a summable sequence of probabilities. The First Borel-Cantelli lemma, which requires no independence, therefore makes the probability of infinitely many of them zero. On the complementary event, for all sufficiently large , proving
The recursively chosen indices are strictly increasing and hence tend to infinity.
Independent random variables satisfy, for every finite selection of distinct indices and Borel sets ,
The Second Borel-Cantelli lemma says that if events are independent and , then
Here is the event that infinitely many of the occur.
Fix and use the indicator random variables . Almost sure convergence gives almost surely, while . The Reverse Fatou lemma states that for random variables bounded above by an integrable random variable,
It follows that
Since was arbitrary, this proves convergence in probability. The integrable upper bound is essential to the application of the Reverse Fatou lemma.
The difference between the high-strike and low-strike put payoffs satisfies
If its price were negative, buying the nonnegative-payoff spread would generate an arbitrage. If its price exceeded the discounted maximum payoff, selling it and buying a bond for that maximum would generate an arbitrage. Thus the sharper inequality is
For the positive-rate convention of the paper this implies the printed upper bound . If rates were allowed to be negative, the undiscounted upper bound need not hold; the discounted bound is the correct rate-independent statement. This distinction is about the stated financial assumptions, not a change to the transcribed inequality.
A stock share plus a put has terminal value . If , buy that package and borrow the price of a bond paying . The package covers the debt at maturity, while the strictly positive initial surplus can be invested. This would be an arbitrage. Consequently
Together with payoff nonnegativity, the lower bound can be strengthened to the maximum of this expression and zero.
The terminal put payoff obeys . If the put cost more than the zero-coupon bond paying , sell the put and buy that bond. Invest the strictly positive initial difference in the bank account. At maturity the bond covers every possible put liability and the extra investment remains positive. This arbitrage is excluded, so
If is continuous at , choose a small interval on which . The triangle inequality makes its oscillation less than , so .
Conversely, if , then for every some has . As itself belongs to the interval used in that supremum, for . Thus is continuous at .
The continuity set of a function is therefore
Each set in the intersection is open by part (i), so this is a G-delta set and in particular a Borel set, even if itself is not measurable.
Boundedness of makes finite and nonnegative. Suppose . By its infimum definition, some satisfies . If , then
The supremum over the smaller interval cannot exceed that over the larger one. Hence
Thus is open for every , proving is upper semicontinuous. Measurability of the original was never needed: these are purely pointwise oscillation bounds.
For a lower semicontinuous function, each upper-ray inverse image is open, hence Borel, so part (a)(i) applies directly. For an upper semicontinuous , the function is lower semicontinuous because
is open. Negation is continuous and Borel measurable, so is Borel measurable too. Thus both semicontinuity classes are Borel measurable.
Every open interval is Borel, since , omitting empty pieces. Open subsets of the line are countable unions of open intervals and hence Borel. Conversely, each half-open interval is obtained from open sets by sigma-algebra operations, so this is the usual Borel sigma-algebra.
A continuous function has open, and therefore Borel, inverse images of open sets. Since open sets generate the target Borel sigma-algebra, it is a Borel measurable function. A discontinuous example is , whose only level sets are built from the Borel half-lines; it jumps at zero.
A Borel measurable function has for every Borel set . Thus the upper-ray condition is necessary.
For sufficiency, note that the rays generate the stipulated sigma-algebra: , and , with integer . The family
is a sigma-algebra because inverse images preserve complements and countable unions. If it contains all upper rays, it contains their generated Borel sigma-algebra. Therefore upper-ray preimages suffice to prove Borel measurability.
In any proposed decomposition, is integrable. Its increment is -measurable by predictability. Taking conditional expectation of the difference equation gives
The martingale increment has conditional mean zero, and a measurable integrable variable equals its own conditional expectation. Starting from , summation gives . Hence . Thus the normalized predictable decomposition is unique, with a common probability-one event available for all integer times by countability.
The process is adapted and integrable. Since is already -measurable,
Therefore is a martingale, and is the Doob decomposition in discrete time. Its normalization is , so the initial value is included in .
The supermartingale property and linearity of conditional expectation give, for ,
Each is integrable and -measurable, while . Thus is integrable and
Moreover, all terms , , are -measurable, so . This is predictability of the decreasing component in the Doob decomposition theorem.
A martingale is an adapted process with for every and
Adaptedness means that is -measurable. Iterating the tower property gives the analogous identity for any two deterministic times .
Let be two versions. For every , their defining identities imply . The set belongs to , and therefore
Every is null. Their union is , so it too is null. Reversing proves the same for . Hence versions of conditional expectation are equal almost surely.

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