Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 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.

Cesaro convergence for irreducible positive-recurrent chains

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 π. Then for every x,y∈E,

1n∑k=0n−1p(k)(x,y) ⟶ π(y)(n→∞).

No aperiodicity hypothesis is required, and the time-zero term k=0 is included in the average.

Facts & Assumptions

Given: AC, an irreducible positive-recurrent p on countable E with invariant probability π, and states x,y∈E.

[A1]

Every family of nonempty sets has a choice function; AC is assumed and is used through the ergodic theorem supplier [F1], whose statement assumes it. (The Axiom of Choice)

[F1]

Assume AC. For an irreducible positive-recurrent countable p-chain with invariant probability π and f with ∑zπ(z)∣f(z)∣<∞, 1n∑k<nf(Xk)→∑zπ(z)f(z) almost surely under Px for every starting state x. (Ergodic theorem for an irreducible positive-recurrent Markov chain)

[F2]

If measurable functions fn on a finite measure space are bounded by one constant M and converge almost everywhere to f, then ∫fn→∫f. (Bounded convergence on a finite measure space)

[F3]

Assume Choice. For a Markov chain with kernel K and bounded measurable f, E[f(Xm+n)∣Fm]=Knf(Xm) almost surely; in particular, for m=0, Ex[f(Xn)]=Knf(x) with Knf(x)=∫Ef dKn(x,⋅). (Chapman-Kolmogorov equations)

[F4]

The transition entries are p(k)(x,y)=Kk(x,{y}) for k≥0. (Transition matrices and n-step probabilities)

Proof

Given: AC, an irreducible positive-recurrent p on countable E with invariant probability π, and fixed x,y∈E.

Proof technique: apply the chain ergodic theorem to the indicator of the target state and pass to expectations by bounded convergence, identifying each expectation with an n-step transition probability.

1.1F1given

Let f:=1{y}. It is bounded with 0≤f≤1, and ∑zπ(z)∣f(z)∣=π(y)≤1<∞, so [F1] applies: 1n∑k=0n−11{Xk=y}→π(y) almost surely under Px, for the fixed starting state x.

1.2F3F4given

For each k≥0, Ex[1{Xk=y}]=Px(Xk=y)=Kk(x,{y})=p(k)(x,y): the second equality is the m=0 case of the Chapman–Kolmogorov identity [F3] applied to the indicator of the singleton, and the third is the definition of the k-step entries [F4].

2.1F2step 1.1given

Each average An:=1n∑k<n1{Xk=y} satisfies 0≤An≤1 for every n≥1, and An→π(y) almost surely by step 1.1; since Px is a probability measure, the bounded convergence corollary [F2] applied to the constant limit gives ExAn→π(y).

3.1step 2.1step 1.2given

By linearity of expectation, ExAn=1n∑k=0n−1Ex[1{Xk=y}]=1n∑k=0n−1p(k)(x,y); combining with step 2.1 gives 1n∑k=0n−1p(k)(x,y)→π(y). Since x,y were arbitrary, the theorem follows.

4.1A1F1F2F3step 3.1given∎

The average is formed for n≥1 and includes p(0)(x,y)=1{x=y}. For the periodic two-state alternation it equals ⌈n/2⌉/n or ⌊n/2⌋/n, according to x,y, and tends to 1/2; thus no aperiodicity is needed. The bounded indicator satisfies the integrability hypothesis, and AC [A1] is used through [F1] and [F3].

Depends on

Used by

Dependency tree · two levels

20 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