The uniqueness theorem for moment-generating functions states that if and are finite and equal on an open real interval containing zero, then
For the convergence theorem for moment-generating functions, suppose that the moment-generating functions are finite on a common open real interval , , and for every , where is finite there. Then
One may equivalently assume convergence to a finite function on that interval: the theorem then asserts existence of a unique limiting probability distribution with moment-generating function as well as convergence in distribution.
For a Borel set , the joint probability density gives
For each , substitute . The change of variables for probability densities contributes , with the absolute value accounting for the reversed orientation when . The line has two-dimensional Lebesgue measure zero, so omitting it changes no probability. By the Tonelli theorem,
The bracket is nonnegative and its integral over is one. This proves the probability density of a product of random variables formula:
As usual, a probability density function is determined only almost everywhere; exceptional infinite values are harmless.
For the independent random variables with the specified uniform distribution, on and zero elsewhere. When , the conditions and are equivalent to . Therefore
The value assigned at zero is arbitrary. Substitution checks normalization of a probability distribution: . This is the product of independent uniform random variables law.
The strong law of large numbers states that, for independent and identically distributed random variables with ,
Thus, outside an event of probability zero, the sample mean converges to the common expected value.
Let and put , . Then are coprime integers, and . The six requested revisions are as follows.
(b)(i): communicating classes. Every increment is divisible by , so the residue class modulo is preserved. Conversely, if is divisible by , Bézout's identity applied to gives a path just as in (b)(i). Thus the original Markov chain is reducible on , with exactly the closed communicating classes
The specified walk starting at zero stays in .
(b)(ii): period of a state in a Markov chain. The return equation reduces to . Hence , . For every state, the period of a state in a Markov chain is therefore
This is still at least two, so no state is aperiodic.
(b)(iii): stationary distribution. The conclusion is unchanged: there is no stationary distribution on . The maximum-mass proof in (b)(iii) applies verbatim, without using coprimality. Equivalently, each closed communicating class, after translating and dividing its state labels by , is the same centered random walk with step sizes and has no stationary distribution.
(b)(iv): occupation of zero. On , the rescaled walk has exactly the transition probabilities of the coprime walk with parameters . The return-probability argument in (b)(iv) therefore makes this class null recurrent. The renewal process proof of the occupation limit applies unchanged:
Starting in another residue class would make every visit to zero impossible, also giving occupation proportion zero.
(c)(i): modified communicating classes. These are unchanged: is one finite closed communicating class, and all other states are transient singleton classes. The original proof used consecutive reset destinations and never used coprimality. Resetting to the consecutive integers connects different residue classes, so it would be incorrect to split according to residue classes modulo .
(c)(ii): limiting distribution. The column-sum calculation, the irreducible Markov chain property on a finite class, positive self-transition probabilities, and geometric entrance argument also required no coprimality. Thus for every initial state the same convergence in distribution holds:
In particular, the denominator is unchanged; it is not divided by .
The history is contained in . The increment is independent of this history by the given independence of random variables. Therefore
This depends only on the current state and not on time. It is precisely the time-homogeneous Markov property, so is a Markov chain with transition probabilities
The conditional identity is an identity that holds almost surely; histories of zero probability require no division by their probabilities.
The support condition forces . As a check, the joint probability density integrates to
For any real , the marginal density of is
Dividing the joint probability density by this marginal density gives the conditional density:
Thus, conditionally on , has the rate-two exponential distribution.
For , use the two inverse branches and . Each branch has absolute Jacobian determinant . Both lie in the original support exactly when and . The change of variables for probability densities therefore yields
No atom of a measure is created at , since . The value of the probability density function at this boundary may be assigned arbitrarily. Checking the integral over gives , which integrates to one.

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