Alphabeta Math
CorollaryStatement: AI-adaptedProof: 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.

Stationary irreducible Markov shift is ergodic

Statement

Assume AC (The Axiom of Choice). Let p be an irreducible (Accessibility, communication, and irreducibility) positive-recurrent transition matrix on a nonempty countable state space E, let π be its invariant probability, and let Pπ be the canonical path law on EN0 of the p-chain with initial law π (Invariant initial law makes a Markov chain stationary). Then:

  1. the invariant probability is unique, so the phrase "the" invariant probability is unambiguous; and
  2. the left shift θ(z)n=zn+1 preserves Pπ and is ergodic for it (Ergodicity relative to an invariant measure): every A with θ−1A=A satisfies Pπ(A)∈{0,1} (Strict and mod-null invariant sigma-algebras).

No aperiodicity hypothesis is used anywhere in the proof.

Facts & Assumptions

Given: AC, a nonempty countable E, an irreducible positive-recurrent transition matrix p on E, and the canonical path laws Px of the chain started at x.

[A1]

Every family of nonempty sets has a choice function; AC is assumed and is used through the chain, statewise Kac, and conditional-expectation suppliers [F3]–[F8], [F11]. (The Axiom of Choice)

[F1]

A measure-preserving system is ergodic for μ exactly when every E∈I={E:T−1E=E} has μ(E)=0 or μ(X∖E)=0. (Ergodicity relative to an invariant measure, Strict and mod-null invariant sigma-algebras)

[F2]

If X is a K-chain with invariant initial law π, then its canonical path law is invariant under the left shift. (Invariant initial law makes a Markov chain stationary)

[F3]

Assume AC. For an irreducible countable chain: some state positive recurrent, every state positive recurrent, and existence of an invariant probability are equivalent; if b is positive recurrent then π∗(y)=μb(y)/EbTb+ is an invariant probability with π∗(b)=1/EbTb+; and every invariant probability ρ satisfies ρ(b)>0 and EbTb+≤1/ρ(b) for every b. (Positive recurrence and stationary probability for irreducible countable chains)

[F4]

Assume AC. If x is recurrent and x→y, then Px(Ty<∞)=1; recurrence is a class property. (Recurrence and transience are class properties)

[F5]

Assume Choice. For bounded product-measurable H:EN0→R, the function h(x)=Ex[H(X0,X1,…)] is measurable and E[H(Xn,Xn+1,…)∣Fn]=h(Xn) a.s. for every n≥0. (Markov property for bounded future path functionals)

[F6]

Assume Choice. A bounded harmonic function f (that is, Pf=f) of a countable-state p-chain yields the bounded martingale (f(Xn)). (Bounded harmonic functions yield Markov-chain martingales)

[F7]

Assume AC. If M is a martingale and σ≤τ are stopping times bounded by a deterministic N, then E[Mτ∣Fσ]=Mσ a.s., so in particular EMτ=EMσ. (Optional sampling for bounded stopping times)

[F8]

Assume AC. If (Fn) is increasing and F∞=σ(⋃nFn), then E[X∣Fn]→E[X∣F∞] almost surely and in L1 for every X∈L1. (Levy upward convergence of conditional expectations)

[F9]

TA=inf⁡{n≥0:Xn∈A} and Ty is a stopping time because {TA≤n}=⋃j≤n{Xj∈A}∈Fn; hence Ty∧n is a stopping time bounded by n, and XTy∧n=y for all n≥Ty when Ty<∞. (Hitting, return, and visit times)

[F10]

If p is irreducible, then for every x,y there is n≥0 with p(n)(x,y)>0. (Accessibility, communication, and irreducibility)

[F11]

Assume AC. If an irreducible countable transition matrix has invariant probability ρ, then for every y∈E, ρ(y)>0 and EyTy+=1/ρ(y). (Kac return-time formula for a state)

[F12]

If measurable functions fn on a probability space satisfy fn→f almost surely and ∣fn∣≤1, then dominated convergence applies with the integrable majorant 1, so Efn→Ef. (Dominated convergence)

Proof

