Complements are relative to the same universal set . Suppose and . Then and . If belonged to , the assumed set inclusion would imply , a contradiction. Thus and , proving
There is only one set inclusion in this conclusion; a reverse inclusion is neither needed nor generally true. The request for double inclusion applies to the equalities in (i) and (ii).
For the first set inclusion, take . Membership in the intersection gives and , while the set difference gives . Consequently .
For the reverse set inclusion, an element of belongs to both and and does not belong to . It therefore belongs to . By double inclusion proof,
We prove both set inclusions, as required by a double inclusion proof. If , then and . Thus and , so and . This proves the forward set inclusion.
Conversely, if , then , , and . Hence , giving . Therefore
For any real , put . Since is integer-valued,
Continuity of the cumulative distribution function of therefore gives
The strict inequality matters before using the absence of point masses. The resulting probability distribution is discrete, with probability mass function
Thus has no ordinary probability density function with respect to length on the real line. Its cumulative distribution function is a step function; its derivative is zero almost everywhere and does not recover its probabilities. The floor function has converted a density into masses on the integers.
Since a square is nonnegative, for . For , the event is . As has no point masses,
Differentiating for gives the contributions of the two inverse branches:
The value assigned to the probability density function at is arbitrary. It can be unbounded near , but there is no atom there because . Both positive and negative preimages must be included; keeping just one would generally lose probability.
Reversing sign reverses the inequality. Since has a probability density function, it has no point masses, so
Differentiating the cumulative distribution function gives
almost everywhere: the minus sign outside cancels the minus sign from the chain rule. If point masses were allowed, the cumulative distribution function would instead require the left limit .
Let for . Since on the negative half-line, almost surely. We have almost everywhere. On a finite interval, integration by parts gives
The lower endpoint contributes zero. The stated hypothesis gives as . Taking the increasing limits of the two nonnegative integrals proves the tail-integral identity
The equality allows the value ; the boundary hypothesis alone does not force a finite expectation. In fact the formula for nonnegative also follows directly from Tonelli theorem, without that additional boundary hypothesis, by integrating against the probability density function.
For an absolutely continuous probability distribution, its expectation is
This is finite when . More generally it is an extended real value if only one of the positive and negative parts diverges; it is undefined if both diverge. For nonnegative it always exists in .
The cumulative distribution function is
For an absolutely continuous probability distribution, the probability density function is a nonnegative integrable function with
Thus interval probabilities are integrals of , and almost everywhere, in particular at continuity points of .
The word “continuous” in the source is understood in this density sense. A merely continuous cumulative distribution function need not possess a probability density function; it can instead describe a singular continuous distribution.
For , is independent of and has a Poisson distribution with parameter . Part (ii) therefore gives
Its probability at zero is
For the event being conditioned on is , so the answer is , also matching the displayed expression. The cancellation of reflects the equal rates of all counts, not an approximation or large- limit.
For , the event is . Use independence in its numerator and the Poisson distribution of the sum in its denominator:
Outside the conditional probability is zero. Consequently
This binomial distribution includes , when it is concentrated at zero. Conditioning on the total converts the independent counts into an allocation of that total between the two rates.
By definition, the probability generating function is
Substituting the Poisson distribution and evaluating the exponential series gives
The series converges for every finite complex ; in particular it gives the probability generating function on .
Let be the number of days up to and including the first breakdown, and the event of a morning first breakdown. For , conditional probability gives
Thus
This geometric distribution counts the day on which the first breakdown occurs. Its parameter is the probability of at least one breakdown during a day, rather than the morning breakdown probability alone.
Let count successful journeys before the first breakdown. The probability of surviving the first journeys is the tail probability . For , independence gives
where again . For a nonnegative integer-valued random variable, the tail-sum formula follows by writing and interchanging nonnegative sums. Therefore
As a separate first-day check using the law of total expectation, if , then . Solving gives the same finite value. This counts only successful journeys, excluding the failed journey.
Put , the probability of surviving a full day, and . These lie in . Let be the event that the first breakdown is in the morning. By independence, surviving complete days and then failing in the morning of day has probability .
These events are disjoint, so summing the geometric series gives
There is no missing probability of never breaking down: survival for days has probability .

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