Consider the Borel setIts indicator function is nonnegative and measurable, so the Tonelli theorem applies to the product measure, without needing any separate absolute-integrability argument. At a fixed , its section in the first coordinate is ; outside that section is empty. ThereforeThe last equality uses the definition of a cumulative distribution function on the half-closed interval. It retains all point atoms of a measure on the diagonal , excludes a possible point atom of a measure at , and includes , exactly as required by the set . If , both sides vanish. This verifies the identity even when the probability measures are not non-atomic measures.[ref]
Probability: Theory and Examples (fifth edition) by Rick Durrett. §1.7, Theorem 1.7.2, printed pp. 38–40: integration of a nonnegative measurable function on a product space
The product measure is the unique probability measure on the sigma-algebra generated by measurable rectangles for whichHere the printed product notation denotes the generated product sigma-algebra, conventionally written ; it is not just the collection of rectangles. On it equals : coordinate projections show that rectangles are Borel sets, while open rectangles with rational endpoints give every open set as a countable union and hence generate the Borel sigma-algebra.
Existence is the product measure theorem for finite measures, which are in particular sigma-finite measures. Uniqueness follows because the rectangles form a pi-system generating the product sigma-algebra, and two finite measures agreeing there agree everywhere by the Dynkin lemma.[ref]
Probability: Theory and Examples (fifth edition) by Rick Durrett. §1.7, Theorem 1.7.1, printed p. 38: existence and characterization on rectangles
For each integer , letIf had distinct members, finite additivity on their disjoint singleton Borel sets would give total measure at least , contradicting . Thus .
Every positive singleton measure is at least for some sufficiently large . Consequently the set of point atoms of a measure isA countable union of finite sets is at most countable. This proves the claim, including the possibility that the set is empty. The same argument gives the countability of point atoms of a finite measure, with in place of .
For , the bound ensures the finite moment . By Jensen's inequality, . The process is an adapted, nonnegative integrable random variable at each time, and independence givesThus is a submartingale, and . The Doob maximal inequality for a nonnegative submartingale states that for . Apply it with . Since the power function is increasing on ,Combining this with the preceding bound givesThe result is a bound on the running maximum, which is why a maximal inequality for a submartingale, rather than an estimate of the single terminal random variable, is needed.[ref]
Probability: Theory and Examples (fifth edition) by Rick Durrett. §4.4, Theorem 4.4.2, printed p. 235: the submartingale maximal inequality
Use the nonnegative martingale and filtration established above. Fix a finite and letFor , is the union of the threshold-crossing events up to , so is a bounded stopping time. The optional stopping theorem for a martingale at a bounded stopping time gives . On one has ; on its complement one still has . ThereforeOnly a bounded stopping time has been used, so no extra uniform integrability assumption at an unbounded hitting time is implicit. This is also the Doob maximal inequality for a nonnegative submartingale specialized to a mean-one martingale.
The conditions on the cumulative distribution function imply almost surely. With , adjoin and the trivial . The random variables are nonnegative, adapted, and bounded by at each fixed time. Independence and giveThus this is the product martingale from independent mean-one factors, with . The almost sure supermartingale convergence theorem states that a nonnegative supermartingale converges almost surely to a finite integrable random variable. Applied to this nonnegative martingale, it shows almost surely. Every convergent real sequence is bounded, so almost surely.
The printed maximum can in fact be taken literally here. If almost surely, all products equal . Otherwise the strict Jensen equality criterion, applied to the strictly convex function on , gives . Independence yields . By Markov's inequality, for every . The First Borel-Cantelli lemma and the countable choices give almost surely. Since , a sequence with this limit attains its positive supremum among finitely many initial terms. This is an instance of fractional moment decay of independent mean-one products.
For , the definition of the common cumulative distribution function givesThe strict exceedance matters here: an atom of a measure at belongs to , so it is already included in . The events are mutually independent events, since each depends on a separate member of the independent random variables .
If , countable subadditivity gives, for every ,Continuity of probability then gives . This is the First Borel-Cantelli lemma and does not need independence.
If the series diverges, independence and give, for every fixed ,Taking shows that the probability of no exceedance after is zero. A countable union over shows that finitely many exceedances has probability zero. This is the Second Borel-Cantelli lemma. Together with the preceding event equality, it proves
The tail sigma-algebra of this sequence isFor each fixed , the preceding event equality givesEvery event on the right is determined by coordinates with index at least . Therefore for every , and . The random variables are independent, so Kolmogorov's zero–one law applies: every tail event has probability zero or one. Hence .
The role of independence can also be seen directly. A tail event is independent of each finite initial sigma-algebra . The Monotone class theorem extends this independence to ; since itself lies there, it is independent of itself. Thus .[ref]
Probability: Theory and Examples (fifth edition) by Rick Durrett. §2.5, Theorem 2.5.3, printed pp. 81–82: the tail sigma-field zero–one law
For the reverse inclusion, fix an outcome for which only finitely many occur. Choose such that for every . The finite prefix has a finite maximum when ; there is no prefix to check when . Since , for every sufficiently large that prefix satisfies . For the remaining indices , the nondecreasing thresholds giveThus for every sufficiently large , so only finitely many occur. Taking the contrapositive proves the reverse inclusion, and hence the pointwise event equalityThis exceedance equivalence for increasing thresholds is deterministic. Its proof uses both monotonicity of and divergence to ; it does not require independence or identical probability distributions.
For each , put . Closure of a sigma-algebra under countable unions and countable intersections givesThe events decrease to . Continuity of probability from above applies because . Also, whenever , soLetting provesThis reverse Fatou inequality for events requires no independence.
The L2-bounded martingale convergence theorem states that a martingale with converges both almost surely and with convergence in L2 to a square-integrable random variable. Its hypotheses hold because . Thus there is almost surely with both kinds of convergence. Alternatively, the martingale convergence theorem gives the almost sure convergence, and the bound gives convergence in L2 by the dominated convergence theorem.[ref]
Probability: Theory and Examples (fifth edition) by Rick Durrett. §4.4, Theorem 4.4.6, printed p. 237: the Lp martingale convergence theorem
The calculation of the conditional expectation of the square is especially informative. The martingale property makes the cross term vanish in the square expansion, soSubtracting this from givesTaking expected values and iterating provesBy bounded convergence theorem, . The random variable inside this expected value is nonnegative, so it is zero almost surely; on this forces . Again by bounded convergence theorem, . HenceThis is the Bernoulli polarization martingale with update size . It also has an exact mean squared error: the terminal representation and the equality case for conditional second moments give
The adapted process is bounded by , so every is an integrable random variable, indeed a square-integrable random variable. Independence of from and its continuous uniform distribution giveThis calculation with a random threshold is justified by conditioning on the -measurable value of : for a fixed , the Lebesgue integral equals . More formally, independence integrates the bounded Borel measurable function over its second coordinate. Thereforewhich verifies the martingale property for this filtration.
Since , the conditional expectation of the squared martingale difference isThe law of total expectation yields . In particular, for every .
Retain the binary random variables . Iterating the recursion givesEach binary history determines the full vector , so its sigma-algebra is finite by the sigma-algebra of a finite-valued random vector. Conversely, because , the integer uniquely determines the digits ; also . ThusAll binary histories have positive probability. By independence of the driving uniform random variables, along a fixed finite history every intermediate state is in , so each subsequent conditional branch probability, either or , is strictly positive. It follows that has nonempty fibres, each an atom of a sigma-algebra, and exactly elements.
Adaptedness from the preceding part gives . For , however, contains the events for every . They have distinct probabilities , so there are infinitely many distinct such events. Consequently the finite sigma-algebra cannot equal . The inclusion is strict for every .
For every , is a sigma-algebra contained in , and including one more random variable among its generators can only enlarge it. Hence ; the trivial is contained in every sigma-algebra. These are exactly the requirements for a filtration.
The constant is -measurable. Suppose is -measurable. The pair is then -measurable, and the event is -measurable because comparison of two real coordinates defines a Borel set. Define its indicator function by . The recursion becomesIt is a measurable function of that pair. Mathematical induction proves is -measurable for every , so is an adapted process. The same recursion also proves at every finite time, a useful bound for the later integrability arguments.
Write and . The two conditional expectation identities supply a -measurable version of and a -measurable version of . Work with those versions, which do not change any almost sure equality. Both lie in L2 space, and the Cauchy-Schwarz inequality makes their product an integrable random variable.
Testing the first conditional expectation identity against , and the second against , givesFor completeness, these tests with unbounded multipliers are valid by first using the bounded truncations and , then passing to the limit with the Cauchy-Schwarz inequality and convergence in L2. Consequently,A nonnegative random variable with zero expected value vanishes almost surely. Therefore almost surely. This is mutual conditional expectation rigidity in L2; it also follows from the equality case for conditional second moments.
For a counterexample to equality of the original random variables, let give probability to each of , set , and use the nonconstant function . Then takes both values and . It is measurable with respect to both generated sigma-algebras, so both required conditional expectation identities hold. Symmetry gives , while neither random variable can be zero. Thus
Put . Both and its indicator function are measurable, and . Thus is an integrable random variable. Monotonicity of conditional expectation givesThe measurable-factor property of conditional expectation says that a bounded -measurable function satisfies for every integrable random variable . Here the factor need not be bounded. Apply that property first to and , then use monotone convergence on the nonnegative products, including the conditional version, to obtainAll the left-hand conditional expectations are well defined; the final one is finite almost surely because is an integrable random variable. Since almost surely, division now yieldsThis proves the conditional Markov inequality with a measurable threshold without assuming that is an integrable random variable. The measurable-factor rule, with its product-integrability condition, is also stated in the standard conditional expectation theory.[ref]
Let count immigration events during the first transitions, and let count upward steps during those transitions. Write for the conditional immigration probability. If is the indicator that transition to is immigration, then is a bounded martingale difference with respect to the history that records event types as well as population sizes. The strong law for martingales with bounded increments impliesSince is bounded, the countable-state Markov chain ergodic theorem givesApplying the same argument to upward-step indicators gives almost surely. To evaluate this denominator, sum detailed balance over all neighboring edges:Since and , both sums equal . The denominator limit is positive, so division is valid and the immigration fraction among upward steps isThis is the requested answer in terms of . Substituting part (iii) additionally gives , so the fraction simplifies to .
Every step changes the population by one, so has the parity of when . Hence . A return in two steps has positive probability from every state, and all return times are even, so the period of a state in a Markov chain is exactly two.
Each transition exchanges the even and odd classes. Since is an invariant distribution, their masses are equal: . The chain sampled at times , restricted to the even states, is irreducible and positive recurrent, and it is aperiodic because its diagonal entries are positive. Its stationary distribution is on even . The countable-state Markov chain convergence theorem applied to this sampled chain yieldsSince , the full sequence has no limit. Its time average nevertheless tends to by the countable-state Markov chain ergodic theorem.
Assume , and put and . The detailed balance equations giveMultiplying from to , the last factor telescopes, while the product involving is evaluated by the Gamma function:Consequently the requested invariant distribution can be expressed using the paper's power series asThe assumed convergence of ensures that this normalization is finite and positive.
For an explicit normalizing constant, the binomial series givesThe termwise differentiation of a power series is valid for , soThe last equality uses and : . ThereforeThese positive terms sum to one and satisfy the detailed balance equations, so part (a)(ii) verifies stationarity. Irreducibility makes the invariant distribution unique.
We use the stationary weights of a reflected birth-death chain, also verifying why they decide the question. If a stationary distribution exists, its equation at zero is . At , stationarity givesThus the edge flow is constant, and its value at the boundary is zero. Every stationary distribution must therefore satisfy detailed balance on each edge. Since irreducibility forces , it must be proportional toConversely, if , normalizing these positive weights gives a probability distribution satisfying detailed balance, hence a stationary distribution. Existence of a stationary distribution for an irreducible Markov chain on a countable state space is equivalent to positive recurrence.
There are unlisted articles, also show them or only show them.