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.

Kac return-time formula for a state

Statement

Assume AC (The Axiom of Choice). Let p be an irreducible transition matrix on a countable state space E with invariant probability π (Invariant and stationary distribution for a Markov kernel), and for b∈E let μb(y)=Eb∑0≤n<Tb+1{Xn=y} be the return-cycle occupation measure (Return-cycle occupation measure and minimality). Then for every b∈E:

  1. π(b)>0;
  2. EbTb+=1/π(b), finite; and
  3. μb(y)=π(y)/π(b) for every y∈E.

Facts & Assumptions

Given: AC, an irreducible countable transition matrix p, an invariant probability π, 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 [F2]. (The Axiom of Choice)

[F1]

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

[F2]

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

[F3]

Irreducibility means that for all x,y∈E there is n≥0 with p(n)(x,y)>0. (Accessibility, communication, and irreducibility)

[F4]

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

[F5]

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

[F6]

For every double sequence (aij) in [0,+∞] the order of summation may be interchanged, the two iterated sums being equal even when the common value is +∞. (Tonelli's theorem for double series of nonnegative extended real numbers)

Proof

Given: AC, an irreducible countable transition matrix p, an invariant probability π, a state b, and the return-cycle occupation measure μb of [F2].

Proof technique: form the nonnegative defect of μb against the normalized stationary measure, observe that it is invariant, and evaluate the resulting conservation identity at b, where irreducibility forces every defect value to vanish.

1.1F1F2given

By [F1] the invariant probability satisfies π(b)>0 and the chain is positive recurrent with EbTb+≤1/π(b)<+∞; hence μb is finite-valued with ∑y∈Eμb(y)=EbTb+, and since positive recurrence makes b recurrent, [F2] gives μbp=μb as well as μb(b)=1.

2.1F4step 1.1given

Define ν(y):=π(y)/π(b) for y∈E; this is nonnegative and finite by step 1.1, ν(b)=1, and for y≠b the invariance identity [F4] gives (νp)(y)=∑xν(x)p(x,y)=1π(b)∑xπ(x)p(x,y)=π(y)/π(b)=ν(y).

3.1F2step 2.1given

By the minimality clause of [F2] applied to ν, one has π(b)μb(y)≤π(b)ν(y)=π(y) for every y; hence η(y):=π(y)−π(b)μb(y) is a well-defined nonnegative extended function with η(b)=π(b)−π(b)⋅1=0 and finite total mass ∑yη(y)=1−π(b)EbTb+.

4.1F4F5F6step 1.1step 3.1given

The defect η is invariant: for every y, ∑xη(x)p(x,y)=∑xπ(x)p(x,y)−π(b)∑xμb(x)p(x,y)=π(y)−π(b)μb(y)=η(y), using the invariance identity [F4] for π, the identity μbp=μb from step 1.1, and the fact that both subtracted series have finite values; iterating with the Chapman–Kolmogorov identity [F5] and the interchange of nonnegative sums [F6] gives ∑xη(x)p(n)(x,y)=η(y) for every n≥0.

5.1F3step 4.1given

Evaluate the conservation identity of step 4.1 at y=b and n arbitrary: 0=η(b)=∑x∈Eη(x)p(n)(x,b), a sum of nonnegative terms, so η(x)p(n)(x,b)=0 for every x and every n; for fixed x, [F3] provides n with p(n)(x,b)>0, hence η(x)=0. Therefore η≡0, that is, π(y)=π(b)μb(y) and so μb(y)=π(y)/π(b) for every y∈E.

6.1F2step 5.1given

Summing the identity of step 5.1 and using ∑yμb(y)=EbTb+ from [F2] gives 1=∑yπ(y)=π(b)∑yμb(y)=π(b)EbTb+, that is, EbTb+=1/π(b), finite and positive.

7.1step 1.1step 5.1step 6.1given

The three assertions of the statement hold: π(b)>0 by step 1.1, EbTb+=1/π(b) by step 6.1, and μb(y)=π(y)/π(b) by step 5.1.

8.1A1F1F2step 3.1step 6.1given∎

Boundary and axiom cases: if E is a singleton the formulas give μb=δb, EbTb+=1 and π(b)=1, matching step 6.1; if π is not unique the argument applies to each invariant probability separately, since only invariance of π and irreducibility are used, and no uniqueness is asserted; a transient or null-recurrent chain has no invariant probability by [F1], so the hypothesis cannot be vacuous in those cases; η is nonnegative by the minimality clause, so no infinite minus infinite subtraction occurs in step 4.1, and the subtracted series there are separately finite; the identities are equalities, not implications, so there is no iff case separation; and AC [A1] enters exactly through [F2] and [F1], both of which assume it.

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