Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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 p be an irreducible positive-recurrent transition matrix on a countable state space E with invariant probability π, let f:E→R satisfy ∑x∈Eπ(x)∣f(x)∣<+∞, and use Px for the law of the chain started at x∈E. Then for every x∈E,

1n∑k=0n−1f(Xk) ⟶ ∑y∈Eπ(y)f(y)Px-almost surely.

For complex-valued f with ∑xπ(x)∣f(x)∣<∞ the same conclusion holds componentwise for real and imaginary parts; no aperiodicity and no continuity or boundedness of f is assumed.

Facts & Assumptions

Given: AC, an irreducible positive-recurrent p on countable E, its invariant probability π, a function f:E→R with ∑xπ(x)∣f(x)∣<∞, and a fixed starting state x.

[A1]

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)

[F1]

A recurrent state x is positive recurrent when ExTx+<∞; a positive-recurrent state is recurrent. (Positive and null recurrence of a state)

[F2]

Assume AC. For an irreducible countable chain with invariant probability π and any state b: π(b)>0, EbTb+=1/π(b), and the return-cycle occupation measure satisfies μb(y)=π(y)/π(b) for every y. (Kac return-time formula for a state)

[F3]

Assume AC. For a recurrent state x, the successive return times R0=0<R1<R2<⋯ of a chain started at x are all finite almost surely and the completed excursions Ek=(XRk−1,…,XRk) for k≥1 are independent and identically distributed; each is a function of a chain started at x run to its first positive return. (Renewal decomposition at successive returns)

[F4]

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)

[F5]

For iid real (Yk)k≥1 with E∣Y1∣<∞ one has 1m∑k=1mYk→EY1 almost surely. (Kolmogorov iid l1 strong law)

[F6]

If 0≤g1≤g2≤⋯ increase pointwise to g, then ∫gn dμ↑∫g dμ; consequently the expectation of a nonnegative extended series is the series of the expectations. (Monotone convergence for the integral)

[F7]

Expectation is linear on integrable real random variables: E[aU+bV]=aEU+bEV. (Linearity, monotonicity, and the modulus bound for expectation)

Proof

Given: AC, an irreducible positive-recurrent p on countable E with invariant probability π, an integrable f, and a deterministic start x.

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.

1.1A1F1F2given

By [F2], ExTx+=1/π(x)∈(0,∞) and π(x)>0; by [F1], the finite return mean makes x positive recurrent and therefore recurrent.

2.1A1F4step 1.1given

By the class property [F4], every state of the irreducible chain is recurrent, although only the recurrence of x is needed below.

2.2A1F3step 1.1given

Let R0=0<R1<R2<⋯ be the successive return times of the chain to x and define the cycle lengths and cycle rewards Lk:=Rk−Rk−1, Wk:=∑j=Rk−1Rk−1f(Xj) for k≥1. By [F3] all Rk are finite almost surely and the excursions are iid; hence (Lk,Wk)k≥1 is an iid sequence of pairs, with (L1,W1) distributed as (Tx+,∑n<Tx+f(Xn)) under Px, and Lk≥1.

3.1A1F2F6F7step 2.2given

The reward is integrable. Put Ny:=∑n<Tx+1{Xn=y}, so ExNy=μx(y)=π(y)/π(x) and ExTx+=1/π(x) by [F2]. Enumerate the countable set E and apply monotone convergence [F6] to increasing finite sums of ∣f(y)∣Ny; their pointwise limit equals ∑n<Tx+∣f(Xn)∣, since each time n<Tx+ contributes to exactly one state. Thus Ex∑n<Tx+∣f(Xn)∣=∑y∣f(y)∣μx(y)=∑yπ(y)∣f(y)∣/π(x)<+∞. Define U1±:=∑n<Tx+f±(Xn), the cycle rewards of the positive and negative parts of f. The same nonnegative calculation gives ExU1±=∑yπ(y)f±(y)/π(x)<∞. Since W1=U1+−U1− and ∣W1∣≤U1++U1−=∑n<Tx+∣f(Xn)∣ almost surely, W1 is integrable; linearity [F7] yields ExW1=∑yπ(y)f(y)/π(x). In general U1± are not the positive and negative parts of W1. Also ExL1=1/π(x).

4.1F5step 3.1given

By the strong law [F5] applied to the iid sequences (Lk) and (Wk): 1m∑k=1mLk→1π(x) and 1m∑k=1mWk→∑yπ(y)f(y)π(x) almost surely; consequently Rm/m→1/π(x)>0, so Rm→∞ and Rm+1/Rm→1 almost surely.

4.2step 3.1given

If f≡0 both sides vanish; if f is unbounded but π-integrable its excursion rewards are still integrable by step 3.1, and no boundedness is used.

5.1step 4.1algebragiven

First suppose f≥0, so each Wk≥0 and the partial sums Sm:=∑k=1mWk are nondecreasing. Let Rm≤n<Rm+1; then Sm≤∑j=0n−1f(Xj)≤Sm+1, while Rm≤n<Rm+1, so, for m≥1, SmRm+1≤1n∑j<nf(Xj)≤Sm+1Rm. Since m=m(n)→∞ almost surely by step 4.1, SmRm=Sm/mRm/m→∑yπ(y)f(y) and Rm+1Rm→1, so both bounding sequences converge to ∑yπ(y)f(y), and the sandwiched average does too.

6.1step 3.1step 5.1algebra

For general real-sign f, write f=f+−f− with f±≥0; by step 3.1 both functions satisfy ∑yπ(y)f±(y)≤∑yπ(y)∣f(y)∣<∞, so step 5.1 applies to each, and subtracting the two almost-sure limits gives 1n∑j<nf(Xj)→∑yπ(y)f+(y)−∑yπ(y)f−(y)=∑yπ(y)f(y) almost surely.

6.2step 1.1step 2.2step 4.1step 5.1given

The argument does not assume aperiodicity, since it uses return epochs and cycle laws; if E is a singleton the conclusion is the constant identity; and Sm/Rm is formed only for m≥1, where Rm≥m≥1, so there is no division by zero.

7.1step 6.1given

For complex f apply step 6.1 to Re⁡f and Im⁡f, which satisfy the same absolute-integrability hypothesis, and recombine. The arbitrary starting state x was fixed once and for all at the beginning; the argument is uniform in x because x enters only through the bounds ExTx+=1/π(x) and μx=π/π(x).

7.2step 5.1step 6.1given

If f≥0, step 5.1 suffices; step 6.1 records the signed reduction.

8.1A1step 1.1step 2.2step 3.1step 4.1step 5.1given∎

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

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