Given: AC, an irreducible positive-recurrent p on nonempty countable E, canonical path laws Px, and the invariant probability existence from [F3].

Proof technique: first pin down the invariant probability by applying the statewise Kac formula to each invariant law at every state; then for a strictly shift-invariant event use the harmonic function of its hitting probabilities, optional sampling up to the hitting time of a fixed state, and Lévy's upward theorem to force the event to have probability zero or one.

1.1F3F11given

Uniqueness of the invariant probability: [F3] supplies an invariant probability π∗. Let ρ be any invariant probability and fix an arbitrary y∈E. Applying [F11] to each of π∗ and ρ gives π∗(y)=1/EyTy+=ρ(y). Since this holds for every y, ρ=π∗ pointwise. Write π for this unique invariant probability.

2.1F2step 1.1given

Let Pπ be the canonical path law of the chain with initial law π; by [F2] the left shift preserves Pπ. Fix a measurable A⊆EN0 with θ−1A=A and define h(x):=Px(A) for x∈E; then 0≤h≤1.

3.1F5step 2.1given

The function h is harmonic, Ph=h: since θ−1A=A, the indicator satisfies 1A(z)=1A(θz) for every path z, so the bounded product-measurable functional H:=1A obeys H(X1,X2,…)=1A(θΦ)=1A(Φ) with Φ=(X0,X1,…); applying [F5] with n=1 and taking expectations gives h(x)=Ex[1A]=Ex[h(X1)]=∑y∈Ep(x,y)h(y) for every x.

4.1F6step 3.1given

Since h is bounded and harmonic, [F6] makes (h(Xn))n≥0 a bounded martingale under every Px.

5.1F7F9step 4.1given

Fix x,y∈E and n≥0. By [F9] the time Ty∧n is a stopping time bounded by the deterministic n, so [F7] applied to the bounded martingale of step 4.1 with σ=0 and τ=Ty∧n gives Ex[h(XTy∧n)]=h(x).

6.1F4F5F9F10F12step 5.1given

Positive recurrence makes every state recurrent, and irreducibility [F10] gives x→y, so [F4] gives Px(Ty<∞)=1. Hence Ty<∞ almost surely, XTy∧n=y for all n≥Ty by [F9], and therefore h(XTy∧n)→h(y) almost surely. The functions are measurable since h is measurable by [F5], and bounded by 1; applying [F12] under Px with integrable majorant 1 gives Ex[h(XTy∧n)]→h(y). Step 5.1 identifies these expectations with the constant h(x). Thus h(x)=h(y), and since x,y were arbitrary, h≡c for a single constant c∈[0,1].

7.1F5F8step 6.1given

Under Pπ, [F5] gives Eπ[1A∣Fn]=h(Xn)=c almost surely for every n. The natural filtration satisfies F∞=σ(⋃nFn)= the product sigma-algebra on EN0, which contains A, so [F8] gives 1A=Eπ[1A∣F∞]=lim⁡nEπ[1A∣Fn]=c Pπ-almost surely; as an indicator takes only the values 0,1 almost surely, c∈{0,1} and Pπ(A)=c.

8.1F1F2step 1.1step 7.1given

Every measurable A with θ−1A=A therefore has Pπ(A)∈{0,1}, and [F1] says exactly that θ is ergodic for Pπ; θ preserves Pπ by step 2.1 and π is the unique invariant probability by step 1.1, so the corollary holds and no aperiodicity hypothesis was used.

9.1A1F3F7F8F11step 1.1step 7.1given∎

Boundary and axiom cases: if E is a singleton the chain is trivially irreducible and positive recurrent, Pπ is the point mass at the constant path, and every shift-invariant event has measure 0 or 1, consistent with steps 7.1–5.1; A=∅ and A=EN0 give c=0 and c=1; the uniqueness claim and the ergodicity claim are both proved, so the two parts of the statement are not riding on an unproved equivalence; the argument uses the strictly invariant sigma-algebra exactly as in [F1] and never replaces it by the mod-null version; and AC [A1] enters through the chain-law, statewise Kac, and conditional-expectation suppliers [F3]–[F8], [F11], whose statements assume Choice, not through irreducibility itself.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

62 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