Apply part (a) under the risk-neutral log-price drift , integrate the maximum and minimum tails using the supplied identities, and simplify the two exponential moments. Fubini then identifies the residual term as . Discounted expectations on both sides give exactly the stated pricing identity.
Under the risk-neutral measure, . Therefore .
Under zero drift, reflection gives the maximum tail. Cameron-Martin changes from Brownian motion to drift , weighting reflected paths by , and yields .
For , . Thus , with the stated length. Substitution (or elementary algebra) verifies it is at most the bound in part (d).
Integrating gives . Risk at the endpoints implies , so the left side is at least . Hence .
Combining the risk assumption with Cramér-Rao bound gives . Taking the branch compatible with super-efficiency yields , equivalent to the displayed sharper pointwise inequality.
. The biased Cramér-Rao bound bound is .
Mark a virus at distance if its uniform radius exceeds , with probability . Marked Poisson thinning gives a Poisson count with mean
A Poisson point process of intensity has independent counts on disjoint Borel sets, with whenever the integral is finite.
Again the series converges absolutely. has the Cantor distribution. Every particular digit sequence has probability zero, so it has no atoms; its support is the Cantor set, which has Lebesgue measure zero, so it cannot have a Lebesgue density.
Absolute convergence gives almost surely. Put . Then . Independent fair binary digits make the sum uniform on , so is uniform on .
Characteristic-function convergence theorem says iff for all , where the limiting function is continuous at zero.
means for every bounded continuous , equivalently convergence of distribution functions at continuity points of .
Define by . On , the vertical derivative in direction is , so 1 is regular. Since , the preimage theorem makes the unit tangent bundle a 3-manifold.
A value is regular when is surjective for every . The preimage theorem says is then a submanifold of dimension .

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