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.

Positive recurrence and stationary probability for irreducible countable chains

Statement

Assume AC (The Axiom of Choice). Let p be an irreducible transition matrix on a nonempty countable state space E (Accessibility, communication, and irreducibility), and for b∈E let μb(y)=Eb∑0≤n<Tb+1{Xn=y} be the return-cycle occupation measure of Return-cycle occupation measure and minimality. Then the following three statements are equivalent:

  1. some state is positive recurrent;
  2. every state is positive recurrent (Positive and null recurrence of a state);
  3. there is an invariant probability π for p (Invariant and stationary distribution for a Markov kernel).

Moreover, if b is positive recurrent then EbTb+=∑y∈Eμb(y) is finite, the measure π(y):=μb(y)/EbTb+ is an invariant probability, and π(b)=1/EbTb+. Conversely, if π is an invariant probability, then π(b)>0 and EbTb+≤1/π(b) for every b.

Facts & Assumptions

Given: AC, a nonempty countable state space E, an irreducible transition matrix p on E, and a state b∈E.

[A1]

Every family of nonempty sets has a choice function; AC is assumed and is used through the chain-law and occupation-measure supplier [F4]. (The Axiom of Choice)

[F1]

x→y means p(n)(x,y)>0 for some n≥0, with p(0)(x,y)=1{x=y}, and p is irreducible when every pair of states communicates; in particular for all x,y there is n≥0 with p(n)(x,y)>0. (Accessibility, communication, and irreducibility)

[F2]

p(m+n)(x,y)=∑z∈Ep(m)(x,z)p(n)(z,y) for all m,n≥0 and x,y∈E. (Matrix Chapman–Kolmogorov equations)

[F3]

A recurrent state x is positive recurrent when ExTx+<+∞; a finite mean forces Px(Tx+<∞)=1. (Positive and null recurrence of a state)

[F4]

Assume AC. For a countable p-chain started at b: μb(b)=1; ∑y∈Eμb(y)=EbTb+; μb(y)=∑x∈Eμb(x)p(x,y) for every y≠b; μb is pointwise minimal among nonnegative solutions of ν(b)=1, ν(y)=∑xν(x)p(x,y) (y≠b); and if b is recurrent then μbp=μb. (Return-cycle occupation measure and minimality)

[F5]

On a countable state space a probability vector π is invariant exactly when π(y)=∑x∈Eπ(x)p(x,y) for every y∈E. (Invariant and stationary distribution for a Markov kernel)

[F6]

For every double sequence (aij) in [0,+∞], the two iterated sums and the supremum of the finite partial sums coincide, so the order of summation of nonnegative terms may be exchanged even when the common value is +∞. (Tonelli's theorem for double series of nonnegative extended real numbers)

Proof

Given: AC, a nonempty countable state space E, an irreducible transition matrix p on E, a state b, and the return-cycle occupation measure μb of [F4].

Proof technique: from an invariant probability build the normalized candidate π/π(b), use the pointwise minimality of the return-cycle measure to bound the expected return time, and reverse the implication by normalizing μb in the positive-recurrent case.

1.1F2F5F6given

For every n≥0 one has πp(n)=π whenever π is an invariant probability, where (πp(n))(y):=∑x∈Eπ(x)p(n)(x,y): the case n=0 is p(0)(x,y)=1{x=y}, and if πp(n)=π, then (πp(n+1))(y)=∑xπ(x)∑zp(n)(x,z)p(z,y)=∑z(∑xπ(x)p(n)(x,z))p(z,y)=∑zπ(z)p(z,y)=π(y) for every y, using [F2] with m=n, n=1 and the interchange of the two nonnegative series in [F6].

1.2F3F4F5given

Conversely, assume some state b is positive recurrent. Then Pb(Tb+<∞)=1 and 0<EbTb+<∞; by [F4] the measure μb satisfies μbp=μb, and μb≥0 with 1=μb(b)≤∑yμb(y)=EbTb+<∞; hence π∗(y):=μb(y)/EbTb+ defines a probability vector with π∗p=π∗, i.e. an invariant probability by [F5].

2.1F1F2F5step 1.1given

Assume there is an invariant probability π. Then π(b)>0 for every b∈E: by [F1] irreducibility gives n with p(n)(x,b)>0 for an arbitrary fixed x, and step 1.1 gives π(b)=∑x′∈Eπ(x′)p(n)(x′,b)≥π(x)p(n)(x,b), so if π(b)=0 then π(x)=0 for every x, contradicting ∑xπ(x)=1.

3.1F5step 2.1given

With π invariant, define ν(y):=π(y)/π(b) for y∈E; this is well defined and finite by step 2.1, ν≥0, ν(b)=1, and for y≠b the invariance identity [F5] gives (νp)(y)=∑xν(x)p(x,y)=1π(b)∑xπ(x)p(x,y)=π(y)/π(b)=ν(y).

4.1F3F4step 3.1given

The pointwise minimality of [F4] applied to ν yields μb(y)≤ν(y) for every y; summing and using ∑yμb(y)=EbTb+ from [F4] gives EbTb+≤∑yν(y)=1/π(b)<+∞, so b is recurrent with finite expected return time, i.e. positive recurrent by [F3]. Since b was arbitrary, every state is positive recurrent.

5.1F4step 4.1step 1.2given

The three statements are equivalent: every state positive recurrent implies some state positive recurrent because E≠∅; some state positive recurrent implies the existence of an invariant probability by step 1.2; and the existence of an invariant probability implies every state positive recurrent by steps 2.1–4.1. In the construction of step 1.2, π∗(y)=μb(y)/EbTb+ and π∗(b)=μb(b)/EbTb+=1/EbTb+, which are the two displayed formulas of the statement, while the bound EbTb+≤1/π(b) for an invariant π is step 4.1.

6.1A1F1F2F3F4F5step 4.1step 1.2given∎

Boundary and axiom cases: if E is a singleton then p(1,1)=1, every state is positive recurrent with Tb+=1, and π=δb is the invariant probability, consistent with all three clauses; no state is transient here, so the alternatives of [F3] are exhaustive; the equivalence is proved in both directions through steps 4.1 and 1.2, not assumed; the arguments never subtract infinite quantities, since all sums of occupation masses are nonnegative and are shown finite only after the minimality bound; and AC [A1] is used exactly through [F4], the published chain-law and return-cycle supplier, whose statement assumes AC, while the remaining steps are nonnegative matrix algebra.

Depends on

Used by

Dependency tree · two levels

22 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