How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Ergodic theorem for an irreducible positive-recurrent Markov chain
Statement
Assume AC (The Axiom of Choice). Let be an irreducible positive-recurrent transition matrix on a countable state space with invariant probability , let satisfy , and use for the law of the chain started at . Then for every ,
For complex-valued with the same conclusion holds componentwise for real and imaginary parts; no aperiodicity and no continuity or boundedness of is assumed.
Facts & Assumptions
Given: AC, an irreducible positive-recurrent on countable , its invariant probability , a function with , and a fixed starting state .
Every family of nonempty sets has a choice function; AC is assumed and is used through the positive-recurrence/Kac, return-excursion, and recurrent-class suppliers [F2]–[F4]. (The Axiom of Choice)
A recurrent state is positive recurrent when ; a positive-recurrent state is recurrent. (Positive and null recurrence of a state)
Assume AC. For an irreducible countable chain with invariant probability and any state : , , and the return-cycle occupation measure satisfies for every . (Kac return-time formula for a state)
Assume AC. For a recurrent state , the successive return times of a chain started at are all finite almost surely and the completed excursions for are independent and identically distributed; each is a function of a chain started at run to its first positive return. (Renewal decomposition at successive returns)
Assume AC. If an irreducible chain has a recurrent state then every state is recurrent, and recurrence is a class property. (Recurrence and transience are class properties)
For iid real with one has almost surely. (Kolmogorov iid l1 strong law)
If increase pointwise to , then ; consequently the expectation of a nonnegative extended series is the series of the expectations. (Monotone convergence for the integral)
Expectation is linear on integrable real random variables: . (Linearity, monotonicity, and the modulus bound for expectation)
Proof
Given: AC, an irreducible positive-recurrent on countable with invariant probability , an integrable , and a deterministic start .
Proof technique: decompose the path into iid excursions between successive visits to the starting state, apply the strong law to the iid cycle lengths and cycle rewards, and sandwich the partial averages between completed cycles.
By [F2], and ; by [F1], the finite return mean makes positive recurrent and therefore recurrent.
By the class property [F4], every state of the irreducible chain is recurrent, although only the recurrence of is needed below.
Let be the successive return times of the chain to and define the cycle lengths and cycle rewards , for . By [F3] all are finite almost surely and the excursions are iid; hence is an iid sequence of pairs, with distributed as under , and .
The reward is integrable. Put , so and by [F2]. Enumerate the countable set and apply monotone convergence [F6] to increasing finite sums of ; their pointwise limit equals , since each time contributes to exactly one state. Thus . Define , the cycle rewards of the positive and negative parts of . The same nonnegative calculation gives . Since and almost surely, is integrable; linearity [F7] yields . In general are not the positive and negative parts of . Also .
By the strong law [F5] applied to the iid sequences and : and almost surely; consequently , so and almost surely.
If both sides vanish; if is unbounded but -integrable its excursion rewards are still integrable by step 3.1, and no boundedness is used.
First suppose , so each and the partial sums are nondecreasing. Let ; then , while , so, for , . Since almost surely by step 4.1, and , so both bounding sequences converge to , and the sandwiched average does too.
For general real-sign , write with ; by step 3.1 both functions satisfy , so step 5.1 applies to each, and subtracting the two almost-sure limits gives almost surely.
The argument does not assume aperiodicity, since it uses return epochs and cycle laws; if is a singleton the conclusion is the constant identity; and is formed only for , where , so there is no division by zero.
For complex apply step 6.1 to and , which satisfy the same absolute-integrability hypothesis, and recombine. The arbitrary starting state was fixed once and for all at the beginning; the argument is uniform in because enters only through the bounds and .
If , step 5.1 suffices; step 6.1 records the signed reduction.
AC [A1] is used exactly at the AC-qualified supplier applications in steps 1.1, 2.2, and 3.1; the strong law and the sandwich/reduction arguments use no further choice.
Depends on
- The Axiom of Choice
- Positive and null recurrence of a state
- Kac return-time formula for a state
- Renewal decomposition at successive returns
- Recurrence and transience are class properties
- Kolmogorov iid l1 strong law
- Monotone convergence for the integral
- Linearity, monotonicity, and the modulus bound for expectation
Used by
Dependency tree · two levels
49 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Durrett, Probability: Theory and Examples, fifth edition, §5.6 and §6.2, ergodic theorem for Markov chains (standard reference, not scraped)
- Levin–Peres–Wilmer, Markov Chains and Mixing Times, second edition, §21.3 and Appendix C.1 (standard reference, not scraped)
- Aldous–Chewi, Probability Theory, Lectures 13–15 (standard reference, not scraped)